Skip to main content

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 140))

  • 1388 Accesses

Abstract

A time-efficient 256 point fast Fourier transform (FFT) processor realized in programmable devices(FPGA) based on a novel architecture is presented. Simulation results indicate that the use of a 16x16 parallel structure for realizing 256-point FFT leads to a 16 times higher processing speed compared to its counterparts employing other series techniques.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chien, C.D., Lin, C.C., Yang, C.H., Guo, J.I.: Design and realization of a new hardware efficient IP core for the 1-D discrete Fourier transform. IEE Proc. Circuits, Dev. Syst. 152(3), 247–258 (2005)

    Article  Google Scholar 

  2. Zhou, Y., Noras, J.M., Shepherd, S.J.: Novel design of multiplier-less FFT processors. Signal Processing 87(1), 1402–1407 (2007)

    Article  MATH  Google Scholar 

  3. Cheng, L.S., Miri, A., Yeap, T.H.: Efficient FPGA implementation of FFT based Multipliers. In: Proc. IEEE CCECE/CCGEI, Saskatoon, pp. 1300–1303 (2005)

    Google Scholar 

  4. Banerjee, A., Dhar, A.S., Banerjee, S.: FPGA realization of a CORDIC based FFT processor for biomedical signal processing. Microprocessor and Microsystems 25(1), 131–142 (2001)

    Article  Google Scholar 

  5. Szadkowski, Z.: 16-point Discrete Fourier transform based on the Radix-2 FFT algorithm implemented into Cyclone FPGA as the UHERC trigger for horizontal air showers. In: Proc. of the 29th ICRC, Pune (2005)

    Google Scholar 

  6. Sanchez, M., Garrido, M., Lopez-Vallejo, M., Grajal, J., Lopez-Barrio, C.: Digital channelised receivers on FPGA platforms. In: Proc. IEEE International Radar Conference, pp. 816–821 (2005)

    Google Scholar 

  7. Oppenheim, A.V., Schafer, R.W., Buck, J.R.: Discrete-Time Signal Processing. Prentice-Hall, Englewood Cliffs (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer Berlin Heidelberg

About this paper

Cite this paper

Wang, X. (2012). A Time-Efficient FPGA-Based FFT Processor. In: Jin, D., Lin, S. (eds) Advances in Electronic Engineering, Communication and Management Vol.2. Lecture Notes in Electrical Engineering, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27296-7_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27296-7_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27295-0

  • Online ISBN: 978-3-642-27296-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics