SubHunter: A High-Performance and Scalable Sub-Circuit Recognition Method with Prüfer-Encoding
Hong-Yan Su, Chih-Hao Hsu and Yih-Lang Li
Institute of Computer Science and Engineering, National Chiao Tung University, Taiwan
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. The SR problem can be formulated as subgraph iso-morphism problem. Performance of previous works is not scalable as the complexities of modern designs increase. In this paper we propose a novel Prüfer-encoding based SR algorithm that per-forms scalable and high–performance sub-circuit matching. 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 problems. A pre-filtering strategy is applied before matching to remove the sub-circuits that are not likely to be matched. 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 and detect all the sub-circuits as well. As the circuit size increases, we can also achieve near linear runtime growth that outperforms the exponen-tial growth for SubGemini, showing the scalability of the proposed algorithm.
Keywords: Sub-circuit recognition, Graph isomorphism, Prüfer encoding.
Full Text (PDF)