Simple closed-form bounds for signal propagation delay in linear

tree models for MOS interconnect were derived in [1]. This paper shows that these bounds are also valid for the more general class of linear networks known as

meshes, which are useful as models for portions of MOS logic circuits that cannot be represented as

trees.