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
440 c ~! ~. F~:i' t~: ~! ~ Floating-Point Representation, Algorithms, and Implementations
method to determine whether the sum of two operands is zero, without
actually performing the addition. This method can be described by
adding -1 to the sum and detecting the value -1. Since the repre-
sentation of- 1 is 1111..1 and this value can only occur when for all bit
positions the sum bit plus the carry bit add to 1, the algorithm is as follows:
S ssssssss
C cccccccc
-1 11111111
ZZZZZZZZ
ttttttt
Consequently,
Zi -- (S i ~) Ci) t
ti --- Si+ 1 + Ci+l
8.64
Now we compute
Wi -- Zi f~ ti
8.65
and the sticky bit is
T = NAND (w
i )
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