Name
Abstract | ||
|---|---|---|
Extracting the inductance of complex interconnect topologiesis a formidable task, and simulating the resulting dense partialinductance matrix is even more difficult. Furthermore, it is wellknown that simply discarding smallest terms to sparsify the inductancematrix can render the partial inductance matrix indefiniteand result in an unstable circuit model. In this paper, wedescribe a methodology for incrementally generating a sparsepartial inductance matrix based on using moments about s=0 todetermine when a sufficient number of mutual inductances havebeen captured. The minimally required mutual inductances areextracted for a provably stable model. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1109/DAC.1997.597132 | DAC |
Keywords | Field | DocType |
sparse partial inductance extraction,smallest term,partial inductance matrix indefiniteand,sufficient number,mutual inductance,sparsepartial inductance matrix,dense partialinductance matrix,provably stable model,unstable circuit model,formidable task,computational modeling,integer linear programming,covering problems,circuit topology,inductance,sparse matrices,helium | Inductance,Matrix (mathematics),Computer science,Circuit extraction,Electronic engineering,Interconnection,Derivation of self inductance,Sparse matrix,Covering problems,Topology (electrical circuits) | Conference |
ISSN | ISBN | Citations |
0738-100X | 0-7803-4093-0 | 34 |
PageRank | References | Authors |
4.40 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhijiang He | 1 | 34 | 4.40 |
| Mustafa Celik | 2 | 702 | 62.15 |
| Lawrence Pileggi | 3 | 358 | 31.47 |