The document outlines unsigned multiplication, defining it as the multiplication of m-bit and n-bit unsigned numbers. It includes a flowchart and a manual multiplication algorithm example using binary numbers and illustrates the sequential circuit process involved in the multiplication. Additionally, it provides a detailed breakdown of the multiplication steps, including addition and shifting cycles.

1. Unsigned
Multiplication
Mahfuzur Rahman Faruk
181002057

2. Outline:
 What is unsigned multiplication
 Flowchart
 Working procedure
2

3. Unsigned Multiplication
 If an m-bit unsigned
number and an n- bit
unsigned number multiple
together then it called
unsigned multiplication.
3

4. Manual Multiplication
Algorithm
1 1 0 1 (13) Multiplicand M
1 0 1 1 (11) Multiplier Q
1 1 0 1
1 1 0 1 XX
0 0 0 0 X XX X
1 1 0 1 XXX X X X
X
X
X
1 0 0 0 1 1 1 1

5. Unsigned
Multiplication Flowchart

6. Sequential Circuit Binary
Multiplier
1 1 1 1
1 0 1 1
1 1 1 1
1 1 1 0
1 1 1 0
1 1 0 1
1 1 0 1
Add
M
1 1 0 1
(b) Multiplication example
C
First cycle
Second cycle
Third cycle
Fourth cycle
No add
Shift
Shift
Add
Shift
Shift
Add
1 1 1 1
0
0
0
1
0
0
0
1
0
0 0 0 0
0 1 1 0
1 1 0 1
0 0 1 1
1 0 0 1
0 1 0 0
0 0 0 1
1 0 0 0
1 0 0 1
1 0 1 1
QA
Product
Here
M = Multiplicand (13)
Q = Multiplier h.
A = Accumulator
C = Carry Bit jjj
(11)
1 1 0 1
1 1 0 1
1 1 0 1
1 1 0 1

7. Any Question ?
7

8. THANK YOU
8