Gate-Interconnection Minimization of Switching Networks Using Negative Gates
- 1 June 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-20 (6) , 698-706
- https://doi.org/10.1109/t-c.1971.223331
Abstract
In this note, we develop an algorithm to design a two-level switching network composed of negative gates with no fan-in restriction imposed on them. The resulting network is such that it minimizes the cost function h(G, 1), a monotone nondecreasing function of G and I, where G is the total number of gates and I is the total number of interconnections in the network. In other words, the earlier work is generalized so that the number of interconnections may be included in its cost criterion. The algorithm is then extended to the multiple output network design.Keywords
This publication has 2 references indexed in Scilit:
- Synthesis of Networks with a Minimum Number of Negative GatesIEEE Transactions on Computers, 1971
- An Improved Implicit Enumeration Approach for Integer ProgrammingOperations Research, 1969