Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 3244-3265 |
| Number of pages | 22 |
| Journal | Circuits, Systems, and Signal Processing |
| Volume | 35 |
| Issue number | 9 |
| DOIs | |
| State | Published - 1 Sep 2016 |
Keywords
- Adaptive filtering
- Convex combination
- Impulsive noise
- Normalized sign algorithm
- System identification