| 摘要 |
There is provided a method of performing binary integer division to obtain a final quotient and a final remainder from an N-bit denominator d and a 2N-bit numerator comprising a binary integer component n of N-bits and a zero component of N-bits of binary 0's, the meth od including: (a) delivering the denominator and intermediate remainders to a computer system operable to determine quotient values; (b) delivering the denominator and quotient values to a computer system operable to determine the intermediate remainders; wherein the quotient values q(i) a nd the intermediate remainders r(i) are generated by performing the following assignments iteratively (i=i+1) until the binary 0's of the zero component of the numerator are exhausted, in which r( 0) is initially set equal to n and q(0) is initially set equal to r(0)[/]d; q(i)=r(i)[/]d padded to th e left with binary 0's equal to N less the number of bits in the intermediate remainder r(i); and r(i+1)=r(i )[- ](q(i)[*]d) padded to the right with binary 0's equal to N less the number of bits in the intermediate remainder r(i) removed from the zero component of the numerator, wherein the final quotient is represented by a concatenation of the quotient values q(i) and the final remainder is represented by the value of r(i).
|
