Division (digital)
A division algorithm is an algorithm which, given two integers N and D, computes their quotient and/or remainder, the result of division. Some are applied by hand, while others are employed by digital circuit designs and software.
Division algorithms fall into two main categories: slow division and fast division. Slow division algorithms produce one digit of the final quotient per iteration. Examples of slow division include restoring, non-performing restoring, non-restoring, and SRT division. Fast division methods start with a close approximation to the final quotient and produce twice as many digits of the final quotient on each iteration. Newton-Raphson and Goldschmidt fall into this category.
Discussion will refer to the form where
- Q = Quotient
- N = Numerator (dividend)
- D = Denominator (divisor).
Read more about Division (digital): Division By Repeated Subtraction, Long Division, Integer Division (unsigned) With Remainder, Slow Division Methods, Large Integer Methods, Division By A Constant, Rounding Error
Famous quotes containing the word division:
“For in the division of the nations of the whole earth he set a ruler over every people; but Israel is the Lord’s portion: whom, being his firstborn, he nourisheth with discipline, and giving him the light of his love doth not forsake him. Therefore all their works are as the sun before him, and his eyes are continually upon their ways.”
—Apocrypha. Ecclesiasticus 17:17-9.