Abstract
Complex-valued least mean kurtosis (CLMK) algorithm and its augmented version (ACLMK) have recently become popular as workhorse tools in the processing of complex-valued signals due to their superior performances. Unfortunately, they are not yet suitable for sparse system identification problems. In this paper, combining the well-known sparsity-promoting strategies into the cost function based on the negated kurtosis of the error signal, we introduce a suit of sparsity-aware CLMK algorithms, named l0-norm CLMK (l0-CLMK), l0-ACLMK, zero-attraction CLMK (ZA-CLMK), ZA-ACLMK, reweighted ZA-CLMK (RZA-CLMK), and RZA-ACLMK. Simulation results on synthetic and real-world sparse system identification scenarios in the complex domain show that the proposed algorithms outperform the existing sparsity-aware algorithms in terms of convergence rate, tracking, and steady-state error.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
