Abstract

The lattice filter has several desirable characteristics that make it attractive in adaptive applications. The Lattice Stochastic Gradient (also called Gradient Adaptive Lattice algorithm) is popularly used to adapt the lattice filter. However, a theoretical study of the bias in the reflection coefficient and the convergence of the LSG algorithm have not been studied extensively yet. This paper presents some theoretical results on these issues. It is hoped that the results will also present some insights into the factors affecting the convergence of the filter.

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.