Given x 0111 and y 1001 in twos compliment notation ie x

Given x = 0111 and y = 1001 in two\'s compliment notation (i.e. x = 7 and y = -7), compute the products of p = x * y with Booth\'s algorithm. Show the steps taken.

Solution

  

We have given two numbers x=7 and y=-7 . Now we create table and find binary multiplication

A Q(-7) Q_1    M(7) Operation

0000 1001 0 0111 Initial

1001 1001 0 0111 Subtract

0100 1100 1 0111 Right Shift

1011 1100 1 0111 Addition

1101 1110 0 0111 Right Shift

0110 1111 0 0111 Subtract

1111 1111 1 0111 Right Shift

0111 1111 1 0111 Right Shift