Abstract
The subcircuit extraction problem is to find all occurences of a pattern circuit S in a larger main circuit T. It is an important topic in many areas of VLSI circuit design. In this paper, we propose an algorithm to solve the problem. Our approach transforms both main and pattern circuits into wi=eighted directed graph consisting of positive weights on edges and then finds the all possible candidates of T for the pattern circuits by using the bit-parallel mechanism to filter out all subcircuits from the surviving main circuit which do not exactly match with S. The remaining circuits found in T will exactly match with S.