Audio Version available in YouTube Link : www.youtube.com/Aksharam subscribe the channel Computer Architecture and Organization V semester Anna University By Babu M, Assistant Professor Department of ECE RMK College of Engineering and Technology Chennai

1. UN SIGNED MULTIPLICATION
Version – 1 / Sequential Version | Multiplication Algorithm

2. FIRST VERSION OF THE
MULTIPLICATION HARDWARE
0 1 1 0 1
0 1 0 0 1
0 1 1 0 1
0 0 0 0 0
0 0 0 0 0
0 1 1 0 1
0 0 0 0 0
101011100
1
X

3. EXPLANATION WITH AN EXAMPLE
1100
Binary Representation
1000
Binary Un Signed Multiplication of (2 X 3) using Version - 1 Multiplication Algorithm
Multiplier 3
Multiplicand 2
Product 6 00000110
n = 4 bits
m = 4 bits
m + n = 8 bits

4. Binary Un Signed Multiplication of (2 X 3) using Version - 1
Multiplication Algorithm
Iteration Step Multiplier Multiplicand Product
0 Initial Values 0 0 1 1 0000 0010 0000 0000
1
2
3
4
0000 0000
0000 0010 (+)
-------------
0000 0010
0000 0010
0000 0100
0 0 0 1 0000 0100 0000 00100000 0010
0000 0100 (+)
-------------
0000 0110
0000 0110
0000 1000
0 0 0 0 0000 1000 0000 0110
0000 0110
0001 0000
0 0 0 0 0001 0000 0000 0110
0000 0110
0010 00000 0 0 0
0 0 0 0 0010 0000 0000 0110
0000 0110
6
a) P = P + Multiplicand
b) sll Multiplicand by 1bit
c) srl Multiplier by 1 bit
a) P = P + Multiplicand
b) sll Multiplicand by 1bit
c) srl Multiplier by 1 bit
a) No Operation
b) sll Multiplicand by 1bit
c) srl Multiplier by 1 bit
a) No Operation
b) sll Multiplicand by 1bit
c) srl Multiplier by 1 bit

5. EXAMPLE
1010
Binary Representation
1111
Binary Un Signed Multiplication of ( 10 X 15) using Version - 1 Multiplication Algorithm
Multiplicand 10
Multiplier 15
Product 150 10010110
m = 4 bits
n = 4 bits
m + n = 8 bits

6. Binary Un Signed Multiplication of (10 X 15) using Version - 1
Multiplication Algorithm
Iteration Step Multiplier Multiplicand Product
0 Initial Values 1 1 1 1 0000 1010 0000 0000
1
2
3
4
0000 0000
0000 1010 (+)
-------------
0000 1010
0000 1010
0001 0100
0 1 1 1 0001 0100 0000 1010
0000 1010
0001 0100 (+)
-------------
0001 1110
0001 1110
0010 1000
0 0 1 1 0010 1000 0001 1110
0100 0110
0101 0000
0 0 0 1 0101 0000 0100 0110
1001 0110
1010 00000 0 0 0
0 0 0 0 1010 0000 1001 0110
1001 0110
150
0001 1110
0010 1000 (+)
-------------
0100 01100100 0110
0101 0000 (+)
-------------
1001 0110
a) P = P + Multiplicand
b) sll Multiplicand by 1bit
c) srl Multiplier by 1 bit
a) P = P + Multiplicand
b) sll Multiplicand by 1bit
c) srl Multiplier by 1 bit
a) P = P + Multiplicand
b) sll Multiplicand by 1bit
c) srl Multiplier by 1 bit
a) P = P + Multiplicand
b) sll Multiplicand by 1bit
c) srl Multiplier by 1 bit