DCTLMS algorithm employing partial coefficient updates

Author

Attallah, S. ; Liaw, S.W.

Author_Institution

Centre for Wireless Commun., Singapore

fYear

2000

fDate

2000

Firstpage

218

Lastpage

223

Abstract

Recently, a fast version of the LMS algorithm where only a small subset of the coefficients is updated at each iteration has been published in the literature. In this paper, we analyze the effects of this technique on the discrete cosine transform domain LMS (DCTLMS) algorithm and highlight its advantages and drawbacks. It will be 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 followed by simulations where real speech and 1st-order Markov signals are used

Keywords

Markov processes; adaptive filters; adaptive signal processing; computational complexity; convergence of numerical methods; discrete cosine transforms; iterative methods; least mean squares methods; speech processing; 1st-order Markov signals; DCTLMS algorithm; analytical results; computational complexity; discrete cosine transform domain LMS algorithm; iteration; partial coefficient updates; real speech signals; simulations; steady state error; 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

Publisher

ieee

Conference_Titel

Adaptive Systems for Signal Processing, Communications, and Control Symposium 2000. AS-SPCC. The IEEE 2000

Conference_Location

Lake Louise, Alta.

Print_ISBN

0-7803-5800-7

Type

conf

DOI

10.1109/ASSPCC.2000.882474

Filename

882474