Regular, area-time efficient carry-lookahead adders

Tin Fook Ngai, Mary Jane Irwin, Shishpal Rawat

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

For fast binary addition, a carry-lookahead (CLA) design is the obvious choice (S. Ong and D. E. Atkins, Proc. Sixth Symposium of Computer Arithmetic, Aarhus, Denmark, June 1983; M. A. Bayoumi, G. A. Jullien, and W. C. Miller, INTEGRATION 1 (1983)). However, the direct implementation of a CLA adder in VLSI faces some undesirable limitations. Either the design lacks regularity, thus increasing the design and implementation costs, or the interconnection wires are too long, thus causing area-time inefficiency and limits on the size of addition. R. P Brent and H. T Kung (IEEE Trans. Comput. C-31 (Mar. 1982)) solved the regularity problem by reformulating the carry chain computation. They showed that an n-bit addition can be performed in time O(log n), using area O(n log n) with maximum interconnection wire length 0(n). In this paper, we give an alternative log n stage design which is nearly optimum with respect to regularity, area-time efficiency, and maximum interconnection wire length.

Original languageEnglish (US)
Pages (from-to)92-105
Number of pages14
JournalJournal of Parallel and Distributed Computing
Volume3
Issue number1
DOIs
StatePublished - Mar 1986

Fingerprint

Look-ahead
Adders
Interconnection
Regularity
Wire
Computer Arithmetic
Binary
Design
Alternatives
Costs

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Cite this

Ngai, Tin Fook ; Irwin, Mary Jane ; Rawat, Shishpal. / Regular, area-time efficient carry-lookahead adders. In: Journal of Parallel and Distributed Computing. 1986 ; Vol. 3, No. 1. pp. 92-105.
@article{dc3b3a4356ca44dab5d1590cbd83362b,
title = "Regular, area-time efficient carry-lookahead adders",
abstract = "For fast binary addition, a carry-lookahead (CLA) design is the obvious choice (S. Ong and D. E. Atkins, Proc. Sixth Symposium of Computer Arithmetic, Aarhus, Denmark, June 1983; M. A. Bayoumi, G. A. Jullien, and W. C. Miller, INTEGRATION 1 (1983)). However, the direct implementation of a CLA adder in VLSI faces some undesirable limitations. Either the design lacks regularity, thus increasing the design and implementation costs, or the interconnection wires are too long, thus causing area-time inefficiency and limits on the size of addition. R. P Brent and H. T Kung (IEEE Trans. Comput. C-31 (Mar. 1982)) solved the regularity problem by reformulating the carry chain computation. They showed that an n-bit addition can be performed in time O(log n), using area O(n log n) with maximum interconnection wire length 0(n). In this paper, we give an alternative log n stage design which is nearly optimum with respect to regularity, area-time efficiency, and maximum interconnection wire length.",
author = "Ngai, {Tin Fook} and Irwin, {Mary Jane} and Shishpal Rawat",
year = "1986",
month = "3",
doi = "10.1016/0743-7315(86)90029-8",
language = "English (US)",
volume = "3",
pages = "92--105",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "1",

}

Regular, area-time efficient carry-lookahead adders. / Ngai, Tin Fook; Irwin, Mary Jane; Rawat, Shishpal.

In: Journal of Parallel and Distributed Computing, Vol. 3, No. 1, 03.1986, p. 92-105.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Regular, area-time efficient carry-lookahead adders

AU - Ngai, Tin Fook

AU - Irwin, Mary Jane

AU - Rawat, Shishpal

PY - 1986/3

Y1 - 1986/3

N2 - For fast binary addition, a carry-lookahead (CLA) design is the obvious choice (S. Ong and D. E. Atkins, Proc. Sixth Symposium of Computer Arithmetic, Aarhus, Denmark, June 1983; M. A. Bayoumi, G. A. Jullien, and W. C. Miller, INTEGRATION 1 (1983)). However, the direct implementation of a CLA adder in VLSI faces some undesirable limitations. Either the design lacks regularity, thus increasing the design and implementation costs, or the interconnection wires are too long, thus causing area-time inefficiency and limits on the size of addition. R. P Brent and H. T Kung (IEEE Trans. Comput. C-31 (Mar. 1982)) solved the regularity problem by reformulating the carry chain computation. They showed that an n-bit addition can be performed in time O(log n), using area O(n log n) with maximum interconnection wire length 0(n). In this paper, we give an alternative log n stage design which is nearly optimum with respect to regularity, area-time efficiency, and maximum interconnection wire length.

AB - For fast binary addition, a carry-lookahead (CLA) design is the obvious choice (S. Ong and D. E. Atkins, Proc. Sixth Symposium of Computer Arithmetic, Aarhus, Denmark, June 1983; M. A. Bayoumi, G. A. Jullien, and W. C. Miller, INTEGRATION 1 (1983)). However, the direct implementation of a CLA adder in VLSI faces some undesirable limitations. Either the design lacks regularity, thus increasing the design and implementation costs, or the interconnection wires are too long, thus causing area-time inefficiency and limits on the size of addition. R. P Brent and H. T Kung (IEEE Trans. Comput. C-31 (Mar. 1982)) solved the regularity problem by reformulating the carry chain computation. They showed that an n-bit addition can be performed in time O(log n), using area O(n log n) with maximum interconnection wire length 0(n). In this paper, we give an alternative log n stage design which is nearly optimum with respect to regularity, area-time efficiency, and maximum interconnection wire length.

UR - http://www.scopus.com/inward/record.url?scp=0022686686&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022686686&partnerID=8YFLogxK

U2 - 10.1016/0743-7315(86)90029-8

DO - 10.1016/0743-7315(86)90029-8

M3 - Article

AN - SCOPUS:0022686686

VL - 3

SP - 92

EP - 105

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 1

ER -