• No results found

EE 508 Lecture 11. The Approximation Problem. Classical Approximations the Chebyschev and Elliptic Approximations

N/A
N/A
Protected

Academic year: 2021

Share "EE 508 Lecture 11. The Approximation Problem. Classical Approximations the Chebyschev and Elliptic Approximations"

Copied!
36
0
0

Loading.... (view fulltext now)

Full text

(1)

EE 508

Lecture 11

The Approximation Problem

Classical Approximations

(2)

Butterworth Approximations

Analytical formulation:

All pole approximation

Magnitude response is maximally flat at

ω

=0

Goes to 0 at

ω

=

Assumes value at

ω

=1

Assumes value of 1 at

ω

=0

Characterized by {n,

ε

}

Emphasis almost entirely on performance at

single frequency

"On the Theory of Filter Amplifiers", Wireless Engineer (also called

Experimental Wireless and the Radio Engineer), Vol. 7, 1930, pp. 536-541.

2

1 1+ε Review from Last Time

( )

LP

(3)

Butterworth Approximation

Poles of TBW(s)

[

]

[

]

1/ 1 sin 1 2 cos 1 2 2 2 n k p k j k n n π π ε + = ⎡− ⎛⎜ + ⎞⎟± ⎛⎜ + ⎞⎟⎤ ⎣ ⎦ 1 n k=0,1, ... 2 − for n even [ ] [ ] 1/ sin 1 2 cos 1 2 2 2 n k p k j k n n π π ε ⎡ ⎛ ⎞ ⎛ ⎞⎤ = + ± + ⎝ ⎠ ⎝ ⎠ ⎣ ⎦

[

]

1/ 1 0 n n p =ε − + j n-3 k=0, ... 2 for n odd Re Im n π 1 n ε⎛ ⎞⎜ ⎟⎝ ⎠ Re Im n π 1 n ε⎛ ⎞⎜ ⎟⎝ ⎠
(4)

Butterworth Approximation

What is the Q of the highest Q pole for the BW approximation?

1/ 0 sin cos 2 2 n p j j n n π π ε ⎡ ⎛ ⎞ ⎛ ⎞⎤ α β = + = + ⎝ ⎠ ⎝ ⎠ ⎣ ⎦ n π 1 n ε⎛ ⎞⎜ ⎟⎝ ⎠ 2 2 2 MAX Q α β α + = − 1 1 2 2 sin cos 1 2 2 2 sin 2sin 2 2 n n MAX n n Q n n π π ε π π ε ⎛ ⎞+ ⎛ ⎞ ⎜ ⎟ ⎜ ⎟ ⎝ ⎠ ⎝ ⎠ = = ⎛ ⎞ ⎛ ⎞ ⎜ ⎟ ⎜ ⎟ ⎝ ⎠ ⎝ ⎠ 1 2sin 2 MAX Q n π = ⎛ ⎞ ⎜ ⎟ ⎝ ⎠ Review from Last Time

(5)

Butterworth Approximation

Order needs to be rather high to get steep transition

Figure from Passive and Active Network Analysis and Synthesis, Budak

(6)

Butterworth Approximation

1 2 2sin 2n π = ⎛ ⎞ ⎜ ⎟ ⎝ ⎠

Phase is quite linear in passband (benefit unrelated to design requirements)

Figure from Passive and Active Network Analysis and Synthesis, Budak

(7)

Butterworth Approximation

• Widely Used Analytical Approximation

• Characterized by {ε,n}

• Maximally flat at ω=0

• Almost all emphasis placed on characteristics at single frequency (ω=0)

• Transition not very steep (requires large order for steep transition)

• Pole Q is quite low

• Pass-band phase is quite linear (no emphasis was placed on phase!)

• Poles lie on a circle

• Simple closed-form analytical expressions for poles and |T(jω)|

Summary

(8)

Approximations

Magnitude Squared Approximating Functions –

H

A

(

ω

2

)

Inverse Transform -

H

A

(

ω

2

)

T

A

(s)

Collocation

Least Squares Approximations

Pade

Approximations

Other Analytical Optimizations

Numerical Optimization

Canonical Approximations

Butterworth

Chebyschev

Elliptic

Bessel

Thompson

( ) LP T jω
(9)

Pafnuty Lvovich Chebyshev

Born May 16, 1821

Died December 8,1894

Nationality Russian

(10)

Chebyshev

Approximations

Analytical formulation:

All pole approximation

Magnitude response bounded between 1 and

in the pass band

Assumes the value of at

ω

=1

Goes to 0 at

ω

=

Assumes extreme values maximum no times in [0 1]

Characterized by {n,

ε

}

Based upon Chebyshev

Polynomials

Chebyshev polynomials were first presented in: P. L. Chebyshev (1854) "Théorie des mécanismes connus sous le nom parallelogrammes," Mémoires des Savants

