Issue No. 05 - May (1998 vol. 47)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.677251
<p><b>Abstract</b>—Duprat and Muller [<ref rid="bibt05871" type="bib">1</ref>] introduced the ingenious "Branching CORDIC" algorithm. It enables a fast implementation of CORDIC algorithm using signed digits and requires a constant normalization factor. The speedup is achieved by performing two basic CORDIC rotations in parallel in two separate modules. In their method, both modules perform identical computation except when the algorithm is in a "branching" [<ref rid="bibt05871" type="bib">1</ref>]. We have improved the algorithm and show that it is possible to perform two circular mode rotations in a single step, with little additional hardware. In our method, both modules perform distinct computations at each step which leads to a better utilization of the hardware and the possibility of further speedup over the original method. Architectures for VLSI implementation of our algorithm are discussed.</p>
Double step, branching CORDIC, constant scale factor, redundant signed-digit CORDIC.
D. S. Phatak, "Double Step Branching CORDIC: A New Algorithm for Fast Sine and Cosine Generation," in IEEE Transactions on Computers, vol. 47, no. , pp. 587-602, 1998.