Home  |   Login  |   Logout  |   Access Information  |   Alerts  |   Purchase History  |   Cart  |   Sitemap  |   Help   
 
CrossRef Search
BROWSE SEARCH IEEE XPLORE GUIDE SUPPORT
You requested this document:
1. Numerically stable fast transversal filters for recursive least squares adaptive filtering
Slock, D.T.M.; Kailath, T.;
Signal Processing, IEEE Transactions on [see also Acoustics, Speech, and Signal Processing, IEEE Transactions on]
Volume 39,  Issue 1,  Jan. 1991 Page(s):92 - 114
Abstract:

A solution is proposed to the long-standing problem of the numerical instability of fast recursive least squares transversal filter (FTF) algorithms with exponential weighting, an important class of algorithms for adaptive filtering. A framework for the analysis of the error propagation in FTF algorithms is first developed; within this framework, it is shown that the computationally most efficient 7N form is exponentially unstable. However, by introducing redundancy into this algorithm, feedback of numerical errors becomes possible; a judicious choice of the feedback gains then leads to a numerically stable FTF algorithm with a complexity of 8N multiplications and additions per time recursion. The results are presented for the complex multichannel joint-process filtering problem
Abstract | Full Text: PDF(1892 KB)    IEEE JNL
 
» Key
IEEE JNL IEEE Journal or Magazine
IEE JNL IEE Journal or Magazine
IEEE CNF IEEE Conference Proceeding
IEE CNF IEE Conference Proceeding
IEEE STD IEEE Standard
 
 
Indexed by IEE Inspec
© Copyright 2008 IEEE – All Rights Reserved