Accessibility navigation

An LMS style variable tap-length algorithm for structure adaptation

Gong, Y. and Cowan, C. F. N. (2005) An LMS style variable tap-length algorithm for structure adaptation. IEEE Transactions on Signal Processing, 53 (7). pp. 2400-2407. ISSN 1053-587X

Full text not archived in this repository.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1109/TSP.2005.849170


Searching for the optimum tap-length that best balances the complexity and steady-state performance of an adaptive filter has attracted attention recently. Among existing algorithms that can be found in the literature, two of which, namely the segmented filter (SF) and gradient descent (GD) algorithms, are of particular interest as they can search for the optimum tap-length quickly. In this paper, at first, we carefully compare the SF and GD algorithms and show that the two algorithms are equivalent in performance under some constraints, but each has advantages/disadvantages relative to the other. Then, we propose an improved variable tap-length algorithm using the concept of the pseudo fractional tap-length (FT). Updating the tap-length with instantaneous errors in a style similar to that used in the stochastic gradient [or least mean squares (LMS)] algorithm, the proposed FT algorithm not only retains the advantages from both the SF and the GD algorithms but also has significantly less complexity than existing algorithms. Both performance analysis and numerical simulations are given to verify the new proposed algorithm.

Item Type:Article
ID Code:19161
Uncontrolled Keywords:LMS style variable tap-length algorithm, adaptive filter, gradient descent algorithm, least mean squares algorithm, pseudo fractional tap-length, segmented filter, steady-state performance, structure adaptation, variable tap-length algorithm

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation