A Proof of the Modified Booth's Algorithm for Multiplication

1 October 1975

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-24 (10), 1014-1015
https://doi.org/10.1109/T-C.1975.224114

Abstract

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.

Keywords

ITERATION
MULTIPLICATION ALGORITHM
MODIFIED ALGORITHM
MODIFIED BOOTH'S
SIMPLIFIED PROOF
ALGORITHM REQUIRES
INCREASED COMPLEXITY
MULTIPLIER BITS

Cited by 110 articles