An Evolutionary Algorithm for Optimization of Pseudo Kronecker Expressions

Abstract

Using EXOR gates in logic synthesis often results in smaller circuit realizations. While in AND/OR synthesis the problem definition is clear, in AND/EXOR synthesis several classes of optimization problems have been considered. In this context Pseudo Kronecker Expressions (PSDKROs) are highly relevant, since they allow very compact representations while the optimization can be carried out efficiently. But the size of PSDKROs depends on a chosen order in which the variables are considered. In this paper an Evolutionary Algorithm (EA) is presented for determining a good decomposition order for PSDKROs. Experimental results are given to demonstrate the efficiency of the approach.