By Topic

QR algorithm and array architectures 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
$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)
P. S. Lewis ; Los Alamos Nat. Lab., NM, USA

An algorithm and a set of array architectures that implement and multichannel adaptive least squares lattice filter are presented. The algorithm is based on QR decomposition and provides both a numerically sound and regularly structured set of recursions. For m channels and p filter taps, O(pm2) computations are required at each sample update. Several array architectures are presented to illustrate the space-time tradeoffs available. These range from an array of p processing elements (PEs) that compute a sample update in O(m2) time to an array of O(pm2) PEs that computes the update in constant time. The in-between arrays of O(m), O(m2), or O(pm) PEs are also outlined

Published in:

Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on

Date of Conference:

11-14 Apr 1988