Transient Theoretical Analysis of Diffusion RLS Algorithm for Cyclostationary Colored Inputs
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.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Stochastic Analysis of the Diffusion Least Mean Square and Normalized Least Mean Square Algorithms for Cyclostationary White Gaussian and Non-Gaussian Inputs
The diffusion least mean square (DLMS) and the diffusion normalized least mean square (DNLMS) algorithms are analyzed for a network having a fusion center. This structure reduces the dimensionality of the resulting stoch…
Assessing Cyclostationary Malware Detection via Feature Selection and Classification
Cyclostationarity involves periodic statistical variations in signals and processes, commonly used in signal analysis and network security. In the context of attacks, cyclostationarity helps detect malicious behaviors wi…
Anomaly DetectionClassificationfeature selectionIntrusion Detection+2CycloDSP: A cyclostationary signal analysis tool for GNU Radio
In this paper, we present a first attempt to incorporate in the GNU Radio ecosystem a tool called CycloDSP, devoted to the analysis of complex-valued cyclostationary signals. Such signals are ubiquitous in communication …
Improving the Transient Times for Distributed Stochastic Gradient Methods
We consider the distributed optimization problem where $n$ agents each possessing a local cost function, collaboratively minimize the average of the $n$ cost functions over a connected network. Assuming stochastic gradie…
Distributed OptimizationQuasicyclic Principal Component Analysis
We present quasicyclic principal component analysis (QPCA), a generalization of principal component analysis (PCA), that determines an optimized basis for a dataset in terms of families of shift-orthogonal principal vect…