étrangers présentes à l'Academie de Saint-Pétersbourg, vol. 7, pages 539-586.

2 1 1+ε 2 1 1+ε

Type I Chebyshev Approximations

( )

LP

(11)

Chebyshev

Approximations

Analytical formulation:

Magnitude response bounded between 0 and

in the stop band

Assumes the value of at

ω

=1

Value of 1 at

ω

=0

Assumes extreme values maximum times

in [1

]

Characterized by {n,

ε

}

Based upon Chebyshev

Polynomials

2 1 ε ε + 2 1 1+ε

Type II Chebyshev Approximations (not so common)

( )

LP

(12)

Chebyshev

Approximations

Chebyshev Polynomials

The Chebyshev polynomials are characterized by the property that

the polynomial assumes the extremum values of 0 and 1 a maximum number of times in the interval [0,1] and go to ∞ for x large.

In polynomial form they can be expressed as C0(x)=1

C1(x)=x

Cn+1(x)=2xCn(x) - Cn-1(x)

Or, equivalently, in trigonometric form as

( )

( )

(

)

( )

(

)

( )

(

( )

)

cos cos [ 1,1] cosh cos 1 1 cosh cos 1 n n n arc x x C x n arc h x x n arc h x x ∈ − ⎪⎪ = • ≥ ⎪ − • − ≤ −
(13)

Chebyshev

Approximations

Chebyshev Polynomials

Figure from Wikipedia

( )

( )

( )

( )

( )

( )

( )

( )

( )

0 1 2 2 3 3 4 2 4 5 3 5 6 4 2 6 7 5 3 7 8 6 4 2 8 1 2 1 4 3 8 8 1 16 20 5 32 48 18 1 64 112 56 7 128 256 160 32 1 C x C x x C x x C x x x C x x x C x x x x C x x x x C x x x x x C x x x x x = = = − = − = − + = − + = − + − = − + − = − + − +

The first 9 CC polynomials:

• Even-indexed polynomials are functions of x2

• Odd-indexed polynomials are product of x and function of x2

(14)

Chebyshev

Approximations

Type 1

( )

BW 2 2n

1

H

ω

=

1+

ε

ω

( )

( )

2 2 n

1

H

ω

=

1+ F

ε

ω

Butterworth A General Form

Fn(ω2) close to 1 in the pass band and gets very large in stop-band

Observation:

The square of the Chebyshev polynomials have this property

( )

( )

CC

2 2

n

1

H

ω

=

1+ C

ε

ω

(15)

Chebyshev

Approximations

Type 1

( )

( )

CC

2 2

n

1

H

ω

=

1+ C

ε

ω

(16)

Chebyshev

Approximations

Type 1

( )

( )

CC

2 2

n

1

H

ω

=

1+ C

ε

ω

Im Re Im Re Poles of TCC(s) Inverse Mapping
(17)

Chebyshev

Approximations

Type 1 Im Re 2 2 1 1 1

sinh 1 sinh cosh 1 sinh

n n k k arc arc α β ε ε ⎡ ⎤ ⎡ ⎤ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ + ⎢ ⎥ = ⎡ ⎛ ⎞⎤ ⎡ ⎛ ⎞⎤ ⎢ ⎥ ⎢ ⎥ ⎜ ⎟ ⎜ ⎟ ⎢ ⎥ ⎢ ⎥ ⎢ ⎝ ⎠⎥ ⎢ ⎝ ⎠⎥ ⎣ ⎦ ⎣ ⎦

(18)

Chebyshev

Approximations

Type 1 Im

Re

Poles of TCC(s)

(

)

1 1

(

)

1

sin sinh cos cosh

k π π 1 p 1+2k sinh 1+2k sinh 2n narc ε j 2n narc ε ⎡ ⎤ ⎡ ⎤ ⎡ ⎤ ⎛ ⎞ ⎡ ⎤ ⎛ ⎞ = − ⎜ ⎟ ± ⎜ ⎟ ⎣ ⎦ ⎣ ⎝ ⎠⎦ ⎣ ⎦ ⎣ ⎝ ⎠⎦ k p = −αk ± jβk 2 2 1 1 1

sinh 1 sinh cosh 1 sinh

n n k k arc arc α β ε ε ⎡ ⎤ ⎡ ⎤ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ + ⎢ ⎥ = ⎡ ⎛ ⎞⎤ ⎡ ⎛ ⎞⎤ ⎢ ⎥ ⎢ ⎥ ⎜ ⎟ ⎜ ⎟ ⎢ ⎥ ⎢ ⎥ ⎢ ⎝ ⎠⎥ ⎢ ⎝ ⎠⎥ ⎣ ⎦ ⎣ ⎦

Properties of the ellipse

(19)

Chebyshev

Approximations

Type 1 2 1 1+ε

