Analysis of DCTLMS algorithm with a selective coefficient updating

Author

Attallah, S. ; Liaw, S.W.

Author_Institution

Center for Wireless Commun., Nat. Univ. of Singapore, Singapore

Volume

48

Issue

6

fYear

2001

fDate

6/1/2001 12:00:00 AM

Firstpage

628

Lastpage

632

Abstract

Recently, a fast version of LMS algorithm where only a small subset of the coefficients is updated at each iteration has been published in the literature. In this work, we analyze the effects of this technique on the discrete cosine transform domain LMS (DCTLMS) algorithm, and highlight its advantages and drawbacks. It is shown, in particular, that a reduction in the computational complexity can be achieved without causing any degradation to the steady state error of the algorithm. The analytical results are then confirmed by simulations where real speech and first-order Markov signals are used

Keywords

adaptive filters; adaptive signal processing; computational complexity; convergence of numerical methods; discrete cosine transforms; least mean squares methods; DCTLMS algorithm; computational complexity reduction; convergence analysis; discrete cosine transform domain LMS algorithm; first-order Markov signals; selective coefficient updating; speech signals; Algorithm design and analysis; Analytical models; Computational complexity; Computational modeling; Degradation; Discrete cosine transforms; Least squares approximation; Signal analysis; Speech analysis; Steady-state;

fLanguage

English

Journal_Title

Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1057-7130

Type

jour

DOI

10.1109/82.943335

Filename

943335