Abstract
In this work, the mathematical structure is analyzed that is associated with the fast order-recursive algorithms for computing the reflection coefficients, and the Levinson polynomial associated with a hermitian, positive-definite Toeplitz matrix. A new form of three-term recurrence relation is derived anda computationally efficient alternative to the classical Levinson–Durbin algorithm is obtained. The computational complexity of the new algorithm is the same as those of the split algorithms described in the recent literature. The new algorithm also provides further insight into the mathematical properties of the structurally rich Toeplitz matrices.
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.
