Finding all simple disjunctive decompositions using irredundant sum-of-products forms
Shin-ichi Minato, Giovanni De Micheli · 1998
Finding disjunct ive decompositions is an important technique to realize compact logic nettvorks.Simple dzsjun cttce decomposition is a b~ic and useful concept, that extracts a single-output subblock function ~vhose input variable set is disjunctive from the other part.This paper presents a method for finding simple disjunct ive decompositions by generating irredundant sum-ofproducts forms and applying factorization.?fre prove that all simple disjunctive decompositions can be extract ed in our method, namely, all possible decompositions are included in the factored logic net;vorks.Experiment al results sho~v that our method can efficiently extract all the simple disjunct ive decompositions of the large-scale functions.Our result clarifies the relationship bet Iveen the functional decomposition method and the t~vo-level logic factorization method.