基于块稀疏信号的正则化自适应压缩感知算法.pdfVIP

第 44 卷第1 期 吉林大学学报(工学版) Vo l. 44 No.1 2014 年 1 月 Journal of Jilin University (Engineering and Technology Edition) Jan. 2014 基于块稀疏信号的正则化自适应压缩感知算法 庄哲氏，吴力科，李芬兰，魏楚亮 (汕头大学电子工程系，广东汕头 515063) 摘 要:在研究已有的块稀疏信号贪婪算法的基础上，提出一种正则化的自适应恢复算法。该 算法在块稀疏度未知的前提下，添加了正则化的思想进行块挑选，从而更正确地挑选出块信号 的支撑块，实现信号的重建。该算法首先在确定块的稀疏度和选择步长后，利用相关最大化原 则实现支撑块的初次挑选;然后，依据巳挑选出的支撑块再进行正则化分组，实现二次挑选;最 终通过循环迭代正确挑选出整个信号的支撑块。通过仿真实验证明，该算法不仅不需要信号 的块稀疏度作为先验知识，且较现有的块信号贪婪算法的重构概率更高，也比现有的块稀疏自 适应贪婪算法所需的迭代次数更少和迭代时间更短。 关键词:通信技术;稀疏信号;自适应;正则化;贪婪算法 中图分类号:TN91 1. 6 文章编号:1671-5497(2014)01-0259-05 文献标志码:A DOI: 10. 13229/j. cnki. jdxbgxb201401042 Regularized adaptive matching pursuit algorithm of compressive sensing based on block sparsity signal ZHUANG Zhe-min , WU Li-ke , LI Fen-lan , WEI Chu-liang (Deρartment 01 Electronics ,Shantou University ,Shantou 515063 ,China) Abstract: A regularized adaptive matching pursuit algorithm as proposed after research and summarize the existing greedy algorisms based on block-sparse signal. This algorithm mainly in the light of regularized method under a condition that a block-sparse degree is unknown , so that the signal support set can be determined more accurately by the algorithm , then we can reconstruct a signal precisely. First , the algorithm initializes a sparsity degree and step size of a block signal; by maximizing the correlation between residual and measurement matrix , it realizes the selection of subset of the signal support. Then the algorithm updates the selected subset in the second time. Finally , the exact support set is acquired through iteration.