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

被引:12
作者
Ganjikunta, Ganesh Kumar [1 ]
Sahoo, Subhendu Kumar [1 ]
机构
[1] BITS Pilani, Dept Elect & Elect Engn, Hyderabad Campus, Hyderabad 500078, Andhra Pradesh, India
关键词
FFT; Radix-2(k) algorithm; SDF architecture; Complex constant multiplier; OFDM; FFT/IFFT PROCESSOR; FFT PROCESSOR; ALGORITHM;
D O I
10.1016/j.vlsi.2016.12.002
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:125 / 131
页数:7
相关论文
共 22 条
[1]  
[Anonymous], INT C EL ENG INF 200
[2]  
[Anonymous], 2007, P IEIT
[3]  
[Anonymous], 2013, P 15 EUR C POW EL AP
[4]  
Chin-Teng Lin, 2006, 2006 IEEE International Symposium on Circuits and Systems (IEEE Cat. No. 06CH37717C)
[5]   A Low-Complexity 128-Point Mixed-Radix FFT Processor for MB-OFDM UWB Systems [J].
Cho, Sang-In ;
Kang, Kyu-Min .
ETRI JOURNAL, 2010, 32 (01) :1-10
[6]  
Cho T, 2011, IEEE INT SYMP CIRC S, P1259
[7]   AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J].
COOLEY, JW ;
TUKEY, JW .
MATHEMATICS OF COMPUTATION, 1965, 19 (90) :297-&
[8]   Radix rk FFTs: Matricial Representation and SDC/SDF Pipeline Implementation [J].
Cortes, Ainhoa ;
Velez, Igone ;
Sevillano, Juan F. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2009, 57 (07) :2824-2839
[9]   Design and implementation of a 1024-point pipeline FFT processor [J].
He, S ;
Torkelson, M .
IEEE 1998 CUSTOM INTEGRATED CIRCUITS CONFERENCE - PROCEEDINGS, 1998, :131-134
[10]   Designing pipeline FFT processor for OFDM (de)modulation [J].
He, SS ;
Torkelson, M .
1998 URSI SYMPOSIUM ON SIGNALS, SYSTEMS, AND ELECTR ONICS, 1998, :257-262