基于矩匹配的耦合RC树串扰估计新模型

Qingjian Yu, E. Kuh
{"title":"基于矩匹配的耦合RC树串扰估计新模型","authors":"Qingjian Yu, E. Kuh","doi":"10.1109/ISQED.2001.915220","DOIUrl":null,"url":null,"abstract":"In this paper we provide a new efficient moment matching based model for the estimation of crosstalk in coupled RC tree networks. This model is formulated based on an exact and efficient linear order recursive algorithm for the moment computation of such networks with both lumped and distributed RC elements. The formulas used in the model are efficiently obtained by using the results of moment computation without any matrix operation and can fit for arbitrary input waveforms. Simulation results show it performs better than all existing formulas.","PeriodicalId":110117,"journal":{"name":"Proceedings of the IEEE 2001. 2nd International Symposium on Quality Electronic Design","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"New efficient and accurate moment matching based model for crosstalk estimation in coupled RC trees\",\"authors\":\"Qingjian Yu, E. Kuh\",\"doi\":\"10.1109/ISQED.2001.915220\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we provide a new efficient moment matching based model for the estimation of crosstalk in coupled RC tree networks. This model is formulated based on an exact and efficient linear order recursive algorithm for the moment computation of such networks with both lumped and distributed RC elements. The formulas used in the model are efficiently obtained by using the results of moment computation without any matrix operation and can fit for arbitrary input waveforms. Simulation results show it performs better than all existing formulas.\",\"PeriodicalId\":110117,\"journal\":{\"name\":\"Proceedings of the IEEE 2001. 2nd International Symposium on Quality Electronic Design\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-03-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the IEEE 2001. 2nd International Symposium on Quality Electronic Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISQED.2001.915220\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the IEEE 2001. 2nd International Symposium on Quality Electronic Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISQED.2001.915220","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

本文提出了一种新的基于矩匹配的耦合RC树网络串扰估计模型。该模型是基于一种精确有效的线性阶递归算法来计算集总和分布RC单元网络的弯矩。该模型的计算公式是利用矩量计算的结果,无需任何矩阵运算即可得到的,可以适用于任意输入波形。仿真结果表明,该方法优于现有的所有公式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
New efficient and accurate moment matching based model for crosstalk estimation in coupled RC trees
In this paper we provide a new efficient moment matching based model for the estimation of crosstalk in coupled RC tree networks. This model is formulated based on an exact and efficient linear order recursive algorithm for the moment computation of such networks with both lumped and distributed RC elements. The formulas used in the model are efficiently obtained by using the results of moment computation without any matrix operation and can fit for arbitrary input waveforms. Simulation results show it performs better than all existing formulas.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信