Zakharov, Y and Albu, F (2005) Coordinate descent iterations in fast affine projection algorithm. IEEE Signal Processing Letters. pp. 353-356. ISSN 1070-9908Full text available as:
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.
|Copyright, Publisher and Additional Information:||Copyright © 2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Keywords:||coordinate descent, echo cancellation, fast affine projection, Gauss-Seidel algorithm|
|Academic Units:||The University of York > Electronics (York)|
|Depositing User:||Sherpa Assistant|
|Date Deposited:||03 Oct 2005|
|Last Modified:||17 Oct 2013 14:22|