摘要: The author addresses the problem of estimating inverse node-conductance matrix R a resistive network as in MOS LSI. main result is definition two bounding matrices. Since derivation these matrices depends solely on Tellegen's theorem, therefore applicable to all networks that obey Kirchoff's laws, whether are linear or nonlinear, time-invariant time-varying, reciprocal nonreciprocal. It observed upper bound tends be closer if tree-like. Likewise, lower consists mainly parallel connections identical resistors. From matrices, bounds delays can obtained. >
sci-hub.se 参考文章(10)
Shu-Park Chan, Introductory topological analysis of electrical networks Holt, Rinehart and Winston. ,(1969)
Franklin F. Kuo, Network Analysis and Synthesis ,(1962)
F. Hadlock, Finding a Maximum Cut of a Planar Graph in Polynomial Time SIAM Journal on Computing. ,vol. 4, pp. 221- 225 ,(1975) , 10.1137/0204019
R.J Duffin, Topology of series-parallel networks Journal of Mathematical Analysis and Applications. ,vol. 10, pp. 303- 318 ,(1965) , 10.1016/0022-247X(65)90125-3
John K. Ousterhout, Switch-Level Delay Models for Digital MOS VLSI design automation conference. pp. 489- 495 ,(1984) , 10.5555/800033.800851
Pak Chan, An extension of Elmore's delay IEEE Transactions on Circuits and Systems. ,vol. 33, pp. 1147- 1149 ,(1986) , 10.1109/TCS.1986.1085863
Robert Tarjan, Depth-First Search and Linear Graph Algorithms SIAM Journal on Computing. ,vol. 1, pp. 146- 160 ,(1972) , 10.1137/0201010
J. Wyatt, Signal delay in RC mesh networks IEEE Transactions on Circuits and Systems. ,vol. 32, pp. 507- 510 ,(1985) , 10.1109/TCS.1985.1085731
Paul Penfield, Signal Delay in RC Tree Networks IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. ,vol. 2, pp. 202- 211 ,(1983) , 10.1109/TCAD.1983.1270037
E. W. Dijkstra, A note on two problems in connexion with graphs Numerische Mathematik. ,vol. 1, pp. 269- 271 ,(1959) , 10.1007/BF01386390