Symmetry Detection and Boolean Matching Utilizing a Signature-Based Canonical Form of Boolean Functions
Afshin Abdollahi, Massoud Pedram · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 2008
A compact canonical form and a computational procedure for solving the Boolean matching problem under permutation and complementation of variables are presented. The proposed approach, which utilizes generalized signatures and variable symmetries, can handle combinational functions with no limitation on the number of input variables. Experimental results demonstrate the generality and effectiveness of the proposed canonical form and the associated Boolean matching algorithm.