Category: Shift-and-add algorithms

Unified CORDIC
No description available.
Trigonometric CORDIC
No description available.
Branching CORDIC
No description available.
Hyperbolic CORDIC
No description available.
Meggitt's method
No description available.
Pseudo-division
No description available.
Shift-and-add algorithm
No description available.
Wang's factor combining
No description available.
Factor combining
No description available.
Redundant CORDIC
No description available.
CORDIC
CORDIC (for "coordinate rotation digital computer"), also known as Volder's algorithm, or: Digit-by-digit method Circular CORDIC (Jack E. Volder), Linear CORDIC, Hyperbolic CORDIC (John Stephen Walthe
Pseudo-multiplication
No description available.
Hybrid CORDIC
No description available.
Pipelined CORDIC
No description available.
BKM algorithm
The BKM algorithm is a shift-and-add algorithm for computing elementary functions, first published in 1994 by Jean-Claude Bajard, Sylvanus Kla, and Jean-Michel Muller. BKM is based on computing comple
Double dabble
In computer science, the double dabble algorithm is used to convert binary numbers into binary-coded decimal (BCD) notation. It is also known as the shift-and-add-3 algorithm, and can be implemented u
Compensated CORDIC
No description available.
Shift-and-add-3 algorithm
No description available.
Binary CORDIC
No description available.
All-serial CORDIC
No description available.
Differential CORDIC
No description available.
Volder's algorithm
No description available.
Merged CORDIC
No description available.
Decimal CORDIC
No description available.