The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—A very-high radix algorithm and implementation for circular CORDIC is presented. We first present in depth the algorithm for the vectoring mode in which the selection of the digits is performed by rounding of the control variable. To assure convergence with this kind of selection, the operands are prescaled. However, in the CORDIC algorithm, the coordinate <tmath>$x$</tmath> varies during the execution so several scalings might be needed; we show that two scalings are sufficient. Moreover, the compensation of the variable scale factor (including the CORDIC scale factor and the prescaling factors) is done by computing the logarithm of the scale factor and performing the compensation by an exponential. Then, we combine, in a unified unit, the proposed vectoring algorithm and the very-high radix rotation algorithm, which was previously proposed by the authors. We compare with low-radix implementations in terms of latency and hardware complexity. Estimations of the delay for 32-bit precision show a speedup of about two with respect to the radix-4 case with redundant addition. This speedup is obtained at the cost of an increase in the hardware complexity, which is moderate for the pipelined implementation. We also compare at the algorithmic level with other very-high radix proposals, demonstrating the advantages of our algorithms.</p>
Very-high radix algorithms, selection by rounding, CORDIC, angle and modulus calculation, rotation.

E. Antelo, T. Lang and J. D. Bruguera, "Very-High Radix Circular CORDIC: Vectoring and Unified Rotation/Vectoring," in IEEE Transactions on Computers, vol. 49, no. , pp. 727-739, 2000.
92 ms
(Ver 3.3 (11022016))