DocumentCode :
1109769
Title :
An explanation to the limitation observed in the Kumaresan-Prony algorithm
Author :
Rao, D. V Bhaskar
Author_Institution :
University of California, San Diego, La Jolla, CA
Volume :
34
Issue :
5
fYear :
1986
fDate :
10/1/1986 12:00:00 AM
Firstpage :
1338
Lastpage :
1340
Abstract :
In this correspondence we explain the limitation of the Kumaresan-Prony algorithm observed in [2]. It is shown that the condition number of the matrix involved with the associated least-squares problem periodically degrades ( \\hbox{condition number } \\rightarrow \\infty ) making the least-squares solution ill conditioned. This ill conditioning causes a degradation in the estimates obtained by the Kumaresan-Prony algorithm.
Keywords :
Additive noise; Degradation; Frequency estimation; Noise robustness; Parameter estimation; Polynomials; Prediction algorithms; Radio access networks; Signal processing algorithms; Speech processing;
fLanguage :
English
Journal_Title :
Acoustics, Speech and Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
0096-3518
Type :
jour
DOI :
10.1109/TASSP.1986.1164963
Filename :
1164963
Link To Document :
بازگشت