摘要
给出了频域抽取二维向量基快速傅里叶变换算法,针对二维频域信号采用频域抽取方法,导出了该快速算法蝶形运算的一般形式并给出了算法实现流程图.计算量比较结果显示,二维向量基FFT算法比基于二维行列分解FFT算法计算量低,计算效率高.
The 2-dimensional vector radix fast Fourier transform (FFT) with decimation in frequency domain (DIF) is presented. Through the method of decimation-in-frequency to the 2-dimensional frequency domain signal, the general form of butterfly computation is deduced, and the algorithm implementation flow chart is given. The comparison results show that the 2-dimensional vector radix DIF FFT algorithm is in low-calculation and more efficient compared to the 2-dimensional row-column decomposition FFT algorithm.
出处
《天津工业大学学报》
CAS
2008年第6期47-50,共4页
Journal of Tiangong University
基金
国家自然科学基金资助项目(60602036)
天津市教委基金资助项目(20051209)