On the steady‐state performance of bias‐compensated LMS algorithm
Abstract Adaptive filtering algorithms are widespread today owing to their flexibility and simplicity. Due to environments in which they are normally immersed, their robustness against noise has been a topic of interest. Traditionally, in the literature it is assumed that noise is mainly active in t...
Guardado en:
Autores principales: | , , , |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Wiley
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/7fb736fb05df409481b81671f4be1ac7 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Sumario: | Abstract Adaptive filtering algorithms are widespread today owing to their flexibility and simplicity. Due to environments in which they are normally immersed, their robustness against noise has been a topic of interest. Traditionally, in the literature it is assumed that noise is mainly active in the reference signal. Since this hypothesis is often violated in practice, recently some papers have advanced strategies to compensate the bias introduced by noisy excitation data. The contributions of this paper are twofold. The first one establishes that, in some conditions, the bias‐compensated least mean square algorithm implements an optimum estimator, in the sense that it presents the smallest variance of the set of unbiased estimators. Since the asymptotic mean‐square performance of this algorithm has not yet been investigated in detail, the second contribution adopts an energy conservation relationship to derive its theoretical steady‐state mean squared distortion. The final result is presented in a closed form, is consistent with simulations and is able to provide important guidelines to the designer. |
---|