Skip to Main Content
Computer Arithmetic and Validity
book

Computer Arithmetic and Validity

by Ulrich Kulisch
April 2013
Intermediate to advanced content levelIntermediate to advanced
456 pages
16h 7m
English
De Gruyter
Content preview from Computer Arithmetic and Validity
206 Chapter 6 Implementation of floating-point arithmetic on a computer
self-explanatory. The operands are always called x and y. The result is called z.Inthe
following algorithms, all operator symbols C, , , =, , , <, > are defined and used
in the sense of integer arithmetic. A left (resp. right) shift is expressed by a multiplica-
tion (resp. division) by powers of the base b. As a (rather awkward) device to describe
certain digit manipulations, we occasionally employ the function Œx :D entire.x/.It
determines the greatest integer less than or equal to x.
6.3 Addition and subtraction
We assume that the long accumulator is being used. We denote ...
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

Arithmetic and Logic in Computer Systems

Arithmetic and Logic in Computer Systems

Mi Lu
Interval Analysis

Interval Analysis

Günter Mayer

Publisher Resources

ISBN: 9783110301731