Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/5520

Title: A new variable tap-length LMS algorithm to model an exponential decay impulse response
Authors: Zhang, Yonggang
Chambers, Jonathon
Sanei, Saeid
Kendrick, Paul
Cox, Trevor J.
Keywords: Adaptive filters
Variable tap-length least-mean-square (LMS) algorithm
Issue Date: 2007
Publisher: © IEEE
Citation: ZHANG, Y. ... et al, 2007. A new variable tap-length LMS algorithm to model an exponential decay impulse response. IEEE Signal Processing Letters, 14 (4), pp. 263-266.
Abstract: This letter proposes a new variable tap-length least-mean-square (LMS) algorithm for applications in which the unknown filter impulse response sequence has an exponential decay envelope. The algorithm is designed to minimize the mean-square deviation (MSD) between the optimal and adaptive filter weight vectors at each iteration. Simulation results show the proposed algorithm has a faster convergence rate as compared with the fixed tap-length LMS algorithm and is robust to the initial tap-length choice.
Description: This article was published in the journal IEEE Signal Processing Letters [© IEEE] and is also available at: http://ieeexplore.ieee.org/. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Version: Published
DOI: 10.1109/LSP.2006.887784
URI: https://dspace.lboro.ac.uk/2134/5520
ISSN: 1070-9908
Appears in Collections:Published Articles (Electronic, Electrical and Systems Engineering)

Files associated with this item:

File Description SizeFormat
A New Variable Tap-Length LMS Algorithm.pdf300.56 kBAdobe PDFView/Open

 

SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.