Search

An adaptive estimation algorithm based on the Lorentzian norm is proposed for echo cancellation in vehicle hands-free communication systems and video teleconferencing systems, namely the affine-projection Lorentzian (APL) algorithm. By minimizing the Lorentzian norm of the a posteriori error vector with a suitable constraint on the weight vector and providing a dynamic Lorentzian-norm-controlling parameter, the proposed APL algorithm achieves robustness against impulsive disturbances and speeds up convergence for colored input signals. The computational complexity of the APL algorithm is analyzed and a fast recursive filtering method is employed to reduce its complexity. The stability analysis, based on energy-conservation arguments, shows that the APL algorithm converges. Furthermore, its tracking behavior is also investigated and a step size optimizing the tracking performance is derived. Simulation results agree well with the theoretical analysis. Simulation results for channel estimation and in-car echo cancellation scenarios demonstrate that the APL algorithm achieves better performance compared to the maximum-correntropy-criterion, affine-projection-generalized-maximum-correntropy, affine-projection-sign, affine-projection-like M-estimate, and Lorentzian adaptive filtering algorithms in various impulsive interference environments. [ABSTRACT FROM AUTHOR]

As a robust nonlinear similarity measure in kernel space, correntropy has received increasing attention in domains of machine learning and signal processing. In particular, the maximum correntropy criterion (MCC) has recently been successfully applied in robust regression and filtering. The default kernel function in correntropy is the Gaussian kernel, which is, of course, not always the best choice. In this paper, we propose a generalized correntropy that adopts the generalized Gaussian density (GGD) function as the kernel, and present some important properties. We further propose the generalized maximum correntropy criterion (GMCC) and apply it to adaptive filtering. An adaptive algorithm, called the GMCC algorithm, is derived, and the stability problem and steady-state performance are studied. We show that the proposed algorithm is very stable and can achieve zero probability of divergence (POD). Simulation results confirm the theoretical expectations and demonstrate the desirable performance of the new algorithm. [ABSTRACT FROM AUTHOR]

Abstract: The maximum mutual information (MaxMI) criterion is used as the adaptation cost for the adaptive filtering. This criterion is robust to measure distortions, and has strong connection with traditional mean-square error (MSE) criterion. Under Gaussian assumption, the closed-form solution of the finite impulse response (FIR) filter is obtained. Further, based on the kernel density estimation, the stochastic mutual information gradient (SMIG) algorithm is derived. Simulation results emphasize the robustness of this new algorithm. [Copyright &y& Elsevier]

Total least squares (TLS) method has been widely used in errors-in-variables (EIV) modeling tasks in which both input and output data are disturbed by noises, and adaptive filtering algorithm using TLS has shown significantly superior performance to classical least squares (LS) method in EIV system. The TLS essentially extends the minimum mean square error (MMSE) criterion to EIV model, which, however, may work poorly when noise is non-Gaussian (especially heavy-tailed distribution). Recently, an information theoretic learning (ITL) based minimum total error entropy (MTEE) adaptive filtering algorithm has been proposed, which extends the minimum error entropy (MEE) criterion to EIV model and shows desirable performance in non-Gaussian noise environments. However, due to complex mathematical expression, MTEE is computationally expensive and difficult to carry out the theoretical analysis. In this paper, we propose a new ITL-based criterion called maximum total correntropy (MTC) and develop a gradient-based MTC adaptive filtering algorithm. We analyze theoretically the local stability and steady-state performance of the proposed algorithm. Simulation results confirm the theoretical analysis and show the superior performance of MTC in heavy-tailed noises. Further, simulation comparisons between MTC and MTEE are presented. Compared with the MTEE, the MTC is mathematically more tractable and computationally much simpler while achieving similar or even better performance. [ABSTRACT FROM AUTHOR]

• A variant of the quantized minimum error entropy (QMEE) algorithm is proposed. • The mean square convergence performance analysis for QMEE algorithm is given. • The theoretical values of the steady-state EMSE for QMEE algorithm are validated by simulations. • QMEE algorithm is applied in electroencephalo (EEG) de-noising task. Adaptive filtering algorithms have been widely used in many areas, among which the minimum error entropy (MEE) algorithm is a superior choice, due to its excellent performance in the non-Gaussian noise situations. However, the computational complexity of the MEE algorithm is expensive, which leads to the computational bottlenecks, especially for large-scale datasets. In order to address the problem, we propose an adaptive filtering algorithm based on the quantized minimum error entropy (QMEE) criterion with an online quantization method, named QMEE algorithm. Moreover, we analyze the transient behavior characteristic and derive an approximate analytical expression for the steady-state excess mean square error (EMSE) based on the Taylor expansion. The extensive simulation results in linear modeling and electroencephalogram (EEG) denoising task demonstrate that the proposed method can outperform other robust adaptive filtering algorithms. [ABSTRACT FROM AUTHOR]

To improve the performance and reduce the computational complexity, a novel sign adaptation scheme for convex combination of adaptive filters is proposed. By using a sign adaptation scheme, the proposed scheme slightly reduces the computational complexity of the basic combination of mixing parameter, and improves the robustness of mixing parameter. Moreover, to obtain fast convergence property during the period of convergence transition in different environments, the instantaneous transfer scheme is applied to the proposed algorithm. The instantaneous transfer scheme has lower computational complexity than that of the basic combination of least mean square (basic-CLMS) algorithms. Simulation results in the context of system identification under time-invariant and time-variant systems demonstrate that the proposed algorithm based on the instantaneous transfer scheme has lower computational complexity and faster convergence rate than that of the basic-CLMS algorithm during period of convergence transitions. [ABSTRACT FROM AUTHOR]

Active noise control (ANC) is an effective way for reducing the noise level in electroacoustic or electromechanical systems. Since its first introduction in 1936, this approach has been greatly developed. This paper focuses on discussing the development of ANC techniques over the past decade. Linear ANC algorithms, including the celebrated filtered-x least-mean-square (FxLMS)-based algorithms and distributed ANC algorithms, are investigated and evaluated. Nonlinear ANC (NLANC) techniques, such as functional link artificial neural network (FLANN)-based algorithms, are pursued in Part II. Furthermore, some novel methods and applications of ANC emerging in the past decade are summarized. Finally, future research challenges regarding the ANC technique are discussed. [ABSTRACT FROM AUTHOR]