An Algorithm for the Disjunctive Decomposition of Switching Functions
- 1 March 1970
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-19 (3) , 239-248
- https://doi.org/10.1109/T-C.1970.222903
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
This publication has 2 references indexed in Scilit:
- Complexity in Electronic Switching CircuitsIRE Transactions on Electronic Computers, 1956
- A class of multiple-error-correcting codes and the decoding schemeTransactions of the IRE Professional Group on Information Theory, 1954