DocumentCode
3003641
Title
Efficient procedures for stepup and stepdown computations
Author
Krishna, H. ; Krishna, B. ; Morgera, S.D.
Author_Institution
Dept. of Electr. & Comput. Eng., Syracuse Univ., NY, USA
fYear
1988
fDate
11-14 Apr 1988
Firstpage
1651
Abstract
The stepup (stepdown) procedure is an algorithm for computing the predictor polynomial (reflection) coefficients from the knowledge of the reflection coefficients (predictor polynomial). Here, both real as well as complex cases are considered, and several computationally efficient algorithms for the stepup and stepdown computations are presented. They are intimately related to recently reported alternative algorithms for computing the predictor polynomial associated with real, symmetric, and Hermitian Toeplitz matrices
Keywords
matrix algebra; polynomials; Hermitian Toeplitz matrices; predictor polynomial; reflection coefficients; setup computations; stepdown computations; Algorithm design and analysis; Autocorrelation; Cities and towns; Computational complexity; Instruction sets; Polynomials; Reflection; Stability; Symmetric matrices; Testing;
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.196930
Filename
196930
Link To Document