摘要
点序列离散Fourier变换(DFT)算法需要次复数乘法和次复数加法,计算量与N2成正比。而点序列基2时分与基2频分的快速Fourier变换(FFT算法)运算次数相当,需要次复数乘法和次复数加法,但运算次数远远低于DFT算法,因而效率高,常被用于信号分析与处理。
The point sequence Discrete Fourier Transform（DFT） algorithm needs a complex multiplication and a plural addition, the amount of calculation is in proportion to. While the fast Fourier transform （FFT algorithm） computaion times of the point sequence base-2 time devision and base-2 frequency devision is the same, and both need a complex multiplication and a plural addition. But the number of operations is far lower than that of DFT algorithm, so that the efficiency is high. It is often used in signal analysis and processing.
出处
《重庆电子工程职业学院学报》
2013年第4期165-167,共3页
Journal of Chongqing College of Electronic Engineering
