Abstract
in this paper we studied the performance of several distributed adaptive algorithms for non-stationary sparse system identification. Non-stationarity is a feature that is introduced to adaptive networks recently and makes the performance of them degraded. The performance analyses are carried out with the steady-state mean square deviation (MSD) criterion of adaptive algorithms. Some sparsity aware algorithms are considered in this paper which tested in non-stationary systems for the first time. It is presented and proved that the performance of incremental least means square/forth (ILMS/F) algorithm surpasses all other algorithms as non-stationarity grows. We hope that this work will inspire researchers to look for other advanced algorithms against systems that are both non-stationary and sparse.
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.
