Exploring Multi-Valued Minimization Using Binary Methods

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]  Shin-ichi Minato,et al.  Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems , 1993, 30th ACM/IEEE Design Automation Conference.

[2]  Thomas C. Bartee,et al.  Computer Design of Multiple-Output Logical Networks , 1961, IRE Trans. Electron. Comput..

[3]  Olivier Coudert,et al.  Towards a symbolic logic minimization algorithm , 1993, The Sixth International Conference on VLSI Design.

[4]  Olivier Coudert,et al.  Symbolic prime generation for multiple-valued functions , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[5]  Olivier Coudert,et al.  Two-level logic minimization: an overview , 1994, Integr..

[6]  Daniel L. Ostapko,et al.  MINI: A Heuristic Approach for Logic Minimization , 1974, IBM J. Res. Dev..

[7]  Robert K. Brayton,et al.  ESPRESSO-SIGNATURE: A New Exact Minimizer for Logic Functions , 1993, 30th ACM/IEEE Design Automation Conference.

[8]  Janusz Rajski,et al.  The testability-preserving concurrent decomposition and factorization of Boolean expressions , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  Alberto L. Sangiovanni-Vincentelli,et al.  Multiple-Valued Minimization for PLA Optimization , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[10]  Robert K. Brayton,et al.  Reducing multi-valued algebraic operations to binary , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[11]  Eugenio Morreale,et al.  Recursive Operators for Prime Implicant and Irredundant Normal Form Determination , 1970, IEEE Transactions on Computers.

[12]  Robert K. Brayton,et al.  Reduced offsets for two-level multi-valued logic minimization , 1991, DAC '90.

[13]  Robert K. Brayton.  Algebraic methods for multi-valued logic , 1999 .

[14]  Tsutomu Sasao.  An Algorithm to Derive the Complement of a Binary Function with Multiple-Valued Inputs , 1985, IEEE Transactions on Computers.

[15]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[16]  Olivier Coudert,et al.  Implicit and incremental computation of primes and essential primes of Boolean functions , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[17]  Tsutomu Sasao,et al.  Multiple-Valued Decomposition of Generalized Boolean Functions and the Complexity of Programmable Logic Arrays , 1981, IEEE Transactions on Computers.

[18]  Robert K. Brayton,et al.  Simplification of non-deterministic multi-valued networks , 2002, IWLS.

[19]  P. R. Stephan,et al.  SIS : A System for Sequential Circuit Synthesis , 1992 .