Coordinate descent iterations in fast affine projection algorithm

Author

Zakharov, Yuriy ; Albu, Felix

Author_Institution

Univ. of York, UK

Volume

12

Issue

5

fYear

2005

fDate

5/1/2005 12:00:00 AM

Firstpage

353

Lastpage

356

Abstract

We propose a new approach for real-time implementation of the fast affine projection (FAP) algorithm. This is based on exploiting the recently introduced dichotomous coordinate descent (DCD) algorithm, which is especially efficient for solving systems of linear equations on real-time hardware and software platforms since it is free of multiplication and division. The numerical stability of the DCD algorithm allows the new combined DCD-FAP algorithm also to be stable. The convergence and complexity of the DCD-FAP algorithm is compared with that of the FAP, Gauss-Seidel FAP (GS-FAP), and modified GS-FAP algorithms in the application to acoustic echo cancellation. The DCD-FAP algorithm demonstrates a performance close to that of the FAP algorithm with ideal matrix inversion and the complexity smaller than that of the Gauss-Seidel FAP algorithms.

Keywords

echo suppression; iterative methods; linear systems; matrix inversion; numerical stability; real-time systems; signal processing; DCD; FAP; Gauss-Seidel FAP; acoustic echo cancellation; convergence; dichotomous coordinate descent algorithm; fast affine projection algorithm; hardware platform; linear system equation; matrix inversion; numerical stability; real-time implementation; software platform; Acoustic applications; Convergence; Equations; Financial advantage program; Gaussian processes; Hardware; Numerical stability; Projection algorithms; Real time systems; Software algorithms; Coordinate descent; Gauss–Seidel algorithm; echo cancellation; fast affine projection;

fLanguage

English

Journal_Title

Signal Processing Letters, IEEE

Publisher

ieee

ISSN

1070-9908

Type

jour

DOI

10.1109/LSP.2005.843765

Filename

1420338