近似极点/零点表达式计算的状态矩阵简化

A. Gheorghe, F. Constantinescu, M. Nitescu
{"title":"近似极点/零点表达式计算的状态矩阵简化","authors":"A. Gheorghe, F. Constantinescu, M. Nitescu","doi":"10.1109/SMACD.2015.7301681","DOIUrl":null,"url":null,"abstract":"A new procedure for the state matrix simplification, used in the computation of the approximate symbolic pole/zero expressions is proposed. This procedure validates a simplification in a circuit matrix employing the error in the design point, the maximum error in all corners defined by all combinations of the extreme parameter values, and the modal assurance criterion.","PeriodicalId":207878,"journal":{"name":"2015 International Conference on Synthesis, Modeling, Analysis and Simulation Methods and Applications to Circuit Design (SMACD)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"State matrix simplification for computation of the approximate pole/zero expressions\",\"authors\":\"A. Gheorghe, F. Constantinescu, M. Nitescu\",\"doi\":\"10.1109/SMACD.2015.7301681\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new procedure for the state matrix simplification, used in the computation of the approximate symbolic pole/zero expressions is proposed. This procedure validates a simplification in a circuit matrix employing the error in the design point, the maximum error in all corners defined by all combinations of the extreme parameter values, and the modal assurance criterion.\",\"PeriodicalId\":207878,\"journal\":{\"name\":\"2015 International Conference on Synthesis, Modeling, Analysis and Simulation Methods and Applications to Circuit Design (SMACD)\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Synthesis, Modeling, Analysis and Simulation Methods and Applications to Circuit Design (SMACD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SMACD.2015.7301681\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Synthesis, Modeling, Analysis and Simulation Methods and Applications to Circuit Design (SMACD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SMACD.2015.7301681","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

提出了一种新的状态矩阵简化方法,用于近似符号极点/零表达式的计算。该程序利用设计点的误差、由所有极值参数值组合定义的所有角的最大误差以及模态保证准则验证电路矩阵的简化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
State matrix simplification for computation of the approximate pole/zero expressions
A new procedure for the state matrix simplification, used in the computation of the approximate symbolic pole/zero expressions is proposed. This procedure validates a simplification in a circuit matrix employing the error in the design point, the maximum error in all corners defined by all combinations of the extreme parameter values, and the modal assurance criterion.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信