Almost-sure convergence of the continuous-time LMS algorithm
From MaRDI portal
Recommendations
Cited in
(10)- On the properties of the reduction-by-composition LMS algorithm
- Analysis of continuous-time LMS adaptive filter weights using stochastic calculus and Fokker-Planck Kolmogorov equation
- scientific article; zbMATH DE number 3974231 (Why is no real title available?)
- scientific article; zbMATH DE number 3974232 (Why is no real title available?)
- Almost-sure convergence of adaptive algorithms by projections
- scientific article; zbMATH DE number 653095 (Why is no real title available?)
- Necessary and sufficient conditions for stability of LMS
- The Averaged, Overdetermined, and Generalized LMS Algorithm
- Convergence behavior of the LMS algorithm in subband adaptive filtering.
- On the convergence of the LMS algorithm with a rank-deficient input autocorrelation matrix
This page was built for publication: Almost-sure convergence of the continuous-time LMS algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3991421)