Skip to main content
SpringerLink
Log in

Split-Radix FFT Algorithms

  • Chapter
  • First Online:
Fast Fourier Transform Algorithms for Parallel Computers

Part of the book series: High-Performance Computing Series ((HPC,volume 2))

  • 1529 Accesses

Abstract

This chapter presents split-radix FFT algorithms. First, split-radix FFT algorithm is given. Next, extended split-radix FFT algorithm is described.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 139.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bergland, G.D.: A fast Fourier transform algorithm using base 8 iterations. Math. Comput. 22, 275–279 (1968)

    MathSciNet  MATH  Google Scholar 

  2. Bouguezel, S., Ahmad, M.O., Swamy, M.N.S.: A new radix-2/8 FFT algorithm for length-\(q\times 2^m\) DFTs. IEEE Trans. Circuits Syst. I Reg. Papers 51, 1723–1732 (2004)

    Article  MathSciNet  Google Scholar 

  3. Bouguezel, S., Ahmad, M.O., Swamy, M.N.S.: A general class of split-radix FFT algorithms for the computation of the DFT of length-\(2^m\). IEEE Trans. Signal Process. 55, 4127–4138 (2007)

    Article  MathSciNet  Google Scholar 

  4. Brigham, E.O.: The Fast Fourier Transform and Its Applications. Prentice-Hall, Englewood Cliffs, NJ (1988)

    Google Scholar 

  5. Duhamel, P.: Implementation of split-radix FFT algorithms for complex, real, and real-symmetric data. IEEE Trans. Acoust. Speech Signal Process. ASSP-34, 285–295 (1986)

    Article  MathSciNet  Google Scholar 

  6. Duhamel, P., Hollmann, H.: Split radix FFT algorithm. Electron. Lett. 20, 14–16 (1984)

    Article  Google Scholar 

  7. Duhamel, P., Piron, B., Etcheto, J.M.: On computing the inverse DFT. IEEE Trans. Acoust. Speech Signal Process. 36, 285–286 (1988)

    Article  Google Scholar 

  8. FFTE: A Fast Fourier Transform Package. http://www.ffte.jp/

  9. Gentleman, W.M., Sande, G.: Fast Fourier transforms: for fun and profit. In: Proceedings of AFIPS ’66 Fall Joint Computer Conference, pp. 563–578 (1966)

    Google Scholar 

  10. Johnson, S.G., Frigo, M.: A modified split-radix FFT with fewer arithmetic operations. IEEE Trans. Signal Process. 55, 111–119 (2007)

    Article  MathSciNet  Google Scholar 

  11. Sorensen, H.V., Heideman, M.T., Burrus, C.S.: On computing the split-radix FFT. IEEE Trans. Acoust. Speech Signal Process. ASSP-34, 152–156 (1986)

    Article  Google Scholar 

  12. Takahashi, D.: An extended split-radix FFT algorithm. IEEE Trans. Signal Process. 8, 145–147 (2001)

    Article  Google Scholar 

  13. Van Loan, C.: Computational Frameworks for the Fast Fourier Transform. SIAM Press, Philadelphia, PA (1992)

    Book  Google Scholar 

  14. Vetterli, M., Duhamel, P.: Split-radix algorithms for length-\(p^m\) DFT’s. IEEE Trans. Acoust. Speech Signal Process. 37, 57–64 (1989)

    Article  MathSciNet  Google Scholar 

  15. Yavne, R.: An economical method for calculating the discrete Fourier transform. In: Proceedings of AFIPS ’68 Fall Joint Computer Conference, Part I, pp. 115–125 (1968)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Tsukuba, Tsukuba, Japan

    Daisuke Takahashi

Authors
  1. Daisuke Takahashi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Daisuke Takahashi .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Takahashi, D. (2019). Split-Radix FFT Algorithms. In: Fast Fourier Transform Algorithms for Parallel Computers. High-Performance Computing Series, vol 2. Springer, Singapore. https://doi.org/10.1007/978-981-13-9965-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-9965-7_4

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-9964-0

  • Online ISBN: 978-981-13-9965-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation