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

Authors:
Heping Ding
Affiliations:
Inst. for Microstruct. Sci., Nat. Res. Council of Canada, Ottawa, Ont.
Venue:
IEEE Transactions on Signal Processing
Year:
2007

Citing 0
Cited 5

Robust Source Separation with Simple One-Source-Active Detection

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Fast exact affine projection algorithm using displacement structure theory

DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
Drift-compensated adaptive filtering to improve speech intelligibility in presence of asynchronous interference

DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
A variable step-size matrix normalized subband adaptive filter

IEEE Transactions on Audio, Speech, and Language Processing
Drift-compensated adaptive filtering for improving speech intelligibility in cases with asynchronous inputs

EURASIP Journal on Advances in Signal Processing

Quantified Score

Hi-index	35.68

Visualization

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