Time-Component Complexity of Two Approaches to Multioperand Binary Addition

Author

Atkins, Daniel E. ; Ong, Shau-Chi

Author_Institution

Program in Computer, Information and Control Engineering, and the Systems Engineering Laboratory of the Department of Electrical and Computer Engineering, University of Michigan

Issue

12

fYear

1979

Firstpage

918

Lastpage

926

Abstract

Component and time complexity measures in terms of number of gates and gate delays, respectively, are derived for two multioperand adder structures: a tree of carry-save adders and a tree of carry-lookahead adders. The parameters of the complexity measures are operand length, number of operands, and maximum fanin to the gates. The analysis involves a constructive derivation of the complexity of carry-lookahead networks including optimization by removal of redundant paths. An alternate measure of component complexity, number of packages with a given number of pinouts, rather than number of gates, is also presented.

Keywords

Adder tree; binary addition; carry-lookahead adder; carry-save adder; multioperand addition; time-component complexity; Application software; Computer applications; Computer science; Delay effects; Digital arithmetic; Length measurement; Packaging; Public healthcare; Signal processing; Time measurement; Adder tree; binary addition; carry-lookahead adder; carry-save adder; multioperand addition; time-component complexity;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/TC.1979.1675281

Filename

1675281