Title :
A two-dimensional fast lattice recursive least squares algorithm
Author :
Liu, Xiang ; Najim, Mohamed
Author_Institution :
Motorola Electron. Ltd., Singapore
fDate :
10/1/1996 12:00:00 AM
Abstract :
This paper is mainly devoted to the derivation of a new two-dimensional fast lattice recursive least squares (2D FLRLS) algorithm. This algorithm updates the filter coefficients in growing-order form with linear computational complexity. After appropriately defining the “order” of 2D data and exploiting the relation with 1D multichannel, “order” recursion relations and shift invariance property are derived. The geometrical approaches of the vector space and the orthogonal projection then can be used for solving this 2D prediction problem. We examine the performances of this new algorithm in comparison with other fast algorithms
Keywords :
computational complexity; computational geometry; lattice filters; least squares approximations; prediction theory; recursive filters; two-dimensional digital filters; 1D multichannel; 2D FLRLS algorithm; 2D data; 2D prediction problem; filter coefficients; geometrical approaches; growing-order form; linear computational complexity; order recursion relations; orthogonal projection; performances; shift invariance property; two-dimensional fast lattice recursive least squares algorithm; vector space; Computational complexity; Lattices; Least squares methods; Nonlinear filters; Reflection; Resonance light scattering; Signal processing algorithms; System identification; Transversal filters; Two dimensional displays;
Journal_Title :
Signal Processing, IEEE Transactions on
