DocumentCode
2007492
Title
Fast Toeplitz-Hankel orthogonalization for high-resolution spectral estimation
Author
Liu, K.J.R. ; Hsieh, S.F.
Author_Institution
Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA
fYear
1991
fDate
14-17 Apr 1991
Firstpage
2249
Abstract
The authors proposed a fast algorithm to perform the QR decomposition of the FBLP (forward-backward linear prediction) matrix. It is based on exploring the special Toeplitz-Hankel form of the FBLP matrix. The computational complexity is then reduced to 10n 2+4mn +O (n ) The fast algorithm, can also be easily implemented onto a linear systolic array. The number of time steps required is further reduced to 2m +n -1 by using the parallel implementation
Keywords
computational complexity; filtering and prediction theory; matrix algebra; parallel algorithms; signal processing; spectral analysis; FBLP matrix; QR decomposition; fast Toeplitz-Hankel orthogonalisation; fast algorithm; forward-backward linear prediction matrix; high-resolution spectral estimation; parallel implementation; Computational complexity; Computational efficiency; Ear; Frequency; Matrix decomposition; Predictive models; Signal processing algorithms; Signal resolution; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference on
Conference_Location
Toronto, Ont.
ISSN
1520-6149
Print_ISBN
0-7803-0003-3
Type
conf
DOI
10.1109/ICASSP.1991.150864
Filename
150864
Link To Document