Abstract
In this paper, we develop a fast recursive algorithm with a view to finding the total least squares (TLS) solution for adaptive FIR filtering with input and output noises. We introduce an approximate inverse power iteration in combination with Galerkin method so that the TLS solution can be updated adaptively at a lower computational cost. We further reduce the computational complexity of the developed algorithm by making efficient computation of the fast gain vector. We then make a careful investigation into global convergence of the developed algorithm. Simulation results are provided that clearly illustrate appealing performances of the developed algorithm.
Original language | English |
---|---|
Title of host publication | 2006 IEEE International Symposium on Circuits and Systems. ISCAS 2006. Proceedings |
Publisher | IEEE |
Number of pages | 4 |
ISBN (Print) | 0780393902 |
Publication status | Published - 2006 |
Event | IEEE International Symposium on Circuits and Systems - Duration: 20 May 2012 → … |
Conference
Conference | IEEE International Symposium on Circuits and Systems |
---|---|
Period | 20/05/12 → … |
Keywords
- FIR filters
- Galerkin method
- computational complexity
- convergence of numerical methods
- iterative methods
- recursive estimation