Revision as of 06:18, 8 February 2018 edit Dicklyon (talk \| contribs) Autopatrolled, Extended confirmed users, Rollbackers 486,013 edits m Reverted to revision 818901218 by 27.131.12.150 (talk): Revert all the 2018 IP random changes. (TW) Tag: Undo ← Previous edit		Revision as of 06:20, 8 February 2018 edit undo Dicklyon (talk \| contribs) Autopatrolled, Extended confirmed users, Rollbackers 486,013 edits rm unsourced claim from lead; he was designing computers, not using desk calculators Next edit →
Line 1: '''Booth's multiplication algorithm''' is a [[multiplication algorithm]] that multiplies two signed [[base 2\|binary]] numbers in [[two's complement\|two's complement notation]]. The [[algorithm]] was invented by [[Andrew Donald Booth]] in 1950 while doing research on [[crystallography]] at [[Birkbeck, University of London\|Birkbeck College]] in [[Bloomsbury]], [[London]]~~. Booth used desk calculators that were faster at [[Arithmetic shift\|shift]]ing than adding and created the algorithm to increase their speed~~. Booth's algorithm is of interest in the study of [[computer architecture]]. ==The algorithm==

Booth's multiplication algorithm: Difference between revisions