Abstract
In a previous paper, we have proposed a novel approach to choose an optimal p-power error criterion for adaptive filtering, by minimizing a Kullback-Leibler information divergence (KL-divergence). However, the method requires exact knowledge of the noise PDF, which reduces its practicality since in real life scenario the noise distribution is usually unknown. In the present paper, we propose a more practicable method, in which the optimal p value is approximately determined by using the error samples on-line, without resorting to a priori knowledge of the noise. The mean-square convergence of the proposed algorithm is studied, and an upper bound of the step-size is derived. Monte Carlo simulation results confirm the effectiveness and superiority of the new method. ICIC International
| Original language | English |
|---|---|
| Pages (from-to) | 1725-1737 |
| Number of pages | 13 |
| Journal | International Journal of Innovative Computing, Information and Control |
| Volume | 7 |
| Issue number | 4 |
| State | Published - Apr 2011 |
| Externally published | Yes |
Keywords
- Adaptive filtering
- Generalized Gaussian density
- P-power error criterion
Fingerprint
Dive into the research topics of 'Adaptive filtering with adaptive p-power error criterion'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver