首页> 外文会议> >Convergence analysis of the recursive least M-estimate adaptive filtering algorithm for impulse noise suppression
【24h】

Convergence analysis of the recursive least M-estimate adaptive filtering algorithm for impulse noise suppression

机译:递推最小M估计自适应滤波算法在脉冲噪声抑制中的收敛性分析

获取原文

摘要

We present the convergence analysis of the recursive least M-estimate (RLM) adaptive filter algorithm, which was recently proposed for robust adaptive filtering in the impulse noise environment. The mean and mean squares behaviors of the RLM algorithm, based on the modified Huber M-estimate function (MHF), in the contaminated Gaussian (CG) noise model are analyzed. Close-form expressions are derived. The simulation and theoretical results agree very well with each other and suggest that the RLM algorithm is more robust than the RLS algorithm under the CG noise model.
机译:我们介绍了递归最小M估计(RLM)自适应滤波器算法的收敛性分析,该算法最近被提出用于脉冲噪声环境中的鲁棒自适应滤波。分析了基于修正的Huber M估计函数(MHF)的RLM算法在受污染的高斯(CG)噪声模型中的均方根和均方根行为。导出近似形式的表达式。仿真和理论结果非常吻合,表明在CG噪声模型下RLM算法比RLS算法更健壮。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号