YAO Yafeng, ZOU Lingzhi, WANG Wei, et al. Low-consumption andLUT-omitted CORDIC algorithm[J]. 2017, 49(11): 2017-11.DOI: 10.11918/j.issn.0367-6234.201704019.
为减少传统流水线型CORDIC(Coordinate Rotation Digital Computer)算法的硬件资源消耗和输出时延,在包含查找表的三阶段CORDIC算法实现基础上,提出一种免去查找表环节的CORDIC算法实现方法.提出的改进算法直接使用四次移位相加的迭代运算替换查找表结构从而显著降低寄存器消耗,同时通过合并迭代降低迭代次数进而有效减少最大输出时延,并综合运用角度二极化重编码(Binary To Bipolar Recoding
In order to reduce the hardware resource consumption and output delay in the conventional pipeline CORDIC (Coordinate Rotation Digital Computer) algorithm
a LUT-omitted CORDIC algorithm is proposed on the basis of the three-stage CORDIC with look-up table (LUT). The proposed new algorithm adopts 4 iterations of shifter-adder instead of LUT to reduce the register consumption apparently
and merges some iterations to decrease the output delay effectively
and guarantees the output resolution by using a combination of Binary to Bipolar Recoding (BBR) and angle range folding. The improved algorithm is specifically implemented using Verilog HDL on ISE 14.2 software platform and synthesized using XST tools
and is modeled to analyze the output errors through MATLAB. Simulation experiment results show that the register resource consumption of the new algorithm
producing sine/cosine effectively
is reduced by about 74.42% compared with the conventional one
while the output width is set to 16 equally. The computing clock periods are decreased by 68.75%
and the resolution is also improved obviously. Compared with the three-stage algorithm
the consumption of register is reduced by about 43.3%. The proposed algorithm has some advantages such as brilliant real-time performance
high resolution
and low consumption. And it is more applicable for modern digital communication systems that demand for high speed and promising real-time performance.