by another bit because the multiple is signed (in two's complement representa-
tion); finally it is necessary to extend one more bit to accommodate the range of
the result of the addition.
The number of iterations is equal to the number of digits of the recoded
multiplier, that is, m = [(n + 1)/2]. The execution is illustrated in the timing
diagram shown in Figure ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.