New efficient FFT algorithm and pipeline implementation results for OFDM/DMT applications

  • Authors:
  • Yunho Jung;Hongil Yoon;Jaeseok Kim

  • Affiliations:
  • Dept. of Electr. & Electron. Eng., Yonsei Univ., Seoul, South Korea;-;-

  • Venue:
  • IEEE Transactions on Consumer Electronics
  • Year:
  • 2003

Quantified Score

Hi-index 0.43

Visualization

Abstract

In this paper, we propose a new efficient FFT algorithm for OFDM/DMT applications and present its pipeline implementation results. Since the proposed algorithm is based on the radix-4 butterfly unit, the processing rate can be twice as fast as that based on the radix-23 algorithm. Also, its implementation is more area-efficient than the implementation from conventional radix-4 algorithm due to reduced number of nontrivial multipliers like using the radix-23 algorithm. In order to compare the proposed algorithm with the conventional radix-4 algorithm, the 64-point MDC pipelined FFT processor based on the proposed algorithm was implemented. After the logic synthesis using 0.35 μm CMOS technology, the logic gate count for the processor with the proposed algorithm is only about 70% of that for the processor with the conventional radix-4 algorithm. Since the proposed algorithm can achieve higher processing rate and better efficiency than the conventional algorithm, it is very suitable for the OFDM/DMT applications such as the WLAN, DAB/DVB, and ADSL/VDSL systems.