Revision as of 20:53, 14 October 2007 edit Captain Zyrain (talk \| contribs) 1,815 edits 4 times thru the loop ← Previous edit		Revision as of 04:37, 2 December 2007 edit undo Reinderien (talk \| contribs) Extended confirmed users 996 edits No edit summary Next edit →
Line 33: The described method in the article can't handle multiplications like -128 x 1 (when using 8 bits). The problem arises from the fact that -128 is the minimum negative number when using 8 bits for representation. I have made a minor modification in the method and added one more example to show the improved technique. Hope that everything is OK. [[User:Prekageo\|Prekageo]] 12:22, 15 August 2007 (UTC) :What is the additional bit initialized to? Reinderien 04:37, 2 December 2007 (UTC) ==Number of times to perform the loop== In [[Booth%27s_multiplication_algorithm#Example]], how do you know to perform the loop 4 times? [[User:Captain Zyrain\|Captain Zyrain]] 20:53, 14 October 2007 (UTC) : Because in the example, x = 4 and y = 4.

Talk:Booth's multiplication algorithm: Difference between revisions