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
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.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/T-C.1974.223778
