edited by
13,174 views

4 Answers

Best answer
46 votes
46 votes

Convert $57$ to Binary & Get $2's$ complement. It is "$11000111$" & Attach one extra $0$ to right of it

$110001110$

To calculate booth code subtract right digit from left digit in every consecutive 2 digits.

So, $11\to 0$, $10 \to +1$. Finally, $10 \to +1$

So, answer is (B).


There is another way to solve this question.

$0-100+100-1 \to$ If you check binary weigted sum of this code you will get $-57$. This is trick to quick check. Booth code is always equivalent to it's original value if checked as weighted code. If you check it before doing above procedure & if only one of option maps, you don't need to do above procedure, just mark the answer.

Here, $  (-1) \times 64 + (+1) \times 8 + (-1) \times 1 = -57$.

edited by
16 votes
16 votes

a) If ith bit is '1' and (i-1)th bit is '0' , we substitute ith bit with  '-1' .

b)  If ith bit is '0' and (i-1)th bit is '1' , we substitute ith bit with  '+1' .

c)  If ith bit is '0' and (i-1)th bit is '0' or  ith bit is '1' and (i-1)th bit is '1' then , we substitute ith bit with  '0'.

d) If LSB bit a0 is '1' , we assume that a-1 is there and = '0' and hence substitute it with '-1' .

57 = 00111001

In 2's compliment form, it is:  11000111 = -57

According to above rules: Booth Encoding Will Be: 0-100+100-1

Hence, Option B

Credit For The Quoted Explanation: @Habibkhan

Ref: https://gateoverflow.in/160574/booths-encoding

11 votes
11 votes
B  -57 i s represented as 1000111  on moving from 0 to 1 we get -1 and from 1 to 0 we get 1

so ans is b
3 votes
3 votes
57 in 2's compliment form = 11000111
So Q=11000111, q(_1 in suffix)=0

We know in bit pairs 00 and 11= ASR, 01=+,ASR , 10=-,ASR
So now           Q      q_1
               11000111  0
from right to left bit pair in reverse order                     (10)(11)(11)(01)(00)(00)(10)(11)
 so booth coding for 8 bit decimal number -57 is ------   
step 1=    -(1^0) (1^1) (1^1)  +(0^1) (0^0) (0^0) -(1^0) (1^1)
step 2=   - 1 0 0  + 1 0 0 - 1 0
step 3=reverse it= 0 - 1 0 0 + 1 0 0 - 1
Answer:

Related questions

22 votes
22 votes
2 answers
1
Kathleen asked Sep 23, 2014
7,290 views
Zero has two representations inSign-magnitude$2's$ complement$1's$ complementNone of the above
29 votes
29 votes
3 answers
2
Kathleen asked Sep 23, 2014
11,433 views
The maximum gate delay for any output to appear in an array multiplier for multiplying two $n$ bit numbers is$O(n^2)$$O(n)$$O(\log n)$$O(1)$
1 votes
1 votes
1 answer
3
pranab ray asked Oct 16, 2017
6,134 views
What is the Booth’s coding in 8-bits for an integer (-86)?
41 votes
41 votes
6 answers
4
Kathleen asked Sep 23, 2014
22,177 views
The number of full and half-adders required to add $16$-bit numbers is$8$ half-adders, $8$ full-adders$1$ half-adder, $15$ full-adders$16$ half-adders, $0$ full-adders$4$...