摘要
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
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 1725-1737 |
| 页数 | 13 |
| 期刊 | International Journal of Innovative Computing, Information and Control |
| 卷 | 7 |
| 期 | 4 |
| 出版状态 | 已出版 - 4月 2011 |
| 已对外发布 | 是 |
学术指纹
探究 'Adaptive filtering with adaptive p-power error criterion' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver