Journal of Computer Science

Improvement of the Simplified Fast Transversal Filter Type Algorithm for Adaptive Filtering

Madjid Arezki, Ahmed Benallal and Daoud Berkani

DOI : 10.3844/jcssp.2009.347.354

Journal of Computer Science

Volume 5, Issue 5

Pages 347-354

Abstract

Problem statement: In this study, we proposed a new algorithm M-SMFTF for adaptive filtering with fast convergence and low complexity. Approach: It was the result of a simplified FTF type algorithm, where the adaptation gain was obtained only from the forward prediction variables and using a new recursive method to compute the likelihood variable. Results: The computational complexity was reduced from 7L-6L, where L is the finite impulse response filter length. Furthermore, this computational complexity can be significantly reduced to (2L+4P) when used with a reduced P-size forward predictor. Conclusion: This algorithm presented a certain interest, for the adaptation of very long filters, like those used in the problems of echo acoustic cancellation, due to its reduced complexity, its numerical stability and its convergence in the presence of the speech signal.

Copyright

© 2009 Madjid Arezki, Ahmed Benallal and Daoud Berkani. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.