{'fraction_non_alphanumeric': 0.025176233635448138, 'fraction_numerical': 0.0, 'mean_word_length': 5.291139240506329, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Convergence Analysis of a Fixed Point Algorithm Under Maximum Complex Correntropy Criterion

With the emergence of complex correntropy, the maximum complex correntropy criterion (MCCC) has been applied to the complex-domain adaptive filtering. The MCCC uses the fixed point method to find the optimal solution, which provides good robustness in the non-Gaussian noise environment, especially for the impulse noise. However, the convergence analysis for the fixed point method is limited to the real-domain filtering. In this letter, we provide the convergence analysis of fixed point based MCCC algorithm in complex-domain filtering. First, by using the matrix inversion lemma, we rewrite the MCCC algorithm to a gradient-like version. In addition, we provide two computationally efficient versions of MCCC. Then, we provide the stability analysis and obtain the excess mean square error for MCCC. Finally, simulation results confirm the correctness of the convergence analysis in this letter.