Question

3. Complete and if needed extend the table below for the division architecture shown. Make sure all fields are filled including explaining the steps in step column. You can redraw the table. The divisor and dividend (in the remainder field) are given in the first row of the table. Divisor Shift right 128 bits 128-bit ALU Quotient Shift left 64 bits Remainder Write 128 bits Control test Iteration Step Quotient Remainder Divisor 0100 0000 0 Initial values 0000 0000 1 111 1 N 3 ...

Answer 1

Iteration	Quotient(Q)	Divisor(D)	Remainder(R)	Description
0	0000	0100 0000	0000 1111	Initial value
1	0000	0100 0000	1100 1111	R-D->R
	0000	0100 0000	0000 1111	R<0 ->Recover R, Shift left Q Put 0
	0000	0010 0000	0000 1001	Shift D Right
2	0000	0010 0000	1110 1001	R-D->R
	0000	0010 0000	0000 1001	R<0 ->Recover R, Shift left Q Put 0
	0000	0001 0000	0000 1001	Shift D Right
3	0000	0001 0000	1111 1001	R-D->R
	0000	0001 0000	0000 1001	R<0 ->Recover R, Shift left Q Put 0
	0000	0000 1000	0000 1001	Shift D Right
4	0000	0000 1000	0000 0001	R-D->R
	0001	0000 1000	0000 0001	R>=0 Shift left Q set rightmost bit to 1
	0001	0000 0100	0000 0001	Shift D Right
5	0001	0000 0100	1111 1101	R-D->R
	0010	0000 0100	0000 0001	R<0 ->Recover R, Shift left Q Put 0
	0010	0000 0010	0000 0001	Shift D Right
6	0010	0000 0010	0000 1111	R-D->R
	0101	0000 0010	0000 1111	R>=0 Shift left Q set rightmost bit to 1
	0101	0000 0001	0000 1111	Shift D Right
7	0101	0000 0001	0000 1110	R-D->R
	1011	0000 0001	0000 1110	R>=0 Shift left Q set rightmost bit to 1
	1011	0000 0000	0000 1110	Shift D Right
8	1011	0000 0000	0000 1110	R-D->R
	0111	0000 0000	0000 1110	R>=0 Shift left Q set rightmost bit to 1
	0111	0000 0000	0000 1110	Shift D Right
9	0111	0000 0000	0000 1110	R-D->R
	1111	0000 0000	0000 1110	R>=0 Shift left Q set rightmost bit to 1
	1111	0000 0000	0000 1110	Shift D Right
10	1111	0000 0000	0000 1110	R-D->R
	1111	0000 0000	0000 1110	R>=0 Shift left Q set rightmost bit to 1
	1111	0000 0000	0000 1110	Shift D Right
11	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .	Same above result is repeated . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33	1111	0000 0000	0000 1110	R-D->R
	1111	0000 0000	0000 1110	R>=0 Shift left Q set rightmost bit to 1
	1111	0000 0000	0000 1110	Shift D Right 33 repetitions so stop here.

At any point if you find any difficulty feel free ask me.