By Topic

Computational complexity and accuracy issues in fast least squares algorithms for adaptive filtering

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

1 Author(s)
Bellanger, M.G. ; LSS/ESE, Gif sur Yvette, France

Three representative algorithms from the family of fast least-squares algorithms are reviewed. They correspond to the transversal FIR (finite-impulse-response) filter, the lattice-ladder structure, and the rotation approach. They lead to three different levels of computational complexity and robustness to roundoff errors. Each of them also has special implementation aspects and provides a particular set of signal parameters. It is concluded that from a user point of view the choice for a given application will depend on what is considered as the most crucial property, i.e. computational complexity or numerical stability, operation accuracy, or signal parameters. Whether the implementation is carried out in software or hardware may also affect the decision

Published in:

Circuits and Systems, 1988., IEEE International Symposium on

Date of Conference:

7-9 Jun 1988