This paper is concerned with adaptive noise reduction based on the fast recursive least squares (FRLS) algorithm. It is well known that the fast recursive least squares (FRLS) algorithm suffers from numerical instability when operating under the effects of finite precision arithmetic. Several numerical solutions of stabilization were proposed in the case of stationary signals. In this work a new version of a numerically stable FRLS algorithm (NS-FRLS) is proposed. The stability characteristics of this new stabilized algorithm are analysed. The analysis is based on a linear model for the errors in the states of the adaptive filter. Experimental results confirm the merits of adaptive filtering with the NS-FRLS algorithm over optimum filtering using the solution provided by Wiener-Hopf equations.

No 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

No abstract

A new adaptive algorithm with fast convergence and low complexity is presented. By using the calculation structure of the dual Kalman variables of the fast transversal filter algorithm and a simple decorrelating technique for the input signal, we obtain an algorithm that exhibits faster convergence speed and enhanced tracking ability compared with the normalized least-mean-square algorithm with similar computational complexity.A. BENALLAL AND M. AREZKI CONCLUSIONIn this paper, a new FNLMS-type algorithm for adaptive filters is presented. The adaptation gain for the new algorithm is obtained by simplification of the FTF adaptation gain calculation. The amount of computation, 2N multiplications per sample, is the same for the proposed algorithm as for the NMLS algorithm. In all presented simulations, the proposed algorithm performs better than NLMS. It exhibits faster convergence and enhanced tracking ability compared with the NLMS algorithm.