arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.01402cs.ITmath.ITmath.OC
收藏

从已有的二进制感知矩阵确定性构造稀疏二进制和三进制矩阵

Deterministic construction of sparse binary and ternary matrices from existing binary sensing matrices

Pradip Sasmal, R. Ramu Naidu, C. S. Sastry, P. V. Jampana

摘要:

在目前的工作中,我们讨论了从现有的两个二进制传感矩阵构造稀疏的二进制和三进制矩阵的过程。我们构造的矩阵有几个有吸引力的属性,如较小的密度,这支持低计算复杂性的算法。作为我们的方法的一个应用,我们表明,CS矩阵的一般行大小不同于$p, p^2, pq$(对于不同的素数$p,q$)可以被构造。

英文摘要:

In the present work, we discuss a procedure for constructing sparse binary and ternary matrices from existing two binary sensing matrices. The matrices that we construct have several attractive properties such as smaller density, which supports algorithms with low computational complexity. As an application of our method, we show that a CS matrix of general row size different from $p, p^2, pq$ (for different primes $p,q$) can be constructed.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