l_0范数约束最小均方算法的性能分析
Performance Analysis of l_0 Norm Constraint Least Mean Square Algorithm
摘要:
$l_0$范数约束最小均方($l_0$ -LMS)算法是近年来提出的一种稀疏系统辨识算法,它通过对抽头权值稀疏性的惩罚来修正传统方法的代价函数。与其各种前体相比,$l_0$ -LMS的性能相当吸引人。然而,还没有对其性能进行详细研究。本文在合理假设的基础上,对$l_0$ -LMS算法在白高斯输入数据下的性能进行了全面、深入的理论分析。稳态均方差(MSD)的表达式推导和讨论相对于算法参数和系统稀疏性。为达到最佳性能,建立了参数选择规则。用泰勒级数逼近,导出了系统的瞬时特性.此外,还建立了$l_0$ -LMS算法与已有算法的关系以及$l_0$ -LMS算法加速收敛的充分条件。最后,所有的理论结果与仿真结果进行了比较,并在很大的参数设置范围内吻合良好。
英文摘要:
As one of the recently proposed algorithms for sparse system identification, $l_0$ norm constraint Least Mean Square ($l_0$-LMS) algorithm modifies the cost function of the traditional method with a penalty of tap-weight sparsity. The performance of $l_0$-LMS is quite attractive compared with its various precursors. However, there has been no detailed study of its performance. This paper presents all-around and throughout theoretical performance analysis of $l_0$-LMS for white Gaussian input data based on some reasonable assumptions. Expressions for steady-state mean square deviation (MSD) are derived and discussed with respect to algorithm parameters and system sparsity. The parameter selection rule is established for achieving the best performance. Approximated with Taylor series, the instantaneous behavior is also derived. In addition, the relationship between $l_0$-LMS and some previous arts and the sufficient conditions for $l_0$-LMS to accelerate convergence are set up. Finally, all of the theoretical results are compared with simulations and are shown to agree well in a large range of parameter setting.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。