A novel subcircuit extraction algorithm by recursive identification scheme

Author

Chang, Wei-Hsin ; Tzeng, Shuenn-Der ; Lee, Chen-Yi

Author_Institution

Dept. of Electron. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan

Volume

5

fYear

2001

fDate

2001

Firstpage

491

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

Keywords

circuit CAD; computational complexity; graph theory; identification; CAD; DECIDE; computer aided design; fast graph construction approach; large circuit netlist; recursive graph identification scheme; run time reduction; subcircuit extraction algorithm; technology independent algorithm; weighting function; Algorithm design and analysis; Circuits; Design engineering; MOSFETs; Partitioning algorithms; Testing; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on

Conference_Location

Sydney, NSW

Print_ISBN

0-7803-6685-9

Type

conf

DOI

10.1109/ISCAS.2001.922092

Filename

922092