Multiple-valued logic synthesis and optimization
Logic Synthesis and Verification
A Framework for Constrained Functional Verification
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
A BDD-based fast heuristic algorithm for disjoint decomposition
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
| Hi-index | 0.00 |
The composition tree of a given function, when it exists, provides a representation of the function revealing all possible disjunctive decompositions, thereby suggesting a realization of the function at a minimal cost. Previously and independently, the authors had studied the class of multiple-valued functions that are fully sensitive to their variables. These functions are useful for test generation purposes, and almost all m-valued n-variable functions belong to this class as n increases. All functions in this class have composition trees. This paper presents a recursive algorithm for generating the composition tree for any function in this class. The construction proceeds top-down and makes immediate use of any encountered decomposition, which reduces the (in general exponential) computation time.