|
這應該是APR的論文 M0 X; b5 B$ s( K' I
* S6 ?/ r, w( C& x, y7 L
+ _; s2 n1 E. S1 {Abstract:
2 K' `8 V% D/ i2 ^+ nParasitic interconnect corner methods are known to
/ [. F- R# n5 S4 i& w1 tbe inaccurate. This paper explains the sources of their errors and
2 `) }: _* t" f% |8 r7 Eshows that errors in excess of 22% can occur in the predicted1 J7 q7 q0 E( C) e+ B
corner delays of a multi-layer stage in the presence of process
6 U- p$ `* a( I7 ivariations. It is shown that exhaustive corner search methods are
/ u% T- ]% \7 |: v1 Z0 A! S; winfeasible in practice as they have an exponential complexity in; n. Q, ?5 _. `8 B& V, J
terms of required SPICE simulations with respect to the number4 \' C- n& e0 F+ D5 |0 T( ~2 L
of layers a stage is routed through. This exponential complexity& b: U, c" Z j! K. _
is reduced to a linear one with a new simulation-based search
# }3 b* Z& q. N: |' l) {3 emethod with the aid of stage delay properties. The ideas behind
6 c4 O3 v7 x+ M [0 vthe simulation-based methodology are shown to be expandable
4 |9 Q, ]; d, D4 m8 K2 dto an analytical-based multi-layer performance corner location
* y% D$ e$ d& Ymethodology. The simulated best/worst case delays based on these$ `7 _! @# R. {* O7 m
analytical corners produce errors below 4% as compared to the4 s( s! Q' z0 t3 J) T }8 `; J; _
exhaustive search simulation based method.
- g: \3 L# B1 M9 E: o
2 w) _7 c9 Y' I' S0 L1 r[ 本帖最後由 masonchung 於 2008-4-22 12:01 AM 編輯 ] |
本帖子中包含更多資源
您需要 登錄 才可以下載或查看,沒有帳號?申請會員
x
|