Loading [a11y]/accessibility-menu.js
Gate-Interconnection Minimization of Switching Networks Using Negative Gates | IEEE Journals & Magazine | IEEE Xplore

Gate-Interconnection Minimization of Switching Networks Using Negative Gates


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...Show More

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.
Published in: IEEE Transactions on Computers ( Volume: C-20, Issue: 6, June 1971)
Page(s): 698 - 706
Date of Publication: 30 June 1971

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.