Two-place decomposition and the synthesis of many-valued switching circuits
D. M. Miller, Jon C. Muzio · International Symposium on Multiple-Valued Logic · 1976
Two-place decomposition is a technique where a many-valued function is reexpressed as a composition of three functions, two of which have at most two arguments. In this paper, the construction of sequences of two-place decompositions is considered. Taking a many-valued universal decision element as a basic building block, such a sequence represents a switching circuit realizing the initial function. A simple algorithm for constructing sequences of two-place decompositions is presented. This algorithm generates a sequence representing a 'good' circuit quickly rather than searching for an optimal solution.