论文部分内容阅读
本文提出了一种计算2~m×2~m点二维离散Fourier变换的新算法。此法与一维FFT逐行逐列计算二维DFT的算法相比,优点是减少25～71％的复数乘法运算。文中还讨论了产生旋转因子和二维反序重排的快速算法。
In this paper, a new algorithm for calculating two-dimensional discrete Fourier transform of 2 ~ m × 2 ~ m points is proposed. Compared with the one-dimensional FFT-based two-dimensional DFT algorithm, the advantage of this method is that it reduces the complex multiplication of 25-71%. The paper also discusses the fast algorithm of generating twiddle factors and two-dimensional inverse rearrangement.