Phase Preservation of $N$-Port Networks Under General Connections

IF 7 1区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS IEEE Transactions on Automatic Control Pub Date : 2024-10-21 DOI:10.1109/TAC.2024.3484229
Jianqi Chen;Wei Chen;Chao Chen;Li Qiu
{"title":"Phase Preservation of $N$-Port Networks Under General Connections","authors":"Jianqi Chen;Wei Chen;Chao Chen;Li Qiu","doi":"10.1109/TAC.2024.3484229","DOIUrl":null,"url":null,"abstract":"This study first introduces the frequency-wise phases of <inline-formula><tex-math>$n$</tex-math></inline-formula>-port linear time-invariant networks based on recently defined phases of complex matrices. Such a phase characterization can be utilized to quantify capacitive, inductive, and passive behaviors of <inline-formula><tex-math>$n$</tex-math></inline-formula>-port networks, as well as to relate to the power factor of the networks. Further, a class of matrix operations induced by fairly common <inline-formula><tex-math>$n$</tex-math></inline-formula>-port network connections is examined. The intrinsic phase properties of networks under such connections are preserved. Concretely, a scalable phase-preserving criterion is proposed, which involves only the phase properties of individual subnetworks, under the matrix operations featured by connections. This criterion ensures that the phase range of the integrated network can be verified effectively and that the scalability of the analyses can be maintained. In addition, the inverse operations of the considered connections, that is, network subtractions with correspondences are examined. With the known phase ranges of the integrated network and one of its subnetworks, the maximal allowable phase range of the remaining subnetwork can also be determined explicitly in a unified form for all types of subtractions. Finally, we extend the phase-preserving properties from the aforementioned connections to more general matrix operations defined using a certain indefinite inner product.","PeriodicalId":13201,"journal":{"name":"IEEE Transactions on Automatic Control","volume":"70 4","pages":"2346-2361"},"PeriodicalIF":7.0000,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Automatic Control","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10723784/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

This study first introduces the frequency-wise phases of $n$-port linear time-invariant networks based on recently defined phases of complex matrices. Such a phase characterization can be utilized to quantify capacitive, inductive, and passive behaviors of $n$-port networks, as well as to relate to the power factor of the networks. Further, a class of matrix operations induced by fairly common $n$-port network connections is examined. The intrinsic phase properties of networks under such connections are preserved. Concretely, a scalable phase-preserving criterion is proposed, which involves only the phase properties of individual subnetworks, under the matrix operations featured by connections. This criterion ensures that the phase range of the integrated network can be verified effectively and that the scalability of the analyses can be maintained. In addition, the inverse operations of the considered connections, that is, network subtractions with correspondences are examined. With the known phase ranges of the integrated network and one of its subnetworks, the maximal allowable phase range of the remaining subnetwork can also be determined explicitly in a unified form for all types of subtractions. Finally, we extend the phase-preserving properties from the aforementioned connections to more general matrix operations defined using a certain indefinite inner product.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一般连接下 $N$ 端口网络的相位保持
本研究首先介绍了基于最近定义的复矩阵相位的$n$ port线性时不变网络的频率相位。这样的相位表征可以用来量化n端口网络的容性、感性和无源行为,以及与网络的功率因数相关。进一步,研究了一类由相当常见的$n$-port网络连接引起的矩阵运算。在这种连接下,网络的固有相位特性得以保留。具体地说,在以连接为特征的矩阵操作下,提出了一种仅涉及单个子网的相位特性的可扩展保相准则。该准则保证了综合网络相量程的有效验证和分析的可扩展性。此外,还研究了所考虑的连接的逆操作,即具有对应关系的网络减法。在已知综合网络和其中一个子网相位范围的情况下,对所有类型的减法,也可以以统一的形式显式确定剩余子网的最大允许相位范围。最后,我们将上述连接的相保持性质推广到用不定内积定义的更一般的矩阵运算。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Automatic Control
IEEE Transactions on Automatic Control 工程技术-工程:电子与电气
CiteScore
11.30
自引率
5.90%
发文量
824
审稿时长
9 months
期刊介绍: In the IEEE Transactions on Automatic Control, the IEEE Control Systems Society publishes high-quality papers on the theory, design, and applications of control engineering. Two types of contributions are regularly considered: 1) Papers: Presentation of significant research, development, or application of control concepts. 2) Technical Notes and Correspondence: Brief technical notes, comments on published areas or established control topics, corrections to papers and notes published in the Transactions. In addition, special papers (tutorials, surveys, and perspectives on the theory and applications of control systems topics) are solicited.
期刊最新文献
Operator Splitting for Convex Constrained Markov Decision Processes Data-Driven Control of Large-Scale Networks with Formal Guarantees: A Small-Gain-Free Approach Distributed Online Convex Optimization With Unknown Delays Finite-Time Resilient Output Feedback Control for Semi-Markov Jump Systems With Imprecise Matching and Jumping Information Reinforcement Learning for Jointly Optimal Coding and Control Policies for a Controlled Markovian System over a Communication Channel
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1