Gradient eigenspace projections for adaptive filtering

N. Gopalan Nair, Andreas Spanias

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations


Although adaptive gradient algorithms are simple and relatively robust, they generally have poor performance in the absence of 'rich' excitation. In particular, it is well known that the convergence speed of the LMS algorithm deteriorates when the condition number of the input autocorrelation matrix is large. This problem has been previously addressed using weighted RLS or normalized frequency-domain algorithms. In this paper, we present a new approach that employs gradient projections in selected eigenvector sub-spaces to improve the convergence properties of LMS algorithms for colored inputs. We also introduce an efficient method to iteratively update an 'eigen subspace' of the autocorrelation matrix. The proposed algorithm is more efficient, in terms of computational complexity, than the WRLS and its convergence speed approaches that of the WRLS even for highly correlated inputs.

Original languageEnglish (US)
Title of host publicationMidwest Symposium on Circuits and Systems
Place of PublicationPiscataway, NJ, United States
Number of pages5
StatePublished - 1995
Externally publishedYes
EventProceedings of the 1995 IEEE 38th Midwest Symposium on Circuits and Systems. Part 1 (of 2) - Rio de Janeiro, Braz
Duration: Aug 13 1995Aug 16 1995


OtherProceedings of the 1995 IEEE 38th Midwest Symposium on Circuits and Systems. Part 1 (of 2)
CityRio de Janeiro, Braz

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials


Dive into the research topics of 'Gradient eigenspace projections for adaptive filtering'. Together they form a unique fingerprint.

Cite this