Abstract
The convergence properties of two different algorithms for the updating of the coefficients of an adaptive FIR digital filter are investigated and compared with one another. These algorithms are the stochastic iteration algorithm and the sign algorithm. In this latter algorithm a one-bit gradient estimation is used which makes its implementation very simple. The convergence is characterized by the residual echo variance after convergence, and a parameter that indicates the speed of the convergence. It is shown that the convergence of the sign algorithm can always be assured but is much slower than that of the stochastic iteration algorithm if the same variance of the residual echo is to be obtained.
Published Version
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 callMore From: IEEE Transactions on Acoustics, Speech, and Signal Processing
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.
