Fast Fourier Transform (FFT)
暂无分享，去创建一个
Data can be described either in the “time domain” or in the “frequency domain”. The frequency domain representations present details about the same signal in a different, potentially more illuminating way. The fast Fourier transform (FFT) provides a fast computational algorithm to obtain the coefficients of the discrete-frequency representation.
Keywords:
DFT ;
FFT ;
spectral analysis;
computational efficiency
[1] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .
[2] Don H. Johnson,et al. Gauss and the history of the fast Fourier transform , 1984, IEEE ASSP Magazine.
[3] Martin Vetterli,et al. Fast Fourier transforms: a tutorial review and a state of the art , 1990 .