Efficient model reduction of interconnect via approximate system gramians

Jing-Rebecca Li, Jacob K. White
{"title":"Efficient model reduction of interconnect via approximate system gramians","authors":"Jing-Rebecca Li, Jacob K. White","doi":"10.1109/ICCAD.1999.810679","DOIUrl":null,"url":null,"abstract":"Krylov-subspace based methods for generating low-order models of complicated interconnect are extremely effective, but there is no optimality theory for the resulting models. Alternatively, methods based on truncating a balanced realization (TBR), in which the observability and controllability gramians have been diagonalized, do have an optimality property but are too computationally expensive to use on complicated problems. In this paper we present a method for computing reduced-order models of interconnect by projection via the orthogonalized union of the approximate dominant eigenspaces of the system's controllability and observability gramians. The approximate dominant eigenspaces are obtained efficiently using an iterative Lyapunov equation solver, Vector ADI, which requires only linear matrix-vector solves. A spiral inductor and a transmission line example are used to demonstrate that the new method accurately approximates the TBR results and gives much more accurate wideband models than Krylov subspace-based moment matching methods.","PeriodicalId":6414,"journal":{"name":"1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051)","volume":"74 1","pages":"380-383"},"PeriodicalIF":0.0000,"publicationDate":"1999-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"60","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCAD.1999.810679","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 60

Abstract

Krylov-subspace based methods for generating low-order models of complicated interconnect are extremely effective, but there is no optimality theory for the resulting models. Alternatively, methods based on truncating a balanced realization (TBR), in which the observability and controllability gramians have been diagonalized, do have an optimality property but are too computationally expensive to use on complicated problems. In this paper we present a method for computing reduced-order models of interconnect by projection via the orthogonalized union of the approximate dominant eigenspaces of the system's controllability and observability gramians. The approximate dominant eigenspaces are obtained efficiently using an iterative Lyapunov equation solver, Vector ADI, which requires only linear matrix-vector solves. A spiral inductor and a transmission line example are used to demonstrate that the new method accurately approximates the TBR results and gives much more accurate wideband models than Krylov subspace-based moment matching methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过近似系统文法实现互连的有效模型约简
基于krylov -子空间的复杂互连低阶模型生成方法是非常有效的,但对于生成的模型没有最优性理论。另外,基于截断平衡实现(TBR)的方法,其中可观察性和可控性已经对角化,确实具有最优性,但计算成本太高,无法用于复杂问题。本文提出了一种利用系统可控性和可观测性矩阵的近似显性特征空间的正交化并来计算投影互联的降阶模型的方法。利用迭代Lyapunov方程求解器Vector ADI有效地获得了近似的显性特征空间,该方法只需要线性矩阵-向量求解。以螺旋电感和传输线为例,表明该方法能较好地逼近TBR结果,并能比基于Krylov子空间的矩匹配方法得到更精确的宽带模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Least fixpoint approximations for reachability analysis Performance optimization using separator sets A scalable substrate noise coupling model for mixed-signal ICs JMTP: an architecture for exploiting concurrency in embedded Java applications with real-time considerations Electromagnetic parasitic extraction via a multipole method with hierarchical refinement
×
引用
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