Cooley-Tukey FFT Algorithms

  • Richard Tolimieri
  • Chao Lu
  • Myoung An
Part of the Signal Processing and Digital Filtering book series (SIGNAL PROCESS)


In the following two chapters, we will concentrate on algorithms for computing the Fourier transform (FT) of a size that is a composite number N. The main idea is to use the additive structure of the indexing set Z/N to define mappings of input and output data vectors into two-dimensional arrays. Algorithms are then designed, transforming two-dimensional arrays which, when combined with these input/output mappings, compute the N-point FT. The stride permutations of chapter 2 play a major role.


Fast Fourier Transform Fast Fourier Transform Algorithm Vector Operation Twiddle Factor Product Notation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Cochran, W. T., et al. “What is the Fast Fourier Transform?,” IEEE Trans. Audio Electroacoust. 15 45–55, 1967.CrossRefGoogle Scholar
  2. [2]
    Cooley, J. W. and Tukey, J. W. “An Algorithm for the machine Calculation of complex Fourier Series,” Math. Comp. 19 1965, 297–301.MathSciNetMATHCrossRefGoogle Scholar
  3. [3]
    Gentleman, W. M., and Sande, G. “Fast Fourier Transform for Fun and Profit,” Proc. AFIPS, Joint Computer Conference 9 563–578, 1966.Google Scholar
  4. [4]
    Korn, D. J., and Lambiotte, J. J. “Computing the Fast Fourier Transform on a vector computer,” Math. Comp. 33 977–992, 1979.MathSciNetMATHCrossRefGoogle Scholar
  5. [5]
    Pease, M. C. “An Adaptation of the Fast Fourier Transform for Parallel Processing,” J. ACM 18 843–846, 1971.Google Scholar
  6. [6]
    Burrus, C. S. “Bit Reverse Unscrambling for a Radix 2m FFT,” IEEE Trans. Acoust., Speech and Signal Proc. 36 July, 1988.Google Scholar
  7. [7]
    Singleton, R. C. “An Algorithm for Computing the Mixed-Radix Fast Fourier Transform,” IEEE Trans. Audio Electroacoust. 17 93–103, 1969.CrossRefGoogle Scholar
  8. [8]
    Swartztrauber, P. N. “FFT algorithms for vector computers,” Parallel Computing, 1 45–63, North Holland, 1984.CrossRefGoogle Scholar
  9. [9]
    Temperton, C. “Self-Sorting Mixed-Radix Fast Fourier Transforms,” J. Comput. Phys., 52(1) 198–204, 1983.MathSciNetMATHCrossRefGoogle Scholar
  10. [10]
    Burrus, C. S. and Park, T. W. DFT/FFT and Convolution Algorithms, John Wiley and Sons, 1985.Google Scholar
  11. [11]
    Oppenheim, A. V. and Schafer, R. W. Digital Signal Processing, Prentice-Hall, 1975.Google Scholar
  12. [12]
    Nussbaumer, H. J. Fast Fourier Transform and Convolution Algorithms, Springer-Verlag, 1981.Google Scholar

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • Richard Tolimieri
    • 1
  • Chao Lu
    • 2
  • Myoung An
    • 3
  1. 1.Department of Electrical EngineeringCity College of CUNYNew YorkUSA
  2. 2.Department of Computer and Information SciencesTowson State UniversityTowsonUSA
  3. 3.A.J. Devaney AssociatesAllstonUSA

Personalised recommendations