Abstract

The effects of limited-precision errors in several popular adaptive-filtering algorithms are analyzed. Performance degradations caused by limited-precision quantization of internal algorithmic quantities are often found to be much larger than what might be otherwise expected. Furthermore, in many cases, limited-precision errors are found to accumulate in time without bound, leading to an eventual overflow. This overflow is an unacceptable phenomenon in practice. Where possible, we list modifications to the infinite-precision design criteria which prevent the overflow at the expense of a small degradation from the performance that is achievable in infinite precision. We also delineate unacceptable numerical problems in some of the adaptive filtering algorithms for which no solution is yet ubiquitously accepted or useful. Stochastic gradient (LMS), recursive least squares (RLS), and frequencydomain methods are all discussed. As such, this paper contains a mixture of tutorial and novel material in an effort to assist the reader in the limited-precision implementation of an adaptive-filtering algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.