The filtered-x least-mean-square (FxLMS) algorithm has been widely used for the active noise control. A fundamental analysis of the convergence behavior of the FxLMS algorithm, including the transient and steady-state performance, could provide some new insights into the algorithm and can be also helpful for its practical applications, e.g., the choice of the step size. Although many efforts have been devoted to the statistical analysis of the FxLMS algorithm, it was usually assumed that the reference signal is Gaussian or white. However, non-Gaussian and/or non-white processes could be very widespread in practice as well. Moreover, the step-size bound that guarantees both of the mean and mean-square stability of the FxLMS for an arbitrary reference signal and a general secondary path is still not available in the literature. To address these problems, this paper presents a comprehensive statistical convergence analysis of the FxLMS algorithm without assuming a specific model for the reference signal. We formulate the mean weight behavior and the mean-square error (MSE) in terms of an augmented weight vector. The covariance matrix of the augmented weight-error vector is then evaluated using the vectorization operation, which makes the analysis easy to follow and suitable for arbitrary input distributions. The stability bound is derived based on the first-order and second-order moments analysis of the FxLMS. Computer simulations confirmed the effectiveness of the proposed theoretical model.

This paper presents a comprehensive overview of the frequency-domain filtered-x least mean-square (FxLMS) algorithms for active noise control (ANC). The direct use of frequency-domain adaptive filters for ANC results in two kinds of delays, i.e., delay in the signal path and delay in the weight adaptation. The effects of the two kinds of delays on the convergence behavior and stability of the adaptive algorithms are analyzed in this paper. The first delay can violate the so-called causality constraint, which is a major concern for broadband ANC, and the second delay can reduce the upper bound of the step size. The modified filter-x scheme has been employed to remove the delay in the weight adaptation, and several delayless filtering approaches have been presented to remove the delay in the signal path. However, state-of-the-art frequency-domain FxLMS algorithms only remove one kind of delay, and some of these algorithms have a very high peak complexity and hence are impractical for real-time systems. This paper thus proposes a new delayless frequency-domain ANC algorithm that completely removes the two kinds of delays and has a low complexity. The performance advantages and limitations of each algorithm are discussed based on an extensive evaluation, and the complexities are evaluated in terms of both the peak and average complexities.

Recently, a multiband-structured subband adaptive filter (MSAF) algorithm was proposed to speed up the convergence of the normalized least-mean-square (NLMS) algorithm. In this letter, we extend this work and propose an improved multiband-structured subband adaptive filter (IMSAF) algorithm to increase the convergence speed of the MSAF, which can also be regarded as a unifying framework for the NLMS, MSAF, and affine projection (AP) algorithms. The proposed optimization criterion is based on the principle of minimal disturbance, canceling the most recent P a posteriori errors in each of the N subbands. The stability condition and the computational complexity are also analyzed. Computer simulations in the context of system identification demonstrate the effectiveness of the new algorithm.

Most multichannel blind source separation (BSS) approaches rely on a spatial model to encode the transfer functions from sources to microphones and a source model to encode the source power spectral density. The rank-1 spatial model has been widely exploited in independent component analysis (ICA), independent vector analysis (IVA), and independent low-rank matrix analysis (ILRMA). The full-rank spatial model is also considered in many BSS approaches, such as full-rank spatial covariance matrix analysis (FCA), multichannel nonnegative matrix factorization (MNMF), and FastMNMF, which can improve the separation performance in the case of long reverberation times. This paper proposes a new MNMF framework based on the convolutive transfer function (CTF) for overdetermined BSS. The time-domain convolutive mixture model is approximated by a frequency-wise convolutive mixture model instead of the widely adopted frequency-wise instantaneous mixture model. The iterative projection algorithm is adopted to estimate the demixing matrix, and the multiplicative update rule is employed to estimate nonnegative matrix factorization (NMF) parameters. Finally, the source image is reconstructed using a multichannel Wiener filter. The advantages of the proposed method are twofold. First, the CTF approximation enables us to use a short window to represent long impulse responses. Second, the full-rank spatial model can be derived based on the CTF approximation and slowly time-variant source variances, and close relationships between the proposed method and ILRMA, FCA, MNMF and FastMNMF are revealed. Extensive experiments show that the proposed algorithm achieves a higher separation performance than ILRMA and FastMNMF in reverberant environments.