SubHunter: A Prüfer-Encoding Based High Performance and Scalable Sub-Circuit Recognition Method

• Main Authors: Hsu, Chih-Hao, 許智皓
• Other Authors: Li, Yih-Lang
• Format: Others
• Language: zh-TW
• Published: 2014
• Online Access: http://ndltd.ncl.edu.tw/handle/75maz9

碩士 === 國立交通大學 === 資訊科學與工程研究所 === 103 === Sub-circuit recognition (SR) is a problem of recognizing sub-circuits within a given circuit and is a fundamental component in simulation, verification and testing of computer-aided design. Since the SR problem can be formulated as subgraph isomorphism problem, the performance and scalability of previous works thus work poorly in current designs. In this paper we propose a novel high performance and scalable SR algorithm based on Prüfer encoding named SubHunter. Several techniques including tree structure partition, tree cutting and circuit graph encoding are proposed herein to decompose the SR problem into several small sub-sequence matching problem. A pre-filtering strategy is applied before matching to keep only possible candidates. Thereafter a fast branch and bound approach is developed to identify all the sub-circuits within the given circuit. Experimental results show that SubHunter can achieve better performance than SubGemini while detecting all the sub-circuits. We can also achieve near linear runtime growth rate comparing to exponential for SubGemini as the circuit size increase and thus shows the scalability of our algorithm. Compare to previous works, SubHunter also has the ability to recognize several sub-circuits at the same time and can further improve performance.