TRANSIENT BOUNDING IN NETWORKS WITH DISTRIBUTED AND LUMPED PARAMETERS

For a general network with distributed parameter lines (described by t elegraph equations) with nodes grounded by RC lumped elements, upper a nd lower bounds of voltage at any point are given. Thus, the problem o f 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.