Search

The normalized subband adaptive filtering algorithm provides fast convergence rate for colored input signals as compared to the normalized least mean square algorithm, but it suffers from a poor convergence issue in the α -stable noise. In light of this, the normalized subband p-norm (NSPN) algorithm, which is based on the least mean p-power error (MPE) criterion, is proposed in this study. This technique is not only robust against impulsive noise samples, but it also maintains a fast convergence rate when colored input signals are used. In addition to this, we develop both the steady-state and the transient models of the NSPN algorithm and provide some insights. Then, in order to solve the problem of making a choice regarding the order p in the NSPN algorithm, we design an autonomous system and come up with the NSPN algorithm with a variable p-norm (VP-NSPN). In addition, we offer the TFC-based VP-NSPN algorithm with a fast convergence rate and low steady-state misadjustment simultaneously by making use of the tap-weights feedback-based convex combination (TFC) scheme. In conclusion, simulation results on system identification and acoustic echo cancellation are undertaken in order to validate the superiority of the proposed algorithms and validate the usefulness of the theoretical analysis. [ABSTRACT FROM AUTHOR]

As a robust adaptation criterion, the maximum correntropy criterion (MCC) has gained increased attention due to its successful application in the adaptation, especially in nonlinear and non-Gaussian situations. In this paper, the second-order Volterra (SOV) filter based on MCC is derived, which is called MCC-SOV. It combines the advantages of the SOV filter and MCC. However, similar to the conventional adaptive algorithm, the proposed MCC-SOV filter has a tradeoff between convergence rate and steady-state error. In order to solve this problem, we present a combination of the MCC-SOV filter by combining Volterra kernels, which is called CK-MCC-SOV. In addition, a weight transfer method is applied to improve the performance of the proposed filter in terms of the convergence rate and the steady-state error. Finally, simulations are carried out to demonstrate the advantages of the proposed filters. [ABSTRACT FROM AUTHOR]

To overcome the performance degradation of adaptive filtering algorithms in the presence of impulsive noise, a novel normalized sign algorithm (NSA) based on a convex combination strategy, called NSA-NSA, is proposed in this paper. The proposed algorithm is capable of solving the conflicting requirement of fast convergence rate and low steady-state error for an individual NSA filter. To further improve the robustness to impulsive noises, a mixing parameter updating formula based on a sign cost function is derived. Moreover, a tracking weight transfer scheme of coefficients from a fast NSA filter to a slow NSA filter is proposed to speed up the convergence rate. The convergence behavior and performance of the new algorithm are verified by theoretical analysis and simulation studies. [ABSTRACT FROM AUTHOR]