Global convergence of a blind iterative algorithm for simultaneous conjugate match of N-ports

Abstract In a recent paper, it has been shown that, if an N-port network fulfills the condition of (geometrical) unconditional stability at a given frequency, then it can be conjugately matched simultaneous at all ports through lossless matching 2-ports. The proof was based on the construction of a...

Full description

Saved in:
Bibliographic Details
Main Authors: Sergio Colangeli, Antonio Serino, Walter Ciccognani, Patrick E. Longhi, Ernesto Limiti
Format: Article
Language:English
Published: Nature Portfolio 2025-05-01
Series:Scientific Reports
Subjects:
Online Access:https://doi.org/10.1038/s41598-025-00770-4
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849731090259902464
author Sergio Colangeli
Antonio Serino
Walter Ciccognani
Patrick E. Longhi
Ernesto Limiti
author_facet Sergio Colangeli
Antonio Serino
Walter Ciccognani
Patrick E. Longhi
Ernesto Limiti
author_sort Sergio Colangeli
collection DOAJ
description Abstract In a recent paper, it has been shown that, if an N-port network fulfills the condition of (geometrical) unconditional stability at a given frequency, then it can be conjugately matched simultaneous at all ports through lossless matching 2-ports. The proof was based on the construction of a guided iterative algorithm (AlgG) which was shown to converge to the desired result. Two other iterative algorithms were presented (AlgS and AlgA), which are simpler to implement but whose global convergence had not been proven. The present contribution aims at proving the global convergence of the AlgA algorithm, which is notable for being totally independent of the user (unlike AlgG) and of the port numbering (unlike AlgS). As such, this algorithm captures the inherent characteristics only of the network to which it is applied. Several examples of using AlgA to achieve the Simultaneous Conjugate Match (SCM) condition are presented and validated on fabricated circuits. More interestingly, AlgA has a useful role in the framework of stability analysis, i.e., in determining upper and lower bounds on the stability radius of N-port networks. This latter application will be further delved into in a future publication.
format Article
id doaj-art-1ad3aee6e893422aa7b333de58b70ee0
institution DOAJ
issn 2045-2322
language English
publishDate 2025-05-01
publisher Nature Portfolio
record_format Article
series Scientific Reports
spelling doaj-art-1ad3aee6e893422aa7b333de58b70ee02025-08-20T03:08:40ZengNature PortfolioScientific Reports2045-23222025-05-0115111510.1038/s41598-025-00770-4Global convergence of a blind iterative algorithm for simultaneous conjugate match of N-portsSergio Colangeli0Antonio Serino1Walter Ciccognani2Patrick E. Longhi3Ernesto Limiti4Department of Electronics Engineering, University of Rome Tor VergataDepartment of Electronics Engineering, University of Rome Tor VergataDepartment of Electronics Engineering, University of Rome Tor VergataDepartment of Electronics Engineering, University of Rome Tor VergataDepartment of Electronics Engineering, University of Rome Tor VergataAbstract In a recent paper, it has been shown that, if an N-port network fulfills the condition of (geometrical) unconditional stability at a given frequency, then it can be conjugately matched simultaneous at all ports through lossless matching 2-ports. The proof was based on the construction of a guided iterative algorithm (AlgG) which was shown to converge to the desired result. Two other iterative algorithms were presented (AlgS and AlgA), which are simpler to implement but whose global convergence had not been proven. The present contribution aims at proving the global convergence of the AlgA algorithm, which is notable for being totally independent of the user (unlike AlgG) and of the port numbering (unlike AlgS). As such, this algorithm captures the inherent characteristics only of the network to which it is applied. Several examples of using AlgA to achieve the Simultaneous Conjugate Match (SCM) condition are presented and validated on fabricated circuits. More interestingly, AlgA has a useful role in the framework of stability analysis, i.e., in determining upper and lower bounds on the stability radius of N-port networks. This latter application will be further delved into in a future publication.https://doi.org/10.1038/s41598-025-00770-4Linear networksSimultaneous conjugate matchUnconditional stability
spellingShingle Sergio Colangeli
Antonio Serino
Walter Ciccognani
Patrick E. Longhi
Ernesto Limiti
Global convergence of a blind iterative algorithm for simultaneous conjugate match of N-ports
Scientific Reports
Linear networks
Simultaneous conjugate match
Unconditional stability
title Global convergence of a blind iterative algorithm for simultaneous conjugate match of N-ports
title_full Global convergence of a blind iterative algorithm for simultaneous conjugate match of N-ports
title_fullStr Global convergence of a blind iterative algorithm for simultaneous conjugate match of N-ports
title_full_unstemmed Global convergence of a blind iterative algorithm for simultaneous conjugate match of N-ports
title_short Global convergence of a blind iterative algorithm for simultaneous conjugate match of N-ports
title_sort global convergence of a blind iterative algorithm for simultaneous conjugate match of n ports
topic Linear networks
Simultaneous conjugate match
Unconditional stability
url https://doi.org/10.1038/s41598-025-00770-4
work_keys_str_mv AT sergiocolangeli globalconvergenceofablinditerativealgorithmforsimultaneousconjugatematchofnports
AT antonioserino globalconvergenceofablinditerativealgorithmforsimultaneousconjugatematchofnports
AT walterciccognani globalconvergenceofablinditerativealgorithmforsimultaneousconjugatematchofnports
AT patrickelonghi globalconvergenceofablinditerativealgorithmforsimultaneousconjugatematchofnports
AT ernestolimiti globalconvergenceofablinditerativealgorithmforsimultaneousconjugatematchofnports