Scribd
Upload
192 views3 pages

Binary - Non-Restoring Division Algorithm - Stack Overflow

The document discusses the non-restoring division algorithm for dividing binary integers. It provides an example of dividing 101110 by 010111. The responder provides a step-by-step explanation of the algorithm using a table to show the values in the registers at each step. The initialization sets the registers and complement of the divisor. The table then walks through applying the algorithm by shifting and subtracting to calculate each digit of the quotient.

Uploaded by

Derek Smith
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
192 views3 pages

Binary - Non-Restoring Division Algorithm - Stack Overflow

The document discusses the non-restoring division algorithm for dividing binary integers. It provides an example of dividing 101110 by 010111. The responder provides a step-by-step explanation of the algorithm using a table to show the values in the registers at each step. The initialization sets the registers and complement of the divisor. The table then walks through applying the algorithm by shifting and subtracting to calculate each digit of the quotient.

Uploaded by

Derek Smith
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

2/21/2014

binary - Non-restoring division algorithm - Stack Overflow


sign up log in tour help careers 2.0

Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.

Take the 2-minute tour

Non-restoring division algorithm


Does anyone know the steps for dividing unsigned binary integers using non-restoring division? It's hard to find any good sources online. i.e if A = 1 0 1 1 1 0 and B = 0 1 0 1 1 1 how do we find A d i v i d e db y B in non-restoring division? What do the registers look like in each step? Thanks!
algorithm binary division bits addition

edited Feb 5 '13 at 16:52 Abid Rahman K 14.6k 4 40 73

asked Aug 26 '12 at 20:51 CyberShot 469 1 7 18

Look at the source code of this web page. Raymond Chen Aug 26 '12 at 21:07 add comment

1 Answer
(My answer is a little late-reply. But I hope it will be useful for future visitors) Algorithm for Non-restoring division is given in below image :

[Link]

1/3

2/21/2014

binary - Non-restoring division algorithm - Stack Overflow

In this problem, Dividend (A) = 101110, ie 46, and Divisor (B) = 010111, ie 23. Initialization : S e tR e g i s t e rA=D i v i d e n d=0 0 0 0 0 0 S e tR e g i s t e rQ=D i v i d e n d=1 0 1 1 1 0 (S oA Q=0 0 0 0 0 01 0 1 1 1 0,Q 0=L S Bo fQ=0) S e tM=D i v i s o r=0 1 0 1 1 1 ,M '=2 ' sc o m p l e m e n to fM=1 0 1 0 0 1 S e tC o u n t=6 ,s i n c e6d i g i t so p e r a t i o ni sb e i n gd o n eh e r e . After this we start the algorithm, which I have shown in a table below : In table, S H L ( A Q )d e n o t e ss h i f tl e f tA Qb yo n ep o s i t i o nl e a v i n gQ 0b l a n k. Similarly, a square symbol in Q0 position denote, i ti st ob ec a l c u l a t e dl a t e r

[Link]

2/3

2/21/2014

binary - Non-restoring division algorithm - Stack Overflow

Hope all the steps are clear from the table !!!
answered Feb 5 '13 at 16:30 Abid Rahman K 14.6k 4 40 73 add comment

Not the answer you're looking for? Browse other questions tagged algorithm binary
division bits addition or ask your own question.

[Link]

3/3

You might also like