The paper discusses computationally efficient NLMS and RLS algorithms for perfect and imperfect periodic excitation sequences. The most interesting aspect of these algorithms is that they are exact LMS and RLS algorithms suitable for identification and tracking of every linear system and they require a real-time computational effort of just a multiplication, an addition and a subtraction per sample time. Moreover, the algorithms have convergence and tracking properties that can be better than or comparable with the NLMS algorithm for white noise input. The transient and steady state behavior of the algorithms and their tracking properties are also studied in the paper.

Efficient NLMS and RLS algorithms for perfect and imperfect periodic sequences

A. Carini
2010-01-01

Abstract

The paper discusses computationally efficient NLMS and RLS algorithms for perfect and imperfect periodic excitation sequences. The most interesting aspect of these algorithms is that they are exact LMS and RLS algorithms suitable for identification and tracking of every linear system and they require a real-time computational effort of just a multiplication, an addition and a subtraction per sample time. Moreover, the algorithms have convergence and tracking properties that can be better than or comparable with the NLMS algorithm for white noise input. The transient and steady state behavior of the algorithms and their tracking properties are also studied in the paper.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
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/11368/2933797
 Avviso

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

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 20
  • ???jsp.display-item.citation.isi??? 13
social impact