Decimative subspace-based parameter estimation techniques

Authors:
Geert Morren;Philippe Lemmerling;Sabine Van Huffel
Affiliations:
SCD/SISTA Division, Electrical Engineering Department (ESAT), K.U.Leuven, Kasteelpark Arenberg 10, B-3001 Leuven-Heverlee, Belgium;SCD/SISTA Division, Electrical Engineering Department (ESAT), K.U.Leuven, Kasteelpark Arenberg 10, B-3001 Leuven-Heverlee, Belgium;SCD/SISTA Division, Electrical Engineering Department (ESAT), K.U.Leuven, Kasteelpark Arenberg 10, B-3001 Leuven-Heverlee, Belgium
Venue:
Signal Processing
Year:
2003

Citing 2
Cited 1

Subspace-based frequency estimation in the presence of moving-average noise using decimation

Signal Processing - Special issue on acoustic echo and noise control
Decimation and SVD to estimate exponentially damped sinusoids in the presence of noise

ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05

Linear prediction approach to oversampling parameter estimation for multiple complex sinusoids

Signal Processing

Quantified Score

Hi-index	0.08

Visualization

Abstract

In this paper, the problem of estimating the frequencies, dampings, amplitudes and phases of closely spaced complex damped exponentials in the presence of noise is considered. In several papers, decimation is proposed as a way to increase the performance of subspace-based parameter estimation methods, in the case of oversampling (Signal Process. 63(3) (1997) 211; IEEE Signal Process. Lett. 4(2) (1997) 49; in: Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Vol. V, Salt Lake City, UT, USA, May 7-11, 2001, pp. 3073-3076). In this paper, three decimative versions of the HTLS-method (J. Magn. Resonance A 110(2) (1994) 228), a subspace-based parameter estimation technique that operates directly on the data matrix, are derived and compared. Monte-Carlo simulation experiments show the influence of decimation on the statistical accuracy and the computational complexity of the algorithms.