Minimizing ESCT forms for two-variable multiple-valued input binary output functions

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


As EXOR (Exclusive-OR) expansions of binary output functions, the ESOP (EXOR Sum of Products) form and its extension, the ESCT (EXOR Sum of Complex Terms) form, have been studied extensively in the literature. An efficient algorithm for minimizing ESOP forms is known for two-variable multiple-valued input functions. On the other hand, no ESCT minimization algorithm is known for such functions. In this paper, we give an efficient algorithm for minimizing ESCT forms of two-variable multiple-valued input functions, showing that the number of terms can be reduced by at most one.

Original languageEnglish
Pages (from-to)186-194
Number of pages9
JournalDiscrete Applied Mathematics
Publication statusPublished - 2014 May 31


  • AND-EXOR expression
  • Boolean matrix
  • Minimization
  • Multiple-valued logic function

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Minimizing ESCT forms for two-variable multiple-valued input binary output functions'. Together they form a unique fingerprint.

Cite this