Stability of the quantized LMS algorithm
The paper deals with the implementation of the least mean square (LMS) algorithm with two truncation quantizations so that numerical stability is achieved. It is shown that a quantized LMS filter can be transformed into a quantized state-space digital filter with variable coefficients. The analysis is restricted to periodically time-varying inputs. Giving a description of the quantized LMS algorithm and its relation to a shift-variant state-space digital filter, two new conditions (and bounds) are established for the input and output stability of the quantized filter. It is shown that it is possible to have both or only one condition satisfied for some problems. One of the conditions is further simplified for the LMS algorithm. Some examples of limit cycles in the quantized LMS algorithm are also presented. The paper will be of interest for the specialists and engineers, working on LMS digital filters design and their VLSI implementations.
- On the steady-state mean squared error of the fixed-point LMS algorithm
- Extension of LMS stability condition over a wide set of signals
- A roundoff error analysis of the LMS adaptive algorithm
- Necessary and sufficient conditions for stability of LMS
- Stability of digital filters implemented with two's complement truncation quantization
- A roundoff error analysis of the LMS adaptive algorithm
- Characterization of cyclostationary random signal processes
- Fast, recursive-least-squares transversal filters for adaptive filtering
- scientific article; zbMATH DE number 3954793 (Why is no real title available?)
- scientific article; zbMATH DE number 194427 (Why is no real title available?)
- Linear Prediction of Speech
- Matrix Analysis
- Recursive least squares ladder estimation algorithms
This page was built for publication: Stability of the quantized LMS algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1902507)