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]

Recently, the sign subband adaptive filter (SSAF) algorithm has obtained great attention, due to its robustness against impulsive noises and decorrelating property for correlated input signals. However, the performance of the algorithm in the steady-state is not analyzed. In this paper, we study the steady-state mean-square-deviation (MSD) behavior of the SSAF algorithm by using energy conservation relation, Price׳s theorem and some reasonable assumptions. Simulation results in different system identification scenarios (including the input signals, tap lengths, impulsive noises, number of subbands, and step sizes) are provided to support our theoretical analysis. [ABSTRACT FROM AUTHOR]