A comparative analysis of the performance of the G. Pomper and J. Armstrong (1981), P. W. Besslich (1986), G. W. Dueck and D. M. Miller (1986), and the T. A. Guima and M. A. Tapia (1987) algorithms for the minimization of multivalued logic functions is conducted. The simulation results of over 15,000 multivalued logic functions utilizing the MAX, MIN, and fundamental gates are obtained for each algorithm and compared to their absolute minimal results. An open ended software for the implementation of the various algorithms has been developed. The algorithms have been implemented, analyzed and evaluated to determine their relative merits. The minimized functional forms are compared according to metrics which exemplify the level of reduction in various aspects, such as the number of product terms, fundamental gates and MIN-literals. Inferences are drawn on the performance of the algorithms in general and on certain functional sets.
