On The Reliability Function of Discrete Memoryless Multiple-Access Channel with Feedback
On The Reliability Function of Discrete Memoryless Multiple-Access Channel with Feedback
复制标题
带反馈的离散无记忆多址信道的可靠性函数
DOI：
10.1109/itw.2018.8613494
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
S. Pradhan
中科院分区：
文献类型：
--
作者：
Mohsen Heidari;A. Anastasopoulos;S. Pradhan
我们推导了具有无噪声反馈和可变长度码（VLC）的离散无记忆多址信道（MAC）的可靠性函数的下限和上限。对于上限，我们在点对点情况下使用 Burnashev 的证明技术。此外，我们还采用了用于证明MAC反馈能力的逆过程的技术。对于误差指数的下界，我们提出了一种由数据和确认阶段组成的编码方案。在数据阶段，使用任意反馈容量实现代码。在确认阶段，每个发射机使用一对大小为 2 的码本向接收机发送一位信息，每个发射机一个。此阶段的码字是根据适当优化的联合概率分布随机选择的。该界限相对于传输速率对和容量边界之间定义的特定欧几里得距离度量线性增加。下限和上限与一类 MAC 相匹配。
We derive a lower and upper bounds on the reliability function of discrete memoryless multiple-access channel (MAC) with noiseless feedback and variable-length codes (VLCs). For the upper-bound, we use proof techniques of Burnashev for the point-to-point case. Also, we adopt the techniques used to prove the converse for the feedback-capacity of MAC. For the lower-bound on the error exponent, we present a coding scheme consisting of a data and a confirmation stage. In the data stage, any arbitrary feedback capacity-achieving code is used. In the confirmation stage, each transmitter sends one bit of information to the receiver using a pair of codebooks of size two, one for each transmitter. The codewords at this stage are selected randomly according to an appropriately optimized joint probability distribution. The bounds increase linearly with respect to a specific Euclidean distance measure defined between the transmission rate pair and the capacity boundary. The lower and upper bounds match for a class of MACs.