1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/81800
DC FieldValue
dc.titleUsing a lattice decorrelator in the Partitioned FBLMS algorithm
dc.contributor.authorChan, Kheong Sann
dc.contributor.authorFarhang-Boroujeny, B.
dc.date.accessioned2014-10-07T03:12:11Z
dc.date.available2014-10-07T03:12:11Z
dc.date.issued1997
dc.identifier.citationChan, 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.
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/81800
dc.description.abstractIn 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.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL ENGINEERING
dc.description.sourcetitleProceedings of the International Conference on Information, Communications and Signal Processing, ICICS
dc.description.volume2
dc.description.page1208-1212
dc.description.coden279
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

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

Google ScholarTM

Check


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