Abstract
Crosstalk is generally recognized as a major problem in IC design. This paper presents a novel approach to the efficient measurement of the effect of crosstalk on the delay of a net using an algorithm whose worst-case complexity is polynomial-time in the number of nets. The cost of the algorithm is seem to be O-(nlogn) in practice, where n is the number of nets, and it is amenable to being incorporated into the inner loop of a timing optimizer. To illustrate this, the method is applied to reduce the effects of crosstalk in channel routing, where it is seen to give an average improvement of 23% in the delay in a channel as compared to the worst case, as measured by SPICE.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the IEEE International Conference on VLSI Design |
| Publisher | IEEE |
| Pages | 364-369 |
| Number of pages | 6 |
| State | Published - Jan 1 2000 |
| Event | The 13th International Conference on VLSI Design: Wireless and Digital Imaging in the Millennium - Calcutta, India Duration: Jan 3 2000 → Jan 7 2000 |
Other
| Other | The 13th International Conference on VLSI Design: Wireless and Digital Imaging in the Millennium |
|---|---|
| City | Calcutta, India |
| Period | 1/3/00 → 1/7/00 |