基于Berlekamp-Justesen码的压缩感知确定性测量矩阵的构造.pdfVIP

第37 卷第4 期 电 子 与 信 息 学 报 Vol.37 No.4 2015 年4 月 Journal of Electronics Information Technology Apr. 2015 基于Berlekamp-Justesen 码的压缩感知确定性测量矩阵的构造 夏树涛* 刘 璐 刘鑫吉 (清华大学深圳研究生院 深圳 518055) (清华大学计算机科学与技术系 北京 100084) 摘 要：确定性测量矩阵构造是近期压缩感知领域的一个重要研究问题。该文基于 Berlekamp-Justesen(B-J)码， 构造了两类确定性测量矩阵。首先，给出一类相关性渐近最优的稀疏测量矩阵，从而保证其具有较好的限定等距性 (RIP)。接着，构造一类确定性复测量矩阵，这类矩阵可以通过删除部分行列使其大小灵活变化。第1 类矩阵具有 很高的稀疏性，第2 类则是基于循环矩阵，因此它们的存储开销较小，编码和重构复杂度也相对较低。仿真结果表 明，这两类矩阵常常有优于或相当于现有的随机和确定性测量矩阵的重建性能。 关键词：压缩感知；Berlekamp-Justesen 码；渐近最优；复测量矩阵；限定等距性 中图分类号：TN911.72 文献标识码：A 文章编号：1009-5896(2015)04-0763-07 DOI: 10.11999/JEIT140875 Deterministic Constructions of Compressive Sensing Matrices Based on Berlekamp-Justesen Codes Xia Shu-tao Liu Lu Liu Xin-ji (Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China) (Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China) Abstract: Nowadays the deterministic construction of sensing matrices is a hot topic in compressed sensing. Two classes of deterministic sensing matrices based on the Berlekamp-Justesen (B-J) codes are proposed. Firstly, a class of sparse sensing matrices with near-optimal coherence is constructed. It satisfies the Restricted Isometry Property (RIP) well. Afterwards, a class of deterministic complex-valued matrices is proposed. The row and column numbers of these matrices are tunable through the row and column puncturing. Moreover, the first proposed matrices are high sparsity and the second matrices are able to obtain from the cyclic matrices, thus the storage costs of them are re