The Fast Fourier Transform
- 449 Downloads
The object of this chapter is to briefly summarize the main properties of the discrete Fourier transform (DFT) and to present various fast DFT computation techniques known collectively as the fast Fourier transform (FFT) algorithm. The DFT plays a key role in physics because it can be used as a mathematical tool to describe the relationship between the time domain and frequency domain representation of discrete signals. The use of DFT analysis methods has increased dramatically since the introduction of the FFT in 1965 because the FFT algorithm decreases by several orders of magnitude the number of arithmetic operations required for DFT computations. It has thereby provided a practical solution to many problems that otherwise would have been intractable.
KeywordsFast Fourier Transform Discrete Fourier Transform Real Multiplication Fast Fourier Transform Algorithm Inverse Discrete Fourier Transform
Unable to display preview. Download preview PDF.
- 4.2E. O. Brigham: The Fast Fourier Transform (Prentice-Hall, Englewood Cliffs, N. J. 1974 )Google Scholar
- 4.3L. R. Rabiner, B. Gold: Theory and Application of Digital Signal Processing (PrenticeHall, Englewood Cliffs, N. J. 1975 )Google Scholar
- 4.4A. V. Oppenheim, R. W. Schafer: Digital Signal Processing (Prentice-Hall, Englewood Cliffs, N. J. 1975 )Google Scholar
- 4.8R. C. Singleton: An algorithm for computing the mixed radix fast Fourier transform. IEEE Trans. AU-17, 93–103 (1969)Google Scholar
- 4.9R. P. Polivka, S. Pakin: APL: the Language and Its Usage (Prentice-Hall, Englewood Cliffs, N. J. 1975 )Google Scholar
- 4.10P. D. Welch: A fixed-point fast Fourier transform error analysis. IEEE Trans. AU-17, 151–157 (1969)Google Scholar
- 4.12C. J. Weinstein: Roundoff noise in floating point fast Fourier transform computation. IEEE Trans. AU-17, 209–215 (1969)Google Scholar
- 4.13C. M. Rader, N. M. Brenner: A new principle for fast Fourier transformation. IEEE Trans. ASSP-24, 264–265 (1976)Google Scholar
- 4.15K. M. Cho, G. C. Temes: “Real-factor FFT algorithms”, in IEEE 1978 Intern. Conf. Acoust., Speech, Signal Processing, pp. 634–637Google Scholar
- 4.18G. Bruun: z-transform DFT filters and FFTs. IEEE Trans. ASSP-26, 56–63 (1978)Google Scholar
- 4.19G. K. McAuliffe: “Fourier Digital Filter or Equalizer and Method of Operation Therefore”, US Patent No. 3 679 882, July 25, 1972Google Scholar