On normalized data-reusing and affine-projections algorithms

This paper addresses the comparison between data-reusing LMS algorithms and the affine-projections algorithm. The normalized new data-reusing LMS (NNDR-LMS) algorithm, the binormalized data-reusing LMS (BNDR-LMS) algorithm, and the affine-projections (AP) algorithm are briefly presented within a com...

Full description

Saved in:
Bibliographic Details
Published inElectronics, Circuits and Systems, 1999: 6th IEEE International Conference On Vol. 2; pp. 843 - 846 vol.2
Main Authors de Campos, M.L.R., Diniz, P.S.R., Apolinario, J.A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1999
Subjects
Algorithm design and analysis
Computational complexity
Convergence
Equations
Least squares approximation
Least squares methods
Resonance light scattering
Signal to noise ratio
Online AccessGet full text
ISBN0780356829
9780780356825
DOI10.1109/ICECS.1999.813240

Cover

More Information
Summary:This paper addresses the comparison between data-reusing LMS algorithms and the affine-projections algorithm. The normalized new data-reusing LMS (NNDR-LMS) algorithm, the binormalized data-reusing LMS (BNDR-LMS) algorithm, and the affine-projections (AP) algorithm are briefly presented within a common framework and their relationships are clarified. Topics such as equivalence of algorithms, graphical representation, and computational complexity are discussed.
ISBN:0780356829
9780780356825
DOI:10.1109/ICECS.1999.813240