A unified multi-corner multi-mode static timing analysis engine

Authors:
Jing-Jia Nian;Shih-Heng Tsai;Chung-Yang (Ric) Huang
Affiliations:
GIEE, National Taiwan University, Taiwan;GIEE, National Taiwan University, Taiwan;GIEE, National Taiwan University, Taiwan
Venue:
Proceedings of the 2010 Asia and South Pacific Design Automation Conference
Year:
2010

Citing 8
Cited 1

Parameter variations and impact on circuits and microarchitecture

Proceedings of the 40th annual Design Automation Conference
Design and reliability challenges in nanometer technologies

Proceedings of the 41st annual Design Automation Conference
Efficient computation of the worst-delay corner

Proceedings of the conference on Design, automation and test in Europe
Parameterized timing analysis with general delay models and arbitrary variation sources

Proceedings of the 45th annual Design Automation Conference
Challenges in gate level modeling for delay and SI at 65nm and below

Proceedings of the 45th annual Design Automation Conference
Adjustment-based modeling for statistical static timing analysis with high dimension of variability

Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Statistical Timing Analysis: From Basic Principles to State of the Art

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A Linear-Time Approach for Static Timing Analysis Covering All Process Corners

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

A fast approach for static timing analysis covering all PVT corners

Proceedings of the 48th Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we proposed a unified Multi-Corner Multi-Mode (MCMM) static timing analysis (STA) engine that can efficiently compute the worst-case delay of the process corners in various very large scaled circuits. Our key contributions include: (1) a seamless integration of the pathand parameter-based branch-and-bound algorithms so that the engine is very robust for different kinds of circuits, (2) an improved search space pruning technique, (3) a simple yet efficient critical path delay bound for the initial search space pruning. Our experimental results show that our engine can significantly outperform the prior MCMM STA approaches in various benchmark circuits with different number of process parameters.