Summary
A broad selection of adaptive finite impulse response (FIR) filter algorithms was examined to assess their theoretical convergence performance and computational requirements. From this examination a classification system has been specified in which the available algorithms are grouped into three classes according to convergence performance and computational complexity. These three classes are: (i) stochastic gradient (SG) algorithms, (ii) self-orthogonalising (SO) algorithms and (iii) recursive least squares (RLS) algorithms. Formerly classes (ii) and (iii) had been grouped together. Movement from class (i) through (ii) to (iii) improves convergence performance at the expense of increasing computational complexity.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Kluwer Academic Publishers
About this chapter
Cite this chapter
Mulgrew, B., Cowan, C.F.N. (1988). Conclusions. In: Adaptive Filters and Equalisers. The Kluwer International Series in Engineering and Computer Science, vol 56. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1701-2_7
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1701-2_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8959-3
Online ISBN: 978-1-4613-1701-2
eBook Packages: Springer Book Archive