Decomposition-based synthesis of multiple-valued functions for threshold logic network realization

In this paper, a sub-optimal algorithm for reducing the number of threshold elements required to realize a given binary function is presented. The algorithm uses a matching-count matrix to obtain the input-output pairing that results the maximum total matching count, thus minimizing the number of switching operations required. The concept of output phase assignment is used to extend the approach to handle multiple-valued logic functions. Experimental results are given to illustrate the merits of the proposed algorithms.<>