Abstract:
Encoding in Curtis-style decompositions is the process of assigning codes to groups of com- patible columns (or cubes) so that the binary logic descriptions of the predecessor and successor sub-functions can be created for further decomposition. In doing so, the sub-functions created are functionally equivalent to the set of care values specified in the original function. In this paper an input/output encoding algorithm DC ENC is presented that is designed to achieve the simpliest total complexity of the predecessor and successor sub-functions, and to increase the total number of don't cares for their further utilization in subsequent decomposition steps of these sub-functions.