Issue No. 09 - September (1998 vol. 47)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.713326
<p><b>Abstract</b>—In [<ref rid="bibt10371" type="bib">1</ref>], Duprat and Muller introduced the ingenious "Branching CORDIC" algorithm. It enables a fast implementation of CORDIC algorithm using signed digits and requires a constant normalization factor. This correspondence corrects some errors in the original paper. All the page numbers quoted are from [<ref rid="bibt10371" type="bib">1</ref>].</p>
Branching CORDIC, constant scale factor, signed-digit representation, corrections, errata.
Dhananjay S. Phatak, "Comments on Duprat and Muller's Branching CORDIC Paper", IEEE Transactions on Computers, vol. 47, no. , pp. 1037-1040, September 1998, doi:10.1109/12.713326