By Topic

A new 2D fast lattice RLS algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Liu, X. ; Bordeaux Univ., Talence, France ; Baylou, P. ; Najim, M.

A new two-dimensional fast lattice recursive least squares algorithm is proposed. This algorithm can update the filter coefficients in growing-order form with a computational complexity O((M +1)K1). By associating the previous 2-D data with the region of support, the causality is specified. After appropriately defining the partial order of 2-D data, the 1-D multichannel analogy, order recursion relations and the shift invariance property are derived. The geometrical approaches for the vector space and the orthogonal projection then can be used for solving this 2-D prediction problem. The performance of this new algorithm is examined in comparison with other fast algorithms

Published in:

Acoustics, Speech, and Signal Processing, 1992. ICASSP-92., 1992 IEEE International Conference on  (Volume:3 )

Date of Conference:

23-26 Mar 1992