A Computer Algorithm for the Synthesis of Memoryless Logic Circuits
- 1 May 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-23 (5) , 455-465
- https://doi.org/10.1109/t-c.1974.223967
Abstract
A method has been investigated for the synthesis of memoryless logical networks using a restricted repertoire of functional modules. The method is based on the reduced general solution to a generalized system of Boolean equations (BE) as applied to the decomposition of Boolean functions. The aim of the synthesis is to obtain the most constrained circuit having at most two levels of gating. The constraints take the form of single input variables or constant logic levels applied to the inputs of the first level gate. This is achieved by assembling a set of constraint equations which are then a part of the generalized system of BE. The method is then tested on some synthesis examples of single and multiple output functions in terms of the NAND and (WOS) modules.Keywords
This publication has 5 references indexed in Scilit:
- Reduced Solutions of Boolean EquationsIEEE Transactions on Computers, 1970
- 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
- Boolean Methods in Operations Research and Related AreasPublished by Springer Nature ,1968
- An Algorithm for Solving Boolean EquationsIEEE Transactions on Electronic Computers, 1963