Abstract

Partial-update (PU) algorithms offer reduced computational complexity to adaptive second-order Volterra filters (SOV) in nonlinear systems while retaining acceptable performance. In this paper, a new selective partial-update technique for the normalized LMS (NLMS) SOV algorithm is proposed, which requires lesser number of comparison operations per iteration than existing methods while providing close performance to the standard M-Max NLMS-SOV algorithm. Convergence properties of the proposed algorithm are enhanced by making the algorithm step-size time varying based on the natural logarithm function. Simulation experiments compare the proposed algorithm with existing PU and variable step-size NLMS-SOV algorithms, which illustrate the advantageous properties of the new algorithm. The proposed algorithm achieves both lower steady-state misalignment and faster convergence speed when compared with the fixed step-size full-update NLMS-SOV algorithm. Simulations also show that comparison operations overhead of the proposed algorithm is reduced significantly compared to that of the standard M-Max NLMS-SOV algorithm.

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