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
Further Readings 313
5.17
5.18
1
How does it compare with the case ~ < d < 1 in which three bits ofd and
six bits of the shifted residual are required?
(c) Summarize the effect of using the divisor range [1, 2). Is it a good idea?
[Scaling and selection by rounding] Consider a high radix r digit recurrence
division method. Assume that residuals are in nonredundant form. The quotient
digit q j+l s {-a, ..., a }, a < r - 1, is selected as the integer part of the rounded
shifted partial residual. That is,
qj+l -- integer(rw[j] + 0.5)
For convergence, such an algorithm requires that the divisor be in the range
l<d<l+~, fl~_0 ...
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