Category: Digit-by-digit algorithms

Unified CORDIC
No description available.
Trigonometric CORDIC
No description available.
Branching CORDIC
No description available.
Bit-by-bit algorithm
No description available.
Hyperbolic CORDIC
No description available.
Meggitt's method
No description available.
Pseudo-division
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.
Digit-by-digit algorithm
No description available.
Shifting nth root algorithm
The shifting nth root algorithm is an algorithm for extracting the nth root of a positive real number which proceeds iteratively by shifting in n digits of the radicand, starting with the most signifi
Hybrid CORDIC
No description available.
Pipelined CORDIC
No description available.
Long division
In arithmetic, long division is a standard division algorithm suitable for dividing multi-digit Hindu-Arabic numerals (Positional notation) that is simple enough to perform by hand. It breaks down a d
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
Compensated CORDIC
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.