This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
January 1975 (vol. 24 no. 1)
pp. 72-79
null Tso-Kai Liu, Bell Laboratories
Due to the considerable progresses during the past few years, metal oxide semiconductor (MOS) has become one of the most important technologies for large-scale integration (LSI). Since a fairly complex function can be realized by a single MOS cell, most of the conventional algorithms which use NOR, NAND, AND, and OR gates as the basic building blocks are not suitable to synthesize MOS networks. This paper presents two simple efficient algorithms to synthesize 2-level MOS networks with a minimum number of cells.
Index Terms:
Boolean expression, MOS complex cell, negative function, optimal 2-level network, true vector.
Citation:
null Tso-Kai Liu, "Synthesis Algorithms for 2-level MOS Networks," IEEE Transactions on Computers, vol. 24, no. 1, pp. 72-79, Jan. 1975, doi:10.1109/T-C.1975.224084
Usage of this product signifies your acceptance of the Terms of Use.