Research Article Open Access

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

Madjid Arezki, Ahmed Benallal and Daoud Berkani

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.

Journal of Computer Science
Volume 5 No. 5, 2009, 347-354

DOI: https://doi.org/10.3844/jcssp.2009.347.354

Submitted On: 19 December 2008 Published On: 31 May 2009

How to Cite: Arezki, M., Benallal, A. & Berkani, D. (2009). Improvement of the Simplified Fast Transversal Filter Type Algorithm for Adaptive Filtering . Journal of Computer Science, 5(5), 347-354. https://doi.org/10.3844/jcssp.2009.347.354

  • 3,136 Views
  • 2,705 Downloads
  • 3 Citations

Download

Keywords

  • Fast RLS
  • NLMS
  • FNTF
  • adaptive filtering
  • convergence speed
  • tracking capability