Abstract
In this paper, a distributed adaptive algorithm for sparsity-aware learning in diffusion networks is developed. The algorithm follows the greedy roadmap for sparsity along with the adapt-combine co-operation strategy, based on the LMS rationale for adaptivity. A bound on the error norm between the obtained estimates and the target vector is computed, and the algorithm is shown to converge in the mean under some general assumptions. Finally, comparative experiments with a recently developed sparsity-promoting diffusion LMS demonstrate the enhanced performance of the proposed algorithm.
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.
