Abstract
We note that some existing algorithms are based on the normalized least-mean square (NLMS) algorithm and aim to reduce the computational complexity of NLMS all inherited from the solution of the same optimization problem, but with different constraints. A new constraint is analyzed to substitute an extra searching technique in the set-membership partial-update NLMS algorithm (SM-PU-NLMS) which aims to get a variable number of updating coefficients for a further reduction of computational complexity. We get a closed form expression of the new constraint without extra searching technique to generate a novel set-membership variable-partial-update NLMS (SM-VPU-NLMS) algorithm. Note that the SM-VPU-NLMS algorithm obtains a faster convergence and a smaller mean-squared error (MSE) than the existing SM-PU-NLMS. It is pointed out that the closed form expression can also be applied to the conventional variable-step-size partial-update NLMS (VSS-PU-NLMS) algorithm. The novel variable-step-size variable-partial-update NLMS (VSS-VPU-NLMS) algorithm is also verified to get a further computational complexity reduction. Simulation results verify that our analysis is reasonable and effective.
Similar content being viewed by others
References
Samalla K, Rao G M, Stayanarayana C. Survey of sparse adaptive filters for acoustic echo cancellation. Int J Image Graph Signal Process, 2013, 5: 16–24
Hadei S A, Azmi, P. Low-complexity adaptive channel estimation over multipath Rayleigh fading non-stationary channels under CFO. In: 18th International Conference on Telecommunications (ICT), Ayia Napa, 2011. 339–345
Douglas S C. Adaptive filters employing partial updates. IEEE Trans Circuits Syst, 1997, 44: 209–216
Dogancay K. Partial-update Adaptive Signal Processing: Design Analysis and Implementation. Academic Press, 2008
Abadi M S E, Moradiani F. A unified approach to tracking performance analysis of the selective partial update adaptive filter algorithms in nonstationary environment. Digit Signal Process, 2013, 23: 817–830
Deller J R. Set-membership identification in digital signal processing. IEEE ASSP Mag, 1989, 6: 4–20
Gollamudi S, Nagaraj S, Kapoor S, et al. Set-membership filtering and a set-membership normalized LMS algorithm with an adaptive step size. IEEE Signal Process Lett, 1998, 5: 111–114
Werner S, Diniz P S R. Set-membership affine projection algorithm. IEEE Signal Process Lett, 2001, 8: 231–235
Diniz P S R, Werner S. Set-membership binormalized data-reusing LMS algorithms. IEEE Trans Signal Process, 2003, 51: 124–134
Werner S, de Campos M L R, Diniz P S R. Partial-update NLMS algorithms with data-selective updating. IEEE Trans Signal Process, 2004, 52: 938–949
Diniz P S R. Adaptive Filtering: Algorithms and Practical Implementation. London: Springer, 2008
Krishnaiah P R, Hagis P, Steinberg L. A note on the bivariate chi distribution. SIAM Rev, 1963, 5: 140–144
Kwong R H, Johnston E W. A variable step size LMS algorithm. IEEE Trans Signal Process, 1992, 40: 1633–1642
Mayyas K. A variable step-size selective partial update LMS algorithm. Digit Signal Process, 2013, 23: 75–85
Huang H C, Lee J. A new variable step-size NLMS algorithm and its performance analysis. IEEE Trans Signal Process, 2012, 60: 2055–2060
Diniz P S R. Adaptive Filtering: Algorithms and Practical Implementation. Berlin: Springer, 2013
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhu, F., Gao, F., Yao, M. et al. Variable partial-update NLMS algorithms with data-selective updating. Sci. China Inf. Sci. 57, 1–11 (2014). https://doi.org/10.1007/s11432-014-5078-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-014-5078-8