Paper Info
Title
Fast Affine Projection Adaptation Algorithms With Stable and Robust Symmetric Linear System Slovers
Abstract
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 LDLT 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
Year
DOI
Venue
2007
10.1109/TSP.2006.889980
IEEE Transactions on Signal Processing
Keywords
Field
DocType
levinson-durbin's recursion,fast affine projection,reciprocating recursion scheme,low complexity,exact solution,fast affine projection adaptation,affine projection,adaptive echo cancellation,good approximate solution,stable approach,fast affine projection adaptation algorithms,robust symmetric linear system,robust symmetric linear system slovers,computational complexity,adaptive filtering,moderate complexity,adaptive filters,matrix decomposition,noniterative approach,filtering theory,durbin's recursion,matrix ldl factorization,certain previous fap algorithm,least squares approximation,steady state,filtering,linear system,adaptive filter,linear systems,robustness
Affine transformation,Affine shape adaptation,Mathematical optimization,Affine combination,Linear system,Matrix (mathematics),Matrix decomposition,Algorithm,Adaptive filter,Mathematics,Computational complexity theory
Journal
Volume
Issue
ISSN
55
5
1053-587X
Citations 
PageRank 
References 
7
0.86
10
Authors
1
Name
Order
Citations
PageRank
Heping Ding1677.26