By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
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.

Published in:

IEEE Transactions on Computers  (Volume:C-26 ,  Issue: 8 )