Abstract

This paper propounds the adaptive polynomial filtering deploying the multifarious variable step-size least mean square (VSS-LMS) algorithms for the nonlinear Volterra multichannel system identification, and all are compared with a fixed step-size Volterra least mean square (VLMS) algorithm, under the various noise constraints comprising an individual signal-to-noise ratio (SNR). The VSS-LMS algorithm corroborates steady behaviour during convergence, and the step- size of the adaptive filter is altered in compliance with a gradient descent algorithm delineated to abate the squared estimation error in the course of each iteration, and it also revamps tracking rendition in the smoothly time-varying environments to the choice of the parameters and the boundaries of adaptive filter. In multitudinous practical implementations, the autocorrelation matrix of the input signal has the immense eigenvalue spread in the manifestation of nonlinear Volterra filter than in respect of the linear impulse response filter. In such circumstances, an adaptive step-size is a pertinent option to mitigate the unpropitious effects of eigenvalue spread on the convergence of VLMS adaptive algorithm. The simulation results are exhibited to reinforce the analysis, which compare the VSS-LMS algorithms with fixed step-size of the second-order Volterra filter, and also substantiate that the VSS-LMS algorithms are more robust than the fixed step-size algorithm when the input noise is logistic chaotic type. Index Terms-least mean square (LMS), minimum mean square error (MMSE), system identification, variable step-size least mean square (VSS-LMS), Volterra filter.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call