Booth's Algorithm

  11001
* 10110

Look at each pair of bits in the multiplier for addition or subtraction of M, the multiplicand.

M:
10110
    _0
First check: 00
Do Nothing.

2M:
10110
   __
Second check: 10
Subtraction.

    00000
-  110010 (-2M)

Because this is the second check, we have one additional 0 added to the multiplicand.

4M:
10110
  __
Third check: 11
Do nothing.

8M:
10110
 __
Fourth check: 01
Add.

      00000
-    110010 (-2M)
+  11001000 (8M)

Because this is the fourth check, we have three additional 0's added to the multiplicand.

16M:
10110
__
Fifth check: 10
Subtract.
      00000
-    110010 (-2M)
+  11001000 (8M)
- 110010000 (-16M)

Because this is the fifth check, we have four additional 0's added to the multiplicand.

Now add them all together.