13.07.2015 Views

Passive, active, and digital filters (3ed., CRC, 2009) - tiera.ru

Passive, active, and digital filters (3ed., CRC, 2009) - tiera.ru

Passive, active, and digital filters (3ed., CRC, 2009) - tiera.ru

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.

FIR Filters 18-23Rejection of superfluous potential extremals. The solution of Equation 18.50 can be obtained only ifprecisely r þ 1 extremals are available. By differentiating E(v), one can show that in a filter with onefrequency b<strong>and</strong> of interest (e.g., a <strong>digital</strong> differentiator) the number of maxima in jE(v)j (potentialextremals in step 2 of Algorithm 18.1) can be as high as r þ 1. In the weighted-Chebyshev method, b<strong>and</strong>edges at which jE(v)j is maximum or jE(v)jjdj are treated as potential extremals (see Algorithm 18.2).Therefore, whenever the number of frequency b<strong>and</strong>s is increased by one, the number of potential˘extremals is increased by 2, i.e., for a filter with J b<strong>and</strong>s there can be as many as r þ 2J 1 frequenciesv i <strong>and</strong> a maximum of 2J 2 superfluousv i may occur. This problem is overcome by rejecting r r of thepotential extremals v i ,ifr > r, in step 4 of the algorithm.A simple rejection scheme is to reject the r r frequencies v i that yield the lowest jE( v i )j <strong>and</strong> thenrenumber the remaining v i from 0 to r [8]. This strategy is based on the well-known fact that themagnitude of the error in a given b<strong>and</strong> is inversely related to the density of extremals in that b<strong>and</strong>, i.e., alow density of extremals results in a large error <strong>and</strong> a high density results in a small error. Conversely,a low b<strong>and</strong> error is indicative of a high density of extremals, <strong>and</strong> rejecting superfluousv i in such a b<strong>and</strong> isthe appropriate course of action.A problem with the scheme just described is that whenever a frequency remains an extremal in twosuccessive iterations, jE(v)j assumes the value of jdj in the second iteration by virtue of Equation 18.49.In practice, there are almost always several frequencies that remain extremals from one iteration tothe next, <strong>and</strong> the value of jE(v)j at these frequencies will be the same. Consequently, the rejectionof potential extremals on the basis of the magnitude of the error can become arbitrary <strong>and</strong> may lead tothe rejection of potential extremals in b<strong>and</strong>s where the density of extremals is low. This tendsto increase the number of iterations, <strong>and</strong> it may even prevent the algorithm from converging onoccasion. This problem can to some extent be alleviated by rejecting only potential extremals that arenot b<strong>and</strong> edges.An alternative rejection scheme based on the aforementioned strategy, which gives excellent results fortwo-b<strong>and</strong> <strong>and</strong> three-b<strong>and</strong> <strong>filters</strong>, involves ranking the frequency b<strong>and</strong>s in the order of lowest averageb<strong>and</strong> error, dropping the b<strong>and</strong> with the highest average error from the list, <strong>and</strong> then rejecting potentialextremals, one per b<strong>and</strong>, in a cyclic manner starting with the b<strong>and</strong> with the lowest average error [11].The steps involved are as follows.˘˘˘˘˘˘ALGORITHM 18.3:Rejection of Superfluous Potential Externals1. Compute the average b<strong>and</strong> errorsE j ¼ 1 v jX v i ) ^v i 2V jE(˘for j ¼ 1, 2, ..., Jwhere V j is the set of potential externals in b<strong>and</strong> j given bynV j ¼ v j : v Lj ˘˘v j v Rjov j is the number of potential externals in b<strong>and</strong> j, <strong>and</strong> J is the number of b<strong>and</strong>s.2. Rank the J b<strong>and</strong>s in the order of lowest average error <strong>and</strong> let l 1 , l 2 ,...,l J be the ranked list obtained,i.e., l 1 <strong>and</strong> l J are the b<strong>and</strong>s with the lowest <strong>and</strong> highest average errors, respectively.3. Reject one v i in each of b<strong>and</strong>s l 1 , l 2 ,..., l J 1 , l 1 , l 2 ,..., l 1 until r r superfluous v i are rejected.In each case, reject the v i , other than a b<strong>and</strong> edge, that yields the lowest jE( v i )j in the b<strong>and</strong>.˘˘˘˘

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

Saved successfully!

Ooh no, something went wrong!