基于最大逼近角的固定旋转序列CORDIC算法  

Fixed rotation sequence CORDIC algorithm based on maximum approximation angle

作　　者：王瑜 蒋平[1] 王建庄 WANG Yu;JIANG Ping;WANG Jian-zhuang(School of Mechanical Science&Engineering,Huazhong University of Science and Technology,Wuhan 430074,China)

机构地区：[1]华中科技大学机械科学与工程学院,湖北武汉430074

出　　处：《微电子学与计算机》2020年第6期57-61,共5页Microelectronics & Computer

基　　金：基金委创新研究群体项目(51721092)。

摘　　要：为了解决现有CORDIC算法旋转序列不固定、算法复杂度高、需要的存储空间大等问题,基于最大逼近角理论对算法加以优化,设计了一种固定旋转序列的CORDIC算法结构.通过对角度重编码后二进制的高位旋转策略的分析,确定了对高位每一位都进行两次旋转的固定序列的方法,从而减少了高位旋转方向判断次数,简化了比例常数的计算.最后在FPGA中实现对优化前后算法的实验对比分析,验证了优化后的算法相比传统算法在计算复杂度、存储空间使用以及误差控制等方面的优越性和有效性.In order to solve the problems of irregular rotation sequence,high complexity and large storage space in traditional CORDIC algorithm,a CORDIC algorithm structure with fixed rotation sequence is designed based on the theory of maximum approximation angle.By analyzing the strategy of binary high bit rotation after angle re-coding,the method of fixed sequence which rotates each bit twice is determined,which reduces the number of judgments of high bit rotation direction and simplifies the calculation of proportional constant.Finally,the experimental comparison and analysis of the optimization algorithm before and after implementation in the FPGA verifies the superiority and effectiveness of the optimized algorithm compared with the traditional algorithm in the aspects of computational complexity,storage space usage and error control.

关 键 词：CORDIC算法 最大逼近角 固定旋转序列 FPGA 

分 类 号：TN911.7[电子电信—通信与信息系统] TN47[电子电信—信息与通信工程]