Let's say we have a multiplier $ (10101010)_2 $. Then applying booth re-coding,
Method 1:
appending a zero at the end: $ (1\ 0\ 1\ 0\ 1\ 0\ 1\ 0\ 0)_2 => (-1\ 1\ -1\ 1\ -1\ 1\ -1\ 0)_2$
Method 2:
without appending a zero at the end: $ (1\ 0\ 1\ 0\ 1\ 0\ 1\ 0)_2 => (-1\ 1\ -1\ 1\ -1\ 1\ -1)_2$
Which of the above method is correct?
Also, is the following condition true?
#multiplier bits must be equal to #multiplicand bits
Please don't give any ref link because I've already searched but didn't got my doubt cleared.
