Pseudo Kronecker expressions (PSDKROs) are a class of AND/EXOR expressions. For a Boolean function with a given variable order the minimal PSDKRO can be derived efficiently using decision diagram (DD) techniques. The quality, i.e., the number of products in the expression, of the result is known to be dependent on the variable ordering. This paper proposes several improvements and enhancements to previous minimization methods. A pruning technique that can be tuned to tradeoff quality for computational resources is presented. By applying dynamic ordering methods, significant improvements to many previously reported results are obtained. Furthermore, a new method for the minimization of multiple output functions is outlined. Experiments on a set of MCNC benchmarks confirm the advantages of the presented algorithms.
展开▼
