Transient bounding in networks with distributed and lumped parameters

For a general network with distributed parameter lines (described by telegraph equations) with nodes grounded by RC lumped elements, upper and lower bounds of voltage at any point are given. Thus, the problem of bounding the delay time in such networks comes to solve a system of nonlinear algebraic inequalities. For tree-type circuits, we give two algorithms, doing this rapidly and providing reasonable tight bounds. The results are of interest for timing analysis of MOS interconnection structures