Simplification of Exclusive-or Sum-of-Products Expressions Through Function Transformation

Exclusive-or sum-of-products expressions (ESOPs) are the most general AND-EXOR expressions. This paper presents a new data structure called a function product (FP) and an algorithm for obtaining simplified ESOPs through transformation of FPs. The algorithm takes the following steps: converting an initial ESOP into an EXOR of FPs (EX-FP), simplifying the EX-FP by repeating the transformation of FPs, and reconverting the resulting EX-FP into the simplified ESOP. The authors give experimental results on benchmarks to demonstrate the superiority of the method in reduction of literals