# please tell the multiplication of (+15 X -13) Through the Booth Multiplication Algo.

25k views
..

edited
0
0

I want the solution of my answer .

3
https://en.wikipedia.org/wiki/Booth's_multiplication_algorithm#Example

Copy above link and open in a new tab or window. Here, an example is shown which is similar to your question (multiplying a positive number with a negative number).

five bits hence five operations.

#imp

How to determine which operation
Q0 Q-1 Operation
0 0 right shift
0 1 A <- A + M and then right shift
1 0 A <- A - M   and then right shift
1 1 right shift

edited
0

Please tell what mistake Am i doing it ?

Arjun sir see i solved this but still not able to get :((

0
Thank you @sushant gokhale sir
0
when the multiplier is like this $1\ 0\ 0\ 1\ 1\ 0\ 1\ 0\$ then no need of implied 0. right?

## Related questions

1
314 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.