Binary distributed hypothesis testing via Körner-Marton coding
Binary distributed hypothesis testing via Körner-Marton coding
复制标题
通过 Körner-Marton 编码进行二元分布式假设检验
DOI：
10.1109/itw.2016.7606813
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
Yuval Kochman
中科院分区：
文献类型：
--
作者：
E. Haim;Yuval Kochman
本文研究了双二进制对称信源产生的两个序列的分布式二进制假设检验问题。每个序列由不同的终端观察。这两个假设对应于两个源分量之间的不同水平的相关性，即，I.I. D两个序列之间的差异的概率。终端通过等速率无噪声链路与决策功能通信。我们分析了假设检验的错误概率的指数衰减和通信速率之间的权衡。由于已知Ko Berrner-Marton编码在传送差序列的相应分布式压缩问题中使速率最小化，因此它构成了本设置的自然候选。事实上，使用此方案，我们得到可实现的误差指数。有趣的是，这些与没有通信约束的最佳折衷的一部分相吻合，即使当速率低于其中一个假设的Ko Berrner-Marton速率时。
We consider the problem of distributed binary hypothesis testing of two sequences that are generated by a doubly binary symmetric source. Each sequence is observed by a different terminal. The two hypotheses correspond to different levels of correlation between the two source components, i.e., the i.i.d. probability of the difference between the two sequences. The terminals communicate with a decision function via equal-rate noiseless links. We analyze the tradeoff between the exponential decay of the error probabilities of the hypothesis test and the communication rate. As Körner-Marton coding is known to minimize the rate in the corresponding distributed compression problem of conveying the difference sequence, it constitutes a natural candidate for the present setting. Indeed, using this scheme we derive achievable error exponents. Interestingly, these coincide with part of the optimal tradeoff without communication constraints, even when the rate is below the Körner-Marton rate for one of the hypotheses.