A fast exact FTF adaptive algorithm

In this paper we present a new method for the efficient implementation of the fast transversal filter(ftf) algorithm. Reduction of the arithmetic complexity is obtained by making use of the redundancy in the successive computations of the forward prediction error and the filtering error in the joint process. The resulting algorithm is exactly equivalent to the originalftf algorithm, hence retaining the same theoretical convergence characteristics and offering the least squares(ls) estimate at each recursion step without delay. Furthermore, the algorithm can be numerically stabilized by using a simple and effective stabilization measure which needs only one additional multiplication per recursion step. The equivalence of the proposed algorithm to the originalftf algorithm is demonstrated by simulations of an acoustic room impulse response identification.