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

Noisy 20 Questions问题的不等错误保护查询策略

Unequal Error Protection Querying Policies for the Noisy 20 Questions Problem

Hye Won Chung, Brian M. Sadler, Lizhong Zheng, Alfred O. Hero

摘要:

针对噪声20题问题,提出了一种基于叠加编码的开环不等错误保护查询策略。在这个问题中,玩家希望通过提出二进制查询并接收噪声响应来连续地改进对连续随机变量的值的估计。当查询被非自适应地设计为单个块并且噪声响应被建模为二进制对称信道的输出时,20个问题问题可以被映射为具有不等错误保护(UEP)的信道编码的等价问题。介绍了一种新的基于UEP叠加编码的非自适应查询策略,其估计误差以指数收敛率下降,明显优于Variani等人(2015)介绍的UEP重复编码。与建议的查询策略,查询数量的指数下降率匹配的闭环自适应方案的查询顺序设计的反馈的好处的速度。此外,可达到的错误指数是显着优于随机分组码采用相等的错误保护。

英文摘要:

In this paper, we propose an open-loop unequal-error-protection querying policy based on superposition coding for the noisy 20 questions problem. In this problem, a player wishes to successively refine an estimate of the value of a continuous random variable by posing binary queries and receiving noisy responses. When the queries are designed non-adaptively as a single block and the noisy responses are modeled as the output of a binary symmetric channel the 20 questions problem can be mapped to an equivalent problem of channel coding with unequal error protection (UEP). A new non-adaptive querying strategy based on UEP superposition coding is introduced whose estimation error decreases with an exponential rate of convergence that is significantly better than that of the UEP repetition coding introduced by Variani et al. (2015). With the proposed querying strategy, the rate of exponential decrease in the number of queries matches the rate of a closed-loop adaptive scheme where queries are sequentially designed with the benefit of feedback. Furthermore, the achievable error exponent is significantly better than that of random block codes employing equal error protection.

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

↑