We consider the problem of checking the equivalence of two Boolean functions under arbitrary input permutations. This problem has several applications in the synthesis and verification of combinational logic. In logic verification this is needed when the exact correspondence of inputs between the two circuits is not known. The problem is NP–hard, thus recourse is taken to heuristics that work well in practice. The approach presented in this thesis computes signatures for each input variable… CONTINUE READING