Scribd
Upload
5 views3 pages

Unit II.6 Computer Arithmetic Division 1

The document discusses the non-restoring division method in computer arithmetic, which eliminates the need to restore A after an unsuccessful subtraction. It outlines the steps involved in the process, including shifting and adding or subtracting values based on the sign of A. An example is provided to illustrate the method in action.

Uploaded by

337 Prasad Parjane
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views3 pages

Unit II.6 Computer Arithmetic Division 1

The document discusses the non-restoring division method in computer arithmetic, which eliminates the need to restore A after an unsuccessful subtraction. It outlines the steps involved in the process, including shifting and adding or subtracting values based on the sign of A. An example is provided to illustrate the method in action.

Uploaded by

337 Prasad Parjane
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Sanjivani Rural Education Society’s

Sanjivani College of Engineering, Kopargaon-423 603


(An Autonomous Institute, Affiliated to Savitribai Phule Pune University, Pune)
NACC ‘A’ Grade Accredited, ISO 9001:2015 Certified

Department of Computer Engineering


(NBA Accredited)

Subject- Computer Organization & Architecture


Unit 2 – Computer Arithmetic
Non Restoring Division

Dr. D. B. Kshirsagar, Professor & Head


E-mail : [email protected]
Contact No: 02434 – 222862 Ext :141, 9890472165
Nonrestoring Division

• Avoid the need for restoring A after an unsuccessful


subtraction.
• Any idea?
• Step 1: (Repeat n times)
If the sign of A is 0, shift A and Q left one bit position and subtract M from A;
otherwise, shift A and Q left and add M to A.
Now, if the sign of A is 0, set q0 to 1; otherwise, set q0 to 0.
• Step2: If the sign of A is 1, add M to A

01-10-2021 Computer Organization: Arithmetic 2


Example
Initially 0 0 0 0 0 1 0 0 0
0 0 0 1 1
Shift 0 0 0 0 1 0 0 0 First cycle
Subtract 1 1 1 0 1
Set q 0 1 1 1 1 0 0 0 0 0

Shift 1 1 1 0 0 0 0 0
Add 0 0 0 1 1 Second cycle

Set q 1 1 1 1 1 0 0 0 0
0

Shift 1 1 1 1 0 0 0 0
1 1 1 1 1 Add 0 0 0 1 1 Third cycle
Restore
0 0 0 1 1 Set q 0 0 0 0 1 0 0 0 1
remainder 0
Add 0 0 0 1 0
Remainder Shift 0 0 0 1 0 0 0 1
Subtract 1 1 1 0 1 Fourth cycle
Set q 1 1 1 1 1 0 0 1 0
0

Quotient
A nonrestoring-division example.
01-10-2021 Computer Organization: Arithmetic 3

You might also like