Exploring Multi-Valued Minimization Using Binary Methods
Alan Mishchenko, Robert K. Brayton, Tsutomu Sasao · 2003
A transformation of multi-valued input binary-output functions, called co-singleton transform (CST), was introduced in [11] to reduce algebraic multi-valued (MV) operations to binary. In this paper, we explore its potential for a number of problems related to MV SOP minimization, such as computing ISOPs, the set of all primes, and the set of all essential primes. Experimental results show that in some cases these problems can be solved more efficiently than by the traditional MV SOP minimization approaches represented by ESPRESSO-MV, but that generally there is no clear method-of-choice. 1