面向LTE的超低复杂度FFT处理单元设计  

Low- Complexity Mixed-Radix FFT Design and Implementation for LTE-Oriented

作　　者：费超[1] 卢浩[1] 陈杰男[1] 胡剑浩[1] 

机构地区：[1]电子科技大学通信抗干扰技术国家级重点实验室,四川成都611731

出　　处：《实验科学与技术》2016年第6期40-42,109,共4页Experiment Science and Technology

基　　金：国家自然科学基金(61371104)

摘　　要：该文提出了一种超低复杂度的、面向长期演进(LTE)上行的快速傅里叶变换(FFT)混合基处理单元的设计与实现。由Cooley-Tukey算法与质因数算法,LTE上行所需FFT可以分解到基2,3,5上。该文基于Winograd傅里叶变换设计了FFT处理单元,利用折叠技术对多模下FFT进行了算法单元复用,利用正则符号数(CSD)乘法结合树形结构与Horner法则优化其中的乘法器结构。相比已有方法,关键路径时间降低16.7,乘法器面积降低78.9,总面积降低62.1。In this paper,a low cost mixed-radix FFT processor is proposed based on the uplink of LTE standards. Firstly CTA and PFA are employed to factorize large length FFT to small mixed- radix FFTs. After that,WFTA is utilized to implement the mixed- radix FFTs with reusing technology. Finally,a CSD multiplier with Horner structure is employed to optimize the constant multiplier. Compared with existing methods,the proposed method has 78. 9 hardware saving in multiplier and 62. 1 in total design,as well as 16. 7 processing time reduction.

关 键 词：快速傅里叶变换 长期演进计划 Winograd傅里叶变换 正则有符号数 

分 类 号：TN929.5[电子电信—通信与信息系统]