This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal One-Bit Full Adders With Different Types of Gates
January 1974 (vol. 23 no. 1)
pp. 63-70
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:
null Tso-Kai Liu, K.R. Hohulin, null Lih-Er Shiau, S. Muroga, "Optimal One-Bit Full Adders With Different Types of Gates," IEEE Transactions on Computers, vol. 23, no. 1, pp. 63-70, Jan. 1974, doi:10.1109/T-C.1974.223778
Usage of this product signifies your acceptance of the Terms of Use.