A Fast Algorithm for the Disjunctive Decomposition of Switching Functions

Abstract

An algorithm for obtaining all simple disjunctive decompositions of a switching function is described. It operates on a function given as an expression using the operations AND, EXCLUSIVE OR, and complementation. It uses necessary conditions for the existence of a decomposition to eliminate sets of bound sets from consideration. Thus this technique differs… (More)
DOI: 10.1109/T-C.1971.223235

Topics

5 Figures and Tables

Slides referencing similar topics