Issue No. 06 - June (1983 vol. 32)
L.B. Bushard , Sperry Univac
The minimum table size is established for nonrestoring division algorithms that utilize a table lookup technique for quotient digit selection. It is assumed that the dividend and divisor are n-bit fractions, that the algorithm is radix 2<sup>q</sup>, q = 2, and that the algorithm uses the table on an iteration in which any remainder in the range 0 to 1/2 ? 1/2<sup>n+1</sup>can occur as, for exampl
radix 2, Digital arithmetic, digital division, inequalities, logic design, minimum table size, n-bit fraction, nonrestoring division, normalized
L. Bushard, "A Minimum Table Size Result for Higher Radix Nonrestoring Division," in IEEE Transactions on Computers, vol. 32, no. , pp. 521-526, 1983.