ICCAD-2016 CAD contest in Non-exact Projective NPNP Boolean Matching and benchmark suite

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]  Afshin Abdollahi.  Signature based Boolean matching in the presence of don’t cares , 2008, 2008 45th ACM/IEEE Design Automation Conference.

[2]  Sharad Malik,et al.  Application of BDDs in Boolean matching techniques for formal logic combinational verification , 2001, International Journal on Software Tools for Technology Transfer.

[3]  Robert K. Brayton,et al.  Boolean matching in logic synthesis , 1992, Proceedings EURO-DAC '92: European Design Automation Conference.

[4]  Jie-Hong Roland Jiang,et al.  Boolean matching of function vectors with strengthened learning , 2010, 2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[5]  Yu Hu,et al.  Fast Filter-Based Boolean Matchers , 2013, IEEE Embedded Systems Letters.

[6]  Christof Paar,et al.  Protecting against Cryptographic Trojans in FPGAs , 2015, 2015 IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines.

[7]  Giovanni Agosta,et al.  A Transform-Parametric Approach to Boolean Matching , 2009, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Zheng Huang,et al.  Fast Boolean matching based on NPN classification , 2013, 2013 International Conference on Field-Programmable Technology (FPT).

[9]  Kuo-Hua Wang,et al.  Simulation and SAT-based Boolean matching for large Boolean networks , 2009, 2009 46th ACM/IEEE Design Automation Conference.

[10]  Ruchir Puri,et al.  DeltaSyn: An efficient logic difference optimizer for ECO synthesis , 2009, 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers.

[11]  Jie-Hong Roland Jiang,et al.  BooM: A decision procedure for boolean matching with abstraction and dynamic learning , 2010, Design Automation Conference.

[12]  Shao-Lun Huang,et al.  Match and replace — A functional ECO engine for multi-error circuit rectification , 2011, 2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[13]  Jason Cong,et al.  Boolean matching for LUT-based logic blocks with applications toarchitecture evaluation and technology mapping , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Luca Benini,et al.  A survey of Boolean matching techniques for library binding , 1997, TODE.

[15]  A. Mishchenko,et al.  Reducing Structural Bias in Technology Mapping , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[16]  Igor L. Markov,et al.  Large-scale Boolean matching , 2010, 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010).