Content deleted Content added
m fix radix-8 link to be correct for latest version of the "A Formal Theory of RTL and Computer Arithmetic" website |
No edit summary Tags: Mobile edit Mobile web edit |
||
Line 1:
'''Booth's multiplication algorithm''' is a u[[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==
| |||