New split Levinson, Schur, and lattice algorithms for digital signal processing

Author

Krishna, Hari

Author_Institution

Dept. of Electr. & Comput. Eng., Syracuse Univ., NY, USA

fYear

1988

fDate

11-14 Apr 1988

Firstpage

1640

Abstract

The mathematical structure associated with the split algorithms for computing the reflection coefficients for a given real symmetric positive-definite Toeplitz matrix is analyzed. A novel form of three-term recurrence relation is derived and computationally efficient alternatives to the Levinson-Durbin, Schur, and lattice algorithms are obtained. The computational complexity of the proposed algorithms is the same as those of the split algorithms described in recent literature. These algorithms provide further insight into the mathematical properties of the structurally rich Toeplitz matrices

Keywords

computational complexity; computerised signal processing; matrix algebra; Levinson algorithms; Schur algorithms; computational complexity; digital signal processing; lattice algorithms; mathematical structure; real symmetric positive-definite Toeplitz matrix; reflection coefficients; split algorithms; structurally rich Toeplitz matrices; three-term recurrence relation; Algorithm design and analysis; Computational complexity; Digital signal processing; Lattices; Polynomials; Reflection; Signal analysis; Signal processing algorithms; Symmetric matrices; Vectors;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on

Conference_Location

New York, NY

ISSN

1520-6149

Type

conf

DOI

10.1109/ICASSP.1988.196927

Filename

196927