Gate level multiple supply voltage assignment algorithm for power optimization under timing constraint

被引:25
|
作者
Chi, Jun Cheng [1 ]
Lee, Hung Hsie
Tsai, Sung Han
Chi, Mely Chen
机构
[1] Chung Yuan Christian Univ, Dept Elect Engn, Chungli 32023, Taiwan
[2] Chung Yuan Christian Univ, Dept Informat & Comp Engn, Chungli 32023, Taiwan
关键词
algorithms; low power; multiple voltages assignment; partition; power optimization; voltage scaling;
D O I
10.1109/TVLSI.2007.898650
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We propose a multiple supply voltage scaling algorithm for low power designs. The algorithm combines a greedy approach and an. iterative improvement optimization approach. In phase 1, it simultaneously scales down as many gates as possible to lower supply voltages. In phase 11, a multiple way partitioning algorithm is applied to further refine the supply voltage assignment of gates to reduce the total power consumption. During both phases, the timing correctness of the circuit is maintained. Level converters (LCs) are adjusted correctly according to the local connectivity of the different supply voltage driven gates. Experimental results show that the proposed algorithm can effectively convert the unused slack of gates into power savings. We use two of the ISPD2001 benchmarks and all of the ISCAS89 benchmarks as test cases. The 0.13-mu m CMOS TSMC library is used. On average, the proposed algorithm improves the power consumption of the original design by 42.5% with a 10.6% overhead in the number of LCs. Our study shows that the key factor in achieving power saving is including the most comportable supply voltage in the scaling process.
引用
收藏
页码:637 / 648
页数:12
相关论文
共 39 条