首页> 外文期刊>IEEE transactions on very large scale integration (VLSI) systems >Reducing dynamic power consumption in synchronous sequential digital designs using retiming and supply voltage scaling
【24h】

Reducing dynamic power consumption in synchronous sequential digital designs using retiming and supply voltage scaling

机译:通过重新定时和电源电压缩放降低同步时序数字设计中的动态功耗

获取原文
获取原文并翻译 | 示例

摘要

The problem of minimizing dynamic power consumption by scaling down the supply voltage of computational elements off critical paths is widely addressed in the literature for the case of combinational designs. The problem is NP-hard in general. To address the problem in the case of synchronous sequential digital designs, one needs to move some registers while applying voltage scaling. Moving these registers shifts some computational elements from critical paths, and can be done by basic retiming. Integrating basic retiming and supply voltage scaling to address this NP-hard problem cannot in general be done in polynomial run time. In this paper, we propose to first apply a guided retiming and then to apply supply voltage scaling on the retimed design. We devise new polynomial time algorithms to realize this guided retiming, and the supply voltage scaling on the retimed design. Also, we show that the problem in the case of combinational designs is not NP-hard for some combinational circuits with certain structure, and give a polynomial time algorithm to optimally solve it. Methods to determine lower bounds on the optimal reduction of dynamic power consumption are also provided. Experimental results on known benchmarks have shown that the proposed approach can reduce dynamic power consumption by factors as high as 61% for single-phase designs with minimal clock period. Also, they have shown that it can solve optimally the problem, and produce converter-free designs with reduced dynamic power consumption. For large size circuits from ISCAS'89 benchmark suite, the proposed algorithms run in 15 s-1 h.
机译:对于组合设计,在文献中广泛解决了通过按比例缩小关键路径之外的计算元件的电源电压来最小化动态功耗的问题。通常,问题是NP困难的。为了解决同步顺序数字设计中的问题,需要在施加电压缩放时移动一些寄存器。移动这些寄存器会使一些计算元素偏离关键路径,并且可以通过基本重定时来完成。通常,在多项式运行时间内无法集成基本的重定时和电源电压缩放以解决该NP难题。在本文中,我们建议首先应用引导式重定时,然后在重定时设计上应用电源电压缩放。我们设计了新的多项式时间算法来实现这种引导式重定时,并在重定时设计上实现电源电压缩放。此外,我们表明在组合设计的情况下,对于某些具有一定结构的组合电路,问题不是NP-hard的,并给出了多项式时间算法来对其进行最佳求解。还提供了确定动态功耗最佳降低的下限的方法。在已知基准上的实验结果表明,对于具有最小时钟周期的单相设计,该方法可以将动态功耗降低多达61%。此外,他们还表明,它可以最佳地解决该问题,并可以生产出动态功耗降低的无转换器设计。对于ISCAS'89基准套件中的大型电路,建议的算法运行时间为15 s-1 h。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号