Functional decomposition through structural analysis of decision diagrams-the binary and multiple-valued cases

Abstract

The problem of disjoint functional decomposition is both an important and difficult task for theoretical reasons and synthesis purposes. The use of efficient representation techniques (decision diagrams) permits a novel approach, which surpasses the preceding ones by identifying graph-structures rather than algebraic relations. In this paper we present a demonstration of a new fact about functional decomposition, and a necessary and sufficient criterion to identify feasible decompositions of a generic function. We implemented and validated the algorithm integrating it in a decision diagram package.