一种优化的最大逼近角的CORDIC算法改进  

An Optimized Maximum Approximation Angle CORDIC Algorithm Improvement

作　　者：任全会[1] 吕春峰[2] 

机构地区：[1]郑州铁路职业技术学院电子工程系,河南郑州450052 [2]郑州铁路职业技术学院软件学院,河南郑州450052

出　　处：《微电子学与计算机》2013年第9期50-52,57,共4页Microelectronics & Computer

基　　金：河南省青年骨干教师资助项目(2012GGJS-251)

摘　　要：本文提出了一种优化的最大逼近角的CORDIC算法改进,低位通过最高非零位最大逼近角的计算方法实现,高位通过高速进位加法器的结构实现.采用基本角度线性编码方式,不但使流水线方式容易实现,而且旋转方向也容易确定,同时减少了迭代次数和增加迭代速度,精度越高优势越明显.算法实现不需要ROM,能大大节省硬件资源,可以应用在高精度高速度的运算领域.The paper proposes an optimized maximum approximation angle CORDIC algorithm improvement, low through maximum approximation angle of highest non zero binary calculation method, structure to achieve high though high--speed binary adder. Using micro--rotation angle recoding for low binary of the angle, pipelined manner not only makes easy to implement, but also to determine the direction of rotation, while reducing the number of iterations and increase the iteration speed, the higher the accuracy the more obvious advantages. The algorithm does not require ROM, significant saving in hardware resources, can be applied in the field of precision high-- speed arithmetic.

关 键 词：最大逼近角 CORDIC算法 基本角度线性编码 迭代次数 

分 类 号：TN47[电子电信—微电子学与固体电子学]