Analysis of the Euclidean direction set adaptive algorithm

Guo Fang Xu, T. Bose

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

20 Scopus citations

Abstract

A mathematical analysis is performed on a previously reported gradient-based adaptive algorithm named the Euclidean direction set (EDS) method. It has been shown that the EDS algorithm has a computational complexity of O(N) for each system update, and a rate of convergence (based on computer simulations) comparable to the RLS algorithm. The stability of the EDS method is studied and it is shown that the algorithm converges to the true solution. It is also proved that the convergence rate of the EDS method is superior to that of the steepest descent method.

Original languageEnglish (US)
Title of host publicationProceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998
Pages1689-1692
Number of pages4
DOIs
StatePublished - Dec 1 1998
Externally publishedYes
Event1998 23rd IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998 - Seattle, WA, United States
Duration: May 12 1998May 15 1998

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume3
ISSN (Print)1520-6149

Conference

Conference1998 23rd IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998
CountryUnited States
CitySeattle, WA
Period5/12/985/15/98

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Analysis of the Euclidean direction set adaptive algorithm'. Together they form a unique fingerprint.

Cite this