Canonical Form-Based Boolean Matching and Symmetry Detection in Logic Synthesis and Verification

An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for computing the proposed canonical form is provided. The efficiency of the algorithm allows it to be applicable to large complex Boolean functions with no limitation on the number of… CONTINUE READING