Please use this identifier to cite or link to this item:
|Title:||Lattice PFBLMS: Fast converging structure for efficient implementation of frequency-domain adaptive filters||Authors:||Chan, K.S.
|Issue Date:||Oct-1999||Citation:||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/80673||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.
checked on Sep 24, 2020
WEB OF SCIENCETM
checked on Sep 16, 2020
checked on Sep 27, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.