How does the performance of restoring and non-restoring division compare? Demonstrate by showing the number of steps necessary to calculate A divided by B using each method. Assume A and B are 6-bit signed (sign- magnitude) integers. Writing a program to perform the restoring and non restoring divisions is acceptable.

Figure 3.10 describes a restoring division algorithm, because when subtracting the divisor from the remainder produces a negative result, the divisor is added back to the remainder (thus restoring the value). However, there are other algorithms that have been developed that eliminate the extra addition. Many references to these algorithms are easily found on the web. We will explore these algorithms using the pairs of octal numbers in the following table.

Figure 3.10

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 Quotent register to the left, setting the new least significant bit to 0 3. Shift the Divisor register right 1 bit 33rd repetition? Done No: <33 repetitions Yes: 33 repetitions