By Topic

Modular and numerically stable multichannel FTF algorithms

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

4 Author(s)
Slock, D.T.M. ; Inf. Syst, Lab., Stanford Univ., CA, USA ; Chisci, L. ; Lev-Ari, Hanoch ; Kailath, T.

The authors present scalar implementations of multichannel fast recursive least squares algorithms in transversal filter form (so-called FTF). By processing the different channels sequentially, i.e one at a time, the processing of any channel reduces to that of the single-channel algorithm. This sequential processing decomposes the multichannel algorithm into a set of intertwined single-channel algorithms. Geometrically, this corresponds to a modified Gram-Schmidt orthogonalization of multichannel error vectors. Algebraically, this technique corresponds to matrix triangularization of multichannel error covariance matrices and converts matrix operations into a regular set of scalar operations. Algorithm structures that are amenable to VLSI implementation on arrays of parallel processors follow naturally from this approach. Numerically, the resulting algorithm benefits from the advantages of triangularization techniques in block processing. Stabilization techniques for control of numerical error propagation in the update recursions are incorporated

Published in:

Acoustics, Speech, and Signal Processing, 1989. ICASSP-89., 1989 International Conference on

Date of Conference:

23-26 May 1989