Hardware Efficient Mixed Radix-25/16/9 FFT for LTE Systems

被引:42
作者
Chen, Jienan [1 ]
Hu, Jianhao [1 ]
Lee, Shuyang [1 ]
Sobelman, Gerald E. [2 ]
机构
[1] Univ Elect Sci & Technol China, Chengdu 611731, Peoples R China
[2] Univ Minnesota, Minneapolis, MN 55455 USA
基金
中国国家自然科学基金;
关键词
Fast Fourier transforms (FFTs); generalized high radix (GHR); long-term evolution (LTE); reconfigurable; ALGORITHM;
D O I
10.1109/TVLSI.2014.2304834
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we propose a hardware-efficient mixed generalized high-radix (GHR) reconfigurable fast Fourier transform (FFT) processor for long-term evolution applications. The GHR processor based on radix-25/16/9 uses a 2-D factorization scheme as the high-radix unit and a 1-D factorization method as the system data routing technology. The 2-D factorization scheme is implemented by an enhanced delay element matrix structure, which supports 25-, 16-, 9-, 8-, 5-, 4-, 3-, and 2-point FFTs. Two different designs were implemented. One design (called discrete Fourier transform core) supports 34 different transform sizes from 12 to 1296 points, while the other design (called FFT core) supports five different power-of-two sizes from 128 to 2048 points. The 1-D factorization method is performed by a coprime accessing technology, which accesses the data in parallel without conflict using a RAM. The GHR combines 2-D and 1-D factorization techniques and improves the throughput by a factor of two to four with comparable hardware cost compared with the previous designs. The speed-area ratio of the proposed scheme is nearly two times better than that of previous FFT processors. Application-specified integrated circuit implementation results based on a 0.18-mu m technology are also provided.
引用
收藏
页码:221 / 229
页数:9
相关论文
共 17 条
[1]  
[Anonymous], 2011, DISCR FOUR TRANSF V3
[2]  
[Anonymous], 136211 3GPP ETSI TS
[3]  
[Anonymous], 2012, Digital Video Broadcasting (DVB)
[4]  
Specification for Service Information (SI) in DVB systems
[5]   An Efficient VLSI Architecture for Normal I/O Order Pipeline FFT Design [J].
Chang, Yun-Nan .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2008, 55 (12) :1234-1238
[6]   Low-cost fast VLSI algorithm for discrete Fourier transform [J].
Cheng, Chao ;
Parhi, Keshab K. .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2007, 54 (04) :791-806
[7]   AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J].
COOLEY, JW ;
TUKEY, JW .
MATHEMATICS OF COMPUTATION, 1965, 19 (90) :297-&
[8]  
GOOD IJ, 1958, J ROY STAT SOC B, V20, P361
[9]   A Generalized Mixed-Radix Algorithm for Memory-Based FFT Processors [J].
Hsiao, Chen-Fong ;
Chen, Yuan ;
Lee, Chen-Yi .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2010, 57 (01) :26-30
[10]  
Hung C. - P., 2000, P IEEE ISCAS, P833