Design and implementation of a pipeline processor for various-size FFTs

Zhen Bin Gao*, He Chen, Yue Qiu Han

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

A pipeline processor which may compute various 2n points FFT is proposed for continuously performing complex points fast Fourier transforms (FFTs). The processor consists of several stages of butterfly computational elements connected with ping-pang RAMs that reorder the data between the butterfly stages. By properly ordering the input data to the pipeline and addressing the twiddle factors ROM, and by controlling the stage's operating status, it is shown that any FFT whose sizes are powers of the pipeline's radix can be performed. Using block-floating point arithmetic, the processor can provide a high quality. The design is written in VHDL at RTL level, and implemented on a single FPGA chip. The processor can operate at 80 MHz, and compute a 1024 complex points FFT in 12.8 μs when operating continuously.

Original languageEnglish
Pages (from-to)268-271
Number of pages4
JournalBeijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology
Volume25
Issue number3
Publication statusPublished - Mar 2005

Keywords

  • Block-floating point
  • Field programmable gate array
  • Fourier transform
  • Pipeline processor
  • VHDL

Fingerprint

Dive into the research topics of 'Design and implementation of a pipeline processor for various-size FFTs'. Together they form a unique fingerprint.

Cite this