A Computer Program for the Synthesis of Switching Circuits by Decomposition
- 1 June 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-21 (6) , 568-573
- https://doi.org/10.1109/tc.1972.5009009
Abstract
A computer program, which has a Boolean expression and a functionally complete set of switching functions as input data and as output data, gives a description of a logic diagram that shows the synthesized switching circuit realizing the Boolean expression, is described in this paper. The program utilizes a new proof for a generalized version of a theorem that was first stated by Ashenhurst. It is shown that an implementation of a modified form of the decomposition chart technique is indeed useful for the synthesis of combinational switching circuits.Keywords
This publication has 15 references indexed in Scilit:
- An Algorithm for the Disjunctive Decomposition of Switching FunctionsIEEE Transactions on Computers, 1970
- An Algorithm for NAND Decomposition Under Network ConstraintsIEEE Transactions on Computers, 1969
- Logic Design Automation of Fan-In Limited NAND NetworksIEEE Transactions on Computers, 1969
- An Algorithm for Synthesis of Multiple-Output Combinational LogicIEEE Transactions on Computers, 1968
- On a general synthesis algorithm of logical circuits using a restricted inventory of integrated circuitsPublished by Association for Computing Machinery (ACM) ,1968
- The use of Roth's decomposition algorithm in multi-level design of circuitsThe Computer Journal, 1968
- A Computer-Oriented Factoring Algorithm for NOR Logic DesignIEEE Transactions on Electronic Computers, 1965
- A Diagrammatic Approach to Multilevel Logic SynthesisIEEE Transactions on Electronic Computers, 1965
- An Algorithm for Solving Boolean EquationsIEEE Transactions on Electronic Computers, 1963
- Minimization Over Boolean GraphsIBM Journal of Research and Development, 1962