首页> 外文期刊>IEEE Transactions on Information Theory >Compressed Sensing With Combinatorial Designs: Theory and Simulations
【24h】

Compressed Sensing With Combinatorial Designs: Theory and Simulations

机译:组合设计的压缩感知:理论与仿真

获取原文
获取原文并翻译 | 示例
           

摘要

We use deterministic and probabilistic methods to analyze the performance of compressed sensing matrices constructed from Hadamard matrices and pairwise balanced designs, previously introduced by a subset of the authors. In this paper, we obtain upper and lower bounds on the sparsity of signals for which our matrices guarantee recovery. These bounds are tight to within a multiplicative factor of at most 4sqrt {2}42√ . We provide new theoretical results and detailed simulations, which indicate that the construction is competitive with Gaussian random matrices, and that recovery is tolerant to noise. A new recovery algorithm tailored to the construction is also given.
机译:我们使用确定性和概率方法来分析由Hadamard矩阵和成对平衡设计构造的压缩感测矩阵的性能,该模型先前由一组作者引入。在本文中,我们获得了信号稀疏性的上限和下限,矩阵保证了这些稀疏性的恢复。这些界限严格限制在最多4sqrt {2}42√的乘法因子内。我们提供了新的理论结果和详细的仿真结果,表明该结构与高斯随机矩阵具有竞争性,并且恢复能力对噪声具有容忍性。还给出了针对该构造的新的恢复算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号