SYNTHESIS OF MULTIPLE-VALUED T-GATE NETWORKS USING INTEGER PROGRAMMING.

A synthesis of multiple-valued T-gate networks with a minimum number of T-gates is presented. A ULM implicant is defined in the multiple-valued T-gate networks. This implies that a certain number of T-gates in a tree structure can be reduced. The optimal T-gate network is obtained by finding the compatible set of ULM implicants which contains the possible reduction of the maximum number of T-gates. Integer programming is used in the synthesis algorithm so that the optimal compatible set can be found using little computation time. A common residual implicant is also defined to use equal residue functions in a tree structure of a T-gate network. Finally, a method for synthesizing multiple-output T-gate networks using equal residue functions is developed.