The paper deals with the numerical validation, performance evaluation and robustness assessment of a procedure for the direct identification of passive transfer matrices based on convex programming. Validation is pursued by producing data sets from lumped multiport systems with random parameters (passive, non passive, and possibly affected by random noise), then evaluating the identification ability of the considered method. Results demonstrate how the considered approach satisfactorily covers the passive identification of a large class of data sets, even in presence of significant passivity violations or noise flawed data, at average accuracies comparable with non passive identifications obtained with standard Vector Fitting.
Numerical validation of a procedure for direct identification of passive linear multiport with convex programming / A. G., Chiariello; DE MAGISTRIS, Massimiliano; L., De Tommasi; D., Deschrjiver; T., Dhaene. - STAMPA. - (2010), pp. 141-144. (Intervento presentato al convegno Signal Propagation on Interconnects (SPI), 2010 IEEE 14th Workshop on tenutosi a Hildesheim, Germany nel 9-12 May 2010) [10.1109/SPI.2010.5483546].
Numerical validation of a procedure for direct identification of passive linear multiport with convex programming
DE MAGISTRIS, MASSIMILIANO;
2010
Abstract
The paper deals with the numerical validation, performance evaluation and robustness assessment of a procedure for the direct identification of passive transfer matrices based on convex programming. Validation is pursued by producing data sets from lumped multiport systems with random parameters (passive, non passive, and possibly affected by random noise), then evaluating the identification ability of the considered method. Results demonstrate how the considered approach satisfactorily covers the passive identification of a large class of data sets, even in presence of significant passivity violations or noise flawed data, at average accuracies comparable with non passive identifications obtained with standard Vector Fitting.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
