This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Synthesis of Networks with a Minimum Number of Negative Gates
January 1971 (vol. 20 no. 1)
pp. 49-58
In this paper we develop an algorithm to design a switching network using only gates which represent negative functions. The number of gates in the network is minimized under the conditions that 1) the network consists of two levels, and 2) no fan-in restriction on each gate is imposed.
Index Terms:
Conjoint, logical design, minimal cover, MOS, negative gates, network with minimum number of gates, supplementary columns, truth table.
Citation:
T. Ibaraki, S. Muroga, "Synthesis of Networks with a Minimum Number of Negative Gates," IEEE Transactions on Computers, vol. 20, no. 1, pp. 49-58, Jan. 1971, doi:10.1109/T-C.1971.223081
Usage of this product signifies your acceptance of the Terms of Use.