A two-dimensional fast lattice recursive least squares algorithm

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing Vol. 44; no. 10; pp. 2557 - 2567
Main Authors: Xiang Liu, Najim, M.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.10.1996
Institute of Electrical and Electronics Engineers
Subjects:
Applied sciences
Computational complexity
Detection, estimation, filtering, equalization, prediction
Exact sciences and technology
Information, signal and communications theory
Lattices
Least squares methods
Nonlinear filters
Reflection
Resonance light scattering
Signal and communications theory
Signal processing algorithms
Signal, noise
System identification
Telecommunications and information theory
Transversal filters
Two dimensional displays
Recursive method
Signal processing
Fast algorithm
Least squares method
Signal estimation
Prediction
ISSN:1053-587X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1053-587X
DOI:10.1109/78.539039