Abstract
Aiming at the contradiction between the convergence rate and steady state mean square error of adaptive filter based on Maximum Versoria Criterion (MVC), this paper introduces the multi-convex combination strategy into MVC algorithm, and proposes a multi-convex combination MVC (MCMVC) algorithm. Simulation results show that compared with the existing MVC algorithm, MCMVC algorithm can select the best filter more flexibly under different weight change rates, and thus it has faster convergence speed and stronger tracking ability. Moreover, compared with the existing multi-convex combination maximum correntropy criterion (MCMCC) algorithm, MCMVC algorithm not only ensures the tracking performance, but also has lower exponential computation and steady-state error.
This work was supported in part by the National Natural Science Foundation of China under Grant 61271262 and Grant 61871314, and in part by the Fundamental Research Funds for the Central Universities, CHD under Grant 300102249303 and Grant 300102249107.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Sayed, A.H.: Adaptive Filters, pp. 139–209. Wiley, Hoboken (2008)
Ozeki, K., Umeda, T.: An adaptive filtering algorithm using an orthogonal projection to an affine subspace and its properties. Electron. Commun. Jpn. 67(5), 19–27 (1984)
Gao, Y.: An adaptive filtering algorithm based on least square criterion. J. Guangzhou Univ. 32–34 (2001)
Walach, E., Widrow, B.: The least mean fourth (LMF) adaptive algorithm and its family. IEEE Trans. Inf. Theory 30(2), 275–283 (1984)
Pei, S.C., Tseng, C.C.: Least mean p-power error criterion for adaptive FIR filter. IEEE J. Sel. Areas Commun. 12(9), 1540–1547 (1994)
Zha, D.F., Qiu, T.S.: Adaptive generalized recursive least p-norm filtering algorithm based on minimum dispersion criterion. J. Electron. Inf. Technol. 54–58 (2007)
Singh, A., Principe, J.C.: Using correntropy as a cost function in linear adaptive filters. In: International Joint Conference on Neural Networks (IJCNN), pp. 2950–2955 (2009)
Principe, J.C.: Information Theoretic Learning: Renyi’s Entropy and Kernel Perspectives. Springer, New York (2010). https://doi.org/10.1007/978-1-4419-1570-2
Chen, B., Xing, L., Zhao, H., et al.: Generalized correntropy for robust adaptive filtering. IEEE Trans. Sig. Process. 64(13), 3376–3387 (2016)
Huang, F., Zhang, J., Zhang, S.: Maximum versoria criterion-based robust adaptive filtering algorithm. IEEE Trans. Circuits Syst. II Express Briefs 64(10), 1252–1256 (2017)
Arenas-Garcia, J., Gomez-Verdejo, V., Figueiras-Vidal, A.R.: New algorithms for improved adaptive convex combination of LMS transversal filters. IEEE Trans. Instrum. Meas. 54(6), 2239–2249 (2005)
Wu, W., Liang, Z., Luo, Q., Li, W.: Tracking performance of improved convex combination adaptive filter based on maximum correntropy criterion. In: Liu, X., Cheng, D., Jinfeng, L. (eds.) ChinaCom 2018. LNICST, vol. 262, pp. 184–193. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-06161-6_18
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Wu, W., Liang, Z., Bai, Y., Li, W. (2020). Multi-convex Combination Adaptive Filtering Algorithm Based on Maximum Versoria Criterion (Workshop). In: Gao, H., Feng, Z., Yu, J., Wu, J. (eds) Communications and Networking. ChinaCom 2019. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 313. Springer, Cham. https://doi.org/10.1007/978-3-030-41117-6_24
Download citation
DOI: https://doi.org/10.1007/978-3-030-41117-6_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-41116-9
Online ISBN: 978-3-030-41117-6
eBook Packages: Computer ScienceComputer Science (R0)