Set-Membership LMS Adaptive Algorithms Based on an Error-Estimation Time-Varying Bound Method
- 23 Downloads
To reduce the computational complexity and enhance the convergence rate, this article presents set-membership least mean square adaptive algorithms based on an error-estimation time-varying bound method. The bound is constituted by the estimation error for the previous iteration and a time-varying error adjustment factor. The set-membership (SM) method utilizes the estimation error for the current iteration and the bound to determine whether to update the weight vector. When the estimation error is larger than the bound, the weight vector is updated; otherwise, no updating is required. Then, by utilizing a nonlinear function between the step size and the estimation error, the step size is modified to further enhance the convergence rate. Compared to the traditional set-membership normalized least mean square algorithms, the simulation results show that the proposed algorithms have the following advantages: (1) fast convergence with low computational costs, (2) maintaining low, steady-state mean square error, (3) enhancing noise resistance in low-SNR environments and (4) estimating the SM bound in noisy environments without requiring noise power estimation.
KeywordsSet-membership Adaptive algorithm Estimation error Least mean square Low complexity
This work is supported by National Natural Science Foundation of China (51877141, 51842703).
- 7.J.R. Deller, S. Gollamudi, S. Nagaraj, D. Joachim, Y.F. Huang, Convergence analysis of the QUASI-OBE algorithm and the performance implications, in Proceedings of IFAC International Symposium on System Identification, Santa Barbara, CA (2000), pp. 875–880Google Scholar
- 9.G. Fang, S. Qiu, X. Ma, W. Sheng, Y. Han, Robust adaptive beamforming based on fast rank-reducing MVB algorithm, in 2014 3rd Asia-Pacific Conference on Antennas and Propagation, Harbin, China (2014), pp. 317–320Google Scholar
- 10.S. Gollamudi, S. Nagaraj, Y.F. Huang, SMART: a toolbox for set-membership filtering, in Proceedings of the European Conference on Circuit Theory and Design, Budapest, Hungary (1997), pp. 879–884Google Scholar
- 12.L. Guo, Y.F. Huang, Set-membership adaptive filtering with parameter-dependent error bound tuning, in Proceedings. (ICASSP ‘05). IEEE International Conference on Acoustics, Speech, and Signal Processing, Philadelphia, PA, USA (2005), pp. 369–372Google Scholar
- 19.L. Wang, R. C. de Lamare, Robust auxiliary vector filtering algorithm based on constrained constant modulus design for adaptive beamforming, in 2010 IEEE International Conference on Acoustics, Speech and Signal Processing, Dallas, TX, USA (2010), pp. 2530–2533Google Scholar
- 21.Y. Wang, L. Huang, Y. Shi, Robust widely linear reduced-rank adaptive beamforming based on joint iterative optimization, in 2014 Fourth International Conference on Instrumentation and Measurement, Computer, Communication and Control, Harbin, China (2014), pp. 366–369Google Scholar
- 22.Q. Yang, Y. Zhang, J. Wang, C. Tang, Anti-jamming algorithm based on multistage Wiener filter with variable loading, in 2015 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC), Ningbo, China (2015), pp. 1–4Google Scholar
- 23.S. Zhang, J. Zhang, Set-membership NLMS algorithm with robust error bound. IEEE Trans. Circuits II 61(7), 536–540 (2014)Google Scholar