Division algorithm: Difference between revisions

Revision as of 02:02, 9 February 2025

Revision as of 07:06, 10 February 2025

Line 111:

==Slow division methods==

Slow division methods are all based on a standard recurrence equation <ref>{{Cite book|last1=Morris|first1=James E.| url=https://books.google.com/books?id=wAhEDwAAQBAJ&q=restoring+division+fixed-point+fractional+numbers&pg=PA243| title=Nanoelectronic Device Applications Handbook|last2=Iniewski|first2=Krzysztof|date=2017-11-22|publisher=CRC Press| isbn=978-1-351-83197-0|language=en}}</ref>

:<math>R_{j+1} = B \times R_j - q_{n-(j+1)}\times D ,</math>

where:

Line 121:

===Restoring division===

Restoring division operates on [[fixed point arithmetic|fixed-point]] fractional numbers and depends on the assumption 0 < ''D'' < ''N''. {{citation needed|date=February 2012}} <!-- see "Integer division (unsigned) with remainder" on talk -->

The quotient digits ''q'' are formed from the digit set {0,1}.