Booth's multiplication algorithm: Difference between revisions

Content deleted Content added
A typical implementation: Wikifying 'multiplicand' and 'multiplier' for clarity and ease of reference.
No edit summary
Tags: Mobile edit Mobile web 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==