Improvement of the convergence speed and the tracking ability of the fast Newton type adaptive filtering (FNTF) algorithm

University of Ottawa, Ottawa, Ontario, Canada
Signal Processing (Impact Factor: 2.24). 07/2006; 86(7):1704-1719. DOI: 10.1016/j.sigpro.2005.09.012
Source: DBLP

ABSTRACT In this paper, five new versions of the fast Newton type adaptive filtering (FNTF) algorithm are presented. A brief preliminary presentation of these algorithms was given in Djendi et al. [Comparative study of new version of the Newton type adaptive filtering algorithm, in: Proceedings of the IEEE ICASSP 2004, Montreal, Canada, May 2004, pp. 677–680]. The first algorithm is based on a simple modification of the filtering part, by introducing a scalar accelerator parameter. The second algorithm is based on the use of the temporal subdivision technique to update the local filter coefficients. The third algorithm is a modification of the second one, by the use of the final filtering errors to update the filter coefficients. The fourth and the fifth algorithms are based, respectively, on the combination of features from the first algorithm with features of the second and third algorithms. These new algorithms are proposed to improve the convergence speed of the original version of the FNTF algorithm for the identification of acoustic impulse responses, and also to improve the tracking ability when the systems vary in time. A comparative study of each algorithm with the original version of the FNTF algorithm is also presented.

  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper addresses the problem of acoustic noise reduction and speech enhancement by adaptive filtering algorithms. Most speech enhancement methods and algorithms which use adaptive filtering structure are generally expressed in fullband form. One of these widespread structures is the Forward Blind Source Separation Structure (FBSS). This FBSS structure is often used to separate speech form noise and therefore enhance the speech signal at the processing output. In this paper, we propose a new subband implementation of this FBSS structure. In order to give more robustness to the proposed structure, we adapt then we apply to this subband structure a new combination of criteria based on the system mismatch and the smoothing filtering errors minimizations. The combination between this proposed subband structure with this optimal criteria allows to obtain a new two-channel subband forward (2CSF) algorithm that improves the convergence speed of the cross adaptive filters which are used to separate speech from noise. Objective tests under various environments are presented showing the good behavior of the proposed 2CSF algorithm.
    Computers & Electrical Engineering 11/2013; 39(8):2531–2550. DOI:10.1016/j.compeleceng.2013.09.009 · 0.99 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper addresses the problem of the speech quality improvement using adaptive filtering algorithms. Recently in Djendi and Bendoumia (2014)[1], we have proposed a new two-channel backward algorithm for noise reduction and speech intelligibility enhancement. The main drawback of proposed two-channel subband algorithm is its poor performance when the number of subband is high. This inconvenience is well seen in the steady state regime values. The source of this problem is the fixed step-sizes of the cross-adaptive filtering algorithms that distort the speech signal when they are selected high and degrade the convergence speed behaviours when they are selected small. In this paper, we propose four modifications of this algorithm which allow improving both the convergence speed and the steady state values even in very noisy condition and a high number of subbands. To confirm the good performance of the four proposed variable-step-size SBBSS algorithms, we have carried out several simulations in various noisy environments. In these simulations, we have evaluated objective and subjective criteria as the system mismatch, the cepstral distance, the output signal-to-noise-ratio, and the mean opinion score (MOS) method to compare the four proposed variables step-size versions of the SBBSS algorithm with their original versions and with the two-channel fullband backward (2CFB) least mean square algorithm.
    Applied Acoustics 12/2014; 86:25–41. DOI:10.1016/j.apacoust.2014.05.003 · 1.07 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper addresses the problem of speech enhancement and acoustic noise reduction by adaptive filtering algorithms. Recently, forward-and-backward (FB) blind-source-separation (BSS) structures have been proposed to solve acoustic noise reduction and speech enhancement problems. The FB structures use the least-mean-square (LMS) algorithm in combination with two BSS structures and are implemented with fixed-step-size to control the convergence behavior of the cross-coupling adaptive filters. In this paper, we propose two new two-channel variable-step-size FB algorithms (2C-VSSF and 2C-VSSB) that improve the previous LMS-based algorithm in the transient and the steady-state phases. These two new proposed FB algorithms are based on recursive formulas, which lead to efficient estimation of the optimal step-sizes of the cross-coupling filters. These proposed algorithms show significant improvement in the steady-state and transient mean-square-error (MSE) values. We present simulation results of the proposed 2C-VSSF and 2C-VSSB algorithms that confirm the superiority and good performance in comparison with the original versions, which use fixed-step-sizes.
    Signal Processing 03/2015; 108:226–244. DOI:10.1016/j.sigpro.2014.08.035 · 2.24 Impact Factor