Low-complexity data reusing methods in adaptive filtering

Robert A. Soni, Kyle A. Gallivan, W. Kenneth Jenkins

Research output: Contribution to journalArticlepeer-review

26 Scopus citations

Abstract

Most adaptive filtering algorithms couple performance with complexity. Over the last 15 years, a class of algorithms, termed "affine projection" algorithms, have given system designers the capability to tradeoff performance with complexity. By changing parameters and the size/scale of data used to update the coefficients of an adaptive filter but without fundamentally changing the algorithm structure, a system designer can radically change the performance of the adaptive algorithm. This paper discusses low-complexity data reusing algorithms that are closely related to affine projection algorithms. This paper presents various low-complexity and highly flexible schemes for improving convergence rates of adaptive algorithms that utilize data reusing strategies. All of these schemes are unified by a row projection framework in existence for more than 65 years. This framework leads to the classification of all data reusing and affine projection methods for adaptive filtering into two categories: the Kaczmarz and Cimmino methods. Simulation and convergence analysis results are presented for these methods under a number of conditions. They are compared in terms of convergence rate performance and computational complexity.

Original languageEnglish (US)
Pages (from-to)394-405
Number of pages12
JournalIEEE Transactions on Signal Processing
Volume52
Issue number2
DOIs
StatePublished - Feb 2004

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Low-complexity data reusing methods in adaptive filtering'. Together they form a unique fingerprint.

Cite this