By Topic

The block-processing FTF adaptive algorithm

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)
J. Cioffi ; Information Systems Laboratory, Stanford, CA

A new block-type adaptive-filtering algorithm is presented. This new block adaptive filter differs from the frequency-domain block adaptive filters of Ferrara (1980), and of Clark, Mitra, and Parker (1980), in that the new method applies a deterministic time-domain least-squares criteria within each of the data blocks. Information is carried from block to block via a weighted initial condition. This new block fast transversal filters (BFTF) algorithm is a numerically stable algorithm and can also be used to perform efficient least-squares system identification on any one data block, in which case it shows a moderate computational advantage over the previous most-efficient single-data-block algorithms of Morf et al. (1977), of Marple (1981), and of Kalouptsidis, Manolakis, and Carayannis (1984-1985). Mechanisms for tracking and varying block length from block to block are also presented and evaluated. Finally, we indicate how the new algorithm could be pipelined for maximum throughput with delay proportional to the number of parameters, after computation of the sample correlation lags.

Published in:

IEEE Transactions on Acoustics, Speech, and Signal Processing  (Volume:34 ,  Issue: 1 )