Coefficient wordlength limitation in FLS adaptive filters
- 24 March 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 11, 3011-3014
- https://doi.org/10.1109/icassp.1986.1168774
Abstract
A stability condition analysis is performed for weighted Least Squares Algorithms. It is shown that the introduction of a constant in the prediction error energy updating recursion can make the algorithm stable. Coefficient wordlength estimations can then be derived from those available for Least Mean Squares Algorithms. The results given are useful in designing adaptive filters based on least squares techniques in their simplest forms.Keywords
This publication has 3 references indexed in Scilit:
- Fast recursive least-squares algorithms: Preventing divergencePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Echo Cancellation of Voiceband Data Signals Using Recursive Least Squares and Stochastic Gradient AlgorithmsIEEE Transactions on Communications, 1985
- A fast sequential algorithm for least-squares filtering and predictionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1983