Several algorithms exist to perform division in digital designs. These algorithms fall into two main categories: slow division and fast division. Slow division algorithms produce 1 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.

The following division methods are all based on the form $Q={\frac {N}{D}}$ where:

Q = Quotient
N = Numerator (dividend)
D = Denominator (divisor)

Slow Division

Slow division methods are all based on a standard recurence equation: $P_{j+1}=RP_{j}-q_{n-(j+1)}D$ where:

 $P_{j}$  = the partial remainder of the division
R = the radix
 $q_{n-(j+1)}$  = the digit of the quotient in position n-j+1 (the position numbers begin with 0 and are numbered from least-significant (0) to most significant (n-1)
n = number of digits in the quotient
D = the denominator

Restoring Division

Restoring Division operates on fixed-point fractional numbers and depends on the following assumptions:

$N<D$
$1>N,D>=1/2$

The quotient digits 'q' are formed from the digit set {0,1}

The basic algorithm for binary (radix 2) restoring division is:

P[0] = N
i=0
while(i<n)
{
  TP[i+1] = 2P*[i] - D
  if(TP[i] > 0)  q[n-(i+1)] = 1; P[i+1] = TP[i+1]
  if(TP[i} <= 0) q[n-(i+1)] = 0; P[i+1] = TP[i+1] + D
  i++
}

Non-performing restoring division is similar to restoring division except that the falue of 2*P[i] is saved, so D does not need to be added back in for the case of TP[i] <= 0.

Non-Restoring Divsion

Non-Restoring division uses the digit set {-1,1} for the quotient digits insted of {0,1}. The basic algorithm for binary (radix 2) non-restoring division is:

P[0] = N
i = 0
while(i<n)
{
  if(P[i] >= 0) q[n-(i+1)] =  1; P[i+1] = 2*P[i] - D
  if(P[j]  < 0) q[n-(i+1)] = -1; P[i+1] = 2*P[i] + D
  i++
}

Following this algorithm, the quotient is in a non-standard form consisting of digits of -1 and +1. This form needs to be converted to binary to form the final quotient. Example:

Convert the following quotient to the digit set {0,1}: 
 
                                     $Q=111{\bar {1}}1{\bar {1}}1{\bar {1}}$ 
Steps:
1. Mask the negative term:           $N=00010101\,$ 
2. Form the Two's complement of N:   ${\bar {N}}=11101011$ 
3. Form the positive term:           $P=11101010\,$ 
4. Sum  $P\,$  and  ${\bar {N}}$ :                   $Q=11010101\,$

SRT Division

Named for its creators (Sweeny, Robertson, and Toker), SRT division is a popular method for division in many microprocessor implementations. SRT division is similar to Non-Restoring division, but it uses a lookup table based on the dividend and the divisor to determine each quotient digit. The Intel Pentium processor's infamous divider bug was cause by an incorrectly coded lookup table.

Fast Division

Newton-Raphson Division

Newton-Raphson uses Newton's method to converge to the quotient. The strategy of Newton-Raphson is to find the reciprocal of D, and multiply that reciprocal by N to find the final quotient Q.

 The steps of Newton-Raphson are:

Calculate an estimate for the reciprocal of the divisor (D): $X_{0}$
Compute successively more accurate estimates of the reciprocal: $(X_{1}...X_{i-1}...X_{k})$
Compute the quotient by multiplying the dividend by the reciprocal of the divisor: $Q=NX_{k}$

Assuming the divisor is scaled so $.5<D<1$ , the initial estimate for the reciprocal of the divisor is:

 $X_{0}=2.914-2D$

Successively more accurate estimates of the reciprocal can be calculated using:

 $X_{i+1}=X_{i}(2-BX_{i})$

Goldschmidt Division

Goldschmidt uses series expansion to converge to the quotient. The strategy of Goldschmidt is repeatedly multiply the dividend and divisor by a factor F to converge the divisor to 1 as the dividend converges to the quotient Q:

  $Q={\frac {N}{D}}{\frac {F[1]}{F[1]}}{\frac {F[2]}{F[2]}}{\frac {F[...]}{F[...]}}$

 The steps for Goldschmidt are:

Calculate an estimate for the muliply factor $F$ .
Multiply the dividend and divisor by $F$ .
Loop to step 1.

Assuming the divisor is scaled so $0.9<=D<=1.1$ , the first factor is:

 $F_{i+1}=2-D_{i}$

Multiplying the dividend and divisor by the factor yields:

 ${\frac {N_{i+1}}{D_{i+1}}}={\frac {N_{i}}{D_{i}}}{\frac {F_{i}}{F_{i}}}$

After a sufficient number of iterations 'k': $Q=N_{k}$