TY - JOUR
T1 - Optimal wire-sizing function under the Elmore delay model with bounded wire sizes
AU - Lee, Yu Min
AU - Chen, Charlie Chung Ping
AU - Wong, D. F.
PY - 2002/11
Y1 - 2002/11
N2 - In this brief, we develop the optimal wire-sizing functions under the Elmore delay model with bounded wire sizes. Given a wire segment of length L, let f(x) be the width of the wire at position x, 0 ≤ x ≤ L. We show that the optimal wire-sizing function that minimizes the Elmore delay through the wire is f(x) = ae-bx, where a > 0 and b > 0 are constants that can be computed in O(1) time. In the case where lower bound (L > 0) and upper bound (U > 0) of the wire widths are given, we show that the optimal wire-sizing function f(x) is a truncated version of ae-bx that can also be determined in O(1) time. Our wire-sizing formula can be iteratively applied to optimally size the wire segments in a routing tree.
AB - In this brief, we develop the optimal wire-sizing functions under the Elmore delay model with bounded wire sizes. Given a wire segment of length L, let f(x) be the width of the wire at position x, 0 ≤ x ≤ L. We show that the optimal wire-sizing function that minimizes the Elmore delay through the wire is f(x) = ae-bx, where a > 0 and b > 0 are constants that can be computed in O(1) time. In the case where lower bound (L > 0) and upper bound (U > 0) of the wire widths are given, we show that the optimal wire-sizing function f(x) is a truncated version of ae-bx that can also be determined in O(1) time. Our wire-sizing formula can be iteratively applied to optimally size the wire segments in a routing tree.
KW - Elmore delay
KW - Optimal
KW - Wire sizing
UR - http://www.scopus.com/inward/record.url?scp=0036861749&partnerID=8YFLogxK
U2 - 10.1109/TCSI.2002.804598
DO - 10.1109/TCSI.2002.804598
M3 - Journal article
AN - SCOPUS:0036861749
SN - 1057-7122
VL - 49
SP - 1671
EP - 1677
JO - IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
JF - IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
IS - 11
ER -