arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1901.07635cs.ITmath.IT
收藏

用于非自适应定量分组测试的稀疏图编码

Sparse Graph Codes for Non-adaptive Quantitative Group Testing

Esmaeil Karimi, Fatemeh Kazemi, Anoosheh Heidarzadeh, Krishna R. Narayanan, Alex Sprintson

摘要:

本文研究定量分组测试问题。考虑一组$N$项,其中$K$项有缺陷。QGT问题是识别(所有或足够大的一部分)有缺陷的项目,其中测试的结果揭示了测试组中有缺陷的项目的数量。在这项工作中,我们提出了一个非自适应QGT算法使用稀疏图码的双正则二部图与左度$\ell$和右度$r$和二进制$t$纠错BCH码。所提出的方案提供了准确的恢复概率保证,即恢复所有的有缺陷的项目与高概率。特别是,我们表明,对于次线性制度,$\frac{K}{N}$消失的$K,N\rightarrow\infty$,该算法需要在最多${m=c(t)K\left(t\log_2\left(\frac{\ell N}{c(t)K}+1\right)+1\right)+1}$测试,以恢复所有的缺陷项目的概率接近一个${K,N\rightarrow\infty}$,其中$c(t)$只依赖于$t$。我们的理论分析的结果表明,所需的测试次数最少的$t=2$实现。对于任何$t\leq 4$,所提出的算法的编码和解码的计算复杂度分别为$\mathcal{O}(K\log^2 \frac{N}{K})$和$\mathcal{O}(K\log \frac{N}{K})$。我们的仿真结果还表明,该算法显着优于Abdalla \emph{et al.}最近提出的非自适应半定量组测试算法在所需的测试数量,以确定所有的缺陷项目的概率高。

英文摘要:

This paper considers the problem of Quantitative Group Testing (QGT). Consider a set of $N$ items among which $K$ items are defective. The QGT problem is to identify (all or a sufficiently large fraction of) the defective items, where the result of a test reveals the number of defective items in the tested group. In this work, we propose a non-adaptive QGT algorithm using sparse graph codes over bi-regular bipartite graphs with left-degree $\ell$ and right degree $r$ and binary $t$-error-correcting BCH codes. The proposed scheme provides exact recovery with probabilistic guarantee, i.e. recovers all the defective items with high probability. In particular, we show that for the sub-linear regime where $\frac{K}{N}$ vanishes as $K,N\rightarrow\infty$, the proposed algorithm requires at most ${m=c(t)K\left(t\log_2\left(\frac{\ell N}{c(t)K}+1\right)+1\right)+1}$ tests to recover all the defective items with probability approaching one as ${K,N\rightarrow\infty}$, where $c(t)$ depends only on $t$. The results of our theoretical analysis reveal that the minimum number of required tests is achieved by $t=2$. The encoding and decoding of the proposed algorithm for any $t\leq 4$ have the computational complexity of $\mathcal{O}(K\log^2 \frac{N}{K})$ and $\mathcal{O}(K\log \frac{N}{K})$, respectively. Our simulation results also show that the proposed algorithm significantly outperforms a non-adaptive semi-quantitative group testing algorithm recently proposed by Abdalla \emph{et al.} in terms of the required number of tests for identifying all the defective items with high probability.

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

↑