Issue No. 01 - January (1974 vol. 23)
ISSN: 0018-9340
pp: 63-70
null Tso-Kai Liu , 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.
INDEX TERMS
Implicit enumeration, integer programming, one-bit adder, optimal networks.
CITATION
n. Lih-Er Shiau, n. Tso-Kai Liu, K. Hohulin and S. Muroga, "Optimal One-Bit Full Adders With Different Types of Gates," in IEEE Transactions on Computers, vol. 23, no. , pp. 63-70, 1974.
doi:10.1109/T-C.1974.223778
CITATIONS
SEARCH
