By Topic

Recursive square-root ladder estimation 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
$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

2 Author(s)
Lee, D.T.L. ; IBM Research Laboratory, San Jose, California ; Morf, M.

Recursive least-square ladder estimation algorithms have attracted much attention recently because of their excellent convergence behavior and fast parameter tracking capability. We present some recently developed square-root normalized ladder form algorithms that have fewer storage requirements, and lower computational requirements than the unnormalized ones. A Hilbert space approach to the derivations of the normalized recursions is presented. Computer simulation results show that the normalized forms have the same convergence behavior, but even better numerical properties than the unnormalized versions. Other normalized forms, such as joint process estimators and ARMA (pole-zero) models, will also be presented. Applications of these algorithms to fast (or "zero") startup equalizers, adaptive noise- and echo cancellers and inverse models for control problems are also discussed.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '80.  (Volume:5 )

Date of Conference:

Apr 1980