( )

CC T ω 2 1 1+ε

( )

CC T ω

•|TCC(0)| alternates between 1 and with index number

•Substantial pass band ripple

•Sharp transitions from pass band to stop band

2

1 1+ε

(20)

Chebyshev

Approximations

Type 1

Sharp transitions from pass band to stop band

(21)

Chebyshev

Approximations

Type 1

CC transition is much steeper than BW transition From Budak Text

(22)

Comparison of BW and CC

Responses

CC slope at band edge much steeper than that

of BW

Corresponding pole Q of CC much higher than

that of BW

Lower-order CC filter can often meet same

band-edge transition as a given BW filter

Both are widely used

Cost of implementation of BW and CC for same

order is about the same

1

1

2 2

(

)

[

(

)]

CC BW

n

Slope

ω

= =

n

=

Slope

ω

=

(23)

Chebyshev

Approximations

Type 1

From BudakText

Analytically, it can be shown that, at the band-edge

( )

(

)

2 3 2 2 1 BW d T j n d ω ε ω = − +ε ( )

(

)

2 3 2 2 2 1 CC d T j n d ω ε ω = − +ε
(24)

Chebyshev

Approximations

Type 1

CC phase is much more nonlinear than BW phase From Budak Text

(25)

Chebyshev

Approximations

Type 1 Im

Re

(

)

1 1

(

)

1

sin sinh cos cosh

k π π 1 p 1+2k sinh 1+2k sinh 2n narc ε j 2n narc ε ⎡ ⎤ ⎡ ⎤ ⎡ ⎤ ⎛ ⎞ ⎡ ⎤ ⎛ ⎞ = − ⎜ ⎟± ⎜ ⎟ ⎣ ⎦ ⎣ ⎝ ⎠⎦ ⎣ ⎦ ⎣ ⎝ ⎠⎦

Maximum pole Q of CC approximation can be obtained by considering pole with index k=0

1 1 1

sin sinh cos cosh

0 π π 1 p sinh sinh 2n narc ε j 2n narc ε ⎡ ⎤ ⎡ ⎤ ⎡ ⎤ ⎛ ⎞ ⎡ ⎤ ⎛ ⎞ = − ⎜ ⎟± ⎜ ⎟ ⎣ ⎦ ⎣ ⎝ ⎠⎦ ⎣ ⎦ ⎣ ⎝ ⎠⎦ 2 2 2 MAX Q α β α + = − 0 p =α + jβ Recall 2 cos 1 1 1 2sin sinh MAX,CC π 2n Q π 1 sinh 2n narc ε ⎡ ⎤ ⎛ ⎞ ⎛ ⎞ ⎜ ⎟ ⎢ ⎥ ⎜ ⎟ ⎢ ⎥ =⎜ ⎟ + ⎛ ⎞ ⎢ ⎛ ⎛ ⎞⎞⎥ ⎜ ⎟ ⎜ ⎜ ⎜ ⎟⎟ ⎝ ⎠ ⎣ ⎝ ⎝ ⎠⎠⎦

(26)

Chebyshev

Approximations

Type 1

Comparison of maximum pole Q of CC approximation with that of BW approximation

2 cos 1 1 1 2sin sinh MAX,CC π 2n Q π 1 sinh 2n narc ε ⎡ ⎤ ⎛ ⎞ ⎛ ⎞ ⎜ ⎟ ⎢ ⎥ ⎜ ⎟ ⎢ ⎥ =⎜ ⎟ + ⎛ ⎞ ⎢ ⎛ ⎛ ⎞⎞⎥ ⎜ ⎟ ⎜ ⎜ ⎜ ⎟⎟ ⎝ ⎠ ⎣ ⎝ ⎝ ⎠⎠⎦ 1 2sin 2 MAX,BW Q n π = ⎛ ⎞ ⎜ ⎟ ⎝ ⎠ 2 cos 1 1 sinh MAX,CC MAX,BW π 2n Q Q 1 sinh narc ε ⎡ ⎤ ⎜ ⎟ ⎢ ⎥ ⎢ ⎥ = + ⎛ ⎛ ⎞⎞ ⎢ ⎥ ⎜ ⎟ ⎜ ⎟ ⎢ ⎝ ⎠⎥ ⎣ ⎦

Example – compare the Q’s for n=10 and ε=1 QBW=3.19 QCC=35.9

(27)

Chebyshev

Approximations

Type 2

( )

BW 2 2n

1

H

ω

=

1+

ε

ω

( )

( )

2 2 n

1

H

ω

=

1+ F

ε

ω

Butterworth A General Form

( )

( )

1

CC2

2 2

n

1

H

ω

=

1

1+

C

ω

ε

Another General Form

( )

( )

2 2 n

1

H

ω

=

1

1+

F 1/

ω

ε

(28)

