Professional Documents
Culture Documents
1
Multiplication
2
Straightforward Algorithm
01010010 (multiplicand)
x 01101101 (multiplier)
01010010
00000000
01010010
01010010
00000000
01010010
01010010
00000000
010001011101010
3
Implementation 1
4
Example (Implementation 1)
Iterati Implementation 1
on Step Multiplier Multiplicand Product
0 initial values 0110 0000 0010 0000 0000
1: 0 -> no op 0110 0000 0010 0000 0000
1 2: Multiplier shift right/ Multiplicand
shift left
011 0000 0100 0000 0000
5
Drawbacks
6
Implementation 2
Implementation 2
Iteration
Step Multiplier Multiplicand Product
8
Implementation 3
Multiplicand stationary -
Multiplier right - PP right
9
Example (Implementation 3)
Implementation 3
Iteration
Step Multiplier Multiplicand Product|Multiplier
10
Example (signed)
Note:
– Sign extension of partial product
– If most significant bit of multiplier is 1, then subtract
+ + +
→ → →
+ → →
→ → →
+
→
→ → →
11
Booth’s Encoding
12
Booth’s Algorithm Example
Implementation 3
Iteration
Step Multiplicand Product
0 initial values 0010 0000 1101 0
10 -> product = product – multiplicand 0010 1110 1101 0
1
shift right 1111 0110 1
01 -> product = product + multiplicand 0010 0001 0110 1
2
shift right 0000 1011 0
10 -> product = product – multiplicand 0010 1110 1011 0
3
shift right 1111 0101 1
11 -> no op 0010 1111 0101 1
4
shift right 1111 1010 1
13
Why it works?
14
Why it works?
15
Division
16
Integer Division
7÷2 = 3 … 1
1001 11
1000 1001010 0010 00000111
-1000 -0010
10 00011
101 -0010
1010
-1000 0001
10
17
Implementation 1
64-bit wide
18
Iteration Step Quotient Divisor Remainder
0 Initial values 0000 0010 0000 0000 0111
1: Rem=Rem-Div 0000 0010 0000 1110 0111
1 2b: Rem<0=>+Div, sll Q, Q0=0 0000 0010 0000 0000 0111
3: Shift Div right 0000 0001 0000 0000 0111
1: Rem=Rem-Div 0000 0001 0000 1111 0111
2 2b: Rem<0=>+Div, sll Q, Q0=0 0000 0001 0000 0000 0111
3: Shift Div right 0000 0000 1000 0000 0111
1: Rem=Rem-Div 0000 0000 1000 1111 1111
3 2b: Rem<0=>+Div, sll Q, Q0=0 0000 0000 1000 0000 0111
3: Shift Div right 0000 0000 0100 0000 0111
1: Rem=Rem-Div 0000 0000 0100 0000 0011
4 2a: Rem≥0=> sll Q, Q0=1 0001 0000 0100 0000 0011
3: Shift Div right 0001 0000 0010 0000 0011
1: Rem=Rem-Div 0001 0000 0010 0000 0001
5 2a: Rem≥0=> sll Q, Q0=1 0011 0000 0010 0000 0001
3: Shift Div right 0011 0000 0001 0000 0001 19
Implementation 2
2. Do the division
20