Efficient Methods for Large Resistor Networks

被引:68
作者
Rommes, Joost [1 ]
Schilders, Wil H. A. [1 ]
机构
[1] NXP Semicond, NL-5656 AE Eindhoven, Netherlands
关键词
Approximate minimum degree; Cholesky decomposition; electro static discharge analysis; graph algorithms; large-scale systems; model order reduction; parasitic extraction; path resistance; resistor networks; strongly connected components; two-connected components; REALIZABLE REDUCTION; INTERCONNECT; ALGORITHM; MODEL;
D O I
10.1109/TCAD.2009.2034402
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Large resistor networks arise during the design of very-large-scale integration chips as a result of parasitic extraction and electro static discharge analysis. Simulating these large parasitic resistor networks is of vital importance, since it gives an insight into the functional and physical performance of the chip. However, due to the increasing amount of interconnect and metal layers, these networks may contain millions of resistors and nodes, making accurate simulation time consuming or even infeasible. We propose efficient algorithms for three types of analysis of large resistor networks: 1) computation of path resistances; 2) computation of resistor currents; and 3) reduction of resistor networks. The algorithms are exact, orders of magnitude faster than conventional approaches, and enable simulation of very large networks.
引用
收藏
页码:28 / 39
页数:12
相关论文
共 37 条
[31]  
ROMMES J, 2008, SCI COMP EL ENG ESP
[32]  
SCHRIJVER A, 2003, COMBINATORIAL OPTIMI, pCH15
[33]  
Sheehan B.N., 1999, PROC INT C COMPUTER, P200
[34]   Realizable reduction of RC networks [J].
Sheehan, Bernard N. .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2007, 26 (08) :1393-1407
[35]  
Yang F, 2008, COMMUN COMPUT PHYS, V3, P376
[36]  
YE Z, 2008, MAN ORG REV WORKSH S
[37]   BALANCED DECOMPOSITIONS OF SPARSE SYSTEMS FOR MULTILEVEL PARALLEL-PROCESSING [J].
ZECEVIC, AI ;
SILJAK, DD .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS, 1994, 41 (03) :220-233