The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
A atribuição de múltiplas tensões de alimentação (MSV) é um meio altamente eficaz de reduzir o consumo de energia. Muitos algoritmos existentes funcionam muito bem para redução de energia. No entanto, eles não lidam com a questão da área dos deslocadores de nível. Em alguns casos, embora se obtenha um resultado superior para reduzir o consumo de energia, muitos deslocadores de nível extras são necessários para adicionar para que a área do circuito fique acima da especificação. Neste artigo, apresentamos uma abordagem eficaz de atribuição de MSV baseada em programação linear inteira (ILP) para resolver dois problemas com objetivos diferentes. Para o objetivo de redução de energia sob restrição de tempo, em comparação com o algoritmo GECVS, o consumo de energia obtido pela abordagem proposta pode ser reduzido ainda mais de 0 a 5.46% e o número de deslocadores de nível é melhorado em 16.31% em média. Para o objetivo de redução de potência sob restrições de tempo e área de deslocadores de nível, a melhoria média do consumo de energia obtida pelo nosso algoritmo ainda é melhor do que o GECVS, ao mesmo tempo que reduz o número de deslocadores de nível em 22.92% em média. Além disso, dada uma restrição de consumo total de energia, nosso algoritmo gerará um projeto com atraso mínimo no circuito. Resultados experimentais mostram que o algoritmo de atribuição de MSV baseado em ILP proposto resolve diferentes problemas de maneira flexível.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Hsi-An CHIEN, Cheng-Chiang LIN, Hsin-Hsiung HUANG, Tsai-Ming HSIEH, "Optimal Supply Voltage Assignment under Timing, Power and Area Constraints" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 4, pp. 761-768, April 2010, doi: 10.1587/transfun.E93.A.761.
Abstract: Multiple supply voltage (MSV) assignment is a highly effective means of reducing power consumption. Many existing algorithms perform very well for power reduction. However, they do not handle the area issue of level shifters. In some cases, although one gets a superior result to reduce the power consumption, but many extra level shifters are needed to add so that the circuit area will be over the specification. In this paper, we present an effective integer linear programming (ILP)-based MSV assignment approach to solve two problems with different objectives. For the objective of power reduction under timing constraint, compared with GECVS algorithm, the power consumption obtained by our proposed approach can be further reduced 0 to 5.46% and the number of level shifters is improved 16.31% in average. For the objective of power reduction under constraints of both timing and area of level shifters, the average improvement of power consumption obtained by our algorithm is still better than GECVS while reducing the number of level shifters by 22.92% in average. In addition, given a constraint of total power consumption, our algorithm will generate a design having minimum circuit delay. Experimental results show that the proposed ILP-based MSV assignment algorithm solves different problems flexibly.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.761/_p
Copiar
@ARTICLE{e93-a_4_761,
author={Hsi-An CHIEN, Cheng-Chiang LIN, Hsin-Hsiung HUANG, Tsai-Ming HSIEH, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Optimal Supply Voltage Assignment under Timing, Power and Area Constraints},
year={2010},
volume={E93-A},
number={4},
pages={761-768},
abstract={Multiple supply voltage (MSV) assignment is a highly effective means of reducing power consumption. Many existing algorithms perform very well for power reduction. However, they do not handle the area issue of level shifters. In some cases, although one gets a superior result to reduce the power consumption, but many extra level shifters are needed to add so that the circuit area will be over the specification. In this paper, we present an effective integer linear programming (ILP)-based MSV assignment approach to solve two problems with different objectives. For the objective of power reduction under timing constraint, compared with GECVS algorithm, the power consumption obtained by our proposed approach can be further reduced 0 to 5.46% and the number of level shifters is improved 16.31% in average. For the objective of power reduction under constraints of both timing and area of level shifters, the average improvement of power consumption obtained by our algorithm is still better than GECVS while reducing the number of level shifters by 22.92% in average. In addition, given a constraint of total power consumption, our algorithm will generate a design having minimum circuit delay. Experimental results show that the proposed ILP-based MSV assignment algorithm solves different problems flexibly.},
keywords={},
doi={10.1587/transfun.E93.A.761},
ISSN={1745-1337},
month={April},}
Copiar
TY - JOUR
TI - Optimal Supply Voltage Assignment under Timing, Power and Area Constraints
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 761
EP - 768
AU - Hsi-An CHIEN
AU - Cheng-Chiang LIN
AU - Hsin-Hsiung HUANG
AU - Tsai-Ming HSIEH
PY - 2010
DO - 10.1587/transfun.E93.A.761
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2010
AB - Multiple supply voltage (MSV) assignment is a highly effective means of reducing power consumption. Many existing algorithms perform very well for power reduction. However, they do not handle the area issue of level shifters. In some cases, although one gets a superior result to reduce the power consumption, but many extra level shifters are needed to add so that the circuit area will be over the specification. In this paper, we present an effective integer linear programming (ILP)-based MSV assignment approach to solve two problems with different objectives. For the objective of power reduction under timing constraint, compared with GECVS algorithm, the power consumption obtained by our proposed approach can be further reduced 0 to 5.46% and the number of level shifters is improved 16.31% in average. For the objective of power reduction under constraints of both timing and area of level shifters, the average improvement of power consumption obtained by our algorithm is still better than GECVS while reducing the number of level shifters by 22.92% in average. In addition, given a constraint of total power consumption, our algorithm will generate a design having minimum circuit delay. Experimental results show that the proposed ILP-based MSV assignment algorithm solves different problems flexibly.
ER -