While a Boolean function usually has a very large number of subfunctions, we show that not all of them are useful for multiple-output decomposition. We use a partition of the set of bound set vertices as the basis to compute preferable decomposition functions, which are sufficient for an optimal multiple-output decomposition. We propose several new algorithms that deal with central issues of central issues of functional multiple-output decomposition. First, an efficient algorithm to solve the variable partitioning problem is described. Due to the implicit computation in the crucial steps, the algorithm is very efficient.
Experimental results show significant reductions in area.