Skip to main navigation Skip to search Skip to main content

Probabilistic transitive-closure ordering and its application on variational buffer insertion

  • University of California at Los Angeles

Research output: Contribution to journalArticlepeer-review

Abstract

We propose a provably transitive-closure ordering rule with theoretical foundations to prune suboptimal design solutions in the presence of process variations. As an example, this probabilistic ordering rule is applied to develop an efficient variational buffering algorithm. Compared to the conventional deterministic approach, variational buffering improves the parametric timing yield by 15.7% on average. This transitive-closure ordering rule may be leveraged to solve other computer-aided-design problems considering process variation effects.

Original languageEnglish
Pages (from-to)739-742
Number of pages4
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Volume26
Issue number4
DOIs
StatePublished - Apr 2007

Keywords

  • Buffering
  • Closure
  • Probabilistic ordering
  • Process variation
  • Transitive ordering
  • Variation metric comparison

Fingerprint

Dive into the research topics of 'Probabilistic transitive-closure ordering and its application on variational buffer insertion'. Together they form a unique fingerprint.

Cite this