Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.