On the properties of the reduction-by-composition LMS algorithm
From MaRDI portal
The authors investigate some statistical properties of the reduction-by-composition least mean square adaptive filtering algorithm introduced by \textit{S. G. Chen, Y. A. Kao} and \textit{C. Y. Chen} [IEEE Trans. Circuits Syst. II 43, 372-378 (1996)]. They establish mean and mean square convergence, provide recommendations for the choice of the tuning parameters and report simulation results in support of the theoretical findings.
Recommendations
- Complexity of pruning strategies for the frequency domain LMS algorithm
- Reduced-Complexity Constrained Recursive Least-Squares Adaptive Filtering Algorithm
- On the convergence of the LMS algorithm in adaptive filtering
- An optimized differential step-size LMS algorithm
- Lattice Reduction Aided MMSE Decision Feedback Equalizers
- Convergent algorithms for frequency weighted \(L_{2}\) model reduction
- Almost-sure convergence of the continuous-time LMS algorithm
- The p-norm generalization of the LMS algorithm for adaptive filtering
This page was built for publication: On the properties of the reduction-by-composition LMS algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2733068)