Skip to main content
SpringerLink
Log in

Variants of FFT Algorithm and Their Implementations

  • Chapter
Algorithms for Discrete Fourier Transform and Convolution

Part of the book series: Signal Processing and Digital Filtering ((SIGNAL PROCESS))

  • 397 Accesses

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal R. C. and Cooley, J. W. ”Vectorized Mixed Radix Discrete Fourier Transform Algorithms”. March 1986, IBM Report.

    Google Scholar 

  2. Cochran, W.T. et al. ”What is the Fast Fourier Transform?,” IEEE Trans. Audio Electroacoust., vol.15, 1967, pp.45–55.

    Article  Google Scholar 

  3. Cooley, J.W. and Tukey, J.W. ”An ALgorithm for the Machine Calculation of Complex Fourier Series,” Math. Comp., vol.19, 1965, pp.297–301.

    Article  MathSciNet  MATH  Google Scholar 

  4. Gentleman, W.M. and Sande, G. ”Fast Fourier Transform for Fun and Profit,” Proc. AFIPS, Joint Computer Conference, vol 29, 1966, pp.563–578.

    Google Scholar 

  5. Korn, D.G., Lambiotte, J.J. ”Computing the Fast Fourier Transform on a Vector Computer,” Math. Comp., vol.33, 1979, pp.977–992.

    Article  MathSciNet  MATH  Google Scholar 

  6. Pease, M. C. ” An Adaptation of the Fast Fourier Transform for Parallel Processing,” J. ACM, vol.15, 1968, pp.252–265.

    Article  MATH  Google Scholar 

  7. Singleton, R. C. ”On Computing the Fast Fourier Transform,” J. ACM, vol.10, 1967, pp.647–654.

    Article  MathSciNet  MATH  Google Scholar 

  8. Singleton, R. C. ” An Algorithm for Computing the Mixed Radix Fast Fourier Transform,” IEEE Trans. Audio Electroacoust., vol. 17, 1969, pp.93–103.

    Article  Google Scholar 

  9. Temperton, C. ”Self-Sorting Mixed Radix Fast Fourier Transforms,” Journal of Computational Physics, vol.52, 1983, ppl–23.

    Google Scholar 

  10. Temperton, C. ”Implementation of a Prime Factor FFT algorithm on the CRAY-1,” 1987, to appear in J. Comput. Phys.

    Google Scholar 

  11. Temperton, C. ”Implementation of a Self-Sorting In-Place Prime Factor FFT algorithm,” J. Comput. Phys., 58(3), 283–299, May 1985.

    Article  MathSciNet  MATH  Google Scholar 

  12. Temperton, C. ”A Note on a Prime Factor FFT,” J. Comput. Phys., 52(1), 198–204, Oct. 1983.

    Article  MathSciNet  MATH  Google Scholar 

  13. Heideman, M.T. and Burrus, C.S. ”Multiply/add Tradeoff in Length-2n FFT Algorithms”, ICASSP’85, pp. 780-783.

    Google Scholar 

  14. Duhamel, P. ”Implementation of ”Split-Radix” FFT Algorithms for Complex, Real, and Real-Symmetric Data”, IEEE Trans, on ASSP, vol.34, No. 2, April 1986.

    Google Scholar 

  15. Vetterli, M. and Duhamel, P. ” Split-Radix Algorithms for Length pm DFT’s“, ICASSP’88, pp. 1415-1418.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Large Scale Computing, City University of New York, New York, NY, 10036-8099, USA

    R. Tolimieri, Myoung An & Chao Lu

Authors
  1. R. Tolimieri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Myoung An
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chao Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, Rice University, Houston, TX, 77251-1892, USA

    C. S. Burrus (Professor and Chairman) (Professor and Chairman)

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer Science+Business Media New York

About this chapter

Cite this chapter

Tolimieri, R., An, M., Lu, C. (1989). Variants of FFT Algorithm and Their Implementations. In: Burrus, C.S. (eds) Algorithms for Discrete Fourier Transform and Convolution. Signal Processing and Digital Filtering. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3854-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3854-4_4

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4757-3856-8

  • Online ISBN: 978-1-4757-3854-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation