15.01.2013 Views

U. Glaeser

U. Glaeser

U. Glaeser

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

TABLE 26.1 Filter Design Comparison<br />

Filter # Zeros # Poles Mag. Error GD. Error RMS GD. Error<br />

Elliptic (Fig. 26.1) 6 6 0.082 13.90 3.57<br />

Equalized elliptic (Fig. 26.3) 31 6 0.079 3.15 0.76<br />

IIR (Fig. 26.4) 31 6 0.015 2.40 0.32<br />

Note: The table shows three features: maximal magnitude error, maximal group delay error, and RMSs of the<br />

group delay error, of the optimal response of the filter in Figs. 26.3 and 26.4 designed under different approaches.<br />

|H |<br />

1<br />

FIGURE 26.4 Filter with optimal general weighted norm. The figures show the magnitude and the group delay of<br />

an IIR frequency selective filter (31 zeros, 6 poles) with flat delay passband. The ideal filter is the same as in Fig. 26.3,<br />

and the filter order is the same as the equalized elliptic filter.<br />

Several optimization techniques are available to solve these general problems. In addition, the error<br />

can be controlled by the selection of an error constraint, an error weight, or a design norm; however,<br />

the optimization of general norms is often a difficult problem, especially in the complex domain. Most<br />

recent research has studied these general norm problems in order to improve the design when the goal<br />

is a simultaneous approximation of the magnitude and phase.<br />

Filter Design as a Norm Problem<br />

Filter design is usually done by minimizing either the worst-case error (Chebyshev norm), or the root mean<br />

squares (RMS) (least-squares norm) of the weighted error. Important norms from classical mathematics<br />

are listed below:<br />

• Chebyshev norm: E ∞ = max<br />

ω E(ω )<br />

• Least-squares norm: =<br />

• p-norm: = for p ∈ [1, ∞]<br />

• Combined norm: E α = { α E ∞ + (1 – α) E 2}<br />

for α ∈ [0,1]<br />

where E = W(I − H) is the weighted complex error. When optimizing the Chebyshev norm, the resulting<br />

optimal filters have the smallest maximal error, while filters with minimal least-squares norm have the<br />

smallest RMS error. Preference for one norm over the other will generally depend on the application. In<br />

many cases, where both norms need to be small, filters should be designed under either the p-norm or<br />

the combined norm. Along with the norm, the numerical optimization can be done under design<br />

constraints, e.g., the most obvious one is a constraint on the magnitude of the error<br />

where ε(ω) is the error constraint.<br />

Figure 26.5 shows the error of the filter with the same specification designed under four different<br />

norms. The RMS and maximal errors are summarized in Table 26.2.<br />

© 2001 by CRC Press LLC<br />

0 ω ω<br />

c1<br />

c2 π<br />

ω<br />

D<br />

g<br />

D<br />

I<br />

π 2 1/2<br />

E 2 {∫−π E(ω ) dω}<br />

π p 1/p<br />

E p {∫−π E(ω ) dω}<br />

2<br />

min E such that E(ω ) ≤<br />

ε(ω )<br />

0 ω ω<br />

c1<br />

c2 π<br />

2<br />

ω

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!