Tracking the frequencies of superimposed time-varying harmonics
C.L. DiMonte, K.S. Arun
Abstract
C.L. DiMonte, K.S. Arun
Abstract
The problem of tracking the frequencies of slowly time-varying superimposed sinusoids in the presence of noise is addressed. An algorithm based on singular value decomposition (SVD) of the data matrix is developed for the problem, and its performance is evaluated by numerical experiments on computer-synthesized data. The algorithm is based on the discovery that even when the frequencies are changing with time, as long as they change slowly locally, a Hankel matrix constructed directly from the noise-free signal is close to a matrix of rank equal to twice the number of real-valued sinusoids superimposed in the signal. Thus, in the presence of additive noise, instead of using the SVD of many small matrices constructed from local blocks of data, all the available data can be included in one large matrix, which can then be approximated by its principal singular vectors and singular values, to achieve greater noise suppression. The number of sinusoidal components and the instantaneous frequency tracks are directly estimated from the principal singular vectors of the large Hankel matrix.>
OpenAlex reports 43 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The problem of tracking the frequencies of slowly time-varying superimposed sinusoids in the presence of noise is addressed. An algorithm based on singular value decomposition (SVD) of the data matrix is developed for the problem, and its performance is evaluated by numerical experiments on computer-synthesized data. The algorithm is based on the discovery that even when the frequencies are changing with time, as long as they change slowly locally, a Hankel matrix constructed directly from the noise-free signal is close to a matrix of rank equal to twice the number of real-valued sinusoids superimposed in the signal. Thus, in the presence of additive noise, instead of using the SVD of many small matrices constructed from local blocks of data, all the available data can be included in one large matrix, which can then be approximated by its principal singular vectors and singular values, to achieve greater noise suppression. The number of sinusoidal components and the instantaneous frequency tracks are directly estimated from the principal singular vectors of the large Hankel matrix.>
Key concepts: Hankel matrix, Singular value decomposition, Singular value, Noise (video), Singular spectrum analysis, Matrix (chemical analysis), Algorithm, Rank (graph theory)