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

离散无记忆信道上的分布式假设检验

Distributed Hypothesis Testing Over Discrete Memoryless Channels

Sreejith Sreekumar, Deniz Gündüz

摘要:

研究了一个分布式的二元假设检验(HT)问题,该问题涉及两个参与者,一个称为观察者,另一个称为检测者。观测器观测离散无记忆源(DMS),并通过离散无记忆信道(DMC)将其观测结果传递给检测器。检测器观测与观测器处的DMS相关的另一DMS,并且使用其自身观测的数据和从观测器接收的信息对两个DMS的联合分布执行二进制HT。探讨了HT的I型错误概率和II型错误指数之间的权衡。通过使用两种不同的编码方案,即单独的HT和信道编码方案以及基于匹配带宽情况下的混合编码的联合HT和信道编码方案,获得了最佳II型误差指数的单字母下界。精确的单字母表征相同的是建立对条件独立的测试的特殊情况下,它被证明是通过单独的HT和信道编码计划来实现。提供了一个例子,其中联合方案实现了严格优于基于分离的方案的性能。

英文摘要:

A distributed binary hypothesis testing (HT) problem involving two parties, one referred to as the observer and the other as the detector is studied. The observer observes a discrete memoryless source (DMS) and communicates its observations to the detector over a discrete memoryless channel (DMC). The detector observes another DMS correlated with that at the observer, and performs a binary HT on the joint distribution of the two DMS's using its own observed data and the information received from the observer. The trade-off between the type I error probability and the type II error-exponent of the HT is explored. Single-letter lower bounds on the optimal type II error-exponent are obtained by using two different coding schemes, a separate HT and channel coding scheme and a joint HT and channel coding scheme based on hybrid coding for the matched bandwidth case. Exact single-letter characterization of the same is established for the special case of testing against conditional independence, and it is shown to be achieved by the separate HT and channel coding scheme. An example is provided where the joint scheme achieves a strictly better performance than the separation based scheme.

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

↑