Revision as of 04:42, 12 February 2020 edit 171.76.168.14 (talk) No edit summary Tags: Visual edit Mobile edit Mobile web edit ← Previous edit		Revision as of 04:42, 12 February 2020 edit undo Dartslilly (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 3,439 edits m Reverted edits by 171.76.168.14 (talk) (HG) (3.4.9) Tags: Huggle Rollback Next edit →
Line 1: '''~~Ameer chand-~~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]].<ref name="Booth_1951"/> Booth's algorithm is of interest in the study of [[computer architecture]]. ==The algorithm==

Booth's multiplication algorithm: Difference between revisions