Sensitivity analysis of interconnect networks based on S-parameter macromodel

Yanhua Sun, W. Dai
{"title":"Sensitivity analysis of interconnect networks based on S-parameter macromodel","authors":"Yanhua Sun, W. Dai","doi":"10.1109/MCMC.1995.512009","DOIUrl":null,"url":null,"abstract":"In this paper a simple and efficient approach for time domain sensitivity analysis is presented. Since moments of the Taylor series of a function are derivatives of the function to frequency, the same technique can be used to compute sensitivities. The basic elements in the linear networks are described by their S-parameters and the first derivatives to parameter variations of the S-parameter; which are expressed as Taylor series. A linear network is reduced to an S-parameter based macromodel together with the driving sources and the nodes of interest. The network transfer functions together with their sensitivities with respect to all the parameter variations can be obtained in one pass during the network reduction process. Since the number of external nodes are much less than the total number of nodes in the network, this method is very efficient The method can be extended to compute the second or higher order sensitivities, which are very difficult, if not impossible, for other known methods. Experimental results show that this method is robust and efficient. This method is very useful for performance optimization, especially when the number of design variables and number of specifications are very large.","PeriodicalId":223500,"journal":{"name":"Proceedings of 1995 IEEE Multi-Chip Module Conference (MCMC-95)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1995 IEEE Multi-Chip Module Conference (MCMC-95)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MCMC.1995.512009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper a simple and efficient approach for time domain sensitivity analysis is presented. Since moments of the Taylor series of a function are derivatives of the function to frequency, the same technique can be used to compute sensitivities. The basic elements in the linear networks are described by their S-parameters and the first derivatives to parameter variations of the S-parameter; which are expressed as Taylor series. A linear network is reduced to an S-parameter based macromodel together with the driving sources and the nodes of interest. The network transfer functions together with their sensitivities with respect to all the parameter variations can be obtained in one pass during the network reduction process. Since the number of external nodes are much less than the total number of nodes in the network, this method is very efficient The method can be extended to compute the second or higher order sensitivities, which are very difficult, if not impossible, for other known methods. Experimental results show that this method is robust and efficient. This method is very useful for performance optimization, especially when the number of design variables and number of specifications are very large.
基于s参数宏模型的互联网络灵敏度分析
本文提出了一种简单有效的时域灵敏度分析方法。由于一个函数的泰勒级数的矩是该函数对频率的导数,因此同样的技术可以用于计算灵敏度。线性网络中的基本元素用其s参数和s参数对参数变化的一阶导数来描述;用泰勒级数表示。将线性网络与驱动源和感兴趣节点一起简化为基于s参数的宏模型。在网络约简过程中,可以一次得到网络传递函数及其对所有参数变化的灵敏度。由于外部节点的数量远远少于网络中节点的总数,因此该方法非常高效,该方法可以扩展到计算二阶或更高阶灵敏度,这对于其他已知方法来说是非常困难的,如果不是不可能的话。实验结果表明,该方法鲁棒性好,效率高。这种方法对于性能优化非常有用,特别是在设计变量数量和规格数量非常大的情况下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信