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
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.
Integrity signals
Registry
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.
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
Introduction to V.L.S.I. Systems
Mead, C. (1981) · IEE Proceedings I Solid State and Electron Devices · doi:10.1049/ip-i-1.1981.0010 · Cited by 3,720
Ladner, R. E., & Fischer, M. J. (1980) · Journal of the ACM · doi:10.1145/322217.322232 · Cited by 1,281
Computer arithmetic: Principles, architecture, and design
Hwang, K. (1979) · Medical Entomology and Zoology · Cited by 1,081
The Structure of Computers and Computations
Kuck, D. L. (1978) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 492
The Area-Time Complexity of Binary Multiplication
Brent, R. P., & Kung, H. T. (1981) · Journal of the ACM · doi:10.1145/322261.322269 · Cited by 196
The chip complexity of binary arithmetic
Brent, R. P., & Kung, H. T. (1980) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800141.804666 · Cited by 115
On the Time Required to Perform Addition
Winograd, S. (1965) · Journal of the ACM · doi:10.1145/321264.321279 · Cited by 115
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
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.