Long-point FFT processing based on twiddle factor table reduction

Ji Hoon Kim, In Cheol Park

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


In this paper, we present a new fast Fourier transform (FFT) algorithm to reduce the table size of twiddle factors required in pipelined FFT processing. The table size is large enough to occupy significant area and power consumption in long-point FFT processing. The proposed algorithm can reduce the table size to half, compared to the radix-22 algorithm, while retaining the simple structure. To verify the proposed algorithm, a 2048-point pipelined FFT processor is designed using a 0.18 μm CMOS process. By combining the proposed algorithm and the radix-22 algorithm, the table size is reduced to 34% and 51% compared to the radix-2 and radix-22 algorithms, respectively. The FFT processor occupies 1.28 mm2 and achieves a signal-to-quantization-noise ratio (SQNR) of more than 50 dB.

Original languageEnglish
Pages (from-to)2526-2532
Number of pages7
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number11
StatePublished - Nov 2007


  • Discrete fourier transform (DFT)
  • Fast Fourier transform (FFT)
  • Low-power design
  • Orthogonal frequency division multiplexing (OFDM)
  • Pipelined processing


Dive into the research topics of 'Long-point FFT processing based on twiddle factor table reduction'. Together they form a unique fingerprint.

Cite this