This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
K.E. Stoffers, Department of Electrical and Electronic Engineering, California State University
The list of separating edges for a switching function describes the boundary between its 1-cells and its 0-cells on the n-cube. It is shown how combinational logic can be designed by partitioning this list. The technique works from the output of the gates toward their inputs and is particularly suited for design with inverting gates (NAND, NOR). Fan-in limits are handled systematically. A necessary constraint for partitioning and a steepest descent technique for the choice of partitions are introduced. Examples for design with fan-in limits of 2 and 3 and for the classical two-stage design problem are given.
Index Terms:
Boolean tree circuits, combinational decomposition theory, fan-in limitations, NAND (NOR) gates, steepest descent strategy.
Citation:
K.E. Stoffers, "Partitioning of Separating Edges: A New Approach to Combinational Logic Design," IEEE Transactions on Computers, vol. 26, no. 8, pp. 833-836, Aug. 1977, doi:10.1109/TC.1977.1674925
Usage of this product signifies your acceptance of the Terms of Use.