Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
