Register

Booth bit-pair recoding of multipliers doubt

4,063 views
0 0 votes

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?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · self doubtNext → · self doubt
← Previous in category · DoubtNext in category → · Made easy book
Position:
Show:

Related questions

0 0 votes
0 0 answers
1.7k
1.7k views
Tuhin Dutta asked Nov 26, 2017
1,699 views
Doubt in Booth Algo and Bit pair recoding
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 vote
1 1 answer
2.5k
2.5k views
Na462 asked Apr 16, 2018
2,528 views
Booth Algorithm
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." ?
0 0 votes
0 0 answers
430
430 views
Aspi R Osa asked Jan 23, 2016
430 views
the concept of multipliers in Digital logic?
can somebody explain the concept of MULTIPLIER circuits?please dont give links.
0 0 votes
0 0 answers
1.6k
1.6k views
HeadShot asked Jul 3, 2018
1,615 views
Multipliers
In the given solution, why the didn't add carry , as after adding carry bits I needed 4 adders. ( Please clarify whether one bit full adder is half adder only or not )