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

Authors:
K. E. Stoffers
Affiliations:
Department of Electrical and Electronic Engineering, California State University
Venue:
IEEE Transactions on Computers
Year:
1977

Citing 2
Cited 2

Minimization over Boolean trees

IBM Journal of Research and Development
Minimization over Boolean graphs

IBM Journal of Research and Development

General Criterion for Essential Nonfault Locatability of Logical Functions

IEEE Transactions on Computers
Test Sets for Combinational Logic The Edge-Tracing Approach

IEEE Transactions on Computers

Quantified Score

Hi-index	14.99

Visualization

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.