Abstract
An efficient solution to the wire sizing problem (WSP) using the Elmore delay model is proposed. Two formulations of the problem are put forth: in the first, the minimum interconnect delay is sought, while in the second, we minimize the net delay under delay constraints at the leaf nodes; previous approaches solve only the former problem. Theoretical results on these problems are proved, and a sensitivity-based algorithm is devised. It is shown experimentally that the second formulation provides significantly better engineering solutions.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 387-391 |
| Number of pages | 5 |
| Journal | Proceedings - Design Automation Conference |
| DOIs | |
| State | Published - 1994 |
| Event | Proceedings of the 31st Design Automation Conference - San Diego, CA, USA Duration: Jun 6 1994 → Jun 10 1994 |
Fingerprint
Dive into the research topics of 'RC interconnect optimization under the Elmore delay model'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS