Revision as of 12:17, 16 December 2018 edit DIVINE (talk \| contribs) Extended confirmed users 9,681 edits m Reverted 1 edit by 139.167.208.17 (talk) to last revision by 139.167.211.72. (TW) Tag: Undo ← Previous edit		Revision as of 16:19, 16 December 2018 edit undo 2405:204:a00c:d3f3:6a46:2a78:5f36:11de (talk) Removed unnecessary words Tags: Mobile edit Mobile web edit Next edit →
Line 1: '''Booth's multiplication algorithm''' is a [[multiplication algorithm]] that multiplies two signed [[base 2\|binary]] numbers ~~rahul Saraswat~~ 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