arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1908.07521stat.OTcs.ITmath.IT
收藏

噪声信道下分布式假设检验:误差指数权衡

Distributed Hypothesis Testing over a Noisy Channel: Error-exponents Trade-off

Sreejith Sreekumar, Deniz Gündüz

摘要:

研究了噪声信道下的双端分布式二元假设检验问题。这两个终端,称为观察者和决策者,每个都可以访问$n$独立和相同分布的样本,分别用$\mathbf{U}$和$\mathbf{V}$表示。观测器通过离散无记忆信道与决策器通信,决策器基于$\mathbf{V}$和从观测器接收的噪声信息对$(\mathbf{U},\mathbf{V})$的联合概率分布执行二元假设检验。研究了I类和第二类错误概率指数之间的折衷关系。得到两个内界,一个使用基于分离的方案,涉及基于类型的压缩和不平等的错误保护信道编码,和其他使用的联合方案,结合基于类型的混合编码。分离为基础的计划,以恢复内界获得的Han和Kobayashi的特殊情况下的速率限制的无噪声信道,也是作者以前获得的一个角点的权衡。最后,我们通过一个例子表明,联合计划实现了严格的严格严格的限制比分离为基础的计划的错误指数的权衡的一些点。

英文摘要:

A two-terminal distributed binary hypothesis testing problem over a noisy channel is studied. The two terminals, called the observer and the decision maker, each has access to $n$ independent and identically distributed samples, denoted by $\mathbf{U}$ and $\mathbf{V}$, respectively. The observer communicates to the decision maker over a discrete memoryless channel, and the decision maker performs a binary hypothesis test on the joint probability distribution of $(\mathbf{U},\mathbf{V})$ based on $\mathbf{V}$ and the noisy information received from the observer. The trade-off between the exponents of the type I and type II error probabilities is investigated. Two inner bounds are obtained, one using a separation-based scheme that involves type-based compression and unequal error-protection channel coding, and the other using a joint scheme that incorporates type-based hybrid coding. The separation-based scheme is shown to recover the inner bound obtained by Han and Kobayashi for the special case of a rate-limited noiseless channel, and also the one obtained by the authors previously for a corner point of the trade-off. Finally, we show via an example that the joint scheme achieves a strictly tighter bound than the separation-based scheme for some points of the error-exponents trade-off.

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

↑