Comments on Duprat and Muller's Branching CORDIC Paper

Authors:
Dhananjay S. Phatak
Affiliations:
State Univ. of New York, Binghamton
Venue:
IEEE Transactions on Computers
Year:
1998

Citing 7
Cited 0

Generalized Signed-Digit Number Systems: A Unifying Framework for Redundant Number Representations

IEEE Transactions on Computers
Computer arithmetic algorithms

Computer arithmetic algorithms
Redundant CORDIC Methods with a Constant Scale Factor for Sine and Cosine Computation

IEEE Transactions on Computers
Elementary functions: algorithms and implementation

Elementary functions: algorithms and implementation
Double Step Branching CORDIC: A New Algorithm for Fast Sine and Cosine Generation

IEEE Transactions on Computers
The CORDIC Algorithm: New Results for Fast VLSI Implementation

IEEE Transactions on Computers
Hybrid Signed-Digit Number Systems: A Unified Framework for Redundant Number Representations with Bounded Carry Propagation Chains

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

In [1], 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 [1].