LOTUS: leakage optimization under timing uncertainty for standard-cell designs

Sarvesh Bhardwaj, Yu Cao, S. Vrudhula
{"title":"LOTUS: leakage optimization under timing uncertainty for standard-cell designs","authors":"Sarvesh Bhardwaj, Yu Cao, S. Vrudhula","doi":"10.1109/ISQED.2006.83","DOIUrl":null,"url":null,"abstract":"This paper proposes a novel methodology for improving the leakage yield of digital circuits in the presence of process variations and under probabilistic timing constraints. The leakage minimization problem is formulated as a discrete optimization problem, where a suitable configuration for each gate in the circuit is selected from a standard-cell library consisting of different implementations of each type of gate. A function of mean and variance of the circuit leakage is minimized with constraint on a-percentile of the delay using physical delay models. Since the leakage is a strong function of the threshold voltage and gate length, considering them as design variables in addition to gate sizes can provide significant power savings. We propose efficient techniques for computing delay and leakage power gradients which form the basis of the optimization algorithm. Results on various trade-offs such as between leakage and delay, and mean and variance of the leakage are discussed","PeriodicalId":138839,"journal":{"name":"7th International Symposium on Quality Electronic Design (ISQED'06)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"7th International Symposium on Quality Electronic Design (ISQED'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISQED.2006.83","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

This paper proposes a novel methodology for improving the leakage yield of digital circuits in the presence of process variations and under probabilistic timing constraints. The leakage minimization problem is formulated as a discrete optimization problem, where a suitable configuration for each gate in the circuit is selected from a standard-cell library consisting of different implementations of each type of gate. A function of mean and variance of the circuit leakage is minimized with constraint on a-percentile of the delay using physical delay models. Since the leakage is a strong function of the threshold voltage and gate length, considering them as design variables in addition to gate sizes can provide significant power savings. We propose efficient techniques for computing delay and leakage power gradients which form the basis of the optimization algorithm. Results on various trade-offs such as between leakage and delay, and mean and variance of the leakage are discussed
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
LOTUS:时间不确定条件下标准电池设计的泄漏优化
本文提出了一种在存在工艺变化和概率时序约束的情况下提高数字电路漏损率的新方法。泄漏最小化问题被表述为离散优化问题,其中从由每种栅极的不同实现组成的标准单元库中选择电路中每个栅极的合适配置。利用物理延迟模型,在延迟的百分位数约束下,最小化了电路泄漏的均值和方差函数。由于泄漏是阈值电压和栅极长度的强烈函数,除了栅极尺寸外,将它们作为设计变量考虑可以提供显着的节能。我们提出了计算延迟和泄漏功率梯度的有效技术,这是优化算法的基础。讨论了泄漏和延迟、泄漏的均值和方差等各种权衡的结果
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A DFM methodology to evaluate the impact of lithography conditions on the speed of critical paths in a VLSI circuit Power-aware test pattern generation for improved concurrency at the core level Compact reduced order modeling for multiple-port interconnects Method to evaluate cable discharge event (CDE) reliability of integrated circuits in CMOS technology Minimizing ohmic loss in future processor IR events
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1