Logic Design of Digital Systems
Logic Design of Digital Systems
An Algebraic Approach to Boolean Equations
IEEE Transactions on Computers
The Necessity of Closed Circuit Loops in Minimal Combinational Circuits
IEEE Transactions on Computers
An Algorithm for Synthesis of Multiple-Output Combinational Logic
IEEE Transactions on Computers
IEEE Transactions on Computers
An Algorithm for the Disjunctive Decomposition of Switching Functions
IEEE Transactions on Computers
A Unified Theory of the Algebraic Topological Methods for the Synthesis of Switching Systems
IEEE Transactions on Computers
Boolean Differential Calculus and its Application to Switching Theory
IEEE Transactions on Computers
A Computer Algorithm for the Synthesis of Memoryless Logic Circuits
IEEE Transactions on Computers
Reduced Solutions of Boolean Equations
IEEE Transactions on Computers
On the Solution of Boolean and Pseudo-Boolean Relations
IEEE Transactions on Computers
IEEE Transactions on Computers
Comments on ``Equational Logic''
IEEE Transactions on Computers
A computer program for the synthesis of combinational switching circuits
FOCS '61 Proceedings of the 2nd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1961)
Maximum projections of don't care conditions in a Boolean network
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Controllability and Fault Observability in Modular Combinational Circuits
IEEE Transactions on Computers
Robust window-based multi-node technology-independent logic minimization
Proceedings of the 19th ACM Great Lakes symposium on VLSI
Transactions on rough sets XII
| Hi-index | 14.98 |
A methodology based on the theory of Boolean equations has been developed which permits a unified approach to the analysis and synthesis of combinational logic circuits. The type of circuits covered by the approach includes both the classical loopless combinational networks as well as those that contain closed feedback loops and thus have internally a sequential character. To that end, a general multiple-output circuit represented by a Mealy-type machine is studied using characteristic equations (functions) that describe its internal structure. It is shown how behavioral properties of the circuit are reflected through the sosutions of these equations. Moreover, it is demonstrated that a multiple-output incompletely specified switching function is reaeized if a = relation is satisfied between the corresponding charchteristic functions. This leads to a new unified outlook on functional decomposition as used in modular synthesis procedures. Although the building modules are allowed to be sequential circuits, it is shown under which conditions the feedback loops are redundant with respect to the realization of a given output characteristic function, and thus the existence conditions of nondegenerate combinational circuits with loops are stated.