Cart (Loading....) | Create Account
Close category search window

QR-based algorithms for multichannel adaptive least squares lattice 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
$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

1 Author(s)
Lewis, P.S. ; Los Alamos Nat. Lab., NM, USA

A pair of multichannel least-squares lattice filter algorithms is presented. Each m-channel filter stage is numerically stable and computationally efficient, with a computational complexity of O (m2). Both algorithms are based on the recursive QR decomposition of the forward and backward error matrices in each filter stage. The first algorithm uses orthogonal Givens rotations to compute the QR decomposition. The second algorithm uses fast Givens rotations for greater efficiency. Simulation results are presented, as well as an example of the algorithms' application in the enhancement of magnetoencephalographic signals

Published in:

Acoustics, Speech and Signal Processing, IEEE Transactions on  (Volume:38 ,  Issue: 3 )

Date of Publication:

Mar 1990

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.