By Topic

Fast non-stationary lattice recursions for adaptive modeling and estimation

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
$33 $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

1 Author(s)
E. Deprettere ; Delft Universtiy of Technology, Delft, Netherlands

A class of least squares time-variant lattice recursions is presented, in which the lattice coefficients are sequences that are generated in a recursive test for matrix positivity. The computations of these sequences go partly along the lines of the test recursion and partly via recursive update procedures reflecting a low index of non Toeplitzness of the underlying matrix. In applications, these mixed form algorithms allow for a substantially reduction of the computational complexity, by performing stepwize tracking, in an exact manner, of estimation parameters.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '82.  (Volume:7 )

Date of Conference:

May 1982