Skip to main content

Tracking Performance of Improved Convex Combination Adaptive Filter Based on Maximum Correntropy Criterion

  • Conference paper
  • First Online:

Abstract

A convex combination adaptive filter based on maximum correntropy criterion (CMCC) was widely used to solve the contradiction between the step size and the misadjustment in impulsive interference. However, one of the major drawbacks of the CMCC is its poor tracking ability. In order to solve this problem, this paper proposes an improved convex combination based on the maximum correntropy criterion (ICMCC), and investigates its estimation performance for system identification in the presence of non-Gaussian noise. The proposed ICMCC algorithm implements the combination of arbitrary number of maximum correntropy criterion (MCC) based adaptive filters with different adaption steps. Each MCC filter in the ICMCC is capable of tracking a specific change speed, such that the combined filter can track a variety of the change speed of weight vectors. In terms of normalized mean square deviation (NMSD) and tracking speed, the proposed algorithm shows good performance in the system identification for four non-Gaussian noise scenarios.

This work was supported in part by the National Natural Science Foundation of China under Grant No. 61271262, and in part by the Special Fund for Basic Scientific Research of Central Colleges, Chang’an University (310824171004).

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Sayed, A.H.: Fundamentals of Adaptive Filtering. Wiley, Hoboken (2003)

    Google Scholar 

  2. Gui, G., Mehbodniya, A., Adachi, F.: Least mean square/fourth algorithm for adaptive sparse channel estimation. In: 2013 IEEE 24th International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC), pp. 296–300 (2013)

    Google Scholar 

  3. Li, Y., Wang, Y., Jiang, T.: Sparse-aware set-membership NLMS algorithms and their application for sparse channel estimation and echo cancelation. AEU-Int. J. Electron. Commun. 70, 895–902 (2016)

    Article  Google Scholar 

  4. Chen, B., Xing, L., Zhao, H.: Generalized correntropy for robust adaptive filtering. IEEE Trans. Signal Process. 64, 3376–3387 (2016)

    Article  MathSciNet  Google Scholar 

  5. Li, Y., Wang, Y., Yang, R., Albu, F.: A soft parameter function penalized normalized maximum correntropy criterion algorithm for sparse system identification. Entropy 19, 1–16 (2017)

    Google Scholar 

  6. Li, Y., Jin, Z.: Sparse normalized maximum correntropy criterion algorithm with L1-norm penalties for channel estimation. In: 2017 Progress in Electromagnetics Research Symposium, pp. 1677–1682 (2017)

    Google Scholar 

  7. Walach, E., Widrow, B.: The least mean fourth (LMF) adaptive algorithm and its family. IEEE Trans. Inf. Theory 30, 275–283 (1984)

    Article  Google Scholar 

  8. Hajiabadi, M., Zamiri-Jafarian, H.: Distributed adaptive LMF algorithm for sparse parameter estimation in Gaussian mixture noise. In: 7th International Symposium on Telecommunications, pp. 1046–1049. Tehran (2014)

    Google Scholar 

  9. Lu, L., Zhao, H., Wang, W.: Performance analysis of the robust diffusion normalized least mean P-power algorithm. IEEE Trans. Circuits Syst. II: Express Briefs 1–1 (2018)

    Google Scholar 

  10. Lu, L., Zhao, H., Chen, B.: Improved variable forgetting factor recursive algorithm based on the logarithmic cost for volterra system identification. IEEE Trans. Circuits Syst. II: Express Briefs 63, 588–592 (2016)

    Article  Google Scholar 

  11. Principe, J.C.: Information Theoretic Learning: Renyis Entropy and Kernel Perspectives. Springer, Berlin (2010)

    Book  Google Scholar 

  12. Erdogmus, D., Principe, J.C.: Convergence properties and data efficiency of the minimum error entropy criterion in adaline training. IEEE Trans. Signal Process. 51, 1966–1978 (2003)

    Article  Google Scholar 

  13. Chen, B., et al.: Stochastic gradient identification of wiener system with maximum mutual information criterion. IET Signal Process 5, 589–597 (2011)

    Article  MathSciNet  Google Scholar 

  14. Liu, Y., Fan, Y., Zhou, L.C.: Ensemble correntropy based mooney viscosity prediction model for an industrial rubber mixing process. Chem. Eng. Technol. 39, 1804–1812 (2016)

    Article  Google Scholar 

  15. Han, S., Jeong, K.H., Principe, J.: Robust adaptive minimum entropy beam former in impulsive noise. In: IEEE Workshop on Machine Learning for Signal Processing (2007)

    Google Scholar 

  16. Chen, B., Xing, L., Liang, J.: Steady-state mean-square error analysis for adaptive filtering under the maximum correntropy criterion. IEEE Signal Process. Lett. 21, 880–884 (2014)

    Article  Google Scholar 

  17. Khalili, A., Rastegarnia, A.: Steady-state tracking analysis of adaptive filter with maximum correntropy criterion. Circuits Syst. Signal Process (2016)

    Google Scholar 

  18. Wang, W., Zhao, J., Qu, H., Chen, B.: A switch kernel width method of correntropy for channel estimation. In: International Joint Conference on Neural Networks, pp. 1–7 (2015)

    Google Scholar 

  19. He, Y., Wang, F.: Kernel adaptive filtering under generalized maximum correntropy criterion. In: International Joint Conference on Neural Networks, pp. 1738–1745 (2016)

    Google Scholar 

  20. Wang, R., Chen, B.: A variable step-size adaptive algorithm under maximum correntropy criterion. In: IEEE International Conference on Acoustic, Speech and Signal Processing (ICASSP), pp. 1–5 (2015)

    Google Scholar 

  21. Shi, L.: Convex combination of adaptive filters under the maximum correntropy criterion in impulsive interference. IEEE Signal Process. Lett. 21, 1385–1388 (2014)

    Article  Google Scholar 

  22. Liu, W.: Correntropy: properties and applications in non-Gaussian signal processing. IEEE Trans. Signal Process. 55, 5286–5298 (2007)

    Article  MathSciNet  Google Scholar 

  23. Liu, C., Qi, Y., Ding, W.: The data-reusing MCC-based algorithm and its performance analysis. Chin. J. Electron. 25, 719–725 (2016)

    Article  Google Scholar 

  24. Arenas-Garcia, J., Figueiras-Vidal, A.R., Sayed A.H.: Improved adaptive filtering schemes via adaptive combination. In: 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers, pp. 1–4 (2009)

    Google Scholar 

  25. Arenas-Garca, J., Gmez-Verdejo, V., Figueiras-Vidal, A.R.: Combinations of adaptive filters: performance and convergence properties. IEEE Signal Process. Mag. 33, 120C–140 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhonghua Liang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wu, W., Liang, Z., Luo, Q., Li, W. (2019). Tracking Performance of Improved Convex Combination Adaptive Filter Based on Maximum Correntropy Criterion. In: Liu, X., Cheng, D., Jinfeng, L. (eds) Communications and Networking. ChinaCom 2018. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 262. Springer, Cham. https://doi.org/10.1007/978-3-030-06161-6_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-06161-6_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-06160-9

  • Online ISBN: 978-3-030-06161-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics