Issue No. 07 - July (1998 vol. 47)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.709373
<p><b>Abstract</b>—The computation of additional functions in the CORDIC module increases its flexibility. We consider here the extension of the vectoring mode (angle calculation) so that the vector is rotated until one of the coordinates (for instance <it>y</it>) attains a target value <it>t</it> (in contrast to the value 0, as in standard vectoring). The main problem in the algorithm is that the modulus of the vector is scaled in each CORDIC iteration so that a direct comparison of <it>y</it>[ <it>j</it> ] with <it>t</it> does not assure convergence. We present a scheme that overcomes this and in which the implementation consists of a standard CORDIC module plus a module to determine the direction of rotation. This improves over a previous proposal in which more complex iterations are introduced as part of the CORDIC algorithm. Moreover, an error analysis is performed to determine the datapath width required for convergence. Since this width is large, we consider also the characteristics of the algorithm for a narrower datapath.</p>
Extended CORDIC functions, computer arithmetic, CORDIC, inverse kinematics computations, rotations.
Tomás Lang, Elisardo Antelo, "CORDIC Vectoring with Arbitrary Target Value", IEEE Transactions on Computers, vol. 47, no. , pp. 736-749, July 1998, doi:10.1109/12.709373