Scribd
Upload
5 views

mod3-3

Uploaded by

karthan.official
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

mod3-3

Uploaded by

karthan.official
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Module-3

Arithmetic Unit
Text Books
Computer Organization: C Hamacher, Z Vranesic, S Zaky:,
Tata McGraw Hill, 5th Edition, 2011 .

Dr. Bhat Geetalaxmi Jairam


Professor,
ISE, NIE, Mysuru
Integer Division
Two types
1. Restoring Division
2.Non- Restoring Division
Integer Division
1. Restoring Division
• Figure 6.21 shows a logic circuit arrangement that implements restoring division.
Note its similarity to the structure for multiplication that was shown in Figure 6.7.
An n-bit positive divisor is loaded into register M and an n-bit positive dividend is
loaded into register Q at the start of the operation.
• Register A is set to 0. After the division is complete, the n-bit quotient is in register
Q and the remainder is in register A. The required subtractions are facilitated by
using 2's-complement arithmetic. The extra bit position at the left end of both A
and M accommodates the sign bit during subtractions.
Integer Division
1. Restoring Division

Quotient

Dividend
Divisor 00

Remainder
Integer Division
1. Restoring Division

Example-1 : Perform division of 18/3 using


Restoring Division Concept.
Integer Division
2. Non-Restoring Division
• The restoring-division algorithm can be improved by avoiding the need for restoring A after
an unsuccessful subtraction. Subtraction is said to be unsuccessful if the result is negative.
Consider the sequence of operations that takes place after the subtraction
• operation in the preceding algorithm. If A is positive, we shift left and subtract M, that is, we
perform 2A -M. If A is negative, we restore it by performing A +M, and then we shift it left
and subtract M. This is equivalent to performing 2A + M. The q0 bit
• is appropriately set to 0 or 1 after the correct operation has been performed. We can
summarize this in the following algorithm for nonrestoring division.

• Step 2 is needed to leave the proper positive remainder in A at the end of the n cycles of Step
l. The logic circuitry in Figure 6.21 can also be used to perform this algorithm. Note that the
Restore operations are no longer needed; and that exactly one Add or Subtract operation is
performed per cycle
Integer Division
• 1. Non-Restoring Division

Example-2 : Perform division of 18/3 using


Non-Restoring Division Concept.

You might also like