Issue No. 02 - February (1993 vol. 42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.204786
<p>After a brief survey of the CORDIC algorithm, some new results that allow fast and easy signed-digit implementation of CORDIC, without modifying the basic iteration step are given. A slight modification would make it possible to use a carry-save representation of numbers, instead of a signed-digit one. The method, called the branching CORDIC method, consists of performing in parallel two classic CORDIC rotations. It gives a constant normalization factor. An online implementation of the algorithm is proposed with an online delay equal to 5 for the sine and cosine functions.</p>
sign functions; CORDIC algorithm; fast VLSI implementation; signed-digit implementation; carry-save representation; branching CORDIC method; constant normalization factor; online delay; cosine functions; digital arithmetic; signal processing; VLSI.
J. Duprat and J. Muller, "The CORDIC Algorithm: New Results for Fast VLSI Implementation," in IEEE Transactions on Computers, vol. 42, no. , pp. 168-178, 1993.