Logic Design and Switching Theory
Logic Design and Switching Theory
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
The minimal covering problem and automated design of two-level and/or optimal networks.
The minimal covering problem and automated design of two-level and/or optimal networks.
Algebraic derivation of minimal sums for functions of a large number of variables
Algebraic derivation of minimal sums for functions of a large number of variables
Generation of Prime Implicants from Subfunctions and a Unifying Approach to the Covering Problem
IEEE Transactions on Computers
Implication techniques for Bollean functions
SWCT '64 Proceedings of the 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
Irredundant disjunctive and conjunctive forms of a Boolean function
IBM Journal of Research and Development
MINI: a heuristic approach for logic minimization
IBM Journal of Research and Development
An application of linear programming to the minimization of Boolean functions
FOCS '61 Proceedings of the 2nd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1961)
Absolute Minimization of Completely Specified Switching Functions
IEEE Transactions on Computers
| Hi-index | 14.99 |
Some new concepts in switching theory are pre sented. One of these is called an "abridged minterm base." We can use an abridged minterm base instead of the minterm expansion in conventional absolute minimization procedures. Since an abridged minterm base almost always has much fewer minterms than are in the minterm expansion, we can derive an abridged minterm base for many functions for which it is impossible to derive the minterm expansion. This paper also introduces the concept of generalized inclusion function Q(f) and its decomposition theorem Q(g)·Q(h) = Q(g V h). The theorem is very useful.