UNIT 2 - DIVISION 1

1. UN SIGNED & SIGNED
DIVISION
Version – 1 Binary Division Algorithm
Mr. C.KARTHIKEYAN,
ASSISTANT PROFESSOR,
ECE , RMKCET

2. FIRST VERSION OF THE
DIVISION HARDWARE

3. EXPLANATION WITH AN
EXAMPLE
0111
Binary Representation
0011
Binary Un Signed Division of (7 / 3) using Version - 1 Division Algorithm
Dividend 7
Divisor 3
Quotient 2 0010
Remainder 1 0001
Dividend = Quotient X Divisor + Remainder

4. Un Signed Division of (7 / 3) using Version - 1 Algorithm
Ite Step Quotient Divisor Remainder
0 Initial Values 0 0 0 0 0011 0000 0000 0111
1
2
3
4
5
1101 0111
0001 1000
0 0 0 0
1110 1111
0000 0111
0000 1100
0 0 0 0
1111 1011
0000 0111
0000 0110
0000 0001
0000 0001
0000 0011
0 0 0 1
0 0 1 0
0000 0001
1111 1110
a) Rem = Rem - Divisor
b) sll Quotient by 1bit
c) srl Divisor by 1 bit
0000 0111
0011 0000 (-)
-------------
1101 0111
0000 0111
0001 1000 (-)
-------------
1110 1111
0000 0111
0000 0111
0 0 0 0
a) Rem = Rem - Divisor
b) sll Quotient by 1bit
c) srl Divisor by 1 bit
0 0 0 0
0000 0111
0 0 0 0
a) Rem = Rem - Divisor
0000 0111
0000 1100 (-)
-------------
1111 1011
0 0 0 0
b) sll Quotient by 1bit
c) srl Divisor by 1 bit
a) Rem = Rem - Divisor
b) sll Quotient by 1bit
c) srl Divisor by 1 bit
a) Rem = Rem - Divisor
b) sll Quotient by 1bit
c) srl Divisor by 1 bit
0000 0111
0000 0110 (-)
-------------
0000 0001
0 0 0 1
0000 0001
0000 0011 (-)
-------------
1111 1110
0000 0001
0000 0001
0 0 1 0
0000 0001
1
0010
2
0000 0111