Please use this identifier to cite or link to this item:
|Title:||Analysis of the partitioned frequency-domain block LMS (PFBLMS) algorithm||Authors:||Chan, K.S.
|Issue Date:||Sep-2001||Citation:||Chan, K.S.,Farhang-Boroujeny, B. (2001-09). Analysis of the partitioned frequency-domain block LMS (PFBLMS) algorithm. IEEE Transactions on Signal Processing 49 (9) : 1860-1874. ScholarBank@NUS Repository. https://doi.org/10.1109/78.942616||Abstract:||In this paper, we present a new analysis of the partitioned frequency-domain block least-mean-square (PFBLMS) algorithm. We analyze the matrices that control the convergence rates of the various forms of the PFBLMS algorithm and evaluate their eigenvalues for both white and colored input processes. Because of the complexity of the problem, the detailed analyses are only given for the case where the filter input is a first-order autoregressive process (AR-1). However, the results are then generalized to arbitrary processes in a heuristic way by looking into a set of numerical examples. An interesting finding (that is consistent with earlier publications) is that the unconstrained PFBLMS algorithm suffers from slow modes of convergence, which the FBLMS algorithm docs not. Fortunately, however, these modes are not present in the constrained PFBLMS algorithm. A simplified version of the constrained PFBLMS algorithm, which is known as the schedule-constrained PFBLMS algorithm, is also discussed, and the reaso n for its similar behavior to that of its fully constrained version is explained.||Source Title:||IEEE Transactions on Signal Processing||URI:||http://scholarbank.nus.edu.sg/handle/10635/81966||ISSN:||1053587X||DOI:||10.1109/78.942616|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 13, 2019
checked on Apr 18, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.