Talk:Booth's multiplication algorithm: Difference between revisions

Revision as of 09:25, 5 September 2013

Revision as of 10:03, 5 September 2013

Line 70:

== Unsigned case ==

For unsigned case, it's simply increase that to 5 x 5 signed bit, so a 15 x 15 would work.

As the statement of this article, it's only work for signed 2's complement, I wonder if this could work for unsigned values.

But keep in mind, if you are work on radix-4 or high order of design, let say a 8 x 8 in radix-4 method.

The examples in this article will NOT work for maximum unsigned values ie 15 x 15.

You are actually working on a 9 x 9 case instead, and the last cycle will be radix-2 only, yes that's odd.

Is there modified version for this algorithm for unsigned?

So for a 64 x 64 => 65 x 65 case, the chose of radix-?? will be difficult.

Thanks. <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/192.165.214.193|192.165.214.193]] ([[User talk:192.165.214.193|talk]]) 09:24, 5 September 2013 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->

Thanks. <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/192.165.214.193|192.165.214.193]] ([[User talk:192.165.214.193|talk]]) 09:24, 5 September 2013 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->