AbstractIt is known that the conventional adaptive filtering algorithms can have good performance for non-sparse systems identification, but unsatisfactory performance for sparse systems identification. The normalized least mean absolute third… Click to show full abstract
AbstractIt is known that the conventional adaptive filtering algorithms can have good performance for non-sparse systems identification, but unsatisfactory performance for sparse systems identification. The normalized least mean absolute third (NLMAT) algorithm which is based on the high-order error power criterion has a strong anti-jamming capability against the impulsive noise, but reduced estimation performance in case of sparse systems. In this paper, several sparse NLMAT algorithms are proposed by inducing sparse-penalty functions into the standard NLMAT algorithm in order to exploit the system sparsity. Simulation results are given to validate that the proposed sparse algorithms can achieve a substantial performance improvement for a sparse system and robustness to impulsive noise environments.
               
Click one of the above tabs to view related content.