An elliptic filter (also known as a Cauer filter, named after Wilhelm Cauer, or as a Zolotarev filter, after Yegor Zolotarev) is a signal processing filter with equalized ripple (equiripple) behavior in both the passband and the stopband. The amount of ripple in each band is independently adjustable, and no other filter of equal order can have a faster transition in gain between the passband and the stopband, for the given values of ripple (whether the ripple is equalized or not). Alternatively, one may give up the ability to adjust independently the passband and stopband ripple, and instead design a filter which is maximally insensitive to component variations.
As the ripple in the stopband approaches zero, the filter becomes a type I Chebyshev filter. As the ripple in the passband approaches zero, the filter becomes a type II Chebyshev filter and finally, as both ripple values approach zero, the filter becomes a Butterworth filter.
The gain of a lowpass elliptic filter as a function of angular frequency ω is given by:
Gn(\omega)={1\over\sqrt{1+\epsilon2
2(\xi,\omega/\omega | |
R | |
0)}} |
where Rn is the nth-order elliptic rational function (sometimes known as a Chebyshev rational function) and
\omega0
\epsilon
\xi
The value of the ripple factor specifies the passband ripple, while the combination of the ripple factor and the selectivity factor specify the stopband ripple.
1/\sqrt{1+\epsilon2}
Ln
Ln=Rn(\xi,\xi)
The gain of the stopband therefore will vary between 0 and
2} | |
1/\sqrt{1+\epsilon | |
n |
\xi → infty
\xi → infty
\omega0 → 0
\epsilon → 0
\epsilonRn(\xi,1/\omega0)=1
\xi → infty
\epsilon → 0
\omega0 → 0
\xi\omega0=1
\epsilonLn=\alpha
G(\omega)= | 1 | ||||||||||||||
|
The zeroes of the gain of an elliptic filter will coincide with the poles of the elliptic rational function, which are derived in the article on elliptic rational functions.
The poles of the gain of an elliptic filter may be derived in a manner very similar to the derivation of the poles of the gain of a type I Chebyshev filter. For simplicity, assume that the cutoff frequency is equal to unity. The poles
(\omegapm)
s=\sigma+j\omega
2(-js,\xi)=0 | |
1+\epsilon | |
n |
Defining
-js=cd(w,1/\xi)
1+\epsilon2cd
| |||||
, |
1 | |
Ln |
\right)=0
where
K=K(1/\xi)
Kn=K(1/Ln)
w= | K |
nKn |
cd-1\left(
\pmj | , | |
\epsilon |
1 | \right)+ | |
Ln |
mK | |
n |
where the multiple values of the inverse cd function are made explicit using the integer index m.
The poles of the elliptic gain function are then:
spm=icd(w,1/\xi)
As is the case for the Chebyshev polynomials, this may be expressed in explicitly complex form
spm=
a+jb | |
c |
a=-\zetan\sqrt{1-\zeta
2/\xi | |
m |
2}
b=xm\sqrt{1-\zeta
2(1-1/\xi | |
n |
2)}
2/\xi | |
c=1-\zeta | |
n |
2
where
\zetan
n,\epsilon
\xi
xm
\zetan
\zeta | ||||
|
\zeta | ||||
|
+\sqrt{(1-t)2+\epsilon2(1+t)2}}
where
t=\sqrt{1-1/\xi2}
The algebraic expression for
\zeta3
The nesting property of the elliptic rational functions can be used to build up higher order expressions for
\zetan
\zetam ⋅
(\xi,\epsilon)= \zeta | ||||||||||
|
-1}\right)
where
Lm=Rm(\xi,\xi)
To design an Elliptic filter using the minimum required number of elements, the minimum order of the Elliptic filter may be calculated with elliptic integrals as follows.[1] The equations account for standard low pass Elliptic filters, only. Even order modifications will introduce error that the equations do not account for.
\begin{align} \tau1&=\sqrt{
| |||||||
|
The elliptic integral computations may eliminated with the use of the following expression.
\begin{align} k&=theselectivityfactor=
\omegap | |
\omegas |
(sameas\tau2above)\\ u&=
1-\sqrt[4]{1-k2 | |
where:
\omegap
\alphap
\omegas
\alphas
n
ceil[] is a round up to next integer function.
See .
Elliptic filters are generally specified by requiring a particular value for the passband ripple, stopband ripple and the sharpness of the cutoff. This will generally specify a minimum value of the filter order which must be used. Another design consideration is the sensitivity of the gain function to the values of the electronic components used to build the filter. This sensitivity is inversely proportional to the quality factor (Q-factor) of the poles of the transfer function of the filter. The Q-factor of a pole is defined as:
Q=-
|spm| | |
2Re(spm) |
=-
1 | |
2\cos(\arg(spm)) |
and is a measure of the influence of the pole on the gain function. For an elliptic filter, it happens that, for a given order, there exists a relationship between the ripple factor and selectivity factor which simultaneously minimizes the Q-factor of all poles in the transfer function:
\epsilonQmin=
1 | |
\sqrt{Ln(\xi) |
This results in a filter which is maximally insensitive to component variations, but the ability to independently specify the passband and stopband ripples will be lost. For such filters, as the order increases, the ripple in both bands will decrease and the rate of cutoff will increase. If one decides to use a minimum-Q elliptic filter in order to achieve a particular minimum ripple in the filter bands along with a particular rate of cutoff, the order needed will generally be greater than the order one would otherwise need without the minimum-Q restriction. An image of the absolute value of the gain will look very much like the image in the previous section, except that the poles are arranged in a circle rather than an ellipse. They will not be evenly spaced and there will be zeroes on the ω axis, unlike the Butterworth filter, whose poles are arranged in an evenly spaced circle with no zeroes.
Here is an image showing the elliptic filter next to other common kind of filters obtained with the same number of coefficients:
As is clear from the image, elliptic filters are sharper than all the others, but they show ripples on the whole bandwidth.
Elliptic filter stop bands are essentially Chebyshev filters with transmission zeros where the transmission zeros are arranged in a manner that yields an equi-ripple stop band. Given this, it is possible to convert a Chebyshev filter characteristic equation,
K(s)
K(s)
K(s)
\Omegac
\Omegac
the
\omegas/\omegap
\Omegac
\Omegac
\begin{align} n&=numberofpoles(orderofthefilter)\\ q&=(16D)(-1/n)\\ 0&=-q+u+2u5+15u9+150u13\\ u&=realrootofaboveequation\\ k&=theselectivityfactor=\sqrt{1-(
1-2u | |
1+2u |
)4}\\ \Omegac&=
\omegas | |
\omegap |
=
1 | |
k |
=
1 | ||||
|
The characteristic polynomials,
K(s)
\Omegac
G(s)
G(s)=
2K(s)K(-s))}| | |
\sqrt{1/(1+\varepsilon | |
LHPpoles |
\varepsilon2=10Ap/10.-1.
Ap
Design an Elliptic filter with a pass band ripple of 1 dB from 0 to 1 rad/sec and a stop band ripple of 40 dB from at least 1.25 rad/sec to
infty
Applying the calculations above for the value for n prior to applying the ceil function, n is found to be 4.83721900 rounded up to the next integer, 5, by applying the ceil function, which means a 5 pole Elliptic filter is required to meet the specified design requirements. Applying the calculations above for
\Omegac
\Omegac
The polynomial scaled inversion function may be performed by translating each root, s, to
\Omegac/s
\Omegac
\begin{align} &asn+bsn-1...cs2+ds1+es0\Longrightarrow (
e | ||||||
|
)sn+(
d | ||||||
|
)sn-1...(
c | ||||||
|
)s2+(
b | ||||||
|
)s1+(
a | ||||||
|
)s0\\ \end{align}
The Elliptic design steps are then as follows:
\Omegac
To illustrate the steps, the below K(s) equations begin with a standard Chebyshev K(s), then iterate through the process. Visible differences are seen in the first three iterations. By time 18 iterations have been reached, the differences in K(s) become negligible. Iterations may be discontinued when the change in K(s) coefficients becomes sufficiently small so as to meet design accuracy requirements. The below K(s) iterations have all been normalized such that
|K(j)|=1
\begin{align} iteration0:K(s)&=
16s5+20s3+5s | |
1 |
\\ iteration1:K(s)&=
9.2965947s5+12.999133s3+4.0025668s | |
0.14167325s4+0.84164496s2+1 |
\\ iteration2:K(s)&=
8.6496472s5+12.270597s3+3.8746611s | |
0.19518773s4+0.94147634s2+1 |
\\ &\vdots\\ iteration17:K(s)&=
8.550086786383502s5+12.157269873073034s3+3.854163602012615s | |
0.2043607336740334s4+0.9573802183509494s2+1 |
\\ iteration18:K(s)&=
8.550086786383422s5+12.157269873072942s3+3.854163602012599s | |
0.2043607336740334s4+0.9573802183509494s2+1 |
\\ \end{align}
To find the
G(s)
\begin{align} \varepsilon2&=101dB/10.-1.=.25892541\\ G(s)&=\sqrt{G(s)G(-s)}|LHPpoles=\sqrt{
1 | |
1+\varepsilon2K(s)K(-s) |
&= \frac \\
\end
To obtain
G(s)
G(s)
|G(s)|
s=0
\begin{align} &G(s)=
0.20436073s4+0.95738022s2+1 | |
4.3506872s5+4.0174213s4+8.0362343s3+4.9129149s2+3.4288915s+1 |
\\ \end{align}
To confirm that the example
G(s)
G(s)
j\omega
Even order Elliptic filters implemented with passive elements, typically inductors, capacitors, and transmission lines, with terminations of equal value on each side cannot be implemented with the traditional Elliptic transfer function without the use of coupled coils, which may not be desirable or feasible. This is due to the physical inability to accommodate the even order Chebyshev reflection zeros and transmission zeros that result in the scattering matrix S12 values that exceed the S12 value at
\omega=0
\omega=infty
\omega=0
\omega=infty
The needed modification involves mapping each pole and zero of the Elliptic transfer function in a manner that maps the lowest frequency reflection zero to zero, the highest frequency transmission zero to
infty
K(s)
K(s)
The translate the reflection zeros, the following equation is applied to all poles and zeros of
K(s)
K(s)
G(s)
K(s)
K(s)
Ri'=\sqrt{
| |||||||||||||||
|
Where:
Ri
Ri'
\omegaLO
The sign of imaginary component of
Ri'
Ri
The translate the transmission zeros, the following equation is applied to all poles and zeros of
K(s)
K(s)
G(s)
K(s)
K(s)
Ri'=\sqrt{
| ||||||||||||||
|
}
Where:
Ri
Ri'
\omegaHI
The sign of imaginary component of
Ri'
Ri
G(s)
Ri'
It is important to note that all applications require both pass and stop translations. Passive network diplexers, for example, only require even order stop band translations, and perform more efficiently with untranslated even order pass bands.
When
G(s)
\omega=0
\omega=infty
The illustration below shows an 8th order Elliptic filter modified to support even order equally terminated passive networks by relocating the lowest frequency reflection zero from a finite frequency to 0 and the highest frequency transmission zero to
infty
\Omegac
\Omegac
K(s)
\Omegac
\Omegac
\Omegac
An Hourglass filter is a special case of filter where the reflection zeros, are the reciprocal of the transmission zeros about a 3.01 dB normalized cut-off attenuation frequency of 1 rad/sec, resulting all poles of the filter residing on the unit circle.[6] The Elliptic Hourglass implementation has an advantage over an Inverse Chebyshev filter in that the pass band is flatter, and has an advantage over traditional Elliptic filters in that the group delay has a less sharp peak at the cut-off frequency.
|S11|2+|S12|2=1
(Sij)dB=20log10(|Sij|arith)
Ap=-10log10
(-As/10) | |
{(1.-10 |
)}
The Ap, defined above will produce reciprocal reflection and transmission zeros about a yet unknown 3.01 dB cut-off frequency. to Design an Elliptic filter with a pass band frequency of 1 rad/sec the 3.01 dB attenuation frequency needs to be determined and that frequency needs to be used to inversely scale the Elliptic design polynomials. The result will be polynomials with an attenuation of 3.01 dB at a normalized frequency of 1 rad/sec. Newton's method or solving the equations directly with a root finding algorithm may be used to determine the 3.01 dB attenuation frequency.
If
G(s)
\omegac
\omegac
G(s)G(-s)
G(s)
G(-s)
G(s)G(-s)
sn
(n+2)
4
s2
s6
s10
G2(s)G2(-s)
\omegaa
j\omegaa
AdB
2 | |
B | |
arith |
2 | |
B | |
arith |
=
AdB/10 | |
10 |
|G2(s)G2(-s)|
\omegaa
G2(\omegaa)G2(-\omegaa)
\omegaa
When steps 1) through 4) are complete, the expression involving Newton's method may be written as:
\omegaa=\omegaa-([G2(\omegaa)G2(-\omegaa)|-
2)/(d[G | |
B | |
2(\omega |
a)G2(-\omegaa)]/d\omegaa)
using a real value for
\omegaa
\omegaa
\omegaa
\omegac
G(s)
G(s)
Since
|G(j\omegaa)|
G(-s)
G(j\omegaa)
G(j\omegaa)
G(s)G(-s)
G(s)
G(-s)
G(s)G(-s)
AdB
2 | |
B | |
arith |
2 | |
B | |
arith |
=
AdB/10 | |
10 |
P(S)=Gnum(S)Gnum(-S)-
2 | |
B | |
arith |
Gden(S)Gden(-S)
\omegac
When
\omegac
\begin{align} G(s)orig&=
| |||||||||||||
|
(originalunscaledtransferfunctionpolynomials)\\ G(s)scaled&=
| |||||||||||||||||||
|
(3.01dBat1rad/secscaledtransferfunctionpolynomials)\\ \omegac&=|G(s)|3.01dBattenuationfrequency\\ nn,nd&=orderofnumeratoranddenominator,respectively\\ N,D&=coefficientsofnumeratoranddenominator,respectively\\ \end{align}
Even order Hourglass filters have the same limitations regarding equally terminated passive networks as other Elliptic filters. The same even order modifications that resolve the problem with Elliptic filters also resolve the problem with Hourglass filters.