標題: Exploiting communication complexity for Boolean matching
作者: Wang, KH
Hwang, TT
Chen, C
資訊工程學系
Department of Computer Science
公開日期: 1-十月-1996
摘要: 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!(n)2), 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.
URI: http://dx.doi.org/10.1109/43.541444
http://hdl.handle.net/11536/1012
ISSN: 0278-0070
DOI: 10.1109/43.541444
期刊: IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
Volume: 15
Issue: 10
起始頁: 1249
結束頁: 1256
顯示於類別:期刊論文


文件中的檔案:

  1. A1996VR33700006.pdf