外文翻译基于lms算法的自适应组合滤波器大学论文.doc

英文原文Combined Adaptive Filter with LMS-Based AlgorithmsBo zo Krstaji c, LJubi sa Stankovi c,and Zdravko UskokoviAbstract: A combined adaptive lter is proposed. It consists of parallel LMS-based adaptive FIR lters and an algorithm for choosing the better among them. As a criterion for comparison of the considered algorithms in the proposed lter, we take the ratio between bias and variance of the weighting coefcients. Simulations results conrm the advantages of the proposed adaptive lter.Keywords: Adaptive lter, LMS algorithm, Combined algorithm,Bias and variance trade-off1IntroductionAdaptive lters have been applied in signal processing and control, as well as in many practical problems, 1, 2. Performance of an adaptive lter depends mainly on the algorithm used for updating the lter weighting coefcients. The most commonly used adaptive systems are those based on the Least Mean Square (LMS) adaptive algorithm and its modications (LMS-based algorithms).The LMS is simple for implementation and robust in a number of applications 13. However, since it does not always converge in an acceptable manner, there have been many attempts to improve its performance by the appropriate modications: sign algorithm (SA) 8, geometric mean LMS (GLMS) 5, variable step-size LMS(VS LMS) 6, 7.Each of the LMS-based algorithms has at least one parameter that should be dened prior to the adaptation procedure (step for LMS and SA; step and smoothing coefcients for GLMS; various parameters affecting the step for VS LMS). These parameters crucially inuence the lter output during two adaptation phases:transient and steady state. Choice of these parameters is mostly based on some kind of trade-off between the quality of algorithm performance in the mentioned adaptation phases.We propose a possible approach for the LMS-based adaptive lter performance improvement. Namely, we make a combination of several LMS-based FIR lters with different parameters, and provide the criterion for choosing the most suitable algorithm for different adaptation phases. This method may be applied to all the LMS-based algorithms, although we here consider only several of them.The paper is organized as follows. An overview of the considered LMS-based algorithms is given in Section 2.Section 3 proposes the criterion for evaluation and combination of adaptive algorithms. Simulation results are presented in Section 4.2. LMS based algorithmsLet us dene the input signal vector and vector of weighting coefcients as .The weighting coefcients vector should be calculated according to: （1）where is the algorithm step, E is the estimate of the expected value andis the error at the in-stant k,and dk is a reference signal. Depending on the estimation of expected value in (1), one denes various forms of adaptive algorithms: the LMS，the GLMS,and the SA,1,2,5,8 .The VS LMS has the same form as the LMS, but in the adaptation the step (k) is changed 6, 7.The considered adaptive ltering problem consists in trying to adjust a set of weighting coefcients so that the system output, tracks a reference signal, assumed as,where is a zero mean Gaussian noise with the variance ,and is the optimal weight vector (Wiener vector). Two cases will be considered: is a constant (stationary case) andis time-varying (nonstationary case). In nonstationary case the unknown system parameters( i.e. the optimal vector)are time variant. It is often assumed that variation of may be modeled as is the zero-mean random perturbation, independent on and with the autocorrelation matrix .Note that analysis for the stationary case directly follows for .The weighting coefcient vector converges to the Wiener one, if the condition from 1, 2 is satised.Dene the weighting coefcientsmisalignment, 13,. It is due to both the effects of gradient noise (weighting coefcients variations around the average value) and the weighting vector lag (difference between the average and the optimal value), 3. It can be expressed as:, (2)According to (2), the ith element of is: (3)where is the weighting coefcient bias and is a zero-mean random variable with the variance .The variance depends on the type of LMS-based algorithm, as well as on the external noise variance .Thus, if the noise variance is constant or slowly-varying, is time invariant for a particular LMS-based algorithm. In that sense, in the analysis that follows we will assume that depends only on the algorithm type, i.e. on its parameters.An important performance measure for an adaptive lter is its mean square deviation (MSD) of weighting coefcients. For the adaptive lters, it is given by, 3:.3. Combined adaptive lterThe basic idea of the combined adaptive lter lies in parallel implementation of two or more adaptive LMS-based algorithms, with the choice of the best among them in each iteration 9. Choice of the most appropriate algorithm, in each iteration, reduces to the choice of the best value for the weighting coefcients. The best weighting coefcient is the one that is, at a given instant, the closest to the corresponding value of the Wiener vector. Let be the i th weighting coefcient for LMS-based algorithm with the chosen parameter q at an instant k. Note that one may now treat all the algorithms in a unied way (LMS: q ,GLMS: q a,SA:q ). LMS-based algorithm behavior is crucially dependent on q. In each iteration there is an optimal value qopt , producing the best performance of the adaptive al-gorithm. Analyze now a combined adaptive lter, with several LMS-based algorithms of the same type, but with different parameter q.The weighting coefcients are random variables distributed around the ,with and the variance , related by 4, 9:, (4)where (4) holds with the probability P(), dependent on . For example, for = 2 and a Gaussian distribution,P() = 0.95 (two sigma rule).Dene the condence intervals for : (5)Then, from (4) and (5) we conclude that, as long as , independently on q. This means that, for small bias, the condence intervals, for different of the same LMS-based algorithm, of the same LMS-based algorithm, intersect. When, on the other hand, the bias becomes large, then the central positions of the intervals for different are far apart, and they do not intersect.Since we do not have apriori information about the ,we will use a specic statistical approach to get the criterion for the choice of adaptive algorithm, i.e. for the values of q. The criterion follows from the trade-off condition that bias and variance are of the same order of magnitude, i.e.The proposed combined algorithm (CA) can now be summarized in the following steps:Step 1. Calculate for the algorithms with different from the predened set .Step 2. Estimate the variance for each considered algorithm.Step 3. Check if intersect for the considered algorithms. Start from an algorithm with largest value of variance, and go toward the ones with smaller values of variances. According to (4), (5) and the trade-off criterion, this check reduces to the check if (6)is satised, where ,and the following relation holds: .If no intersect (large bias) choose the algorithm with largest value of variance. If the intersect, the bias is already small. So, check a new pair of weighting coefcients or, if that is the last pair, just choose the algorithm with the smallest variance. First two intervals that do not intersect mean that the proposed trade-off criterion is achieved, and choose the algorithm with large variance.Step 4. Go to the next instant of time.The smallest number of elements of the set Q is L =2. In that case, one of the should provide good tracking of rapid variations (the largest variance), while the other should provide small variance in the steady state. Observe that by adding few more between these two extremes, one may slightly improve the transient behavior of the algorithm.Note that the only unknown values in (6) are the variances. In our simulations we estimate as in 4:, (7)for k = 1, 2,. , L and .The alternative way is to estimate as:，for x(i) = 0. （8）Expressions relating and in steady state, for different types of LMS-based algorithms, are known from literature. For the standard LMS algorithm in steady state, and are related ,3. Note that any other estimation of is valid for the proposed filter. Complexity of the CA depends on the constituent algorithms (Step 1), and on the decision algorithm (Step 3).Calculation of weighting coefficients for parallel algorithms does not increase the calculation time, since it is performed by a parallel hardware realization, thus increasing the hardware requirements. The variance estimations (Step 2), negligibly contribute to the increase of algorithm complexity, because they are performed at the very beginning of adaptation and they are using separate hardware realizations. Simple analysis shows that the CA increases the number of operations for, at most, N(L1) additions and N(L1) IF decisions, and needs some additional hardware with respect to the constituent algorithms.4.Illustration of combined adaptive filterConsider a system identification by the combination of two LMS algorithms with different steps. Here, the parameter q is ,i.e. . The unknown system has four time-invariant coefficients,and the FIR filters are with N = 4. We give the average mean square deviation (AMSD) for both individual algorithms, as well as for their combination,Fig. 1(a). Results are obtained by averaging over 100 independent runs (the Monte Carlo method), with = 0.1. The reference dk is corrupted by a zero-mean uncorrelated Gaussian noise with = 0.01 and SNR = 15 dB, and is 1.75. In the first 30 iterations the variance was estimated according to (7), and the CA picked the weighting coefficients calculated by the LMS with . As presented in Fig. 1(a), the CA first uses the LMS with and then, in the steady state, the LMS with /10. Note the region, between the 200th and 400th iteration,where the algorithm can take the LMS with either stepsize,in different realizations. Here, performance of the CA would be improved by increasing the number of parallel LMS algorithms with steps between these two extrems.Observe also that, in steady state, the CA does not ideally pick up the LMS with smaller step. The reason is in the statistical nature of the approach. Combined adaptive filter achieves even better performance if the individual algorithms, instead of starting an iteration with the coefficient values taken from their previous iteration, take the ones chosen by the CA. Namely, if the CA chooses, in the k-th iteration, the weighting coefficient vector ,then each individual algorithm calculates its weighting coefficients in the (k+1)-th iteration according to: (9)Fig. 1. Average MSD for considered algorithms.Fig. 2. Average MSD for considered algorithms.Fig. 1(b) shows this improvement, applied on the previous example. In order to clearly compare the obtained results,for each simulation we calculated the AMSD. For the first LMS () it was AMSD = 0.02865, for the second LMS (/10) it was AMSD = 0.20723, for the CA (CoLMS) it was AMSD = 0.02720 and for the CA with modification (9) it was AMSD = 0.02371.5. Simulation resultsThe proposed combined adaptive filter with various types of LMS-based algorithms is implemented for stationary and nonstationary cases in a system identification setup.Performance of the combined filter is compared with the individual ones, that compose the particular combination.In all simulations presented here, the reference dk is corrupted by a zero-mean uncorrelated Gaussian noise with and SNR = 15 dB. Results are obtained by averaging over 100 independent runs, with N = 4, as in the previous section. (a) Time varying optimal weighting vector: The proposed idea may be applied to the SA algorithms in a nonstationary case. In the simulation, the combined filter is composed out of three SA adaptive filters with different steps, i.e. Q = , /2, /8; = 0.2. The optimal vectors is generated according to the presented model with ,and with = 2. In the first 30 iterations the variance was estimated according to (7), and CA takes the coefficients of SA with (SA1). Figure 2(a) shows the AMSD characteristics for each algorithm. In steady state the CA does not ideally follow the SA3 with /8, because of the nonstationary problem nature and a relatively small difference between the coefficient variances of the SA2 and SA3. However,this does not affect the overall performance of the proposed algorithm. AMSD for each considered algorithm was: AMSD = 0.4129 (SA1,), AMSD = 0.4257 (SA2,/2), AMSD = 1.6011 (SA3, /8) and AMSD = 0.2696(Comb). (b) Comparison with VS LMS algorithm 6: In this simulation we take the improved CA (9) from 3.1, and compare its performance with the VS LMS algorithm 6, in the case of abrupt changes of optimal vector. Since the considered VS LMS algorithm6 updates its step size for each weighting coefficient individually, the comparison of these two algorithms is meaningful. All the parameters for the improved CA are the same as in 3.1. For the VS LMS algorithm 6, the relevant parameter values are the counter of sign change m0 = 11,and the counter of sign continuity m1 = 7. Figure 2(b)shows the AMSD for the compared algorithms, where one can observe the favorable properties of the CA, especially after the abrupt changes. Note that abrupt changes are generated by multiplying all the system coefficients by 1 at the 2000-th iteration (Fig. 2(b). The AMSD for the VS LMS was AMSD = 0.0425, while its value for the CA (CoLMS) was AMSD = 0.0323.For a complete comparison of these algorithms we consider now their calculation complexity, expressed by the respective increase in number of operations with respect to the LMS algorithm. The CA increases the number of requres operations for N additions and N IF decisions.For the VS LMS algorithm, the respective increase is: 3N multiplications, N additions, and at least 2N IF decisions.These values show the advantage of the CA with respect to the calculation complexity.6. ConclusionCombination of the LMS based algorithms, which results in an adaptive system that takes the favorable properties of these algorithms in tracking parameter variations, is proposed.In the course of adaptation procedure it chooses better algorithms, all the way to the steady state when it takes the algorithm with the smallest variance of the weighting coefficient deviations from the optimal value.Acknowledgement.