A green FFT processor with 2.5-GS/s for IEEE 802.15.3c (WPANs)

This paper presents a high-throughput FFT processor for IEEE 802.15.3c (WPANs) standard. To meet the 2.59 Gigasample/s throughput requirements, radix-16 FFT algorithm is adopted and reformulated to an efficient form so that the required number of butterfly stages is reduced and the proposed radix-16 FFT butterfly processing element (PE) can be optimally pipelined. Specifically, the radix-16 butterfly PE consists of one radix-4 and two radix-2 cascaded pipelined butterfly units. It facilitates low-complexity realization of radix-16 butterfly operation and high operation speed due to the optimized pipelined structure. Hardware reuse and low-power schemes are also devised to reduce both area and power consumption. Moreover, a multibank memory scheme is used to support up to 16-times I/O capability of a single-bank memory, which can greatly reduce the input/output time of FFT data samples. As a result, the proposed radix-16 FFT processor is area-efficient with high data processing rate and hardware utilization efficiency. The EDA synthesis results show that the proposed design has 2.59 GS/s throughput and it consumes 103.5 mW by using UMC 90nm process.

[1]  Jing He,et al.  Word-length optimization of a pipelined FFT processor , 2011, 2011 International Conference on Consumer Electronics, Communications and Networks (CECNet).

[2]  Yutai Ma,et al.  An effective memory addressing scheme for FFT processors , 1999, IEEE Trans. Signal Process..

[3]  Chin-Liang Wang,et al.  A new memory-based FFT processor for VDSL transceivers , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).

[4]  Keshab K. Parhi,et al.  High-Throughput VLSI Architecture for FFT Computation , 2007, IEEE Transactions on Circuits and Systems II: Express Briefs.

[5]  Shousheng He,et al.  Designing pipeline FFT processor for OFDM (de)modulation , 1998, 1998 URSI International Symposium on Signals, Systems, and Electronics. Conference Proceedings (Cat. No.98EX167).

[6]  Keshab K. Parhi,et al.  An efficient pipelined FFT architecture , 2003 .

[7]  Yunho Jung,et al.  New efficient FFT algorithm and pipeline implementation results for OFDM/DMT applications , 2003, IEEE Trans. Consumer Electron..

[8]  Lewis Johnson,et al.  Conflict free memory addressing for dedicated FFT hardware , 1992 .

[9]  M.N.S. Swamy,et al.  An improved radix-16 FFT algorithm , 2004, Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513).

[10]  Chen-Yi Lee,et al.  A 1-GS/s FFT/IFFT processor for UWB applications , 2005, IEEE J. Solid State Circuits.

[11]  Daisuke Takahashi.  A radix-16 FFT algorithm suitable for multiply-add instruction based on Goedecker method , 2003, 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)..