Two-pole analysis of interconnection trees

Andrew B. Kahng, S. Muddu

2002 · 54 citations · 14 references

Concepts

TL;DR

The study aims to develop a two‑pole moment‑matching method for interconnect trees, deriving non‑uniform equivalent circuits that match the distributed line transfer function up to the second term. They model the interconnect network with non‑uniform lumped segments and apply a two‑pole methodology, deriving recursive admittance equations that yield exact first‑ and second‑moment expressions for the tree’s transfer function. The method produces delay estimates within 13% of SPICE, offering improved accuracy and reduced simulation complexity for larger routing trees in multi‑chip module designs.

Abstract

We address the two-pole simulation of interconnect trees via the moment matching technique. We simulate the interconnect network by modeling the distributed lines with non-uniform m lumped segments and using the two-pole methodology. To this end, we derive new non-uniform equivalent circuits which match the general distributed line transfer function up to the second term. Using the recursive equation for the admittance of a tree, we give the exact expressions for the first and second moments of the transfer function of the interconnect tree. Our results show that delay estimates using our method are within 13% of SPICE-computed delays. As routing trees become bigger and interconnection lines become longer, e.g., in MCM design, our approach has advantages in both accuracy and simulation complexity.

References

14