Embed Size (px)
Citation preview
1
2
3
4
5
6
Used for multiplying numbers in 2's complement format
7
8
9
10
11
12
The shown discussion is a “proof” that Booth’s Algorithm yield the correct product when the multiplier is positive or negative
13
2 bits at a time
3 bits at a time
14
at mostminimum total
number of arithmetic operations
15
16
17
18
