Abstract: 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.

Key words: CORDIC algorithm, scaling-factor, twiddle factor multiplication, Fast Fourier Transform（FFT）

摘要： 提出了一种改进的高基CORDIC算法，显著减少了传统CORDIC算法的迭代次数，同时保持模校正因子依然是一个常数。该算法可用于旋转角度能事先确定的场合，例如FFT计算中的旋转因子乘法。所设计的复数乘法模块采用SMIC 0.13 μm工艺综合，结果证明，提出的结构相比通用复数乘法器节约了19.2%的硬件面积和29.1%的ROM存储器面积，同时SQNR大于83 dB，满足实际应用的要求。

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