High-speed, low cost parallel memory-based FFT processors for OFDM applications

Chin Long Wey, Shin Yo Lin, Wei Chien Tang, Muh Tien Shiue

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

Abstract

Low cost yet efficient FFT (Fast Fourier Transform) processors are greatly needed for real-time operation in many OFDM applications. Taking the advantages of both memory-based and pipelined FFT architectures, this paper presents simple radix-2 memory-based FFT (MBFFT) Processors with low hardware cost and high maximum operation frequency. Results show that the core area of the proposed MBFFT is 1.79mm2 with the maximum operation frequency of 205MHz, or a process speed of 269μs for N=8192 points (24 bits per word). This also implies a throughput of 730 Mb/s (Mbits per second). This paper also presents parallel MBFFT structures with two and four butterfly processing elements (PEs), respectively, to improve the latency while still keeping low hardware cost and high maximum operation frequency.

Original languageEnglish
Title of host publicationICECS 2007 - 14th IEEE International Conference on Electronics, Circuits and Systems
Pages783-787
Number of pages5
DOIs
StatePublished - 2007
Event14th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2007 - Marrakech, Morocco
Duration: 11 Dec 200714 Dec 2007

Publication series

NameProceedings of the IEEE International Conference on Electronics, Circuits, and Systems

Conference

Conference14th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2007
Country/TerritoryMorocco
CityMarrakech
Period11/12/0714/12/07

Keywords

  • Fast fourier transform(FFT)
  • Memory-based FFT
  • Multi-path delay commutator (MDC) FFT
  • Orthogonal frequency division multiplexing (OFDM)
  • Single-path delay feedback (SDF) FFT

Fingerprint

Dive into the research topics of 'High-speed, low cost parallel memory-based FFT processors for OFDM applications'. Together they form a unique fingerprint.

Cite this