The broadband matching problem

Contents

The broadband matching problem aims to minimise within a specified frequency interval I the reflected power from the system (Latex formula) composed of a matching filter (Latex formula) cascaded with load (Latex formula). Note that the load is represented here as a two port device.

Statement of the general matching problem

The problem is stated in its general form as the minimisation over the filter Latex formula of the maximum in the band  of Latex formula over the frequency variable Latex formula. If the filter is parametrised in function of its reflection parameter Latex formula, the only constraint imposed is that the reflection  Latex formula must remain passive and stable. Therefore Latex formula is a stable function with Latex formula on the whole frequency axis.

Schematic of the global system with input and output reflection of each device

Chaining operation

The scattering parameter Latex formula can be computed by the chain operation (Latex formula):

Latex formula

where Latex formula stand for the transmission parameters of the matching filter.

For a lossless device, the scattering matrix is unitary, this means Latex formula (Latex formula). Using this property we can express:

Latex formula

This expression correspond to the pseudohyperbolic distance between the function Latex formula and Latex formula.

Optimisation over the Schur functions

The problem is stated then as the minimisation of the previous pseudohyperbolic distance over the functions Latex formula that are passive and stable.

The functions Latex formula that are passive (Latex formula) and stable (analytic) in a domain are called schur functions. We denote the set of such functions by Latex formula.

Thus the aim is to solve:

Latex formula

for all Latex formula in the passband.

Infinite dimension solution

If the only restriction of the function Latex formula is being stable and passible (without limitation on the degree), the previous problem can be solved optimally. This is possible because the set Latex formula is a convex set.

The optimal solution to the general problem was already obtained by Helton in [ref]. He computed, for a given load Latex formula the function Latex formula that provides a reflection  Latex formula lowest possible absolute value within the passband. This reflection level, being obtained without limitation on the degree of Latex formula, represents a lower bound on the reflection level that can be obtained for Latex formula. We can see an example of the Helton bound for a particular load in the following picture, along with the function Latex formula of infinite degree providing the optimal reflection level.

However, if the function  Latex formula is constrained to be rational with a low degree, this bound will not be accurate. Symilarly, the optimal rational function Latex formula with a given low degree will differ from the one obtained with no degree limitation.

Rational matching problem

If we now restrict the function Latex formula only to be rational, i.e. Latex formula with Latex formula and Latex formula polynomials of degree at most N, the previous problem becomes too difficult to solve. Intead we use a parametrisation allowing for the transmission zeros to be prescribed as well.

Belevitch representation

We use the belevitch form to parametrise the global system:

Latex formula

with Latex formulaa uni-modular constant, and Latex formula polynomials of degree at most N satisfying Latex formula with Latex formula. Note that q is a stable polynomial (analytic in the stability domain). Additionally, the polynomial Latex formula is fix by the user.

This parametrisation is customary in classical filter design where the belevitch form  is  used to parametrise lossless devices. Similarly the transmission zeros are often set to given positions in the complex plane, usually with the purpose of increasing the out-of-band selectivity or to have some control on the group delay in the passband.

Feasible responses

Now given the chaining operation introduced before:

Latex formula

we define the set of feasible functions (Latex formula) as the image of the schur functions (Latex formula) under the chaining application:

Latex formula

In other words, a function Latex formula is feasible for a given load Latex formula if and only if there exists a Schur function Latex formula such that Latex formula.

Rational matching with prescribed transmission zeros

With S being parametrised in the belevitch form as before, we denote by Latex formula the set admissible functions Latex formula satisfying  Latex formula (the set of rational responses where the transmission zeros are prescribed).

With those definitions, the rational matching problem can be stated as the minimisation in the passband of the reflection of the global system knowing that there must exist a function Latex formula rational of given degree that chained to the load provides the desired reflection:

Latex formula

for all Latex formula in the passband.

Note that the problem is stated here on Latex formula instead of Latex formula. However, it is not relevant since for lossless systems and Latex formula real,  Latex formula.

The Fano/Youla characterisation

Having defined the set of feasible responses Latex formula as the reflection parameters that can be obtained by  connecting a passive stable device to a prescribe load, we need a charactesation for it. In other words, what requisites must be satisfied by a reflection Latex formula to be feasible?, of course we know that the requisite is that there must exist a passive stable filter F such that the cascade of that filter with the load shows the reflection Latex formula at the second port. However thats too abstract.

A better characterisation can be obtained from the chaining equation

Latex formula

We look at the transmission zeros of the load Latex formula (the points inside the stability domain of the complex plane for which Latex formula. At those points,  for any passibe stable filter F the right term in the previous equation vanishes since the denominator can not be zero inside the stability domain. Therefore we obtain the interpolation condition

Latex formula

This is a necessary condition for a function Latex formula to be feasible. In addition, as the main result of Fano/Youla work, it was shown that this condition is indeed necessary and sufficient.

(this stand for the case of simple transmission zeros of the load inside the complex plane, if the load has either transmission zeros of higher multiplicity or transmission zeros on the frequency axis, the previous condition has to be modified including equalities on the derivatives as well).

In conclussion, if a response Latex formula satisfied the previous conditions for a given load A then it exist a passive stable filter F that chained with the load provides the reflection Latex formula  at the second port (the function Latex formula  is feasible).

Thus this interpolation conditions represent a characterisation of the feasible responses Latex formula.

Nevanlinna-Pick interpolation

The last tool required to understand how puma works is the Nevanlinna-Pick interplation theorem, it states:

Given N points Latex formula in the lower half of the complex plane (points with negative imaginary part), and N complex values Latex formula with Latex formula, there exist a schur function Latex formula (passive stable in the lower half plane) such that Latex formula if and only if the followig matrix is positive definite.

Latex formula

 This matrix is called the Pick matrix.

Nevanlinna parametrisation

Nevanlinna also provided a parametrisation of all solutions to the interpolation problem Latex formula with Latex formula (schur functions). In the general case, when the pick matrix is positive definite (with N interpolation conditions)

Latex formula

where Latex formula are polynomials of degree at most N and Latex formula is a schur function.

Remark: in our context, this expression is actually equivalent to the chaininig operation Latex formula where the Latex formula polynomials are in fact the polynomials involved in the belevitch model of the load Latex formula.

In the particular case where the pick matrix is positive semi-definite and singular, there is a unique solution to the interpolation problem in the form of a blaschke product Latex formula:

Latex formula

where M stand for the rank of the pick matrix, Latex formula belong to the analicity domain and with Latex formula real.

Continue reading…

Comments are closed.