Restoring and Non-Restoring division algo for CSE

1,292 views 11 slides Jun 17, 2021
Slide 1
Slide 1 of 11
Slide 1
1
Slide 2
2
Slide 3
3
Slide 4
4
Slide 5
5
Slide 6
6
Slide 7
7
Slide 8
8
Slide 9
9
Slide 10
10
Slide 11
11

About This Presentation

You can view my ppt for enough knowledge


Slide Content

Computer Architecture and Organization Seminar Course Code-PCC-CS401 Topic- " Division Restoring and Non-Restoring Techniques " Presentation by- Aishwarya Roy - (BWU/BTS/19/009) Stream- Bachelor of  Technology in Computer Science and Engineering. 2nd year (Sem-IV) College- Brainware University,   Barasat .

Division Algorithm A division algorithm provides a quotient and a remainder when we divide two number. Q=(dividend / divisor) ,   where (Q) is quotient. R=(dividend - (divisor * quotient)) , where (R) is remainder. A division algorithm can be of two types- Slow division Algorithm. Restoring . Non-Restoring . Non-Performing Restoring. SRT ( Sweeney, Robertson, and Tocher). Fast division Algorithm. Newton-Raphson. Goldschmidt.

Binary Division with pen & paper Let us solve it with an example - For , Dividend=27 , Divisor= 4

Non-Restoring Division Algorithm for Unsigned Integers This is a slow division algorithm which is mainly performed by  left shifting the bits in the registers and  Performing some ALU operations on the corresponding bits. No restoration of the bits in Accumulator occur. Here is the Flowchart of the method Len(Q)=n Len(A)=n+1 Len(M)=n+1

Non-Restoring division algorithm with an example

Hardware Implementation of Non-Restoring Division Algorithm ALU- It is an Adder that performs XOR operation on A reg bits and M reg bits. Control- It checks out the MSB bit of A reg and according to it the further operation occur. M- Divisor register A- Accumulator Q- Dividend register.

Restoring Division algorithm for Unsigned integer This is also a slow division method where we perform the same controls but different procedure. In this method we usually restore the previous n-bit data of the accumulator(A) and it is only valid when we find the MSB of A as '1' else there will be no restoration of A. It is easy to implement. Restore A

Restoring division algorithm with an example

HARDWARE IMPLEMENTATION OF RESTORING DIVISION ALGORITHM Here ALU perform the logic expression A=A+M'+1

The Drawback between 2 Algorithms The  advantage  of using  non - restoring  arithmetic over the standard  restoring division  is that a test subtraction is  not  required; the sign bit of the accumulator determines whether an addition or subtraction is used. The  disadvantage , though, is that an extra bit must be maintained in the partial remainder to keep track of the sign. Another disadvantage is that , restoring division is slower and requires time for the restoration in each cycle.

THANK  YOU Presented By- Aishwarya Roy BWU/BTS/19/009
Tags