Skip to main content
SpringerLink
Log in

A Blocking Algorithm for FFT on Cache-Based Processors

  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2110))

Included in the following conference series:

Abstract

In this paper, we propose a blocking algorithm for computing large one-dimensional fast Fourier transform (FFT) on cache-based processors. Our proposed FFT algorithm is based on the six-step FFT algorithm. We show that the block six-step FFT algorithm improves performance by effectively utilizing the cache memory. Performance results of one-dimensional FFTs on the Sun Ultra 10 and PentiumIII PC are reported. We succeeded in obtaining performance of about 108MFLOPS on the Sun Ultra 10 (UltraSPARC-IIi 333MHz) and about 247MFLOPS on the 1GHz PentiumIII PC for 220-point FFT.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.H. Bailey, “FFTs in external or hierarchical memory,” The Journal of Supercomputing, vol. 4, pp. 23–35, 1990.

    Article  Google Scholar 

  2. C. Van Loan, Computational Frameworks for the Fast Fourier Transform. SIAM Press, Philadelphia, PA, 1992.

    MATH  Google Scholar 

  3. M. Frigo and S.G. Johnson, “The fastest Fourier transform in the west.” Technical Report MIT-LCS-TR-728, MIT Lab for Computer Science, 1997.

    Google Scholar 

  4. K.R. Wadleigh, “High performance FFT algorithms for cache-coherent multiprocessors,” The International Journal of High Performance Computing Applications, vol. 13, pp. 163–171, 1999.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and Computer Sciences, Saitama University, 255 Shimo-Okubo, Urawa-shi, Saitama, 338-8570, Japan

    Daisuke Takahashi

Authors
  1. Daisuke Takahashi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Mathematics, Computer Science, Physics,and Astronomy, University of Amsterdam, Kruislaan 403, 1098, SJ, Amsterdam, The Netherlands

    Bob Hertzberger  & Alfons Hoekstra  & 

  2. California Institute of Technology, Caltech 158-79, Pasadena, CA, 91125, USA

    Roy Williams

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Takahashi, D. (2001). A Blocking Algorithm for FFT on Cache-Based Processors. In: Hertzberger, B., Hoekstra, A., Williams, R. (eds) High-Performance Computing and Networking. HPCN-Europe 2001. Lecture Notes in Computer Science, vol 2110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48228-8_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-48228-8_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42293-8

  • Online ISBN: 978-3-540-48228-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation