【24h】

On the Step-Size optimization of the LMS Algorithm

机译:LMS算法的步长优化

获取原文

摘要

The least-mean-square (LMS) and the normalized least-mean-square (NLMS) algorithms require a trade-off between fast convergence and low misadjustment, obtained by choosing the control parameters. In general, time variable parameters are proposed according to different rules. Many studies on the optimization of the NLMS algorithm imply time variable control parameters according some specific criteria. In this paper, we develop an optimized LMS algorithm, in the context of a state variable model. The proposed algorithm follows an optimization problem and introduces a variable step-size in order to minimize the system misalignment. The simulations confirm the theoretical results and show the good features of the algorithm.
机译:最小均方(LMS)算法和规范化的最小均方(NLMS)算法需要在快速收敛和低失调之间进行权衡,这可以通过选择控制参数来实现。通常,根据不同的规则提出时变参数。许多关于NLMS算法优化的研究都暗示了根据某些特定标准的时变控制参数。在本文中,我们在状态变量模型的背景下开发了一种优化的LMS算法。所提出的算法遵循优化问题并引入可变步长,以最小化系统失准。仿真结果验证了理论结果,表明了该算法的优良特性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号