Pith. sign in

REVIEW

Transient Theoretical Analysis of Diffusion RLS Algorithm for Cyclostationary Colored Inputs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2101.04502 v1 pith:K475U4WP submitted 2021-01-12 eess.SP

Wei Gao , Jie Chen , Cédric Richard This is my paper
classification eess.SP
keywords algorithmanalysisbehaviorconvergencetheoreticaltransientbeencolored
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Sign in to comment.

Pith tools