Fast estimation of timing yield bounds for process variations

Ruiming Chen*, Hai Zhou

*Corresponding author for this work

Research output: Contribution to journalArticle

6 Scopus citations

Abstract

With aggressive scaling down of feature sizes in VLSI fabrication, process variation has become a critical issue in designs. We show that two necessary conditions for the "Max" operation are actually not satisfied in the moment matching based statistical timing analysis approaches. We propose two correlationaware block-based statistical timing analysis approaches that keep these necessary conditions, and show that our approaches always achieve the lower bound and the upper bound on the timing yield. Our approach combining with moment-matching based statistical static timing analysis (SSTA) approaches can efficiently estimate the maximal possible errors of moment-matching-based SSTA approaches.

Original languageEnglish (US)
Article number4453949
Pages (from-to)241-248
Number of pages8
JournalIEEE Transactions on Very Large Scale Integration (VLSI) Systems
Volume16
Issue number3
DOIs
StatePublished - Mar 1 2008

Keywords

  • Process variations
  • Statistical static timing analysis (SSTA)
  • Statistical timing

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Fast estimation of timing yield bounds for process variations'. Together they form a unique fingerprint.

  • Cite this