Using a lattice decorrelator in the partitioned FBLMS algorithm

Author

Chan, Kheong Sann ; Farhang-Boroujeny, B.

Author_Institution

Dept. of Electr. Eng., Nat. Univ. of Singapore, Singapore

fYear

1997

fDate

9-12 Sep 1997

Firstpage

1208

Abstract

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 also examine how many lattice decorrelator structures are necessary to achieve a satisfactory convergence rate

Keywords

adaptive filters; adaptive signal processing; convergence of numerical methods; correlation methods; digital filters; filtering theory; lattice filters; least mean squares methods; adaptive digital filters; convergence rate; correlation; decorrelation; lattice decorrelator; lattice structure; partitioned FBLMS algorithm; partitioned fast block least mean square; tap delay line; tap-weight inputs; Computational efficiency; Convergence; Convolution; Decorrelation; Delay lines; Frequency; Lattices; Least squares approximation; Partitioning algorithms; Transversal filters;

fLanguage

English

Publisher

ieee

Conference_Titel

Information, Communications and Signal Processing, 1997. ICICS., Proceedings of 1997 International Conference on

Print_ISBN

0-7803-3676-3

Type

conf

DOI

10.1109/ICICS.1997.652175

Filename

652175