Exclusive-Symmetry Aware Non-exact Projective Boolean Matching with Internal Nodes Matching

Abstract

Boolean matching is to determine whether two circuits can be equivalent under permutation and/or negation of their inputs and outputs It is important in circuit rectification and technology mapping Previous works discussed Boolean matching under the same numbers of inputs and outputs They are inapplicable to Non-exact Projective NPNP Boolean matching (NP3) in which inputs/outputs numbers of two circuits are different We use SAT-based method and functional properties (symmetry) to design a technique which is applicable to NP3 We design a technique to speed up convergence of Boolean matching procedure A newly defined functional property is used to remove more infeasible solutions Experimental data shows besides to NP3 the proposed technique has better capability of matching circuits with large number of inputs

Date of Award	2017 Jul 13
Original language	English
Supervisor	Meng-Hsun Tsai (Supervisor)