.png){kind=icon}
返回
An adjusting-block based convex combination algorithm for identifying block-sparse system
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2017.08.014.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A novel block wise convex combination algorithm with adjusting blocks is proposed for block-sparse system identification. The proposed algorithm unifies the complementary advantages of different block induced algorithms, which are based on block proportionate matrix and block zero attracting penalty. A mixing parameter for block wise combination is designed as a block diagonal matrix. The mixing parameter is obtained using the conventional mixing parameter, which represents convergence state, and a block activeness indicator. The indicator for each block is derived from the l-norm measure of the block. Moreover, a block adjustment algorithm is developed using the indicator to overcome the main disadvantage of block-induced algorithms, i.e., the dependency on cluster location. The simulations for system identification are performed on several block-sparse systems including systems with single cluster and double clusters. The simulation results show that the proposed algorithm not only combines the different block-induced algorithms effectively but also improves the performance via the block adjustment algorithm. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Adaptive filter
NLMS algorithm
Echo cancellation
Proportionate matrix
Zero-attracting penalty
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.9K
被引数:
1.7W
机构
暂无机构信息
引用论文
Proportionate normalized subband adaptive filter algorithms for sparse system identification.png)
SIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
分享收藏Gradient optimization p-norm-like constraint LMS algorithm for sparse system estimationSIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
分享收藏
查看更多内容