Using a table similar to that shown in Figure 3.11, calculate A divided by B using the hardware described in Figure 3.12. You should show the contents of each register on each step. Assume A and B are unsigned 6-bit integers. This algorithm requires a slightly different approach than that shown in Figure 3.10. You will want to think hard about this, do an experiment or two, or else go to the web to figure out how to make this work correctly.

Figure 3.10

Figure 3.11

Figure 3.12

Let’s look in more detail at division. We will use the octal numbers in the following table.

Transcribed Image Text:

2a Start 1. Subtract the Divisor register from the Remainder register and place the result in the Remainder register Remainder 20 Test Remainder Remainder <0 2b. Restore the original value by adding the Divisor register to the Remainder register and placing the sum in the Remainder register. Also shift the Quotient register to the left, setting the new least significant bit to 0 3. Shift the Divisor register right 1 bit 33 rd repetition? Done No: <33 repetitions Yes: 33 repetitions