This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Computer Algorithm for the Synthesis of Memoryless Logic Circuits
May 1974 (vol. 23 no. 5)
pp. 455-465
E. Cerny, Department of Electrical Engineering, Loyola College
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.
Index Terms:
Boolean equations (BE), combinational logic synthesis, computer program, constraints on logical space, cost factor, functional decomposition, multilevel logic.
Citation:
E. Cerny, M.A. Marin, "A Computer Algorithm for the Synthesis of Memoryless Logic Circuits," IEEE Transactions on Computers, vol. 23, no. 5, pp. 455-465, May 1974, doi:10.1109/T-C.1974.223967
Usage of this product signifies your acceptance of the Terms of Use.