By Topic

Lattice and OR decomposition-based algorithms for recursive least squares adaptive nonlinear filters

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

2 Author(s)
M. A. Syed ; Dept. of Electr. Eng., Utah Univ., Salt Lake City, UT, USA ; V. J. Mathews

A lattice structure for adaptive Volterra systems is presented. The structure is applicable to arbitrary planes of support of the Volterra kernels. A fast least-squares lattice algorithm and a fast QR-lattice adaptive nonlinear filtering algorithm based on the lattice structure are presented. These algorithms share the fast convergence property of fast least-squares transversal Volterra filters; however, unlike the transversal filters, they do not suffer from numerical instability

Published in:

Circuits and Systems, 1990., IEEE International Symposium on

Date of Conference:

1-3 May 1990