arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.0463eess.SYcs.SY
收藏

基于交替优化与收缩的稀疏性感知自适应算法

Sparsity-Aware Adaptive Algorithms Based on Alternating Optimization with Shrinkage

CETUC-PUC-Rio(天主教里约热内卢大学电信研究中心);University of York(约克大学);CETUC/PUC-RIO(天主教里约热内卢大学电信研究中心)

Rodrigo C. de Lamare, Raimundo Sampaio-Neto

AI总结:

本文提出了一种基于交替优化策略与收缩的新型稀疏性感知自适应滤波方案,通过两阶段结构加速收敛并强制小系数为零,实验表明其在收敛性和跟踪性能上优于现有方法。

摘要:

本文提出了一种基于交替优化策略与收缩的新型稀疏性感知自适应滤波方案和算法。所提出的方案采用两阶段结构,包括一个交替优化对对角结构矩阵以加速收敛,以及一个具有收缩函数的自适应滤波器,该函数迫使小幅度系数为零。我们为所提出的方案设计了交替优化最小均方(LMS)算法,并分析了其均方误差。系统辨识应用的仿真结果表明,所提出的方案和算法在收敛性和跟踪性能上优于现有的稀疏性感知算法。

英文摘要:

This letter proposes a novel sparsity-aware adaptive filtering scheme and algorithms based on an alternating optimization strategy with shrinkage. The proposed scheme employs a two-stage structure that consists of an alternating optimization of a diagonally-structured matrix that speeds up the convergence and an adaptive filter with a shrinkage function that forces the coefficients with small magnitudes to zero. We devise alternating optimization least-mean square (LMS) algorithms for the proposed scheme and analyze its mean-square error. Simulations for a system identification application show that the proposed scheme and algorithms outperform in convergence and tracking existing sparsity-aware algorithms.

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

↑