Abstract
A polynomial approach to the generalized Levinson algorithm based on the Toeplitz distance concept is given. It turns out that most properties of the standard Levinson algorithm admit natural generalizations, including the three-term recurrence relations, the Christoffel-Darboux formula, and the reflection coefficients (Schur-Szegö parameters) obtainable from the data via an extension of the Schur algorithm. The theory of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">\sum</tex> -lossless transfer functions is shown to play the same illuminating role in the problem as the theory of Szegö orthogonal polynomials in the standard Levinson algorithm.
Sign-in/Register to access full text options 
Free) 
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
