Chi-An Wu
ABSTRACT
Boolean Matching is significant to industry applications, such as library binding, synthesis, engineer change order, and hardware Trojan detection. Instead of basic Boolean matching, Non-exact Projective NPNP Boolean Matching allows to match two designs by not only negating and permuting inputs/outputs but also merging them or binding constants to inputs. Besides, the matching goal is extended to achieve the largest number of output equivalences between two designs. This kind of Boolean matching may get better quality in the related applications due to more flexibility and scalability, and the development of its algorithms is more challengeable. Hence, this problem has some research values. In ICCAD 2016 CAD contest, given two designs, participants need to decide how to permute, negate and merge designs' inputs/outputs or bind constants for achieving largest number of output equivalences. The score will be evaluated by how many outputs are equivalent and the runtime. We expect the contest result can improve industry applications and bring more research interests.
- [1]., “Boolean Matching in Logic Synthesis”, course slide, http://www.cs.nthu.edu.tw/~E;tingting/logic/ch5-2.pptGoogle Scholar
- [2]., Large-scale Boolean Matching, DATE, 2010Google Scholar
- [3]., A Survey of Boolean Matching Techniques for Library Binding, Design Automation Electronic System, ACM, 1997.Google Scholar
- [4]., Boolean Matching for LUT-Based Logic Blocks with Applications to Architecture Evaluation and Technology Mapping, CAD Integrated Circuit System, IEEE, 2006.Google Scholar
- [5]., Fast Filter-Based Boolean Matchers, Embedded Systems Letters, IEEE, 2013.Google Scholar
- [6]., Delta Syn: An efficient logic-difference optimizer for ECO synthesis, ICCAD, 2009.Google Scholar
- [7]., Match and replace-A functional ECO engine for multi-error circuit rectification, ICCAD, 2011.Google Scholar
- [8]., Application of BDDs in Boolean matching techniques for formal logic combinational verification, Software tools for Technology Transfer, 2001.Google Scholar
- [9]., Protecting against Cryptographic Trojans in FPGAs, FCCM, 2015.Google Scholar
- [10]., Signature based Boolean matching in the presence of don't care, DAC, 2008.Google Scholar
- [11]., Simulation and SAT-Based Boolean Matching for Large Boolean Networks, DAC, 2009.Google Scholar
- [12]., A Transform-Parametric Approach to Boolean Matching, CAD Integrated Circuit System, IEEE, 2009.Google Scholar
- [13]., Fast Boolean matching based on NPN classification, ICFPT, 2013.Google Scholar
- [14]., Reducing Structural Bias in Technology Map, ICCAD, 2005Google Scholar
- [15]., BooM: A Decision Procedure for Boolean Matching with Abstraction and Dynamic Learning, DAC, 2010Google Scholar
- [16]., Boolean Matching of Function Vectors with Strengthened Learning, ICCAD, 2010Google Scholar
- [17].IWLS 2015 Benchmarks, http://iwls.org/iwls2005/benchmarks.htmlGoogle Scholar
- [18].OpenCore, http://opencores.org/Google Scholar
- [19].Altera Advanced Synhesis Cookbook, http://www.altera.com/literature/manual/stx_cookbook.pdfGoogle Scholar
- [20].Cadence Genus™ Synhesis Solution and Conformal LEC, http://www.cadence.com/productsGoogle Scholar
- [21].CAD Contest 2016 Problem B, http://cad-contest-2016.el.cycu.edu.tw/problem_B/default.htmlGoogle Scholar
Index Terms
- ICCAD-2016 CAD contest in Non-exact Projective NPNP Boolean Matching and benchmark suite
Recommendations
Simulation and SAT-based Boolean matching for large Boolean networks
DAC '09: Proceedings of the 46th Annual Design Automation ConferenceBoolean matching is to check the equivalence of two target functions under input permutation and input/output phase assignment. This paper addresses the permutation independent (P-equivalent) Boolean matching problem. We will propose a matching ...
ICCAD-2013 CAD contest in placement finishing and benchmark suite
ICCAD '13: Proceedings of the International Conference on Computer-Aided DesignAt advanced technology nodes, highly-optimized placements need careful post-processing to further reduce interconnect length or optimize resource distribution, and therefore, high-performance legalization and detailed placement steps are essential for ...
ICCAD-2014 CAD contest in simultaneous CNF encoder optimization with SAT solver setting selection and benchmark suite
ICCAD '14: Proceedings of the 2014 IEEE/ACM International Conference on Computer-Aided DesignEfficiently solving numerous relevant circuit satisfiability (CircuitSAT) problems becomes a crucial industrial topic as the design scale expands. In this topic, we are especially interested in: how to select the best setting of the Boolean ...
Comments