Skip to main content
SpringerLink
Log in
Book cover

Fast Fourier Transform Algorithms for Parallel Computers pp 15–20Cite as

Mixed-Radix FFT Algorithms

  • Chapter
  • First Online:

  • 1760 Accesses

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

Abstract

This chapter presents Mixed-Radix FFT Algorithms. First, two-dimensional formulation of DFT is given. Next, radix-3, 4, 5, and 8 FFT algorithms are described.

This is a preview of subscription content, 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   109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   139.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

Learn about institutional subscriptions

References

  1. Burrus, C.S., Eschenbacher, P.W.: An in-place, in-order prime factor FFT algorithm. IEEE Trans. Acoust. Speech Signal Process. ASSP-29, 806–817 (1981)

    Article  Google Scholar 

  2. Dubois, E., Venetsanopoulos, A.N.: A new algorithm for the radix-3 FFT. IEEE Trans. Acoust. Speech Signal Process. ASSP-26, 222–225 (1978)

    Article  Google Scholar 

  3. Kolba, D.P., Parks, T.W.: A prime factor FFT algorithm using high-speed convolution. IEEE Trans. Acoust. Speech Signal Process. ASSP-25, 281–294 (1977)

    Article  Google Scholar 

  4. Prakash, S., Rao, V.V.: A new radix-6 FFT algorithm. IEEE Trans. Acoust. Speech Signal Process. ASSP-29, 939–941 (1981)

    Article  Google Scholar 

  5. Singleton, R.C.: An algorithm for computing the mixed radix fast Fourier transform. IEEE Trans. Audio Electroacoust. 17, 93–103 (1969)

    Article  Google Scholar 

  6. Suzuki, Y., Sone, T., Kido, K.: A new FFT algorithm of radix 3, 6, and 12. IEEE Trans. Acoust. Speech Signal Process. ASSP-34, 380–383 (1986)

    Article  MathSciNet  Google Scholar 

  7. Temperton, C.: Self-sorting mixed-radix fast Fourier transforms. J. Comput. Phys. 52, 1–23 (1983)

    Article  MathSciNet  Google Scholar 

  8. Temperton, C.: A generalized prime factor FFT algorithm for any \(n =2^p3^q5^r\). SIAM J. Sci. Stat. Comput. 13, 676–686 (1992)

    Article  MathSciNet  Google Scholar 

  9. Winograd, S.: On computing the discrete Fourier transform. Math. Comput. 32, 175–199 (1978)

    Article  MathSciNet  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). Mixed-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_3

Download citation

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

  • 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