Transient Theoretical Analysis of Diffusion RLS Algorithm for Cyclostationary Colored Inputs

Abstract

Convergence of the diffusion RLS (DRLS) algorithm to steady-state has been extensively studied in the literature, whereas no analysis of its transient convergence behavior has been reported yet. In this letter, we conduct a theoretical analysis of the transient behavior of the DRLS algorithm for cyclostationary colored inputs, in the mean and mean-square error sense. The resulting analytical models allows us to thoroughly investigate the convergence behavior of the algorithm over adaptive networks in such complex scenarios. Simulation results support the accuracy and correctness of the theoretical findings.

arXiv comment5 pages, 2 figures

References in corpus (5)

• Multitask Diffusion Adaptation over Networks
• Multitask learning over graphs: An Approach for Distributed, Streaming Machine Learning
• Study of Robust Diffusion Recursive Least Squares Algorithms with Side Information for Networked Agents
• Multitask diffusion adaptation over networks with common latent representations
• Decentralized Sparse Multitask RLS over Networks