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 language | English |
|---|---|
| Pages (from-to) | 739-742 |
| Number of pages | 4 |
| Journal | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems |
| Volume | 26 |
| Issue number | 4 |
| DOIs | |
| State | Published - 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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver