Multiple plant identifier via adaptive LMS convex combination

The least mean square (LMS) algorithm has become a very popular algorithm for adaptive filtering due to its robustness and simplicity. A difficulty concerning LMS filters is their inherent compromise between tracking capabilities and precision, that is imposed by the selection of a fixed value for the adaption step. An adaptive convex combination of one fast LMS filter (high adaption step) and one slow LMS filter (low adaption step) was proposed as a way to break this balance. We propose to generalize this idea, combining multiple LMS filters with different adaption steps. Additional speeding up procedures are necessary to improve the performance of the basic scheme. Some simulation work has been carried out to show the appropriateness of this approach when identifying plants that vary at different rates.

[1]  Bernard Widrow,et al.  The least mean fourth (LMF) adaptive algorithm and its family , 1984, IEEE Trans. Inf. Theory.

[2]  Richard W. Harris,et al.  A variable step (VS) adaptive filter algorithm , 1986, IEEE Trans. Acoust. Speech Signal Process..

[3]  A. Constantinides,et al.  Least mean mixed-norm adaptive filtering , 1994 .

[4]  Anthony G. Constantinides,et al.  LMS+F algorithm , 1995 .

[5]  Andrew C. Singer,et al.  Universal linear prediction by model order weighting , 1999, IEEE Trans. Signal Process..

[6]  Andrew C. Singer,et al.  Multi-stage adaptive signal processing algorithms , 2000, Proceedings of the 2000 IEEE Sensor Array and Multichannel Signal Processing Workshop. SAM 2000 (Cat. No.00EX410).

[7]  Á. Navia-Vázquez,et al.  An adaptive combination of adaptive filters for plant identification , 2002, 2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628).