Issue No. 01 - January (1971 vol. 20)
T. Ibaraki , IEEE
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.
Conjoint, logical design, minimal cover, MOS, negative gates, network with minimum number of gates, supplementary columns, truth table.
T. Ibaraki, S. Muroga, "Synthesis of Networks with a Minimum Number of Negative Gates", IEEE Transactions on Computers, vol. 20, no. , pp. 49-58, January 1971, doi:10.1109/T-C.1971.223081