Revision as of 14:58, 18 September 2012 edit Kogorman (talk \| contribs) 67 edits →Motive of the algorithm is unclear: new section ← Previous edit		Revision as of 09:24, 5 September 2013 edit undo 192.165.214.193 (talk) →Unsigned case: new section Next edit →
Line 67: --[[User:Kogorman\|kogorman]] ([[User talk:Kogorman\|talk]]) 14:58, 18 September 2012 (UTC) == Unsigned case == As the statement of this article, it's only work for signed 2's complement, I wonder if this could work for unsigned values. The examples in this article will NOT work for maximum unsigned values ie 15 x 15. Is there modified version for this algorithm for unsigned? Thanks.

Talk:Booth's multiplication algorithm: Difference between revisions