论文信息 - The Fast Fourier Transform

The Fast Fourier Transform

The fast Fourier transform (FFT), a computer algorithm that computes the discrete Fourier transform much faster than other algorithms, is explained. Examples and detailed procedures are provided to assist the reader in learning how to use the algorithm. The savings in computer time can be huge; for example, an N = 210-point transform can be computed with the FFT 100 times faster than with the use of a direct approach.

E. O. Brigham | C. K. Yuen | E. Brigham

[1] W. M. Gentleman,et al. Fast Fourier Transforms: for fun and profit , 1966, AFIPS '66 (Fall).

[2] Thomas G. Stockham,et al. High-speed convolution and correlation , 1966, AFIPS '66 (Spring).

[3] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .

[4] C. Lanczos,et al. Some improvements in practical Fourier analysis and their application to x-ray scattering from liquids , 1942 .

[5] Irving John Good,et al. The Interaction Algorithm and Practical Fourier Analysis , 1958 .