An area-efficient and low-power 64-point pipeline Fast Fourier Transform for OFDM applications

作者：Ganjikunta Ganesh Kumar^*; Sahoo Subhendu Kumar

来源：Integration, the VLSI Journal, 2017, 57: 125-131.

DOI：10.1016/j.vlsi.2016.12.002

• FFT
• Radix-2(k) algorithm
• SDF architecture
• Complex constant multiplier
• OFDM

In an orthogonal frequency division multiplexing (OFDM) based wireless systems, Fast Fourier Transform (FFT) is a critical block as it occupies large area and consumes more power. In this paper, we present an area efficient and low power 16-bit word-width 64-point radix-2(2) and radix-2(3) pipelined FFT architectures for an OFDM-based IEEE 802.11a wireless LAN baseband. The designs are derived from radix-2(k) algorithm and adopt a Single-Path Delay Feedback (SDF) architecture for hardware implementation. To eliminate the complex multipliers and read-only memory (ROM) which is used for internal storage of twiddle factor coefficients, the proposed 64-point FFT employs a Canonical Signed Digit (CSD) complex constant multiplier using adders, multiplexers and shifters. The complex constant multiplier (CCM) is modified using common sub-expression sharing block that reduces the area of the design. The proposed radix-2(2) and radix-2(3) pipelined FFT architectures are modeled and implemented using TSMC 180 nm CMOS technology with a supply voltage of 1.8 V. The implementation results show that the proposed architectures significantly reduces the hardware cost and power consumption in comparison to existing 64-point FFT architectures.

• 出版日期2017-3