Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 470

The DOI matches its Crossref record.

Computer Arithmetic: Volume III

Swartzlander, Earl E, Lemonds, Carl E · 2015 · WORLD SCIENTIFIC eBooks

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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1142/9467

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

See all 470

Metadata

Authors
Swartzlander, E. E., & Lemonds, C. E.
Venue
WORLD SCIENTIFIC eBooks
Published
2015-01-09
Pages
1-1
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Computer Arithmetic: Volume III. https://app.cochat.ai/papers/10.1142/9467
The paper
Swartzlander, E. E., & Lemonds, C. E. (2015). Computer Arithmetic: Volume III. WORLD SCIENTIFIC eBooks. https://doi.org/10.1142/9467

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.