This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Time-Component Complexity of Two Approaches to Multioperand Binary Addition
December 1979 (vol. 28 no. 12)
pp. 918-926
D.E. Atkins, Program in Computer, Information and Control Engineering, and the Systems Engineering Laboratory of the Department of Electrical and Computer Engineering, University of Michigan
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.
Index Terms:
time-component complexity, Adder tree, binary addition, carry-lookahead adder, carry-save adder, multioperand addition
Citation:
D.E. Atkins, null Shau-Chi Ong, "Time-Component Complexity of Two Approaches to Multioperand Binary Addition," IEEE Transactions on Computers, vol. 28, no. 12, pp. 918-926, Dec. 1979, doi:10.1109/TC.1979.1675281
Usage of this product signifies your acceptance of the Terms of Use.