Abstract :
An algorithm for obtaining all simple disjunctive decompositions of a switching function is described. The algorithm proceeds by testing for all decompositions with a bound set of size two. Under given conditions, this test for a pair of variables will show that some larger bound sets, containing the two variables for which the test was conducted, cannot yield a decomposition. The remaining bound sets require further testing. Thus this algorithm differs from existing techniques in that it attempts to test fewer bound sets at the expense of additional analysis. The relative merit of this algorithm is discussed.
Keywords :
Characterization constant, decomposition algorithm, decomposition graph, mod 2 canonical form, mod 2 map, simple disjunctive decompositions, switching functions.; Algorithm design and analysis; Helium; Input variables; Lattices; Terminology; Testing; Characterization constant, decomposition algorithm, decomposition graph, mod 2 canonical form, mod 2 map, simple disjunctive decompositions, switching functions.;
