改进的高基CORDIC算法及其在FFT中的应用  

Modified high-radix CORDIC algorithm with its application in FFT computation

作　　者：王冬格 周晓方[1] 

机构地区：[1]复旦大学专用集成电路与系统国家重点实验室,上海201203

出　　处：《计算机工程与应用》2014年第7期41-45,共5页Computer Engineering and Applications

基　　金：国家科技重大专项基金(No.2011ZX03003-003-03);专用集成电路与系统国家重点实验室自主项目(No.11MS003)

摘　　要：提出了一种改进的高基CORDIC算法,显著减少了传统CORDIC算法的迭代次数,同时保持模校正因子依然是一个常数。该算法可用于旋转角度能事先确定的场合,例如FFT计算中的旋转因子乘法。所设计的复数乘法模块采用SMIC 0.13μm工艺综合,结果证明,提出的结构相比通用复数乘法器节约了19.2%的硬件面积和29.1%的ROM存储器面积,同时SQNR大于83 dB,满足实际应用的要求。A modified high-radix CORDIC algorithm is proposed, which significantly reduces iteration number of CORDIC algorithm and keeps scaling-factor as a constant. This algorithm can be applied in situations where rotation angle can be computed beforehand, such as twiddle factor multiplication of FFT（Fast Fourier Transform）computation. The designed plural-multiplication module is synthesized using the SMIC 0.13 μm process. Results proves that the proposed architecture has saved 19.2% hardware area and 29.1% ROM memory area in comparison with general-purpose plural multiplier, meanwhile it guarantees SQNR is above 83 dB which meets the practical requirement.

关 键 词：CORDIC算法 模校正因子 旋转因子乘法 快速傅里叶变换 

分 类 号：TP303[自动化与计算机技术—计算机系统结构]