Immittance-domain Levinson algorithms
- 1 May 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 35 (3) , 675-682
- https://doi.org/10.1109/18.30994
Abstract
Several computationally efficient versions of the Levinson algorithm for solving linear equations with Toeplitz and quasi-Toeplitz matrices are presented, motivated by a new stability test. The new versions require half the number of multiplications and the same number of additions as the conventional form of the Levinson algorithm. The saving is achieved by using three-term (rather than two-term) recursions and propagating them in an impedance/admittance (or immittance) domain rather than the conventional scattering domain. One of the recursions coincides with recent results of P. Delsarte and Y. Genin (IEEE Trans., Acoust. Speech, Signal Proc., vol.ASSP-34, p.470-8, June 1986) on split Levinson algorithms for symmetric Toeplitz matrices, where the efficiency is gained by using the symmetric and skew-symmetric versions of the usual polynomials. This special structure is lost in the quasi-Toeplitz case, but one still can obtain similar computational reductions by suitably using three-term recursions in the immittance domainKeywords
This publication has 10 references indexed in Scilit:
- A new unit circle stability criterionPublished by Springer Nature ,2005
- The Levinson recurrence and fast algorithms for solving Toeplitz systems of linear equationsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- The split Levinson algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- A circular stability test for general polynomialsSystems & Control Letters, 1986
- Z-domain continued fraction expansions for stable discrete systems polynomialsIEEE Transactions on Circuits and Systems, 1985
- Lattice filter parameterization and modeling of nonstationary processesIEEE Transactions on Information Theory, 1984
- Zero location with respect to the unit circle of discrete-time linear system polynomialsProceedings of the IEEE, 1984
- The One-Dimensional Inverse Problem of Reflection SeismologySIAM Review, 1983
- A class of all-zero lattice digital filters: Properties and applicationsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1978
- The Wiener (Root Mean Square) Error Criterion in Filter Design and PredictionJournal of Mathematics and Physics, 1946