Leakage minimization of digital circuits using gate sizing in the presence of process variations

被引:10
作者
Bhardwaj, Sarvesh [1 ]
Vrudhula, Sarma [2 ]
机构
[1] Synopsys Inc, Mountain View, CA 94043 USA
[2] Ira A Fulton Sch Engn, Dept Comp Sci & Engn, Tempe, AZ 85281 USA
基金
美国国家科学基金会;
关键词
circuit optimization; leakage power; process variations;
D O I
10.1109/TCAD.2008.916341
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a novel gate-sizing methodology to minimize the leakage power in the presence of process variations. The method is based on modeling the statistics of leakage and delay as posynomials functions to formulate a geometric-programming problem. The existing statistical leakage model is extended to include the variations in gate sizes, as well as systematic variations. Using a simplified delay model, we propose an efficient method to evaluate the alpha-percentile of path delays without enumerating the paths in a circuit. The complexity of evaluating the objective function of the optimization problem is O(vertical bar N vertical bar(2)) and that of evaluating the delay constraints is O(vertical bar N vertical bar + vertical bar E vertical bar) for a circuit with vertical bar N vertical bar gates and vertical bar E vertical bar wires. The optimization problem is then solved using a convex optimization algorithm that gives an exact solution. The statistical optimization methodology is shown to provide as much as 15% reduction in the mean leakage power as compared to traditional worst case gate sizing with the same delay constraints.
引用
收藏
页码:445 / 455
页数:11
相关论文
共 38 条