search
Log In
0 votes
943 views

1) In Booth's bit-pair recording technique how to multiply a multiplicand with 2?

2) In booth's algorithm for multiplication/Booth's bit-pair recording of multipliers, the sign bit extension of the multiplicand i.e. we must extend the sign-bit value of the multiplicand to the left as far as the product will extend. Now my question is what should be the value of extended Sign Bit?

I think following are the possible values-

Multiplier Bit Extended Sign Bit Value
0 0
+1 0
-1 +1
-2 +1
+2 I don't know
 

Also, why is the sign bit extended? Will we get the correct answer if we don't extend sign bit?

in Digital Logic 943 views
0

Please log in or register to answer this question.

Related questions

0 votes
0 answers
1
422 views
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 ... 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.
asked Nov 26, 2017 in Digital Logic Tuhin Dutta 422 views
1 vote
1 answer
2
662 views
Can anybody Explain why is it so that "The worst case of an implementation using Booth’s algorithm is when pairs of 01s or 10s occur very frequently in the multiplier." ?
asked Apr 17, 2018 in Digital Logic Na462 662 views
0 votes
0 answers
3
93 views
can somebody explain the concept of MULTIPLIER circuits? please dont give links.
asked Jan 23, 2016 in Digital Logic Aspi R Osa 93 views
0 votes
0 answers
4
2.8k views
2's complement representation of a 16 bit number ( one sign bit and 15 magnitude bits) is FFFF . Its magnitude in decimal representation is (a) 0 (b) 1 (c)32767 (d) 65535
asked Sep 7, 2017 in Digital Logic hem chandra joshi 2.8k views
...