期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
A robust subband adaptive filter algorithm for sparse and block-sparse systems identification 被引量:2
1
作者 ZAHRA Habibi HADI Zayyani MOHAMMAD Shams Esfand Abadi 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2021年第2期487-497,共11页
This paper presents a new subband adaptive filter(SAF)algorithm for system identification scenario under impulsive interference,named generalized continuous mixed p-norm SAF(GCMPN-SAF)algorithm.The proposed algorithm ... This paper presents a new subband adaptive filter(SAF)algorithm for system identification scenario under impulsive interference,named generalized continuous mixed p-norm SAF(GCMPN-SAF)algorithm.The proposed algorithm uses a GCMPN cost function to combat the impul-sive interference.To further accelerate the convergence rate in the sparse and the block-sparse system identification processes,the proportionate versions of the proposed algorithm,the L0-norm GCMPN-SAF(L0-GCMPN-SAF)and the block-sparse GCMPN-SAF(BSGCMPN-SAF)algorithms are also developed.Moreover,the convergence analysis of the proposed algorithm is provided.Simulation results show that the proposed algorithms have a better performance than some other state-of-the-art algorithms in the literature with respect to the convergence rate and the tracking capability. 展开更多
关键词 subband adaptive filter(SAF) generalized continuous mixed p-norm(GCMPN) sparse system block-sparse system impulsive interference
在线阅读 下载PDF
Recoverability analysis of block-sparse representation
2
作者 Yuli Fu Jian Zou +1 位作者 Qiheng Zhang Haifeng Li 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2014年第3期373-379,共7页
Recoverability of block-sparse signals by convex relaxation methods is considered for the underdetermined linear model. In previous works, some explicit but pessimistic recoverability results which were associated wit... Recoverability of block-sparse signals by convex relaxation methods is considered for the underdetermined linear model. In previous works, some explicit but pessimistic recoverability results which were associated with the dictionary were presented. This paper shows the recoverability of block-sparse signals are associated with the block structure when a random dictionary is given. Several probability inequalities are obtained to show how the recoverability changes along with the block structure parameters, such as the number of nonzero blocks, the block length, the dimension of the measurements and the dimension of the block-sparse representation signal. Also, this paper concludes that if the block-sparse structure can be considered, the recoverability of the signals wil be improved. Numerical examples are given to il ustrate the availability of the presented theoretical results. 展开更多
关键词 block-sparsity RECOVERABILITY mixed l2/l1-optimization program.
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部