Abstract
Least-squares algorithms are the fastest converging algorithms for adaptive signal processors, such as adaptive equalizers. The Kalman, fast Kalman, and adaptive lattice algorithms using a least-squares cost function are investigated and extended to complex, fractionally spaced equalizers. It is shown that, for a typical telephone channel, these algorithms converge roughly three times as fast as the conventional stochastic-gradient technique. We analyze and compute the computational complexities and demonstrate that the fast Kalman algorithm is the most efficient in terms of overall performance.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
