Static timing analysis is a key process to guarantee timing closure for modern IC designs. Nevertheless, fast growing design complexities and increasing on-chip variations complicate this process. To capture more accurate timing performance of a design, common path pessimism removal is prevalent to eliminate artificially induced pessimism in clock paths during timing analysis. To avoid exhaustive exploration on all paths in a design, in this paper, we present a novel timing analysis framework removing common path pessimism based on block-based static timing analysis, timing graph reduction, and dynamic bounding. Experimental results show that the proposed method is highly scalable, especially with short runtimes for large-scale designs. Moreover, our approach outperforms TAU 2014 timing contest winners, generating accurate results and achieving more than 2.13X speedups.
[1]
K. Ravindran,et al.
First-Order Incremental Block-Based Statistical Timing Analysis
,
2004,
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[2]
Rakesh Chadha,et al.
Static Timing Analysis for Nanometer Designs: A Practical Approach
,
2009
.
[3]
Jin Hu,et al.
TAU 2014 contest on removing common path pessimism during timing analysis
,
2014,
ICCAD.
[4]
Jindrich Zejda,et al.
General framework for removal of clock network pessimism
,
2002,
IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002..
[5]
Paul Cunningham,et al.
Clock Concurrent Optimization
,
2009
.