About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Systems and Computers in Japan
Paper
A simplification method for AND-EXOR expressions for multiple-output functions
Abstract
This paper presents properties of Exclusive-OR Sum-of-Products expressions (ESOPs) for multiple-output functions and a simplification algorithm for ESOPs. First, lower bounds on the number of products in minimum ESOPs for multiple output functions are derived. Then, algorithms to simplify ESOPs and to prove their minimality are presented. Experimental results for arithmetic functions and randomly generated functions for up to ten variables are shown.