Bounds on signal delay in RC mesh networks

The author addresses the problem of estimating the inverse of the node-conductance matrix R of a resistive network as in MOS LSI. The main result is the definition of two bounding matrices. Since the derivation of these matrices depends solely on Tellegen´s theorem, the result is therefore applicable to all resistive networks that obey Kirchoff´s laws, whether the networks are linear or nonlinear, time-invariant or time-varying, reciprocal or nonreciprocal. It is observed that the upper bound matrix tends to be closer to R if the resistive network is tree-like. Likewise, the lower bound matrix tends to be closer to R if the resistive network consists mainly of parallel connections of identical resistors. From the bounding matrices, bounds on the delays can be obtained