09-05-2012, 12:33 PM
VLSI Digital System Design
cmpe222_13mul_ppt.ppt (Size: 30.5 KB / Downloads: 40)
Booth's Algorithm
Multiplication can be sped up
When large number of consecutive 1sin multiplier
Replace consecutive additions
Subtract at least-significant end
Add at position to the left ofthe most-significant end
Higher-Radix Multiplication
Retire k low-order bits of multiplierat each step, rather than just one bit: radix 2
E.g., let k = 2: radix 4
Let b = multiplicand
If 00, add 0
If 01, add b
If 10, add 2b: shift and add
If 11, add 2b + b: avoid with Booth recoding