Jump to content

Talk:Booth's multiplication algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Daggath (talk | contribs) at 05:24, 14 December 2006 (Adding information about the original Booth's Algorithm.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Here is a reference to Booth's paper:

A. D. Booth. A Signed Binary Multiplication Technique, Quarterly Journal of Mechanics and Applied Mathematics 4 (1951), 236--240.

This shows that Booth proposed his multiplication technique in 1951. The article gives a date of "around 1957".

-James

U can get the pdf copy of the paper ("A Signed Binary Multiplication Technique")at the given URL:

[[1]]

Get it for better knowledge of Booth's Multiplier.

-Prasad Babu P (INDIA)

Booth actually has 2 algorithms. The first one was found to contain a flaw, so the second algorithm is the one that is now used and referenced in industry as Booth's Algorithm, since no one uses his original algorithm. - I suggest having both algorithms on this page(I shall do this if I have time). -source= class @ San Jose State University CS147

-Oliver Seet (USA) (student)

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Booth%27s_multiplication_algorithm&oldid=94226112"