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.