Blackwell信道的增强置信传播编码
Encoding for the Blackwell Channel with Reinforced Belief Propagation
摘要：
广播信道（BC）编码的一个关键思想是分箱（binning），其中发射机通过从适当的箱（bin）中选择码字来编码信息（因此消息是箱索引）。这种选择通常是通过解决一个适当的（可能是困难的）组合问题。最近，它已被证明，装箱的Blackwell信道-一个特定的BC-可以通过迭代计划的基础上调查传播（SP）。这种方法对SP使用抽取，复杂度为O（n^2）。在本文中，我们提出了一个新的变化的信念传播（BP）算法，命名为加强BP算法，BP变成一个求解器。仿真结果表明，该算法的复杂度为O（nlogn）.使用这种新的算法与非线性编码方案，我们可以有效地实现速率接近边界的容量区域的Blackwell信道。
英文摘要：
A key idea in coding for the broadcast channel (BC) is binning, in which the transmitter encode information by selecting a codeword from an appropriate bin (the messages are thus the bin indexes). This selection is normally done by solving an appropriate (possibly difficult) combinatorial problem. Recently it has been shown that binning for the Blackwell channel --a particular BC-- can be done by iterative schemes based on Survey Propagation (SP). This method uses decimation for SP and suffers a complexity of O(n^2). In this paper we propose a new variation of the Belief Propagation (BP) algorithm, named Reinforced BP algorithm, that turns BP into a solver. Our simulations show that this new algorithm has complexity O(n log n). Using this new algorithm together with a non-linear coding scheme, we can efficiently achieve rates close to the border of the capacity region of the Blackwell channel.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
