Waveform relaxation and overlapping partitioning techniques for tightly coupled interconnects

M. Farhan, N. Nakhla, M. Nakhla, R. Achar, Albert Ruehliy
{"title":"Waveform relaxation and overlapping partitioning techniques for tightly coupled interconnects","authors":"M. Farhan, N. Nakhla, M. Nakhla, R. Achar, Albert Ruehliy","doi":"10.1109/EPEPS.2011.6100201","DOIUrl":null,"url":null,"abstract":"The large number of interconnects in high-speed circuits is a major bottleneck for fast simulation of such circuits. Recently, waveform relaxation methods based on transverse partitioning (WR-TP) were proposed to address this issue. It was shown that the complexity of WR-TP grows only linearly with the number of lines. However, as the coupling between the lines becomes stronger, the WR-TP algorithm either fails to converge or the number of iterations required for convergence increases. In this paper, an overlapping partitioning method for WR-TP is presented, which minimizes the number of iterations in the presence of strong coupling between the lines.","PeriodicalId":313560,"journal":{"name":"2011 IEEE 20th Conference on Electrical Performance of Electronic Packaging and Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 20th Conference on Electrical Performance of Electronic Packaging and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EPEPS.2011.6100201","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The large number of interconnects in high-speed circuits is a major bottleneck for fast simulation of such circuits. Recently, waveform relaxation methods based on transverse partitioning (WR-TP) were proposed to address this issue. It was shown that the complexity of WR-TP grows only linearly with the number of lines. However, as the coupling between the lines becomes stronger, the WR-TP algorithm either fails to converge or the number of iterations required for convergence increases. In this paper, an overlapping partitioning method for WR-TP is presented, which minimizes the number of iterations in the presence of strong coupling between the lines.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
紧耦合互连的波形松弛和重叠划分技术
高速电路中大量的互连是高速电路快速仿真的主要瓶颈。为了解决这一问题,近年来提出了基于横向分割的波形松弛方法(WR-TP)。结果表明,WR-TP的复杂度仅随行数线性增长。然而,随着线之间的耦合变得更强,WR-TP算法要么无法收敛,要么收敛所需的迭代次数增加。本文提出了一种WR-TP的重叠分划方法,该方法在线间存在强耦合的情况下使迭代次数最小化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Simulations of pulse signals with X-parameters Extraction of jitter parameters from BER measurements Full-wave PEEC time domain solver based on leapfrog scheme Bended differential transmission line using short-circuited coupled line for common-mode noise suppression Deriving voltage tolerance specification for processor circuit design
×
引用
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