梯度比较器LMS算法的性能分析
Performance Analysis of the Gradient Comparator LMS Algorithm
摘要:
稀疏感知零吸引子最小均方(ZA-LMS)算法表现出更低的失调,在强稀疏环境比其稀疏不可知的对应,最小均方(LMS),但表现出比LMS更差时,稀疏的脉冲响应降低。ZA-LMS的重新加权的变体,即RZA-LMS,显示了对稀疏性的这种变化的鲁棒性,但代价是增加了计算复杂性。其他变体,例如10-LMS和改进的比例归一化LMS(IPNLMS),尽管性能令人满意,但也是计算密集型的。梯度比较器LMS(GC-LMS)是一个实用的解决方案,这种权衡时,硬件的限制是要考虑的。本文详细分析了GC-LMS算法的均值和均方收敛性能。分析结果与仿真结果吻合较好。
英文摘要:
The sparsity-aware zero attractor least mean square (ZA-LMS) algorithm manifests much lower misadjustment in strongly sparse environment than its sparsity-agnostic counterpart, the least mean square (LMS), but is shown to perform worse than the LMS when sparsity of the impulse response decreases. The reweighted variant of the ZA-LMS, namely RZA-LMS shows robustness against this variation in sparsity, but at the price of increased computational complexity. The other variants such as the l 0 -LMS and the improved proportionate normalized LMS (IPNLMS), though perform satisfactorily, are also computationally intensive. The gradient comparator LMS (GC-LMS) is a practical solution of this trade-off when hardware constraint is to be considered. In this paper, we analyse the mean and the mean square convergence performance of the GC-LMS algorithm in detail. The analyses satisfactorily match with the simulation results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。