Lesser Known FFT Algorithms

  • R. Tolimieri
  • M. An
Part of the NATO Science Series book series (NAII, volume 33)


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.


Fast Fourier Transform Discrete Fourier Transform Digital Signal Processing Chinese Remainder Theorem Fast Fourier Transform Algorithm 
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]
    R.C. Agarwal and C.S. Burrus, “Fast convolution using Fermat number transforms with applications to digital filtering,”IEEE Trans. ASSP ASSP22, 87–97, 1974.MathSciNetCrossRefGoogle Scholar
  2. [2]
    R.C. Agarwal and C.S. Burrus, “Number theoretic transforms to implement fast digital convolution,” Proc. IEEE 63, 550–560, 1975.MathSciNetCrossRefGoogle Scholar
  3. [3]
    L. Auslander, E. Feig and S. Winograd, “The multiplicative complexity of the discrete Fourier transform,” Adv. inAppl. Math. (5), 31–55, 1984.MathSciNetMATHCrossRefGoogle Scholar
  4. [4]
    R.E. Blahut, Fast Algorithms for Digital Signal Processing, Addison-Wesley, Reading, MA 1985.MATHGoogle Scholar
  5. [5]
    C.S. Burrus, “An in-place, in-order prime factor FFT algorithm,” IEEE Trans. ASSP, ASSP29, 806–817, 1979.Google Scholar
  6. [6]
    C.S. Burrus and T.W. Park, DFT/FFT and Convolution Algorithms, Wiley and Sons, New York, 1985.Google Scholar
  7. [7]
    J. Cooley and J. Tukey, “An algorithm for the machine calculation of complex Fourier series,” Math. Comp., 19 297–301, 1965.MathSciNetMATHCrossRefGoogle Scholar
  8. [8]
    Hari Krishna Garg, Digital Signal Processing: Number theory, convolution, fast Fourier Transforms, and applications, CRC Press, London, 1998.MATHGoogle Scholar
  9. [9]
    I. Gertner, “A new efficient algorithm to compute the two-dimensional discrete Fourier transform,” IEEE Trans. ASSP ASSP36 (7), 1036–1050, 1988.CrossRefGoogle Scholar
  10. [10]
    I.J. Good, ’The interaction algorithm and practical Fourier analysis,” J. Royal Statistics, B(2), 361–375, 1958.MathSciNetGoogle Scholar
  11. [11]
    J.H. McClellan and C.M. Rader, Number theory in Digital Signal Processing, Prentice Hall, 1979.Google Scholar
  12. [12]
    H.J. Nussbaumer, “Fast polynomial transform algorithms for digital convolution,” IEEE Trans. ASSP ASSP28, 205–215, 1980.MathSciNetCrossRefGoogle Scholar
  13. [13]
    H.J. Nussbaumer, Fast Fourier Transform and Convolution Algorithms, Springer-Verlag, Berlin, Heidelberg and New York, 1981.MATHCrossRefGoogle Scholar
  14. [14]
    C. Rader, “Discrete Fourier transform when the number of data samples is prime,” Proc. IEEE, 56, 1107–1108, 1968.CrossRefGoogle Scholar
  15. [15]
    M. Rofheart, Algorithms and Methods for Multidimensional Digital Signal Processing, PhD Thesis, the City University of New York, 1991.Google Scholar
  16. [16]
    L.H. Thomas, “Using computers to solve problems in physics,” Applications of Digital Computers, Ginn and Co., Boston, 1963.Google Scholar
  17. [17]
    R. Tolimieri, M. An and C. Lu, Mathematics of Multidimensional Fourier Transform Algorithms 2nd ed., Springer, New York 1997.CrossRefGoogle Scholar
  18. [18]
    R. Tolimieri, M. An and C. Lu, Algorithms for Discrete Fourier Transform and Convolution, 2nd ed., Springer, New York 1997.MATHGoogle Scholar
  19. [19]
    S. Winograd, “On computing the discrete Fourier transform,” Math, of Computation, 32(141) 175–199, 1978.CrossRefGoogle Scholar
  20. [20]
    S. Winograd, “On computing the discrete Fourier transform,” Proc. Nat. Acad. Science, USA, 73(4), 1005–1006, 1976.CrossRefGoogle Scholar
  21. [21]
    S. Winograd, “Complexity of computations,” CBMS Regional Conf. Ser. in Math., 33 Philadelphia, 1980.Google Scholar
  22. [22]
    S. Winograd, “On multiplication of polynomials modulo a polynomial,” SIAM J. on Computing 9(2), 225–229, 1980.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • R. Tolimieri
  • M. An

There are no affiliations available

Personalised recommendations