The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1974 vol.23)
pp: 338-346
D.C. Schmidt , Systems and Information Science Department, Vanderbilt University
ABSTRACT
There are a number of methods which use a clause table to generate the prime implicants of a switching function. This paper describes a technique for extending the clause table approach to the minimization of multi-terminal networks. The specific extension described here extends the algorithm of Slagle et al. to generate the important implicants of a set of switching functions and to determine a minimum realization.
INDEX TERMS
Boolean minimization, clause table, combinational logic, heuristics, multi-output network, trees.
CITATION
D.C. Schmidt, L.E. Druffel, "An Extension of the Clause Table Approach to Multi-Output Combinational Switching Networks", IEEE Transactions on Computers, vol.23, no. 4, pp. 338-346, April 1974, doi:10.1109/T-C.1974.223947
4 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool