projectus.freehost7.com:UG and PG level projects,mini projects and many more here ...



 

 

 

 

Non-restoring division

 

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

P[0] := N

i := 0

while i < n do

  if P[i] >= 0 then

    q[n-(i+1)] := 1

    P[i+1] := 2*P[i] - D

  else

    q[n-(i+1)] := -1

    P[i+1] := 2*P[i] + D

  end if

  i := i + 1

end while