The fast Fourier transform
- 1 December 1967
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Spectrum
- Vol. 4 (12) , 63-70
- https://doi.org/10.1109/mspec.1967.5217220
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- High-speed convolution and correlationPublished by Association for Computing Machinery (ACM) ,1966
- Fast Fourier TransformsPublished by Association for Computing Machinery (ACM) ,1966
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965
- Some improvements in practical Fourier analysis and their application to x-ray scattering from liquidsJournal of the Franklin Institute, 1942