A logic function f has a disjoint bi-decomposition iff f can be represented as f = h(g1(X1); g2(X2)), where X1 and X2 are disjoint set of variables, and h is an arbitrary two-variable logic fuction. f has a non- disjoint bidecomposition if can be represented as f(X1;X2; x) = h(g1(X1; x); g2(X2; x)), where x is the common variable. In this paper, we show a fast method to find bidecompositions. Also, we enumerate the number of functions having bidecompositions.
展开▼
