Improvement of the Simplified FTF-Type Algorithm

In this paper, we propose a new algorithm M-SMFTF which reduces the complexity of the simplified FTF-type (SMFTF) algorithm by using a new recursive method to compute the likelihood variable. The computational complexity was reduced from 7L to 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. Finally, some simulation results are presented and our algorithm shows an improvement in convergence over the normalized least mean square (NLMS).