arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.03283cs.ITmath.ITnlin.AOstat.ME
收藏

$l_0$范数约束递归最小二乘算法的性能分析

Performance Analysis of $l_0$ Norm Constrained Recursive Least Squares Algorithm

Samrat Mukhopadhyay, Bijit Kumar Das, Mrityunjoy Chakraborty

摘要:

对$l_0$范数约束递归最小二乘(RLS)算法进行了性能分析.虽然性能相当吸引人相比,其各种替代品,没有进行深入的理论分析研究。与流行的$l_0$最小均方(LMS)算法类似,在$l_0$ RLS中,添加$l_0$范数惩罚以在瞬时滤波器抽头上提供零抽头吸引。本文采用白高斯输入数据,在适用于许多实际场景的假设下,对该算法进行了深入的理论性能分析。稳态MSD的表达式推导和分析不同的预定义变量的变化。还进行了基于泰勒级数展开的瞬时MSD的近似线性演化。最后,进行了数值模拟,以证实理论分析,并显示出匹配良好的参数范围很广。

英文摘要:

Performance analysis of $l_0$ norm constrained Recursive least Squares (RLS) algorithm is attempted in this paper. Though the performance pretty attractive compared to its various alternatives, no thorough study of theoretical analysis has been performed. Like the popular $l_0$ Least Mean Squares (LMS) algorithm, in $l_0$ RLS, a $l_0$ norm penalty is added to provide zero tap attractions on the instantaneous filter taps. A thorough theoretical performance analysis has been conducted in this paper with white Gaussian input data under assumptions suitable for many practical scenarios. An expression for steady state MSD is derived and analyzed for variations of different sets of predefined variables. Also a Taylor series expansion based approximate linear evolution of the instantaneous MSD has been performed. Finally numerical simulations are carried out to corroborate the theoretical analysis and are shown to match well for a wide range of parameters.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