Euclidean direction search algorithm for adaptive filtering

Guo Fang Xu, Tamal Bose, Jim Schroeder

Research output: Chapter in Book/Report/Conference proceedingChapter

8 Citations (Scopus)

Abstract

A new least-squares adaptive algorithm, called the Euclidean Direction Search (EDS) algorithm is investigated for applications in fast adaptive filtering. Based on mathematical analysis and computer simulations, the proposed algorithm is shown to be very efficient for adaptive filtering applications such as noise cancellation and channel equalization. The algorithm features an O(N) computational complexity, fast convergence, improved numerical stability and least-squares optimal solution. Its convergence rate is comparable to that of the RLS but at a much lower computational cost.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
PublisherIEEE
Volume3
ISBN (Print)0780354710
StatePublished - 1999
Externally publishedYes
EventProceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS '99 - Orlando, FL, USA
Duration: May 30 1999Jun 2 1999

Other

OtherProceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS '99
CityOrlando, FL, USA
Period5/30/996/2/99

Fingerprint

Adaptive filtering
Convergence of numerical methods
Adaptive algorithms
Computational complexity
Computer simulation
Direction compound
Costs

ASJC Scopus subject areas

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

Cite this

Xu, G. F., Bose, T., & Schroeder, J. (1999). Euclidean direction search algorithm for adaptive filtering. In Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 3). IEEE.

Euclidean direction search algorithm for adaptive filtering. / Xu, Guo Fang; Bose, Tamal; Schroeder, Jim.

Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 3 IEEE, 1999.

Research output: Chapter in Book/Report/Conference proceedingChapter

Xu, GF, Bose, T & Schroeder, J 1999, Euclidean direction search algorithm for adaptive filtering. in Proceedings - IEEE International Symposium on Circuits and Systems. vol. 3, IEEE, Proceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS '99, Orlando, FL, USA, 5/30/99.
Xu GF, Bose T, Schroeder J. Euclidean direction search algorithm for adaptive filtering. In Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 3. IEEE. 1999
Xu, Guo Fang ; Bose, Tamal ; Schroeder, Jim. / Euclidean direction search algorithm for adaptive filtering. Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 3 IEEE, 1999.
@inbook{1435df8ce6ac4984b4c090dc2f15aa7d,
title = "Euclidean direction search algorithm for adaptive filtering",
abstract = "A new least-squares adaptive algorithm, called the Euclidean Direction Search (EDS) algorithm is investigated for applications in fast adaptive filtering. Based on mathematical analysis and computer simulations, the proposed algorithm is shown to be very efficient for adaptive filtering applications such as noise cancellation and channel equalization. The algorithm features an O(N) computational complexity, fast convergence, improved numerical stability and least-squares optimal solution. Its convergence rate is comparable to that of the RLS but at a much lower computational cost.",
author = "Xu, {Guo Fang} and Tamal Bose and Jim Schroeder",
year = "1999",
language = "English (US)",
isbn = "0780354710",
volume = "3",
booktitle = "Proceedings - IEEE International Symposium on Circuits and Systems",
publisher = "IEEE",

}

TY - CHAP

T1 - Euclidean direction search algorithm for adaptive filtering

AU - Xu, Guo Fang

AU - Bose, Tamal

AU - Schroeder, Jim

PY - 1999

Y1 - 1999

N2 - A new least-squares adaptive algorithm, called the Euclidean Direction Search (EDS) algorithm is investigated for applications in fast adaptive filtering. Based on mathematical analysis and computer simulations, the proposed algorithm is shown to be very efficient for adaptive filtering applications such as noise cancellation and channel equalization. The algorithm features an O(N) computational complexity, fast convergence, improved numerical stability and least-squares optimal solution. Its convergence rate is comparable to that of the RLS but at a much lower computational cost.

AB - A new least-squares adaptive algorithm, called the Euclidean Direction Search (EDS) algorithm is investigated for applications in fast adaptive filtering. Based on mathematical analysis and computer simulations, the proposed algorithm is shown to be very efficient for adaptive filtering applications such as noise cancellation and channel equalization. The algorithm features an O(N) computational complexity, fast convergence, improved numerical stability and least-squares optimal solution. Its convergence rate is comparable to that of the RLS but at a much lower computational cost.

UR - http://www.scopus.com/inward/record.url?scp=0032691673&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032691673&partnerID=8YFLogxK

M3 - Chapter

SN - 0780354710

VL - 3

BT - Proceedings - IEEE International Symposium on Circuits and Systems

PB - IEEE

ER -