Please use this identifier to cite or link to this item: https://doi.org/10.1016/S0165-1684(99)00048-1
Title: Lattice PFBLMS: Fast converging structure for efficient implementation of frequency-domain adaptive filters
Authors: Chan, K.S.
Farhang-Boroujeny, B. 
Issue Date: Oct-1999
Source: Chan, K.S., Farhang-Boroujeny, B. (1999-10). Lattice PFBLMS: Fast converging structure for efficient implementation of frequency-domain adaptive filters. Signal Processing 78 (1) : 79-89. ScholarBank@NUS Repository. https://doi.org/10.1016/S0165-1684(99)00048-1
Abstract: It has been demonstrated that the unconstrained partitioned fast block LMS (PFBLMS) algorithm suffers from an inherently slow convergence rate. A solution to this problem has previously been proposed by the second author of this paper, which reduces the correlation by reducing the overlap between partitions. A drawback of this solution is that it requires more memory than the conventional PFBLMS algorithm. In this paper, we propose an alternative solution that does not require any additional memory. A lattice structure is used instead to remove the correlation and increase the convergence rate.
Source Title: Signal Processing
URI: http://scholarbank.nus.edu.sg/handle/10635/62380
ISSN: 01651684
DOI: 10.1016/S0165-1684(99)00048-1
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

1
checked on Dec 13, 2017

WEB OF SCIENCETM
Citations

3
checked on Dec 13, 2017

Page view(s)

32
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


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