-
Notifications
You must be signed in to change notification settings - Fork 1
/
non_restoring_division.py
189 lines (150 loc) · 5.09 KB
/
non_restoring_division.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
def deci_to_bin(n):
return bin(n).replace("0b", "")
def shift_left(C,AC,Q):
C=AC[0]
temp_AC=list(AC)
for i in range(1,len(AC)):
temp_AC[i-1]=temp_AC[i]
temp_AC[len(AC)-1]=Q[0]
AC=''
AC=AC.join(temp_AC)
temp_Q=list(Q)
for i in range(1,len(Q)):
temp_Q[i-1]=temp_Q[i]
temp_Q[len(Q)-1]='_'
Q=''
Q=Q.join(temp_Q)
return(C,AC,Q)
def operation(C,AC,M):
temp=C+AC
temp=bin(int(temp,2)+int(M,2))
temp=temp.replace("0b","")
# discard the carry while operation is done
if(len(temp)>len(M)):
temp=temp[1::]
return(temp[0],temp[1::])
# Main function
AC=''
C='0'
Q=input("Enter the dividend(Q) : ")
Q=deci_to_bin(int(Q))
M=input("Enter the divisor(M) : ")
M=deci_to_bin(int(M))
if(len(Q)>len(M)):
for i in range(len(Q)):
AC=AC+'0'
else:
for i in range(len(M)):
AC=AC+'0'
print("Initial C value is : ",C)
print("Initial AC value is : ",AC)
print("Initial Q value is : ",Q)
for i in range(len(Q)-len(M)):
M='0'+M
# adding one bit extra
M='0'+M
print("Value of M is : ",M)
# two's complement
M_array=list(M)
for i in range(len(M)):
if(M[i]=='0'):
M_array[i]='1'
if(M[i]=='1'):
M_array[i]='0'
M_negative=''
M_negative=M_negative.join(M_array)
M_negative=bin(int(M_negative,2)+int('1',2))
M_negative=M_negative.replace("0b","")
print("Two's complement of M : ",M_negative)
print()
print("---------------------------------------------------------------------------------------------------------------------")
print("\t C "," "*int(len(AC)/2),"AC"," "*int(len(AC)/2)," "*int(len(Q)/2),"Q"," "*int(len(Q)/2)," Operation done")
print("---------------------------------------------------------------------------------------------------------------------")
print("\t",C," ",AC," ",Q," ","Initial values")
print()
for i in range(len(Q)):
print("step",(i+1),": ")
C,AC,Q=shift_left(C,AC,Q)
print("\t",C," ",AC," ",Q," ","After shift left operation")
# AC is positive
if(C=='0'):
C,AC=operation(C,AC,M_negative)
print("\t",C," ",AC," ",Q," ","AC_equals_AC_minus_M operation")
# AC is negative
else:
C,AC=operation(C,AC,M)
print("\t",C," ",AC," ",Q," ","AC_equals_AC_plus_M operation")
# AC is negative
if(C=='1'):
temp_Q=list(Q)
temp_Q[len(Q)-1]='0'
Q=''
Q=Q.join(temp_Q)
# AC is positive
else:
temp_Q=list(Q)
temp_Q[len(Q)-1]='1'
Q=''
Q=Q.join(temp_Q)
print()
# AC is negative
print("Final step: ")
if(C=='1'):
print("Finally AC is negative. So, ")
C,AC=operation(C,AC,M)
print("\t",C," ",AC," ",Q," ","AC_equals_AC_plus_M operation")
else:
print("No final step as AC is positive.")
print('\nFinal values')
print("\t",C," ",AC," ",Q)
print()
print("Remainder=(C,AC) : ",int(C+AC,2))
print("Quotient=(Q) : ",int(Q,2))
'''
----------OUTPUT----------
Enter the dividend(Q) : 479
Enter the divisor(M) : 62
Initial C value is : 0
Initial AC value is : 000000000
Initial Q value is : 111011111
Value of M is : 0000111110
Two's complement of M : 1111000010
---------------------------------------------------------------------------------------------------------------------
C AC Q Operation done
---------------------------------------------------------------------------------------------------------------------
0 000000000 111011111 Initial values
step 1 :
0 000000001 11011111_ After shift left operation
1 111000011 11011111_ AC_equals_AC_minus_M operation
step 2 :
1 110000111 10111110_ After shift left operation
1 111000101 10111110_ AC_equals_AC_plus_M operation
step 3 :
1 110001011 01111100_ After shift left operation
1 111001001 01111100_ AC_equals_AC_plus_M operation
step 4 :
1 110010010 11111000_ After shift left operation
1 111010000 11111000_ AC_equals_AC_plus_M operation
step 5 :
1 110100001 11110000_ After shift left operation
1 111011111 11110000_ AC_equals_AC_plus_M operation
step 6 :
1 110111111 11100000_ After shift left operation
1 111111101 11100000_ AC_equals_AC_plus_M operation
step 7 :
1 111111011 11000000_ After shift left operation
0 000111001 11000000_ AC_equals_AC_plus_M operation
step 8 :
0 001110011 10000001_ After shift left operation
0 000110101 10000001_ AC_equals_AC_minus_M operation
step 9 :
0 001101011 00000011_ After shift left operation
0 000101101 00000011_ AC_equals_AC_minus_M operation
Final step:
No final step as AC is positive.
Final values
0 000101101 000000111
Remainder=(C,AC) : 45
Quotient=(Q) : 7
>>>
'''