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.
No takes yet. Share an insight, caveat, or question.
Louis Paul Rubinfield (1975) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: