DocumentCode :
1108454
Title :
An efficient algorithm for computing Pisarenko´s harmonic decomposition using Levinson´s recursion
Author :
Hayes, Monson H. ; Clements, Mark A.
Author_Institution :
Georgia Institute of Technology, Atlanta, GA
Volume :
34
Issue :
3
fYear :
1986
fDate :
6/1/1986 12:00:00 AM
Firstpage :
485
Lastpage :
491
Abstract :
The harmonic decomposition of a random process into a sum of sinusoids in white noise is an important problem with applications in a number of different areas. As a result of the work of V. F. Pisarenko, it has been shown that the sinusoidal frequencies and the white noise power are determined by the minimum eigenvalue and the corresponding eigenvector of the autocorrelation matrix. In this paper, an efficient algorithm is presented for finding this eigenvalue and eigenvector. In addition to its being computationally more efficient than the power method, it has a "built-in" criterion for selecting the model order to use in the decomposition. Some examples are presented and the results are compared to those obtained using other approaches.
Keywords :
Autocorrelation; Eigenvalues and eigenfunctions; Frequency estimation; Helium; Iterative algorithms; Matrix decomposition; Power generation; Random processes; Recursive estimation; White noise;
fLanguage :
English
Journal_Title :
Acoustics, Speech and Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
0096-3518
Type :
jour
DOI :
10.1109/TASSP.1986.1164835
Filename :
1164835
Link To Document :
بازگشت