unsigned division

1. Shuvo
mozumder

2. Division of unsigned binary numbers
Restoring division algorithm for unsigned integer. A division
algorithm provides a quotient and a remainder when we divide two
number....Step-1:first the registers are initialized with corresponding values
(q = dividend, m = divisor, a = 0, n = number of bits in dividend
Dividend = Quotient × Divisor + Remainder

4.  Suppose I want to divide 2 binary number which is
0111=7 and 0011=3
7
6
0011
3
1 0001
2
0010

5.  For this Division of unsigned that have a rule that is
C A Q M
0 0 0 0 0 0 1 1 1 0 0 1 1 Initial value
1st
Cycle
0 0 0 0
1 1 0 1
1 1 0 1
0 0 0 0
1 1 1 0
1 1 1 0
1 1 1 0
1 1 1 0
0 0 1 1
0 0 1 1
0 0 1 1
0 0 1 1
L .Shift
A A-M
Q0 0
2nd
Cycle
0 0 0 1
1 1 1 0
1 1 1 0
0 0 0 1
1 1 0 0
1 1 0 0
1 1 0 0
1 1 0 0
0 0 1 1
0 0 1 1
0 0 1 1
0 0 1 1
L .Shift
A A-m
Q0 0 {check A<0}
A A+M
3rd
Cycle
0 0 1 1
0 0 0 0
0 0 0 0
1 0 0 0
1 0 0 0
1 0 0 1
0 0 1 1
0 0 1 1
0 0 1 1
L .Shift
A A-M
Q0 1
4th
Cycle
0 0 0 1
1 1 1 0
1 1 1 0
0 0 0 1
0 0 1 0
0 0 1 0
0 0 1 0
0 0 1 0
0 0 1 1
0 0 1 1
0 0 1 1
0 0 1 1
L .Shift
A A-M
Q0 0
0 0 0 1 0 0 1 0