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
다중 공급 전압(MSV) 할당은 전력 소비를 줄이는 매우 효과적인 수단입니다. 기존의 많은 알고리즘은 전력 감소에 매우 효과적입니다. 그러나 레벨 시프터의 영역 문제는 처리하지 않습니다. 어떤 경우에는 전력 소모를 줄여서 더 나은 결과를 얻을 수 있지만, 회로 면적이 사양을 초과하도록 추가로 많은 레벨 시프터를 추가해야 합니다. 본 논문에서는 서로 다른 목표를 가진 두 가지 문제를 해결하기 위한 효과적인 정수 선형 프로그래밍(ILP) 기반 MSV 할당 접근 방식을 제시합니다. 타이밍 제약 하에서의 전력 감소 목적을 위해 GECVS 알고리즘과 비교하여 제안한 접근 방식으로 얻은 전력 소비는 0에서 5.46%로 추가로 감소할 수 있으며 레벨 시프터의 수는 평균 16.31% 향상됩니다. 레벨 시프터의 타이밍과 영역의 제약 하에서 전력 절감을 목표로 하는 경우, 우리 알고리즘으로 얻은 평균 전력 소비 개선은 레벨 시프터의 수를 평균 22.92% 줄이면서 GECVS보다 여전히 좋습니다. 또한, 총 전력 소비의 제약이 주어지면 우리 알고리즘은 최소 회로 지연을 갖는 설계를 생성합니다. 실험 결과는 제안된 ILP 기반 MSV 할당 알고리즘이 다양한 문제를 유연하게 해결한다는 것을 보여줍니다.
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.
부
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
부
@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},}
부
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 -