On the Inversion Complexity of a System of Functions
Journal of the ACM (JACM)
Multifunctional Circuits in Functional Canonical Form
Journal of the ACM (JACM)
Programmed Logic Array Optimization
IEEE Transactions on Computers
A Unified Theory of the Algebraic Topological Methods for the Synthesis of Switching Systems
IEEE Transactions on Computers
Partitioning of Separating Edges: A New Approach to Combinational Logic Design
IEEE Transactions on Computers
An Algebra for Switching Circuits
IEEE Transactions on Computers
A Digital Synthesis Procedure Under Function Symmetries and Mapping Methods
IEEE Transactions on Computers
A relational approach to functional decomposition of logic circuits
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.02 |
An algorithm is provided for what might be termea tne general problem ot logical design ot circuits with one output and no feedback. Given a set B of logical building blocks, each with a positive cost, each with one output, and given a Boolean function f the problem is to prescribe a Boolean tree constructed from the available set of building blocks which realizes f and which has a minimum cost. Actually a more general problem involving don't care conditions is treated. The cost of a Boolean tree shall be the sum of the costs of the building blocks of which it is composed. A special case of this problem is the classical logical problem of finding a functional expression for a given logical function which uses a minimum number of conjunctions, disjunctions and negations. Programmed on an IBM 704 computer, the algorithm is believed to be efficient on problems with eight or less variables.