Chebyshev

Approximations

Type 2

( )

( )

1

CC2 2 2 n

1

H

ω

=

1

1+

C

ω

ε

• Equal-ripple in stop band

• Monotone in pass band

• Both poles and zeros present

• Poles of Type II CC are reciprocal of poles of Type I

• Zeros of Type II are inverse of the zeros of the CC Polynomials

(

)

1

cos

π

2k-1

2

n

k

z

=

j

(

)

(

)

1 1 1 1

sin sinh cos cosh

k p π π 1 1+2k sinh 1+2k sinh 2n narc ε j 2n narc ε − = ⎡ ⎤ ⎡ ⎤ ⎡ ⎤ ⎛ ⎞ ± ⎡ ⎤ ⎛ ⎞ ⎜ ⎟ ⎜ ⎟ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎣ ⎦ ⎣ ⎝ ⎠⎦ ⎣ ⎦ ⎣ ⎝ ⎠⎦

(29)

Chebyshev

Approximations

Type 2

( )

( )

1

CC2 2 2 n

1

H

ω

=

1

1+

C

ω

ε

2 1 1 1 ε +

( )

CC T ω 2 1 1 1 ε +

( )

CC T ω
(30)

Chebyshev

Approximations

Type 2

( )

( )

1

CC2 2 2 n

1

H

ω

=

1

1+

C

ω

ε

2 1 1 1 ε +

( )

CC T ω

• Transition region not as steep as for Type 1

(31)

Chebyshev

Approximations

Type 2

( )

( )

1

CC2 2 2 n

1

H

ω

=

1

1+

C

ω

ε

• Pole Q expressions identical since poles are reciprocals

• Maximum pole Q is just as high as for Type 1

1 Re

(32)

Transitional BW-Chebyshev

Approximations

( )

( )

2 2 n

1

H

ω

=

1+ F

ε

ω

General Form Define FBWk=ω2k F CCk=Cn2(ω) Consider:

( )

( )

0

2 BWk CC n-k

1

H

ω

=

k n

1+ F

ε

F

≤ ≤

( )

( )

(

1

)

( )

0

1

2 BWk CC n-k

1

H

ω

=

1+

ε

θ

F

+ −

θ

F

≤ ≤

θ

• Other transitional approximations are possible

(33)

Transitional BW-CC filters

( )

2 2 2

1

1

ABW n

H

ω

ε ω

=

+

( )

2

(

( )

)

2 2

1

1

ACC n

H

C

ω

ε

ω

=

+

( )

2

( ) ( )

1 2 2 2

1

1

ATRAN k n k

H

C

ω

ε ω

ω

=

+

0

≤ ≤

k

n

( )

2

(

) ( )

2 2 2 2

1

1

1

ATRAN n n

H

C

ω

ε θω

θ

ω

=

+

+ −

0

≤ ≤

θ

1

(34)

Transitional BW-CC filters

( )

2

( ) ( )

1 2 2 2

1

1

ATRAN k n k

H

C

ω

ε ω

ω

=

+

( )

2

(

) ( )

2 2 2 2

1

1

1

ATRAN n n

H

C

ω

ε θω

θ

ω

=

+

+ −

Transitional filters will exhibit flatness at ω=0, passband ripple, and intermediate slope characteristics at band-edge

(35)

Chebyshev

Approximations

from Spectrum Software:

• Note that this is introduced as a Chebyshev filter, the source correctly points out that it implements the CC filter in a specific filter topology

• It is important to not confuse the approximation from the architecture and this Tow-Thomas Structure can be used to implement either BW or CC functions only differing in the choice of the component values

(36)
Russian Mathematician

References

Related documents

In the study presented here, we selected three rep- resentative pathogenic PV mAbs cloned from 3 different PV patients: F706, an anti-Dsg3 IgG4 isolated by heterohybridoma, F779,

Decrease in systolic blood pressure after stenting per- sists during follow-up (values are mean ± SD), but the proportion of patients needing antihypertensive treatment increases

Then we presented a portfolio optimization problem based on the use of the Multivariate Mixed Tempered Stable distribution for the joint modeling of univariate residuals obtained

Specification of the abstract model As presented, Partial order reduction methods reduce the state space of a program by exploiting the commutation of independent actions.

An analysis of the economic contribution of the software industry examined the effect of software activity on the Lebanese economy by measuring it in terms of output and value

Conversion factors used to determine fee schedule payments for anesthesia services furnished by qualified nonphysician anesthetists on or after January 1, 1992, are determined

TCP connection Data Cloud application Cloud backend server TCP Split-TCP proxy Wireless network cloud Layer 1/2/3 Wireless channel Wide area network Data Cloud application Mobile

Commanders of DON organizations shall enable DON information systems, including networks, e-mail, and Web servers, to use PKI certificates issued by the Department of Defense