Premium
Synthesis of complex lossless two‐ports
Author(s) -
Scarth Gordon B.,
Martens G. O.
Publication year - 1994
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/cta.4490220204
Subject(s) - lossless compression , complex plane , mathematics , realization (probability) , algorithm , robustness (evolution) , computer science , mathematical analysis , data compression , biochemistry , statistics , chemistry , gene
A new synthesis algorithm is presented for the realization of a doubly terminated complex lossless two‐port from a given canonic set of scattering polynomials. the synthesis algorithm is based entirely on polynomial evaluations and thus polynomial arithmetic and routines for zero finding are not needed. the accuracy problem due to coefficient sensitivity is avoided. In particular, explicit knowledge of the intermediate polynomials is not required. the simplicity and functionality of the algorithm are based on a new representation of elementary sections given by a set of canonic parameters , namely the transmission zero of the section, the reflectance evaluated at the transmission zero and, for reciprocal sections, the return group delay evaluated at the transmission zero. A great deal of freedom is available, since transmission zeros with any multiplicity and located anywhere in the complex plane are realized independently. Also, complex networks composed exclusively of either inductors or capacitors as the dynamic elements are possible. an example is given to illustrate the robustness of the algorithm.