Truncated QR methods have been shown to be comparable to SVD-based methods for the sinusoidal frequency estimation based on the forward-backward linear prediction (FBLP) model. However, without exploiting the special structure of the FBLP matrix, the QR decomposition (QRD) of the FBLP matrix has a computational complexity on the order of 2(6m-n)n2/3+O(n 2) for a 2m×n FBLP matrix. A fast algorithm to perform the QRD of the FBLP matrix by exploiting its special Toeplitz-Hankel form is proposed. The computational complexity is reduced to 10n2+4mn+O(n). The fast algorithm can also be easily implemented by a linear systolic array, reducing the number of time steps required to 2m+5n-4
Published in:
Signal Processing, IEEE Transactions on
(Volume:41
,
Issue:
3
)
Date of Publication:
Mar 1993
- Page(s):
-
1453
-
1458
- ISSN :
-
1053-587X
- INSPEC Accession Number:
-
4440653
- Digital Object Identifier :
-
10.1109/78.205755
- Product Type:
-
Journals & Magazines
- Date of Current Version :
-
06 August 2002
- Issue Date :
-
Mar 1993
- Sponsored by :
-
IEEE Signal Processing Society