论通过矩阵分解寻找耦合矩阵合成路径

0 ENGINEERING, ELECTRICAL & ELECTRONIC
Lluís Acosta;Ricardo Pampliega;Carlos Caballero;Eloi Guerrero;Jordi Verdú;Pedro de Paco
{"title":"论通过矩阵分解寻找耦合矩阵合成路径","authors":"Lluís Acosta;Ricardo Pampliega;Carlos Caballero;Eloi Guerrero;Jordi Verdú;Pedro de Paco","doi":"10.1109/LMWT.2024.3432666","DOIUrl":null,"url":null,"abstract":"The synthesis of nonconventional topologies has become the key enabler of next-generation filters. However, the coupling matrix (CM) reconfiguration path of noncanonical forms may become complex and difficult to trace, especially in high-order filters. As a consequence, the synthesis of this kind of networks is usually tackled by means of optimization and numerical interval methods. Although these synthesis methodologies have proven to be effective, for some cases they may take large amounts of time to get to the target topology. This work presents a methodology to extract the reconfiguration path of any target topology once the general transformation matrix is obtained, which is reproducible independently of the transfer function. This enables the option of using the powerful and rapid tool of CM reconfiguration. Moreover, this letter discusses the nonunique solution of a target topology with their reconfiguration path, which is strongly related to the eigenvalues of the network. Two different topologies are used as a vehicle to validate the presented methodology.","PeriodicalId":73297,"journal":{"name":"IEEE microwave and wireless technology letters","volume":"34 9","pages":"1063-1066"},"PeriodicalIF":0.0000,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Search of the Coupling Matrix Synthesis Path Through Matrix Decomposition\",\"authors\":\"Lluís Acosta;Ricardo Pampliega;Carlos Caballero;Eloi Guerrero;Jordi Verdú;Pedro de Paco\",\"doi\":\"10.1109/LMWT.2024.3432666\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The synthesis of nonconventional topologies has become the key enabler of next-generation filters. However, the coupling matrix (CM) reconfiguration path of noncanonical forms may become complex and difficult to trace, especially in high-order filters. As a consequence, the synthesis of this kind of networks is usually tackled by means of optimization and numerical interval methods. Although these synthesis methodologies have proven to be effective, for some cases they may take large amounts of time to get to the target topology. This work presents a methodology to extract the reconfiguration path of any target topology once the general transformation matrix is obtained, which is reproducible independently of the transfer function. This enables the option of using the powerful and rapid tool of CM reconfiguration. Moreover, this letter discusses the nonunique solution of a target topology with their reconfiguration path, which is strongly related to the eigenvalues of the network. Two different topologies are used as a vehicle to validate the presented methodology.\",\"PeriodicalId\":73297,\"journal\":{\"name\":\"IEEE microwave and wireless technology letters\",\"volume\":\"34 9\",\"pages\":\"1063-1066\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE microwave and wireless technology letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10616125/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"0\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE microwave and wireless technology letters","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10616125/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

非常规拓扑结构的合成已成为下一代滤波器的关键驱动因素。然而,非标准形式的耦合矩阵(CM)重构路径可能会变得复杂且难以追踪,尤其是在高阶滤波器中。因此,这类网络的合成通常采用优化和数值区间法。虽然这些合成方法已被证明是有效的,但在某些情况下,它们可能需要花费大量时间才能达到目标拓扑结构。本研究提出了一种方法,一旦获得通用变换矩阵,就能提取任何目标拓扑结构的重新配置路径,而且这种方法不受传递函数的影响,具有可重复性。这样就可以选择使用 CM 重构这一强大而快速的工具。此外,这封信还讨论了目标拓扑与其重新配置路径的非唯一解,这与网络的特征值密切相关。两种不同的拓扑结构被用作验证所介绍方法的载体。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On the Search of the Coupling Matrix Synthesis Path Through Matrix Decomposition
The synthesis of nonconventional topologies has become the key enabler of next-generation filters. However, the coupling matrix (CM) reconfiguration path of noncanonical forms may become complex and difficult to trace, especially in high-order filters. As a consequence, the synthesis of this kind of networks is usually tackled by means of optimization and numerical interval methods. Although these synthesis methodologies have proven to be effective, for some cases they may take large amounts of time to get to the target topology. This work presents a methodology to extract the reconfiguration path of any target topology once the general transformation matrix is obtained, which is reproducible independently of the transfer function. This enables the option of using the powerful and rapid tool of CM reconfiguration. Moreover, this letter discusses the nonunique solution of a target topology with their reconfiguration path, which is strongly related to the eigenvalues of the network. Two different topologies are used as a vehicle to validate the presented methodology.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
6.00
自引率
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学术官方微信