Skip to Main Content
Digital Arithmetic
book

Digital Arithmetic

by Miloš D. Ercegovac, Tomás Lang
September 2003
Intermediate to advanced content levelIntermediate to advanced
709 pages
26h 51m
English
Morgan Kaufmann
Content preview from Digital Arithmetic
254 r N ~, pT E ~ 5 Division by Digit Recurrence
,
iteration is done using a carry-free adder (and is, therefore, fast). 6 Its
disadvantages are that it complicates somewhat the quotient-digit selection
and that it increases the number of register bits required to store the
residual. Moreover, if the remainder is needed, the final residual has to be
converted to conventional representation. Even if the remainder is not
needed, a sign detection has to be implemented for the correction step,
indicated in Section 5.2.2.
Quotient-digit selection function. The complexity of the implementation of
this function depends on all the previous factors. ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Computer Arithmetic in Practice

Computer Arithmetic in Practice

Sławomir Gryś

Publisher Resources

ISBN: 9781558607989