Issue No.01 - January (1990 vol.39)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.46287
<p>It is shown that, if a division is described by AQ=C, where A is the divisor, Q is the quotient, and C is the dividend, then the bit variables involved in a set of equations, each of which determines a leading bit of C, gives an approximation for Q that an be used in a SRT division scheme. The results of an exhaustive statistical simulation, using all possible combinations of two pairs of integers 12 b in length, in normalized form, representing A and C are presented to validate the method.</p>
systematic method; division; high average bit skipping; approximation; statistical simulation; normalized form; digital arithmetic.
D.M. Mandelbaum, "A Systematic Method for Division with High Average Bit Skipping", IEEE Transactions on Computers, vol.39, no. 1, pp. 127-130, January 1990, doi:10.1109/12.46287