|
ABSTRACT
There has been substantial work on interconnect sizing algorithms for delay and area optimization in terms of the Elmore delay. Recently, however, signal integrity issues have become of equal or greater importance than delay and area for deep submicron designs. Modeling signal integrity requires more than the Elmore delay approximation, especially when interconnect inductance effects are considered. This paper studies a new interconnect sizing formulaðtion with signal attenuation and transition time constraints that capðtures the same global optimality as the Elmore delay based approaches. With the signal attenuation (or the signal transition time) modeled by the second order central moment of the circuit response, we formulate a provably posynomial optimization probðlem for RC trees such that the well studied algorithms for geometric programming can be applied with guaranteed convergence to a gloðbal minima. For RCL cases we demonstrate that this formulation remains convex and posynomial under reasonable conditions. Suffiðcient conditions are given in terms of the technology parameters and termination conditions.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
M. Celik and L. T. Pileggi, "Metrics and bounds of phase delay and signal attenuation in RC(L) clock trees", IEEE Trans. Computer-Aided Design, vol. 18, no. 3, Mar. 1999
|
 |
2
|
Chung-Ping Chen , Chris C. N. Chu , D. F. Wong, Fast and exact simultaneous gate and wire sizing by Lagrangian relaxation, Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, p.617-624, November 08-12, 1998, San Jose, California, United States
[doi> 10.1145/288548.289097]
|
| |
3
|
|
| |
4
|
|
| |
5
|
|
 |
6
|
|
| |
7
|
J. G. Ecker, "Geometric programming: Methods, Computations, and Applications", SIAM review, vol. 22, no. 3, pp. 338-362, July 1980
|
| |
8
|
W. C. Elmore, "The transient response of damped linear networks with particular regard to wideband amplifiers," Journal of Applied Physics, vol. 19, no. 1, 1998
|
| |
9
|
J. P. Fishburn and A. E. Dunlop, "TILOS: A posynomial programming approach to transistor sizing", Proc. Init. Conf. on Computer-Aided Design, Nov. 1985
|
| |
10
|
R. Gupta, B. Tutuianu, L. T. Pileggi, "The Elmore Delay as a Bound for RC trees with Generalized Input Signals," IEEE trans. Computer-Aided Design, vol. 16, no. 1, 1997
|
| |
11
|
R. Kay and L. T. Pileggi, "EWA: Efficient Wiring-Sizing Algorithm for Signal Nets and Clock Nets", IEEE trans. Computer-AIded Design, vol. 17 No. 1, Jan. 1998
|
| |
12
|
N. Menezes, R. Baldick, and L. T. Pileggi, "A sequential quadratic programming approach to concurrent gate and interconnect sizing," IEEE trans. Computer-Aided Design, Aug. 1997
|
 |
13
|
|
| |
14
|
S. S. Sapatnekar, "Wire sizing as a convex optimization problem: exploring the area-delay tradeoff", IEEE trans. Computer-Aided Design, August 1996
|
| |
15
|
Q. Zhu and W. M. Dai, "High-speed clock network sizing optimization based on distributed RC and Lossy RLC interconnect models", IEEE trans. Computer Aided Design, vol. 15, no. 9, Sept. 1996
|
| |
16
|
|
|