摘要

The CORDIC algorithm is a hardware-efficient iterative algorithm for evaluating a wide variety of elementary functions, but it suffers from the problem of long latency. The Angle Recoding method can obtain lower overall latency by reducing more than 50% iterations, however, its angle selection function is very complex which requires a large increase in cycle time and hardware cost. This paper presents a simpler implementation for angle selection function of Angle Recoding method by using a novel renumbering scheme. This method uses only a priority selector and a comparator to find the closest angle constant to the residual angle instead of using the adder-subtracters and binary tree comparison unit. Compared with the existing method, our method achieves much less delay and hardware cost and still keeps the advantage of the reduction in iteration count.

  • 出版日期2012

全文