Talk:Booth's multiplication algorithm: Difference between revisions

Revision as of 10:03, 5 September 2013

Revision as of 20:19, 20 August 2014

Line 43:

:What is the additional bit initialized to? Reinderien 04:37, 2 December 2007 (UTC)

:I added some clarification to that part, based on what I believe is a correct interpretation: the typical implementation states, "A: Fill the most significant (leftmost) bits with the value of m. Fill the remaining (y + 1) bits with zeros." It seems to be the case that, should you add more bits to the front, you still fill all of them with the value of '''m'''--you're just filling more bits with the same value now, so the sign bit will be further out, and you'll have an extra '1' for each bit you add, to balance out the fact that the sign bit is now more significant. [[User:KoriganStone|KoriganStone]] ([[User talk:KoriganStone|talk]]) 20:19, 20 August 2014 (UTC)

==Number of times to perform the loop==