Advertisement

Variants of FT Algorithms and Implementations

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

Abstract

In chapter 3, additive FT algorithms were derived corresponding to the factorization of the transform size N into a product of two factors. Analogous algorithms will now be designed corresponding to transform sizes given as a product of three or more factors. In general, as the number of factors increases, the number of possible algorithms increases.

Keywords

Fast Fourier Transform Stage Computation Twiddle Factor Commutation Theorem Vector Instruction 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Agarwal, R. C. and Cooley, J. W. “Vectorized Mixed Radix Discrete Fourier Transform Algorithms”, IBM Report., March 1986.Google Scholar
  2. [2]
    Cochran, W. T., et al. “What is the Fast Fourier Transform?”, IEEE Trans. Audio Electroacoust. 15, 1967, 45–55.CrossRefGoogle Scholar
  3. [3]
    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
  4. [4]
    Gentleman, W. M. and Sande, G. “Fast Fourier Transform for Fun and Profit”, Proc. AFIPS, Joint Computer Conference 29, 1966, 563–578.Google Scholar
  5. [5]
    Korn, D. G. and Lambiotte, J. J. “Computing the Fast Fourier Transform on a Vector Computer”, Math. Comp. 33, 1979, 977–992.MathSciNetMATHCrossRefGoogle Scholar
  6. [6]
    Pease, M. C. “An Adaptation of the Fast Fourier Transform for Parallel Processing”, J. ACM 15, 1968, 252–265.MATHCrossRefGoogle Scholar
  7. [7]
    Singleton, R. C. “On Computing the Fast Fourier Transform”, J. A CM 10, 1967, 647–654.MathSciNetMATHGoogle Scholar
  8. [8]
    Singleton, R. C. “An Algorithm for Computing the Mixed Radix Fast Fourier Transform”, IEEE Trans. Audio Electroacoust. 17, 1969, 93–103.CrossRefGoogle Scholar
  9. [9]
    Temperton, C. “Self-Sorting Mixed Radix Fast Fourier Transforms”, J. Comput Phys. 52, 1983, 1–23.MathSciNetMATHCrossRefGoogle Scholar
  10. [10]
    Temperton, C. “Fast Fourier Transforms and Poisson-Solvers on Cray-1”, Supercomputers, Infotech State of the Art Report, Jesshope C. R. and Hockney R. W. eds., Infotech International Ltd., 1979, 359-379.Google Scholar
  11. [11]
    Temperton, C. “Implementation of a Self-Sorting In-Place Prime Factor FFT algorithm”, J. Comput. Phys. 58(3), 1985, 283–299.MathSciNetMATHCrossRefGoogle Scholar
  12. [12]
    Temperton, C. “A Note on a Prime Factor FFT”, J. Comput Phys. 52(1), 1983, 198–204.MathSciNetMATHCrossRefGoogle Scholar
  13. [13]
    Heideman, M. T. and Burrus, C. S. “Multiply/add Trade-off in Length-2n FFT Algorithms”, ICASSP’85, 780-783.Google Scholar
  14. [14]
    Duhamel, P. “Implementation of Split-Radix FFT Algorithms for Complex, Real, and Real-Symmetric Data”, IEEE Trans. on Acoust., Speech and Signal Proc. 34 (2), April 1986.Google Scholar
  15. [15]
    Vetterli, M. and Duhamel, P. “Split-Radix Algorithms for Length p m DFT’s”, ICASSP’88, 1415-1418.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