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

The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.

A Regular Layout for Parallel Adders

Brent, Kung·1982·IEEE Transactions on Computers

Abstract

With VLSI architecture, the chip area and design regularity represent a better measure of cost than the conventional gate count. We show that addition of n-bit binary numbers can be performed on a chip with a regular layout in time proportional to log n and with area proportional to n.

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.1109/tc.1982.1675982

Cites

7 of 7 references verified0 citation errors · 0 not checkable

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

Cites

Show all 7 references

Cited by

  • Halving the cost of quantum addition

    Gidney, C. (2018) · Quantum · doi:10.22331/q-2018-06-18-74 · Cited by 279

    “Alternatively, by using temporary logical-ANDs to implement the classical Brent-Kung adder [6] in a reversible fashion, two n -bit numbers can be added in O (lg n ) depth with a T-count of only 12 n .”
    Method

See all 1,147

Metadata

Authors
Brent, & Kung
Venue
IEEE Transactions on Computers
Published
1982-03
Volume
C-31
Issue
3
Pages
260-264
ISSN
  • 0018-9340 (ISSN-L)
  • 1557-9956
  • 2326-3814
OpenAlex
W2168543008
Cited by
1,147
References
7
FWCI
8.14
Type
journal article
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: A Regular Layout for Parallel Adders. https://app.cochat.ai/papers/10.1109/tc.1982.1675982
The paper
Brent, & Kung. (1982). A Regular Layout for Parallel Adders. IEEE Transactions on Computers. https://doi.org/10.1109/tc.1982.1675982

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.