This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Proof of the Modified Booth's Algorithm for Multiplication
October 1975 (vol. 24 no. 10)
pp. 1014-1015
L.P. Rubinfield, Computers Systems Laboratory, Washington University
A simplified proof of a modification of Booth's multiplication algorithm by MacSorley to a form which examines three multiplier bits at a time is presented. In comparison with the original Booth's algorithm, which examines two bits at a time, the modified algorithm requires half the nutmber of iterations at the cost of somewhat increased complexity for each iteration.
Index Terms:
Modified Booth's algorithm, multiplicand, multiplier, partial product.
Citation:
L.P. Rubinfield, "A Proof of the Modified Booth's Algorithm for Multiplication," IEEE Transactions on Computers, vol. 24, no. 10, pp. 1014-1015, Oct. 1975, doi:10.1109/T-C.1975.224114
Usage of this product signifies your acceptance of the Terms of Use.