arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0710.4697cs.AR
收藏

基于统计时序的门控优化

Statistical Timing Based Optimization using Gate Sizing

Aseem Agarwal, Kaviraj Chopra, David Blaauw

摘要:

管芯内工艺变化的增加的主导性激发了统计静态时序分析(SSTA)领域,并且提高了对基于SSTA的电路优化的需求。在本文中,我们提出了一种新的灵敏度为基础的,统计门定径方法。由于电路延迟分布的变化门大小的变化的蛮力计算是计算昂贵的,我们提出了一个有效的和准确的修剪算法。修剪算法是基于一种新的理论的扰动界,这是减少,因为它们通过电路传播。这允许在不完全传播其扰动的情况下修剪门灵敏度。我们将我们提出的优化算法应用于ISCAS基准电路,并证明了所提出的方法的准确性和效率。我们的研究结果表明,在相同的电路面积的99百分位电路延迟高达10.5%的改善,使用建议的统计优化器和运行时间改善高达56倍的蛮力的方法相比。

英文摘要:

The increased dominance of intra-die process variations has motivated the field of Statistical Static Timing Analysis (SSTA) and has raised the need for SSTA-based circuit optimization. In this paper, we propose a new sensitivity based, statistical gate sizing method. Since brute-force computation of the change in circuit delay distribution to gate size change is computationally expensive, we propose an efficient and exact pruning algorithm. The pruning algorithm is based on a novel theory of perturbation bounds which are shown to decrease as they propagate through the circuit. This allows pruning of gate sensitivities without complete propagation of their perturbations. We apply our proposed optimization algorithm to ISCAS benchmark circuits and demonstrate the accuracy and efficiency of the proposed method. Our results show an improvement of up to 10.5% in the 99-percentile circuit delay for the same circuit area, using the proposed statistical optimizer and a run time improvement of up to 56x compared to the brute-force approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