Name
Abstract | ||
|---|---|---|
To extract subcircuits from a large circuit netlist is an important task that contributes a lot in many fields of computer aided design. In this paper, a novel subcircuit extraction algorithm-DECIDE, based on a recursive graph identification scheme as well as a fast graph construction approach is presented. Cooperating with a proper weighting function that assigns a weighting value to each node, the number of nodes needed to be recognized decreases such that the required run time is reduced significantly. In addition, the proposed algorithm is technology independent and can be applied to handle circuits of any design style |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1109/ISCAS.2001.922092 | ISCAS (5) |
Keywords | Field | DocType |
technology independent algorithm,cad,identification,fast graph construction approach,weighting function,large circuit netlist,computational complexity,computer aided design,circuit cad,recursive graph identification scheme,subcircuit extraction algorithm,run time reduction,graph theory,decide,very large scale integration,algorithm design and analysis,circuits,weight function,testing | Graph theory,Netlist,Weighting,Algorithm design,Identification scheme,Computer science,Algorithm,Very-large-scale integration,Recursion,Computational complexity theory | Conference |
Volume | ISBN | Citations |
5 | 0-7803-6685-9 | 7 |
PageRank | References | Authors |
0.66 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei-Hsin Chang | 1 | 105 | 10.25 |
| Shuenn-der Tzeng | 2 | 7 | 0.66 |
| Chen-Yi Lee | 3 | 1211 | 152.40 |