Skip to main content

A Parallel FFT Architecture for FPGAs

  • Conference paper
Field Programmable Logic and Application (FPL 2004)

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

Included in the following conference series:

Abstract

The inclusion of block RAMs and block multipliers in FPGA fabrics has made them more ammenable for implementing the FFT. This paper describes a parallel FFT design suitable for such FPGA implementations. It consists of multiple, parallel pipelines with a front end butterfly-like circuit to preprocess the incoming data and distribute it to the parallel pipelines. Implementation of the parallel FFT on Virtex II shows superlinear speedups for a range of FFT sizes.

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

Access this chapter

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. Gramam, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing, 2nd edn. Pearson Education, Harlow (2003)

    Google Scholar 

  2. Smith, W.W., Smith, J.M.: Handbook of Real-Time Fast Fourier Transforms. IEEE, New York (1995)

    Book  MATH  Google Scholar 

  3. He, S., Torkelson, M.: A New Approach to Pipeline FFT Processor. In: The 10th International Parallel Processing Symposium(IPPS), pp. 766–770 (1996)

    Google Scholar 

  4. Chen, T., Sunada, G., Jin, J.: COBRA: A 100-MOPS single-chip programmable and expandable FFT. IEEE Transactions on VLSI Systems 7(2) (June 1999)

    Google Scholar 

  5. Ma, Y.T.: AVLSI-Oriented Parallel FFT Algorithm. IEEE Transactions on Signal Processing 44(2) (February 1996)

    Google Scholar 

  6. Bidet, E., Castelain, D., Joanblanq, C., Senn, P.: A Fast Single-Chip Implementation of 8192 Complex Point FFT. IEEE Journal of Solid-State Circuits 30 (March 1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Palmer, J., Nelson, B. (2004). A Parallel FFT Architecture for FPGAs. In: Becker, J., Platzner, M., Vernalde, S. (eds) Field Programmable Logic and Application. FPL 2004. Lecture Notes in Computer Science, vol 3203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30117-2_105

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30117-2_105

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22989-6

  • Online ISBN: 978-3-540-30117-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics