Sciweavers

11 search results - page 1 / 3
» Binning optimization based on SSTA for transparently-latched...
Sort
View
ICCAD
2009
IEEE
117views Hardware» more  ICCAD 2009»
13 years 2 months ago
Binning optimization based on SSTA for transparently-latched circuits
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
Min Gong, Hai Zhou, Jun Tao, Xuan Zeng
ASPDAC
2009
ACM
122views Hardware» more  ASPDAC 2009»
13 years 11 months ago
Tolerating process variations in high-level synthesis using transparent latches
—Considering process variability at the behavior synthesis level is necessary, because it makes some instances of function units slower and others faster, resulting in unbalanced...
Yibo Chen, Yuan Xie
FPGA
2010
ACM
276views FPGA» more  FPGA 2010»
14 years 1 months ago
Accelerating Monte Carlo based SSTA using FPGA
Monte Carlo based SSTA serves as the golden standard against alternative SSTA algorithms, but it is seldom used in practice due to its high computation time. In this paper, we acc...
Jason Cong, Karthik Gururaj, Wei Jiang, Bin Liu, K...
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
13 years 8 months ago
Optimal latch mapping and retiming within a tree
We propose a technology mapping algorithm that takes existing structural technology-mapping algorithms based on dynamic programming [1,3,4] and extends them to retime pipelined cir...
Joel Grodstein, Eric Lehman, Heather Harkness, Her...
ASPDAC
2009
ACM
161views Hardware» more  ASPDAC 2009»
13 years 11 months ago
Risk aversion min-period retiming under process variations
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
Jia Wang, Hai Zhou