Partitioning of Separating Edges: A New Approach to Combinational Logic Design | IEEE Journals & Magazine | IEEE Xplore

Partitioning of Separating Edges: A New Approach to Combinational Logic Design


Abstract:

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...Show More

Abstract:

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.
Published in: IEEE Transactions on Computers ( Volume: C-26, Issue: 8, August 1977)
Page(s): 833 - 836
Date of Publication: 31 August 1977

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.