Performance study of LMS based adaptive algorithms for unknown system identification

Adaptive filtering techniques have gained much popularity in the modeling of unknown system identification problem. These techniques can be classified as either iterative or direct. Iterative techniques include stochastic descent method and its improved versions in affine space. In this paper we pre...

Full description

Saved in:
Bibliographic Details
Published inAIP conference proceedings Vol. 1605; no. 1
Main Authors Javed, Shazia, Ahmad, Noor Atinah
Format Conference Proceeding Journal Article
LanguageEnglish
Published Melville American Institute of Physics 10.07.2014
Subjects
Online AccessGet full text
ISSN0094-243X
1935-0465
1551-7616
1551-7616
DOI10.1063/1.4887594

Cover

More Information
Summary:Adaptive filtering techniques have gained much popularity in the modeling of unknown system identification problem. These techniques can be classified as either iterative or direct. Iterative techniques include stochastic descent method and its improved versions in affine space. In this paper we present a comparative study of the least mean square (LMS) algorithm and some improved versions of LMS, more precisely the normalized LMS (NLMS), LMS-Newton, transform domain LMS (TDLMS) and affine projection algorithm (APA). The performance evaluation of these algorithms is carried out using adaptive system identification (ASI) model with random input signals, in which the unknown (measured) signal is assumed to be contaminated by output noise. Simulation results are recorded to compare the performance in terms of convergence speed, robustness, misalignment, and their sensitivity to the spectral properties of input signals. Main objective of this comparative study is to observe the effects of fast convergence rate of improved versions of LMS algorithms on their robustness and misalignment.
Bibliography:ObjectType-Conference Proceeding-1
SourceType-Conference Papers & Proceedings-1
content type line 21
ISSN:0094-243X
1935-0465
1551-7616
1551-7616
DOI:10.1063/1.4887594