• DocumentCode
    1113421
  • Title

    Optimal One-Bit Full Adders With Different Types of Gates

  • Author

    Liu, Tso-Kai ; Hohulin, Keith R. ; Shiau, Lih-er ; Muroga, Saburo

  • Author_Institution
    Bell Laboratories
  • Issue
    1
  • fYear
    1974
  • Firstpage
    63
  • Lastpage
    70
  • Abstract
    Optimal networks with thirty different types of restrictions are listed for the one-bit fuli adder. Optimality is derined as the minimization of the number of gates under different restrictions.
  • Keywords
    Implicit enumeration, integer programming, one-bit adder, optimal networks.; Adders; Computer networks; Computer science; Costs; Integrated circuit interconnections; Integrated circuit synthesis; Large scale integration; Linear programming; Logic programming; Minimization; Implicit enumeration, integer programming, one-bit adder, optimal networks.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/T-C.1974.223778
  • Filename
    1672371
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1113421