A High-Speed Algorithm for the Computer Generation of Fourier Transforms
暂无分享,去创建一个
Abstract—An efficient algorithm is presented for performing the Fourier transformation operation on a digital computer. This algorithm completes the transform calculation with Nlog2N complex additions (complex additions include complex subtractions) and ½N [log2(N)-2]+1 complex multiplications. This is a considerable savings over a brute-force method of N2complex additions and multiplications, especially when considering the use of digital machines whose MULTIPLY time is much longer than ADD time.
[1] M. Forman. Fast Fourier-Transform Technique and Its Application to Fourier Spectroscopy* , 1966 .
[2] W. M. Gentleman,et al. Fast Fourier Transforms: for fun and profit , 1966, AFIPS '66 (Fall).
[3] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .