Statistical timing analysis using bounds

Aseem Agarwal, David Blaauw, Vladimir Zolotov, Sarma Vrudhula

Research output: Chapter in Book/Report/Conference proceedingConference contribution

38 Citations (Scopus)

Abstract

The growing impact of within-die process variation has created the need for statistical timing analysis, where gate delays are modeled as random variables. Statistical timing analysis has traditionally suffered from exponential run time complexity with circuit size, due to the dependencies created by reconverging paths in the circuit. In this paper, we propose a new approach to statistical timing analysis which uses statistical bounds. First, we provide a formal definition of the statistical delay of a circuit and derive a statistical timing analysis method from this definition. Since this method for finding the exact statistical delay has exponential run time complexity with circuit size, we also propose a new method for computing statistical bounds which has linear run time complexity. We prove the correctness of the proposed bounds. Since we provide both a lower and upper bound on the true statistical delay, we can determine the quality of the bounds. The proposed methods were implemented and tested on benchmark circuits. The results demonstrate that the proposed bounds have only a small error.

Original languageEnglish (US)
Title of host publicationProceedings -Design, Automation and Test in Europe, DATE
Pages62-67
Number of pages6
DOIs
StatePublished - 2003
EventDesign, Automation and Test in Europe Conference and Exhibition, DATE 2003 - Munich, Germany
Duration: Mar 3 2003Mar 7 2003

Other

OtherDesign, Automation and Test in Europe Conference and Exhibition, DATE 2003
CountryGermany
CityMunich
Period3/3/033/7/03

Fingerprint

Networks (circuits)
Random variables

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Agarwal, A., Blaauw, D., Zolotov, V., & Vrudhula, S. (2003). Statistical timing analysis using bounds. In Proceedings -Design, Automation and Test in Europe, DATE (pp. 62-67). [1253588] https://doi.org/10.1109/DATE.2003.1253588

Statistical timing analysis using bounds. / Agarwal, Aseem; Blaauw, David; Zolotov, Vladimir; Vrudhula, Sarma.

Proceedings -Design, Automation and Test in Europe, DATE. 2003. p. 62-67 1253588.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Agarwal, A, Blaauw, D, Zolotov, V & Vrudhula, S 2003, Statistical timing analysis using bounds. in Proceedings -Design, Automation and Test in Europe, DATE., 1253588, pp. 62-67, Design, Automation and Test in Europe Conference and Exhibition, DATE 2003, Munich, Germany, 3/3/03. https://doi.org/10.1109/DATE.2003.1253588
Agarwal A, Blaauw D, Zolotov V, Vrudhula S. Statistical timing analysis using bounds. In Proceedings -Design, Automation and Test in Europe, DATE. 2003. p. 62-67. 1253588 https://doi.org/10.1109/DATE.2003.1253588
Agarwal, Aseem ; Blaauw, David ; Zolotov, Vladimir ; Vrudhula, Sarma. / Statistical timing analysis using bounds. Proceedings -Design, Automation and Test in Europe, DATE. 2003. pp. 62-67
@inproceedings{d7a5c088a6bc45fdbbbe55703ad8d3e9,
title = "Statistical timing analysis using bounds",
abstract = "The growing impact of within-die process variation has created the need for statistical timing analysis, where gate delays are modeled as random variables. Statistical timing analysis has traditionally suffered from exponential run time complexity with circuit size, due to the dependencies created by reconverging paths in the circuit. In this paper, we propose a new approach to statistical timing analysis which uses statistical bounds. First, we provide a formal definition of the statistical delay of a circuit and derive a statistical timing analysis method from this definition. Since this method for finding the exact statistical delay has exponential run time complexity with circuit size, we also propose a new method for computing statistical bounds which has linear run time complexity. We prove the correctness of the proposed bounds. Since we provide both a lower and upper bound on the true statistical delay, we can determine the quality of the bounds. The proposed methods were implemented and tested on benchmark circuits. The results demonstrate that the proposed bounds have only a small error.",
author = "Aseem Agarwal and David Blaauw and Vladimir Zolotov and Sarma Vrudhula",
year = "2003",
doi = "10.1109/DATE.2003.1253588",
language = "English (US)",
pages = "62--67",
booktitle = "Proceedings -Design, Automation and Test in Europe, DATE",

}

TY - GEN

T1 - Statistical timing analysis using bounds

AU - Agarwal, Aseem

AU - Blaauw, David

AU - Zolotov, Vladimir

AU - Vrudhula, Sarma

PY - 2003

Y1 - 2003

N2 - The growing impact of within-die process variation has created the need for statistical timing analysis, where gate delays are modeled as random variables. Statistical timing analysis has traditionally suffered from exponential run time complexity with circuit size, due to the dependencies created by reconverging paths in the circuit. In this paper, we propose a new approach to statistical timing analysis which uses statistical bounds. First, we provide a formal definition of the statistical delay of a circuit and derive a statistical timing analysis method from this definition. Since this method for finding the exact statistical delay has exponential run time complexity with circuit size, we also propose a new method for computing statistical bounds which has linear run time complexity. We prove the correctness of the proposed bounds. Since we provide both a lower and upper bound on the true statistical delay, we can determine the quality of the bounds. The proposed methods were implemented and tested on benchmark circuits. The results demonstrate that the proposed bounds have only a small error.

AB - The growing impact of within-die process variation has created the need for statistical timing analysis, where gate delays are modeled as random variables. Statistical timing analysis has traditionally suffered from exponential run time complexity with circuit size, due to the dependencies created by reconverging paths in the circuit. In this paper, we propose a new approach to statistical timing analysis which uses statistical bounds. First, we provide a formal definition of the statistical delay of a circuit and derive a statistical timing analysis method from this definition. Since this method for finding the exact statistical delay has exponential run time complexity with circuit size, we also propose a new method for computing statistical bounds which has linear run time complexity. We prove the correctness of the proposed bounds. Since we provide both a lower and upper bound on the true statistical delay, we can determine the quality of the bounds. The proposed methods were implemented and tested on benchmark circuits. The results demonstrate that the proposed bounds have only a small error.

UR - http://www.scopus.com/inward/record.url?scp=18144420677&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=18144420677&partnerID=8YFLogxK

U2 - 10.1109/DATE.2003.1253588

DO - 10.1109/DATE.2003.1253588

M3 - Conference contribution

AN - SCOPUS:18144420677

SP - 62

EP - 67

BT - Proceedings -Design, Automation and Test in Europe, DATE

ER -