arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.2255cs.ITmath.IT
收藏

近似稀疏系统辨识的鲁棒零点吸引LMS算法

A Robust Zero-point Attraction LMS Algorithm on Near Sparse System Identification

Jian Jin, Qing Qu, Yuantao Gu

摘要:

新提出的$l_1$范数约束零点吸引最小均方算法(ZA-LMS)在精确稀疏系统辨识方面表现出优异的性能。然而,当系统接近稀疏时,ZA-LMS与标准LMS相比具有较小的优势。因此,本文首先提出了基于广义高斯分布的近稀疏系统建模方法,并给出了稀疏度的定义。其次,对ZA-LMS算法进行了两处改进。在代价函数中,用部分$l_1$范数代替$l_1$范数惩罚,从而在不增加计算复杂性的情况下增强鲁棒性。此外,零点吸引力项通过估计误差的大小进行加权,从而动态地调整零点吸引力。将这两种改进方法结合起来,进一步提出了动态加窗ZA-LMS(DWZA-LMS)算法,该算法在近稀疏系统辨识方面表现出更好的性能。此外,对DWZA-LMS算法的均方性能进行了分析。最后,通过计算机模拟验证了算法的有效性,验证了理论分析的结果。

英文摘要:

The newly proposed $l_1$ norm constraint zero-point attraction Least Mean Square algorithm (ZA-LMS) demonstrates excellent performance on exact sparse system identification. However, ZA-LMS has less advantage against standard LMS when the system is near sparse. Thus, in this paper, firstly the near sparse system modeling by Generalized Gaussian Distribution is recommended, where the sparsity is defined accordingly. Secondly, two modifications to the ZA-LMS algorithm have been made. The $l_1$ norm penalty is replaced by a partial $l_1$ norm in the cost function, enhancing robustness without increasing the computational complexity. Moreover, the zero-point attraction item is weighted by the magnitude of estimation error which adjusts the zero-point attraction force dynamically. By combining the two improvements, Dynamic Windowing ZA-LMS (DWZA-LMS) algorithm is further proposed, which shows better performance on near sparse system identification. In addition, the mean square performance of DWZA-LMS algorithm is analyzed. Finally, computer simulations demonstrate the effectiveness of the proposed algorithm and verify the result of theoretical analysis.

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

↑