The Gauss-Seidel fast affine projection algorithm
Authors:
- F. AlbuF. Albu
- J. KadlecJKJ. Kadlec
- N. ColemanNCN. Coleman
- A. FaganAFA. Fagan
- 27 August 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15206130,p. 109-114
Abstract
In this paper we propose a new stable fast affine projection algorithm based on Gauss-Seidel iterations (GSFAP). We investigate its implementation using the logarithmic number system (LNS) and compare it with two other fast affine projection (FAP) algorithms. Simplified and multi-input GSFAP versions are also proposed. We show that the algorithm is only marginally more complex than NLMS and simpler than other FAP algorithms. Its application for acoustic echo cancellation is also investigated.Keywords
This publication has 6 references indexed in Scilit:
- A 32 bit logarithmic arithmetic unit and its performance compared to floating-point2003
- The fast affine projection algorithm2002
- Arithmetic on the European logarithmic microprocessorIEEE Transactions on Computers, 2000
- Acoustic echo control. An application of very-high-order adaptive filtersIEEE Signal Processing Magazine, 1999
- Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods1994
- An adaptive filtering algorithm using an orthogonal projection to an affine subspace and its propertiesElectronics and Communications in Japan (Part I: Communications), 1984