The multiple access channel with causal and strictly causal side information at the encoders
The multiple access channel with causal and strictly causal side information at the encoders
复制标题
编码器处具有因果和严格因果辅助信息的多路访问信道
DOI：
--
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
Y. Steinberg
中科院分区：
文献类型：
--
作者：
A. Lapidoth;Y. Steinberg
我们研究了在编码器处具有因果侧信息的状态相关多址信道（MAC）。我们考虑两种一般模型。在第一个模型中，状态序列在两个编码器上以严格因果关系的方式可用。我们推导了一个可实现的区域，该区域对于状态序列包含信道噪声的高斯MAC的特殊情况是紧的。虽然两个发送者无法访问对方的按摩，也没有反馈，但本案例的容量与同一MAC的容量一致，没有侧信息，但用户之间充分合作。提出了一种Schalkwijk-Kailath型算法，该算法以最大误差概率的双指数衰减来实现这种能力。在我们考虑的第二个模型中，与香农模型一样，状态序列以因果关系的方式对两个编码器可用。对前面的结果进行简单的扩展，加入香农策略，就得到了这个问题的可实现性结果。
—We study the state-dependent multiple access channel (MAC) with causal side information at the encoders. We consider two general models. In the first model, the state sequence is available at the two encoders in a strictly causal manner. We derive an achievable region, which is tight for the special case of a Gaussian MAC where the state sequence comprises the channel noise. Although the two senders do not have access to each other’s massage and no feedback is present, the capacity for this case coincides with the capacity of the same MAC without side information, but with full cooperation between the users. A Schalkwijk-Kailath type algorithm is developed, which achieves this capacity with a double exponential decay of the maximal probability of error. In the second model we consider, the state sequence is available, as in Shannon’s model, to the two encoders in a causal manner. A simple extension of the previous result, with the inclusion of Shannon strategies, yields an achievability result for this problem.