Generalized subband decomposition LMS algorithm employing selective partial updates

The paper presents a reduced-complexity implementation for the generalized subband decomposition LMS (GSD-LMS) algorithm based on selective partial updating. The major advantages of the GSD-LMS over the transform-domain LMS (TD-LMS) algorithm are the reduced transform size and the smaller number of...

Full description

Saved in:
Bibliographic Details
Published in2002 IEEE International Conference on Acoustics, Speech, and Signal Processing Vol. 2; pp. II-1377 - II-1380
Main Authors Dogancay, Kutluyil, Tanrikulu, Oguz
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.01.2002
Subjects
Blogs
Online AccessGet full text
ISBN9780780374027
0780374029
ISSN1520-6149
DOI10.1109/ICASSP.2002.5744886

Cover

More Information
Summary:The paper presents a reduced-complexity implementation for the generalized subband decomposition LMS (GSD-LMS) algorithm based on selective partial updating. The major advantages of the GSD-LMS over the transform-domain LMS (TD-LMS) algorithm are the reduced transform size and the smaller number of divisions required for power normalization. The proposed algorithm capitalizes on this by further reducing the number of multiplications in the update term. The only overhead introduced is a number of comparison operations which can be implemented cheaply. The superior performance of the selective-partial-update GSD-LMS compared with sequential block updating is demonstrated via simulation examples.
ISBN:9780780374027
0780374029
ISSN:1520-6149
DOI:10.1109/ICASSP.2002.5744886