r H ApT E~ 8 Floating-Point Representation, Algorithms, and Implementations
qj+l Q[j +
1]
Q M[j +
1]
Q P[j +
1]
3
2
1
0
-1
-2
-3
(Q[j], 3)
(Q[j], 2)
(Q[j], 1)
(Q[j], 2)
(Q[j], 1)
(Q[j], o)
(Q P[j], o)
(Q[j], 3)
(Q[j], 2)
(Q[j], o)
(QM[j],
3) (Q[j], 1)
(QM[j],2)
(QM[j],
1)
(QM[j], O)
(QM[j], 3)
(QM[j], 2)
(QM[j],
1)
(Q[j], o)
( Q M[j
1, 3)
(QM[j],2)
T A B L E 8.5
Updating of forms for radix 4.
EXAMPLE 8.7
The following example illustrates the rounding-to-nearest process for a radix-
4 division with a - 2. Since a -- r - 2, it is necessary to include
QP.
We show
the conversion of quotient digits qL-1 and qL. ...
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.