|
1. |
Exploiting communication complexity for Boolean matching
Kuo-Hua Wang; TingTing Hwang; Cheng Chen;
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Volume 15,
Issue 10,
Oct. 1996
Page(s):1249
-
1256
Abstract:
Boolean matching is to check the equivalence of two functions under input permutation and input/output phase assignment. A straightforward implementation takes time complexity O(n!2n2), where n is the number of variables. Various signatures of variables were used to prune impossible permutations by many researchers. In this paper, based on communication complexity, we also propose two signatures, cofactor and equivalence signatures, which are general forms of many existing signatures. These signatures are used to develop an efficient Boolean matching algorithm which is based on checking structural equivalence of OBDD's. Experimental results on a set of benchmarks show that our algorithm is indeed very effective in solving Boolean matching problem
|
Cart
