Fast Affine Projection Adaptation Algorithms With Stable and Robust Symmetric Linear System Slovers

This paper proposes two noniterative approaches to solve a symmetric linear system associated with the fast affine projection adaptation algorithm. The first approach, using matrix LDL T factorization, can provide an exact solution at a moderate complexity, in contrast with the fact that existing st...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on signal processing Vol. 55; no. 5; pp. 1730 - 1740
Main Author Ding, Heping
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.05.2007
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Adaptation
Adaptive filtering
Adaptive filters
Algorithms
Applied sciences
Approximation
Complexity
Detection, estimation, filtering, equalization, prediction
Durbin's recursion
Echo cancellers
Exact sciences and technology
fast affine projection
Filtering
Financial advantage program
Information, signal and communications theory
Least squares approximation
Levinson-Durbin's recursion
Linear systems
Projection
Resonance light scattering
Robustness
Signal and communications theory
Signal processing algorithms
Signal, noise
Telecommunication network topology
Telecommunications
Telecommunications and information theory
fast affine projection
Durbin's recursion
Adaptive filtering
Unsteady state
Levinson-Durbin's recursion
Matrix factorization
Affine transformation
Steady state
Exact solution
Linear system
Matrix method
Fast algorithm
Approximate solution
Online AccessGet full text

Cover

More Information
Summary:This paper proposes two noniterative approaches to solve a symmetric linear system associated with the fast affine projection adaptation algorithm. The first approach, using matrix LDL T factorization, can provide an exact solution at a moderate complexity, in contrast with the fact that existing stable approaches are all approximate. Based on a reciprocating recursion scheme, the second approach has a very low complexity and gives a good approximate solution. Steady-state and transient properties of the proposed and certain previous FAP algorithms are studied in detail. Being stable and optimal under all step size conditions, fast affine projection algorithms incorporating the proposed approaches are promising in telecom and other applications of adaptive filtering
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ObjectType-Article-2
ObjectType-Feature-1
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2006.889980