.png){kind=icon}
Return
ESOP Expression Minimization for Multi-Valued Functions Using Nonlinear Integer Programming
.png){kind=icon}
OA
AI
DOI：10.3390/math14101582.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The minimization of Exclusive-OR Sum-of-Products (ESOP) expressions in the case of multi-valued input, multi-output binary, and certain types of multi-valued output functions (MVESOP) is approached in this work through a novel nonlinear integer programming methodology. The devised method is applicable to both completely and incompletely specified functions and has the capacity to provide exact solutions of global optimality. A key general transformation converts the minimization problem from the MVESOP to the classical algebraic domain, resulting in a nonlinear integer program. Notably, for the challenging cases of incompletely specified functions, the problem becomes significantly simpler after this mapping. Several illustrative, analytical, and numerical examples are provided to demonstrate the implementation and performance of the approach.
Keywords:
Boolean functions
exclusive-OR operation
multi-valued logic
nonlinear integer programming
exact minimization
incompletely specified functions
Journal
IF:
2.2
Papers:
3.1K
Citations:
3.6W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
View more