Computing Signal Delay in General RC Networks by Tree/Link Partitioning

Most RC simulators only handle tree networks, not arbitrary networks. We present an algorithm for computing signal delays in general RC networks using the RC-tree computation as the primary operation. We partition a given network into a spanning tree and link branches. Then we compute the signal delay of the spanning tree, and update the signal delay as we incrementally add the links back to reconstruct the original network. If m is the number of link branches, this algorithm requires m(m+1)/2 updated and m+1 tree delay evaluations. all the tree delay evaluations involve computing signal delays with the same resistive spanning tree, but with different values for the capacitors.