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

多比特传感器分布式检测串联网络的贝叶斯设计

Bayesian Design of Tandem Networks for Distributed Detection With Multi-bit Sensor Decisions

Alla Tarighati, Joakim Jalden

摘要:

我们考虑的问题,分散的假设检验下的通信约束的拓扑结构中,几个外围节点串联排列。每个节点接收到一个观测结果,并向其后继节点发送一个消息,最后一个节点然后决定哪个假设是真的。我们假设,在不同的节点上的观察,条件下的真实假设,独立的和任何两个连续的节点之间的信道被认为是无误差的,但速率约束。我们提出了一个循环的数值设计算法的节点设计,使用一个人一个人的方法与最小的预期错误概率作为设计标准,其中的通信消息的数量不一定等于假设的数量。该方法中外围节点的数目原则上是任意的,通过量化每个节点的输入来满足信息速率约束。所提出的方法的性能为不同的信息速率约束,在一个二进制假设检验,进行比较,由于Swaszek和覆盖提出的方法的最佳速率一个解决方案,它是数值计算表明,增加信道速率可以显着提高性能的串联网络。$M$ -ary假设检验的仿真结果也表明,通过增加信道速率,串联网络的性能显着改善。

英文摘要:

We consider the problem of decentralized hypothesis testing under communication constraints in a topology where several peripheral nodes are arranged in tandem. Each node receives an observation and transmits a message to its successor, and the last node then decides which hypothesis is true. We assume that the observations at different nodes are, conditioned on the true hypothesis, independent and the channel between any two successive nodes is considered error-free but rate-constrained. We propose a cyclic numerical design algorithm for the design of nodes using a person-by-person methodology with the minimum expected error probability as a design criterion, where the number of communicated messages is not necessarily equal to the number of hypotheses. The number of peripheral nodes in the proposed method is in principle arbitrary and the information rate constraints are satisfied by quantizing the input of each node. The performance of the proposed method for different information rate constraints, in a binary hypothesis test, is compared to the optimum rate-one solution due to Swaszek and a method proposed by Cover, and it is shown numerically that increasing the channel rate can significantly enhance the performance of the tandem network. Simulation results for $M$-ary hypothesis tests also show that by increasing the channel rates the performance of the tandem network significantly improves.

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

↑