Lesser Known FFT Algorithms
The introduction of the Cooley-Tukey Fast Fourier transform (C-T FFT) algorithm in 1968 was a critical step in advancing the widespread use of digital computers in scientific and technological applications. Initial efforts focused on realizing the potential of the immense reduction in arithmetic complexity afforded by the FFT for computing the finite Fourier transform and convolution. On existing serial butterfly architectures, this limited implementations of the FFT to transform sizes a power of two.
KeywordsFast Fourier Transform Discrete Fourier Transform Digital Signal Processing Chinese Remainder Theorem Fast Fourier Transform Algorithm
Unable to display preview. Download preview PDF.
- C.S. Burrus, “An in-place, in-order prime factor FFT algorithm,” IEEE Trans. ASSP, ASSP29, 806–817, 1979.Google Scholar
- C.S. Burrus and T.W. Park, DFT/FFT and Convolution Algorithms, Wiley and Sons, New York, 1985.Google Scholar
- J.H. McClellan and C.M. Rader, Number theory in Digital Signal Processing, Prentice Hall, 1979.Google Scholar
- M. Rofheart, Algorithms and Methods for Multidimensional Digital Signal Processing, PhD Thesis, the City University of New York, 1991.Google Scholar
- L.H. Thomas, “Using computers to solve problems in physics,” Applications of Digital Computers, Ginn and Co., Boston, 1963.Google Scholar
- S. Winograd, “Complexity of computations,” CBMS Regional Conf. Ser. in Math., 33 Philadelphia, 1980.Google Scholar