Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/72984
Title: Using a lattice decorrelator in the Partitioned FBLMS algorithm
Authors: Chan, Kheong Sann
Farhang-Boroujeny, B. 
Issue Date: 1997
Source: Chan, Kheong Sann,Farhang-Boroujeny, B. (1997). Using a lattice decorrelator in the Partitioned FBLMS algorithm. Proceedings of the International Conference on Information, Communications and Signal Processing, ICICS 2 : 1208-1212. ScholarBank@NUS Repository.
Abstract: In this paper, we examine a method of reducing the correlation between successive partitions in the Partitioned Fast Block Least Mean Square (PFBLMS) algorithm. This method involves replacing the tap delay line in the PFBLMS with a lattice structure resulting in a decorrelation of the tap-weight inputs and a faster convergence of the PFBLMS algorithm. We go on to examine how many lattice decorrelator structures are necessary to achieve a satisfactory convergence rate.
Source Title: Proceedings of the International Conference on Information, Communications and Signal Processing, ICICS
URI: http://scholarbank.nus.edu.sg/handle/10635/72984
Appears in Collections:Staff Publications

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

Page view(s)

33
checked on Dec 9, 2017

Google ScholarTM

Check


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