A two-step search engine for large scale boolean matching under NP3 equivalence
Authors: 
Chak-Wa Pui, 
Peishan Tu, Haocheng Li, Gengjie Chen, Evangeline F. Y. YoungAuthors Info & Claims
Pages 592 - 598
Abstract
Boolean matching is one of the most widely used engines in industrial applications. However, existing Boolean matching researches mainly focus on NPNP-equivalence. In this paper, we study a more practical problem of Boolean matching, which is Non-exact Projective NPNP (NP3). A two-step search engine is used to solve the problem and several heuristics and constraints are proposed to accelerate the whole process. In particular, we explore a new kind of symmetry properties in NP3 equivalence checking which helps to prune the solution space efficiently. Experimental results show that our proposed approach can achieve the best results among the winning teams of the ICCAD 2016 contest in quality within a given time limit.
References
[1]
A. Abdollahi. Signature based boolean matching in the presence of don't cares. In ACM/IEEE Design Automation Conference (DAC), pages 642--647, 2008.
[2]
A. Abdollahi and M. Pedram. A new canonical form for fast boolean matching in logic synthesis and verification. In ACM/IEEE Design Automation Conference (DAC), pages 379--384, 2005.
[3]
G. Agosta, F. Bruschi, G. Pelosi, and D. Sciuto. A unified approach to canonical form-based boolean matching. In ACM/IEEE Design Automation Conference (DAC), pages 841--846, 2007.
[4]
G. Agosta, F. Bruschi, G. Pelosi, and D. Sciuto. A transform-parametric approach to boolean matching. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD), 28(6):805--817, 2009.
[5]
M. Agrawal and T. Thierauf. The boolean isomorphism problem. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 422--430, 1996.
[6]
L. Benini and G. De Micheli. A survey of boolean matching techniques for library binding. ACM Transactions on Design Automation of Electronic Systems (TODAES), 2(3):193--226, 1997.
[7]
B. Borchert, D. Ranjan, and F. Stephan. On the computational complexity of some classical equivalence relations on boolean functions. Theory of Computing Systems, 31(6):679--693, 1998.
[8]
J. Cong and Y.-Y. Hwang. Boolean matching for lut-based logic blocks with applications to architecture evaluation and technology mapping. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD), 20(9):1077--1090, 2001.
[9]
Z. Huang, L. Wang, Y. Nasikovskiy, and A. Mishchenko. Fast boolean matching based on npn classification. In FPT, pages 310--313, 2013.
[10]
H. Katebi and I. L. Markov. Large-scale boolean matching. In IEEE/ACM Proceedings Design, Automation and Test in Eurpoe (DATE), pages 771--776, 2010.
[11]
S. Krishnaswamy, H. Ren, N. Modi, and R. Puri. Deltasyn: an efficient logic difference optimizer for eco synthesis. In IEEE/ACM International Conference on Computer-Aided Design (ICCAD), pages 789--796, 2009.
[12]
A. Kuehlmann and F. Krohm. Equivalence checking using cuts and heaps. In Proceedings of the 34th annual Design Automation Conference, pages 263--268. ACM, 1997.
[13]
C.-F. Lai, J.-H. R. Jiang, and K.-H. Wang. Boolean matching of function vectors with strengthened learning. In IEEE/ACM International Conference on Computer-Aided Design (ICCAD), pages 596--601, 2010.
[14]
C.-F. Lai, J.-H. R. Jiang, and K.-H. Wang. Boom: a decision procedure for boolean matching with abstraction and dynamic learning. In ACM/IEEE Design Automation Conference (DAC), pages 499--504, 2010.
[15]
A. Mishchenko, S. Ray, and R. Brayton. Incremental sequential equivalence checking and subgraph isomorphism.
[16]
J. Mohnke, P. Molitor, and S. Malik. Limits of using signatures for permutation independent boolean comparison. In ACM/IEEE Design Automation Conference (DAC), pages 459--464, 1995.
[17]
J. Mohnke, P. Molitor, and S. Malik. Application of bdds in boolean matching techniques for formal logic combinational verification. International Journal on Software Tools for Technology Transfer, 3(2):207--216, 2001.
[18]
N. Sorensson and N. Een. Minisat v1.13-a sat solver with conflict-clause minimization. SAT, 2005:53, 2005.
[19]
P. Swierczynski, M. Fyrbiak, C. Paar, C. Huriaux, and R. Tessier. Protecting against cryptographic trojans in fpgas. In Field-Programmable Custom Computing Machines (FCCM), 2015 IEEE 23rd Annual International Symposium on, pages 151--154, 2015.
[20]
F. Wang, J. Zhang, L. Wu, W. Zhang, and G. Luo. Search Space Reduction for the Non-Exact Projective NPNP Boolean Matching Problem. In IEEE International Symposium on Circuits and Systems (ISCAS), pages 596--601, 2017.
[21]
C.-A. R. Wu, C.-J. J. Hsu, and K.-Y. Khoo. ICCAD-2016 CAD contest in non-exact projective NPNP boolean matching and benchmark suite. In IEEE/ACM International Conference on Computer-Aided Design (ICCAD), page 40, 2016.
Recommendations
A two-step search engine for large scale boolean matching under NP3 equivalence
2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)Boolean matching is one of the most widely used engines in industrial applications. However, existing Boolean matching researches mainly focus on NPNP-equivalence. In this paper, we study a more practical problem of Boolean matching, which is Non-exact ...
Identifying redundant search engines in a very large scale metasearch engine context
WIDM '06: Proceedings of the 8th annual ACM international workshop on Web information and data managementFor a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method to identify redundant search engines in a very large-scale metasearch ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sponsors
- IEEE Circuits and Systems Society
- SIGDA: ACM Special Interest Group on Design Automation
- IEEE Council on Electronic Design Automation (CEDA)
Publisher
IEEE Press
Publication History
Published: 22 January 2018
Check for updates
Qualifiers
- Research-article
Conference
ASPDAC '18
Sponsor:
ASPDAC '18: 23rd Asia and South Pacific Design Automation Conference
January 22 - 25, 2018
Jeju, Republic of Korea
Acceptance Rates
Overall Acceptance Rate 466 of 1,454 submissions, 32%
Upcoming Conference
ASPDAC '25
- Sponsor:
- sigda
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 25Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 20 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in