Scribd
Upload
392 views9 pages

8-Restoring and Non Restoring Division-05-01-2023

This document discusses two types of division algorithms: restoring division and non-restoring division. Non-restoring division initializes registers, shifts the dividend left and conditionally adds or subtracts the divisor based on the sign bit. It then sets the least significant bit of the quotient, decrements a bit counter, and repeats until finished, finally adjusting the remainder.

Uploaded by

Rohan Agrawal 961
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
392 views9 pages

8-Restoring and Non Restoring Division-05-01-2023

This document discusses two types of division algorithms: restoring division and non-restoring division. Non-restoring division initializes registers, shifts the dividend left and conditionally adds or subtracts the divisor based on the sign bit. It then sets the least significant bit of the quotient, decrements a bit counter, and repeats until finished, finally adjusting the remainder.

Uploaded by

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

DIVISION ALGORITHMS

Restoring Division
Restoring Division
7/3
Non-Restoring Division
Non-restoring Division
Step-1: Initialize registers
Q = Dividend, M = Divisor, A = 0, n = number of bits in dividend

Step-2:
If sign bit of register A is 1
then shift left content of AQ and A=A+M,
otherwise shift left content of AQ and A=A-M (means add 2's complement of M to A
and store it to A)

Step-3:
If sign bit of register A is 1
then Q[0]=0
otherwise Q[0]=1 (Q[0] means LSB (least significant bit) of Q)

Step-4:
The value of counter n is decremented by 1

Step-5:
If value of n becomes 0 then goto next step otherwise repeat from step-2

Step-6: If sign bit of register A is 1


then A=A+M
Step-7:
Now register Q contains Quotient value and A contains Remainder value
8/3

You might also like