In this paper, a new class of parameter estimation algorithms, called turbo estimation algorithms (TEA), is introduced. The basic idea is that each estimation algorithm (EA) must perform a sort of intrinsic denoising of the input data in order to achieve reliable estimates. Optimum algorithms implement the best possible noise reduction, compatible with the problem de"nition and the related lower bounds to the estimation error variance; however, their computational complexity is often overwhelming, so that in real life one must often resort to suboptimal algorithms; in this case, some amount of noise could be still eliminated. The TEA methods reduce the residual noise by means of a closed loop con"guration, in which an external denoising system, fed by the master estimator output, generates an enhanced signal to be input to the estimator for next iteration. The working principle of such schemes can be described in terms of a more general turbo principle, well known in an information theory context. In this paper, an example of turbo algorithm for modal analysis is described, which employs the Tufts and Kumaresan (TK) method as a master EA. ( 2000 Elsevier Science B.V. All rights reserved.

Turbo Estimation Algorithms: General Principles, and Applications to Modal Analysis / LO PRESTI, Letizia; Olmo, Gabriella; D., Bosetto. - In: SIGNAL PROCESSING. - ISSN 0165-1684. - STAMPA. - 80:(2000), pp. 2567-2578. [10.1016/S0165-1684(00)00132-8]

Turbo Estimation Algorithms: General Principles, and Applications to Modal Analysis

LO PRESTI, Letizia;OLMO, Gabriella;
2000

Abstract

In this paper, a new class of parameter estimation algorithms, called turbo estimation algorithms (TEA), is introduced. The basic idea is that each estimation algorithm (EA) must perform a sort of intrinsic denoising of the input data in order to achieve reliable estimates. Optimum algorithms implement the best possible noise reduction, compatible with the problem de"nition and the related lower bounds to the estimation error variance; however, their computational complexity is often overwhelming, so that in real life one must often resort to suboptimal algorithms; in this case, some amount of noise could be still eliminated. The TEA methods reduce the residual noise by means of a closed loop con"guration, in which an external denoising system, fed by the master estimator output, generates an enhanced signal to be input to the estimator for next iteration. The working principle of such schemes can be described in terms of a more general turbo principle, well known in an information theory context. In this paper, an example of turbo algorithm for modal analysis is described, which employs the Tufts and Kumaresan (TK) method as a master EA. ( 2000 Elsevier Science B.V. All rights reserved.
File in questo prodotto:
File Dimensione Formato  
Turbo estimation algo general principles LLP GO DB 1-s2.0-S0165168400001328-main-1.pdf

non disponibili

Tipologia: 1. Preprint / submitted version [pre- review]
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 241.04 kB
Formato Adobe PDF
241.04 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/1401790
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo