Improving the performance of the LMS algorithm via cooperative learning

Abstract

Combination of two adaptive filters working in parallel for achieving better performance both in term of convergence speed and excess mean square error (EMSE) has been considered by several researchers in recent past. Prominent among these include convex combination (where combinational weight factors are within the range [0 1], while summing up to one), affine combination (where the combinational weight factors are free from any range constraint, while still summing up to one) and unconstrained model combination (where the output of constituent filters are combined using another adaptive algorithm). In this paper, we propose a novel way of using two adaptive filters for achieving better performance, using the cooperative learning approach. For this, we employ one LMS based adaptive filter that uses a larger step size and thus has a faster rate of convergence at the expense of higher EMSE. The other filter employed uses a modified version of the LMS algorithm, which employs a much lesser step size, but has one extra update term in the weight update relation that helps in learning from the faster filter its filter weight information. The learning takes place during the transient phase, while, in the steady state, two filters become almost independent of each other. Presence of the learning component in the weight update recursion enables the filter to converge much faster while a smaller step size ensures much less steady state EMSE. The claims are supported by theoretical as well as detailed simulation studies.