Booth's multiplication algorithm: Difference between revisions

Content deleted Content added
m Reverted edits by 171.76.168.14 (talk) (HG) (3.4.9)
Adding short description: "Algorithm that multiplies two signed binary numbers in two's complement notation" (Shortdesc helper)
Line 1:
{{short description|Algorithm that multiplies two signed binary numbers in two's complement notation}}
'''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]].