Issue No. 10 - October (1975 vol. 24)
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.
Modified Booth's algorithm, multiplicand, multiplier, partial product.
L. Rubinfield, "A Proof of the Modified Booth's Algorithm for Multiplication," in IEEE Transactions on Computers, vol. 24, no. , pp. 1014-1015, 1975.