Booth Algorithm:

Booth's multiplication algorithm is a multiplication algorithm that multiplies two signed binary numbers in two's complement notation. It uses the CSD representation logic of a binary number. The example below shows the csd representation logic used for multiplication: Eg:

Dept of ECE, RVCE Bangalore

Booth Algorithm:
Booth's algorithm follows this scheme by performing an addition when it encounters the first digit of a block of ones (0 1) and a subtraction when it encounters the end of the block (1 0). This works for a negative multiplier as well. When the ones in a multiplier are grouped into long blocks, Booth's algorithm performs fewer additions and subtractions than the normal multiplication algorithm. This is called Radix-2 booth algorithm. Situation can be improved by examining 3 bits of a number at a time rather than two, this is called Radix-4 booth algorithm.

Dept of ECE, RVCE Bangalore

Modified Booths Encoder

y(2i+1) 0 0 0 y(2i) 0 0 1 y(2i-1) 0 1 0 y(i)` 0 1 1 X 0 1 1 2X 0 0 0 Sign 0 0 0 Zero 1 0 0

0
1 1 1 1

1
0 0 1 1

1
0 1 0 1

2
-2 -1 -1 1

0
0 1 1 0

1
1 0 0 0

0
1 1 1 1

0
0 0 0 1
3

Dept of ECE, RVCE Bangalore

Simplified sign extension method

PP83

1 PP82 PP83 PP73

1 PP82 PP63

PP80 PP81 PP72 PP53

PP80 PP81 PP62 PP43

PP80 PP71 PP52 PP33

PP80 PP61 PP42 PP23

PP70 PP51 PP32 PP13

PP60 PP50 PP40 PP30 PP20 PP10 PP00 PP41 PP31 PP21 PP11 PP01 S PP22 PP12 PP02 S PP03 S S P6 P5 P4 P3 P2 P1 P0

P15

P14

P13

P12

P11

P10

P9

P8

P7

Dept of ECE, RVCE Bangalore