A Fast Equation Free Iterative Approach to Analog Circuit Sizing

S. Maji, P. Mandal
{"title":"A Fast Equation Free Iterative Approach to Analog Circuit Sizing","authors":"S. Maji, P. Mandal","doi":"10.1109/VLSID.2012.99","DOIUrl":null,"url":null,"abstract":"A fast equation free iterative approach for sizing of analog circuit is proposed. Equation based sizing approach has been popular as it removes time consuming simulation effort. If equations are cast in posynomial inequality format, a special optimization technique called geometric programming(GP) can be deployed. The advantage of formulating the problem in GP form is that, it ensures global optimality and can return the final design point instantly even in the presence of hundreds of equation and thousands of variable. But main limitation comes in deriving performance equations in posynomial inequality format. In this context, we develop one novel methodology for fast sizing of analog circuit. This method does not require any such performance expressions. It is based on the meaningful presentation of only device constraints. Infeasibility is handled iteratively making suitable changes on those constraints. Due to the simplicity of formulation, fully automated flow is achieved.","PeriodicalId":405021,"journal":{"name":"2012 25th International Conference on VLSI Design","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 25th International Conference on VLSI Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VLSID.2012.99","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

A fast equation free iterative approach for sizing of analog circuit is proposed. Equation based sizing approach has been popular as it removes time consuming simulation effort. If equations are cast in posynomial inequality format, a special optimization technique called geometric programming(GP) can be deployed. The advantage of formulating the problem in GP form is that, it ensures global optimality and can return the final design point instantly even in the presence of hundreds of equation and thousands of variable. But main limitation comes in deriving performance equations in posynomial inequality format. In this context, we develop one novel methodology for fast sizing of analog circuit. This method does not require any such performance expressions. It is based on the meaningful presentation of only device constraints. Infeasibility is handled iteratively making suitable changes on those constraints. Due to the simplicity of formulation, fully automated flow is achieved.
模拟电路尺寸的快速无方程迭代方法
提出了一种快速求解模拟电路尺寸的无方程迭代方法。基于方程的分级方法由于消除了耗时的仿真工作而受到欢迎。如果方程以多项式不等式格式进行转换,则可以使用一种称为几何规划(GP)的特殊优化技术。以GP形式表述问题的优点是,即使存在数百个方程和数千个变量,也能保证全局最优性,并能立即返回最终设计点。但主要的局限性在于以多项式不等式的形式推导性能方程。在此背景下,我们开发了一种新的方法来快速调整模拟电路的尺寸。此方法不需要任何此类性能表达式。它只基于设备约束的有意义的表示。对这些约束进行适当的更改,迭代地处理不可行性。由于配方简单,实现了全自动流程。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信