Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article

Time-Component Complexity of Two Approaches to Multioperand Binary Addition

Published: 01 December 1979 Publication History

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.
  1. Time-Component Complexity of Two Approaches to Multioperand Binary Addition

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image IEEE Transactions on Computers
    IEEE Transactions on Computers  Volume 28, Issue 12
    December 1979
    73 pages

    Publisher

    IEEE Computer Society

    United States

    Publication History

    Published: 01 December 1979

    Author Tags

    1. Adder tree
    2. binary addition
    3. carry-lookahead adder
    4. carry-save adder
    5. multioperand addition
    6. time-component complexity

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 0
      Total Downloads
    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 22 Dec 2024

    Other Metrics

    Citations

    View Options

    View options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media