DocumentCode :
3063623
Title :
A fast computational algorithm for and performance of the Kumaresan-Prony method of spectrum analysis
Author :
Marple, S., Jr.
Author_Institution :
Schlumberger Well Services, Houston, Texas
Volume :
8
fYear :
1983
fDate :
30407
Firstpage :
1419
Lastpage :
1421
Abstract :
Kumaresan and Tufts at the University of Rhode Island have developed a modification of the Prony technique that yields improved linear prediction frequency estimates for two equiamplitude sinusoids in white noise. The improved performance is manifested by decreased variance and bias in the estimates of the two closely-spaced sinusoid frequencies, particularly at low signal-to-noise ratios (SNR) where other linear prediction techniques do not seem to do as well. The Kumaresan-Prony technique is based on fitting a high-order linear prediction model to the available data using a pseudoinverse solution. This paper indicates how a fast computational algorithm may be obtained to solve the pseudoinverse matrix. Also, an examination of the spectral estimation performance against a different signal scenario is made.
Keywords :
Algorithm design and analysis; Degradation; Equations; Frequency estimation; Nonlinear filters; Performance analysis; Signal resolution; Signal to noise ratio; Vectors; Yield estimation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '83.
Type :
conf
DOI :
10.1109/ICASSP.1983.1172053
Filename :
1172053
Link To Document :
بازگشت