Factorization of multi-valued logic functions

Hui Min Wang, Chung Len Lee, Jwu E. Chen

Research output: Contribution to journalConference articlepeer-review

3 Scopus citations


This paper describes an approach to factorization of multi-valued logic (MVL) functions. The key concept is to formulate the problem as a rectangular covering problem. At first, we develop an MVL algebraic factorization algorithm. Then, by incorporating two MVL Boolean properties: 'identical' and 'complementary', we further improve the purely algebraic factorization algorithm be a Boolean one. The algorithm can perform a subset of Boolean factorization with approximately the same complexity as the algebraic one but obtain a better factorization for MVL functions. Experimental results show that the multilevel implementation, synthesized by the Boolean method, for MVL example functions can have 45.4% cost saving over the two-level implementation, and the improved Boolean factorization algorithm can have additional 13.7% cost saving over the algebraic one.

Original languageEnglish
Pages (from-to)164-169
Number of pages6
JournalProceedings of The International Symposium on Multiple-Valued Logic
StatePublished - 1995
EventProceedings of the 1995 25th International Symposium on Multiple-Valued Logic - Bloomington, IN, USA
Duration: 23 May 199525 May 1995


Dive into the research topics of 'Factorization of multi-valued logic functions'. Together they form a unique fingerprint.

Cite this