Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/top-k-aggressors-sets-in-delay-noise-analysis-HBCrnuCIM7
References (15)
-
K. Shepard, V. Narayanan, P. Elmendorf, Gutuan Zheng (1997)
Global Harmony: coupled noise analysis for full-chip RC interconnect networks1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD)
-
J. Croix, D. Wong (2003)
Blade and razor: cell and interconnect delay analysis using current-based modelsProceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451)
-
(2003)
Sapatnekar,‘‘An efficient algorithm for calculating the worstcase delay due to crosstalk, -
H. Zhou (2003)
Timing analysis with crosstalk is a fixpoint on a complete latticeIEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 22
-
R. Levy, D. Blaauw, G. Braca, A. Dasgupta, A. Grinshpon, C. Oh, Boaz Orshav, S. Sirichotiyakul, V. Zolotov (2000)
ClariNet: a noise analysis tool for deep submicron designProceedings 37th Design Automation Conference
-
Donald Chai, A. Kondratyev, Y. Ran, Ken Tseng, Yosinori Watanabe, M. Marek-Sadowska (2003)
Temporofunctional crosstalk noise analysisProceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451)
-
K. Shepard, V. Narayanan (1996)
Noise in deep submicron digital designProceedings of International Conference on Computer Aided Design
-
K. Belkhale, Alexander Suess (1995)
Timing analysis with known false sub graphsProceedings of IEEE International Conference on Computer Aided Design (ICCAD)
-
Venkatesan Rajappan, S. Sapatnekar (2003)
An efficient algorithm for calculating the worst-case delay due to crosstalkProceedings 21st International Conference on Computer Design
-
S. Sapatnekar (2000)
A timing model incorporating the effect of crosstalk on delay andits application to optimal channel routingIEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 19
-
Paul Gross, Ravishankar Arunachalam, K. Rajagopal, L. Pileggi (1998)
Determination of worst-case aggressor alignment for delay calculation1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)
-
(2000)
A robust celllevel crosstalk delay change analy -
Igor Keller, Ken Tseng, N. Verghese (2004)
A robust cell-level crosstalk delay change analysisIEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004.
-
S. Sirichotiyakul, D. Blaauw, C. Oh, R. Levy, V. Zolotov, Jingyan Zuo (2001)
Driver modeling and alignment for worst-case delay noiseProceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232)
-
Tong Xiao, M. Marek-Sadowska (2000)
Worst Delay Estimation in Crosstalk Aware Static Timing Analysis
- Datasource
- Association for Computing Machinery
- Copyright
- Copyright © 2007 by ACM Inc.
- ISBN
- 978-1-59593-627-1
- doi
- 10.1145/1278480.1278523
- Publisher site
- See Article on Publisher Site
Abstract
10.3 Top-k Aggressors Sets in Delay Noise Analysis Ravikishore Gandikota, Kaviraj Chopra, David Blaauw, Dennis Sylvester, Murat Becer* University of Michigan, Ann Arbor, MI. email: {gravkis, kaviraj, blaauw, dennis}@eecs.umich.edu *CLK Design Automation, Littleton, MA. email: murat@clkda.com ABSTRACT We present, in this paper, novel algorithms to compute the set of œtop-k  aggressors in a design. We show that the computation of the set of top-k aggressors is non-trivial, since we must consider all permutations of aggressors that are coupled to a critical path. Also, different sets of aggressors contribute different amounts of noise to each critical path and a brute-force enumeration to obtain the set of top-k aggressors has impractical runtime. Our proposed approach uses two key techniques to reduce the runtime complexity: Firstly, we model the delay noise propagated from a victim net to its fanout net by a so-called pseudo aggressor, which simplifies our problem formulation significantly. Secondly, we define a dominance property for aggressor sets, which imposes a partial ordering on the aggressor sets and allows us to efficiently prune the enumeration space. We then demonstrate the effectiveness of our proposed algorithm on benchmark circuits. a 3 a 2 a 1 v 1 Figure 1.