This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
June 1983 (vol. 32 no. 6)
pp. 521-526
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 2q, q = 2, and that the algorithm uses the table on an iteration in which any remainder in the range 0 to 1/2 ? 1/2n+1can occur as, for exampl
Index Terms:
radix 2, Digital arithmetic, digital division, inequalities, logic design, minimum table size, n-bit fraction, nonrestoring division, normalized
Citation:
L.B. Bushard, "A Minimum Table Size Result for Higher Radix Nonrestoring Division," IEEE Transactions on Computers, vol. 32, no. 6, pp. 521-526, June 1983, doi:10.1109/TC.1983.1676273
Usage of this product signifies your acceptance of the Terms of Use.