3,222 views

1 Answer

Best answer
1 votes
1 votes

$m = -5 = 1011$

$-m = 5 = 0101$

$r \ = -3 = 1101$

 let x and represent the number of bits in m and r.

$A = 1011 \ 0000 \ 0$

$S = 0101 \ 0000 \ 0$

$P = 0000 \ 1101 \ 0$

Least significant 2 bits of P are  $10$

1) if $10$ then $P + S$, $0101 \ 1101 \ 0$ and shift 1 bit to the right, So P = $0010 \ 1110 \ 1$

2) if $01$ then $P + A$, $1101 \ 1110 \ 1$ and shift 1 bit to the right, So P = $1110 \ 1111 \ 0$

3) if $10$ then $P + S$, $0011 \ 1111 \ 0$ and shift 1 bit to the right, So P = $0001 \ 1111 \ 1$

4) if $11$ then do nothing and shift 1 bit to the right, So P = $ 0000 \ 1111 \ 1$

After dropping the LSB, we're left with $0000 \ 1111$ which is $15$

selected by

Related questions

0 votes
0 votes
0 answers
1
Magma asked Jan 15, 2019
1,676 views
Consider the following 8 bit multiplication process (-121) X (-113) . What is the recorded multiplier in the multiplication.
0 votes
0 votes
1 answer
2
Na462 asked Apr 16, 2018
1,576 views
Please Explain the Rule to find number of additions and subtractions required for multiplication of two given numbers.
1 votes
1 votes
1 answer
3
sidsunny asked Jan 26, 2017
3,445 views
I understand booth's algorithm, but what is the meaning of this question?
1 votes
1 votes
1 answer
4
shikharV asked Jan 2, 2016
5,147 views
Given answer is 8 with following explanation:I couldn't understand the approach. Please explain.