The DOI matches its Crossref record.
Computer Arithmetic: Volume III
Abstract
The speed of a computer is determined to a first order by the speed of the arithmetic unit and the speed of the memory. Although the speed of both units depends directly on the implementation technology, arithmetic unit speed also depends strongly on the logic design. This chapter describes algorithms for floating-point arithmetic. Regarding notation, capital letters represent digital numbers, while subscripted lowercase letters represent bits of the corresponding word. Much arithmetic is performed with fixed-point numbers, which have constant scaling. The numbers can be interpreted as fractions, integers, or mixed numbers, depending on the application. There are two types of division algorithms in common use: digit recurrence and convergence methods. The digit recurrence approach computes the quotient on a digit-by-digit basis; hence, they have a delay proportional to the precision of the quotient. The main advantage of floating-point arithmetic is that its wide dynamic range virtually eliminates overflow and underflow for most applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
What every computer scientist should know about floating-point arithmetic
Goldberg, D. (1991) · ACM Computing Surveys · doi:10.1145/103162.103163 · Cited by 1,750
Brent, R. P., & Zimmermann, P. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921698 · Cited by 321
Metadata
- Authors
- Swartzlander, E. E., & Lemonds, C. E.
- Venue
- WORLD SCIENTIFIC eBooks
- Publisher
- WORLD SCIENTIFIC
- Published
- 2015-01-09
- Pages
- 1-1
- DOI
- 10.1142/9467
- OpenAlex
- W2912759893
- Cited by
- 470
- References
- 0
- FWCI
- 4.05
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.