The problem of checking the equivalence of two Boolean functions under arbitrary input permutations and/or input plane assignments is considered. This problem has several applications in the synthesis and verification of combinational logic. The approach presented computes a signature for each variable or phase of a variable that will help establish correspondence of variables or phases of variables. The strength of the proposed approach depends on the ability to quickly derive a signature with minimum aliasing. Aliasing refers to two different variables or phases having the same signature, thus rendering this signature useless for the purpose of distinguishing between them. Experimental results on a large number of examples establish the efficacy of this approach.<<ETX>>
[1]
Jerry R. Burch,et al.
Efficient Boolean function matching
,
1992,
ICCAD.
[2]
Albert R. Wang,et al.
Logic verification using binary decision diagrams in a logic synthesis environment
,
1988,
[1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.
[3]
Massoud Pedram,et al.
Boolean matching using binary decision diagrams with applications to logic synthesis and verification
,
1992,
Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.
[4]
Randal E. Bryant,et al.
Graph-Based Algorithms for Boolean Function Manipulation
,
1986,
IEEE Transactions on Computers.