Talk:Booth's multiplication algorithm: Difference between revisions

Revision as of 22:30, 8 September 2009

Revision as of 22:32, 8 September 2009

Line 32:

::The 9 bits refer to 4+4+1 (the number of bits ''x'' and ''y'', not the values '''x''' and '''y'''). I have changed '''x''' and '''y''' to '''m''' and '''r''', so hopefully there is less confusion. The whole description is confusing, but I only learned the algorithm a few minutes ago so I won't dare to fix it yet. :) [[User:Maghnus|Maghnus]] ([[User talk:Maghnus|talk]]) 21:19, 10 January 2009 (UTC)

:There is definitely an error in the example and maybe the description of the algorythm. It does not work out when using the correct 2's complement numbers. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/134.253.26.12|134.253.26.12]] ([[User talk:134.253.26.12|talk]]) 22:30, 8 September 2009 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->

== Improved method that handles multiplication by the minimum negative number ==