首页> 外文期刊>IEEE Transactions on Information Theory >On the Capacity of Symmetric M-User Gaussian Interference Channels With Feedback
【24h】

On the Capacity of Symmetric M-User Gaussian Interference Channels With Feedback

机译:具有反馈的对称M用户高斯干扰信道的容量

获取原文
获取原文并翻译 | 示例

摘要

A general time-varying feedback coding scheme is proposed for $M$ -user fully connected symmetric Gaussian interference channels. Based on the analysis of the general coding scheme, we prove a theorem which gives a criterion for designing good time-varying feedback codes for Gaussian interference channels. The proposed scheme improves the Suh-Tse and Kramer inner bounds of the channel capacity for the cases of weak and not very strong interference when $M=2$ . This capacity improvement is more significant when the signal-to-noise ratio (SNR) is not very high. In addition, our coding scheme can be proved mathematically and numerically to outperform the Kramer code for $Mgeq 2$ when the SNR is equal to the interference-to-noise ratio (INR). Besides, the generalized degrees-of-freedom (GDoF) of our proposed coding scheme can be proved to be optimal in the all network situations (very weak, weak, strong, very strong) for any $M$ . The numerical results show that our coding scheme can attain better performance than the Suh-Tse coding scheme for $M=2$ or the Mohajer-Tandon-Poor lattice coding scheme for $M > 2$ . Furthermore, the simplicity of the encoding/decoding algorithms is another strong point of our proposed coding scheme compared with the Suh-Tse coding scheme when $M=2$ and the Mohajer-Tandon-Poor lattice coding scheme when $M > 2$ . More importantly, our results show that an optimal coding scheme for the symmetric Gaussian interference channels with feedback can be achieved by only using marginal posterior distributions under a better cooperation strategy between transmitters.
机译:针对$ M $用户的全连接对称高斯干扰信道,提出了一种通用的时变反馈编码方案。在对通用编码方案进行分析的基础上,我们证明了一个定理,该定理为设计良好的高斯干扰信道时变反馈码提供了标准。在$ M = 2 $的情况下,针对弱干扰和非强干扰的情况,所提出的方案改进了信道容量的Suh-Tse和Kramer内边界。当信噪比(SNR)不太高时,这种容量提高更为显着。此外,当SNR等于干扰噪声比(INR)时,我们的编码方案可以通过数学和数字方式证明优于$ M geq 2 $的Kramer码。此外,可以证明我们提出的编码方案的广义自由度(GDoF)在任何$ M $的所有网络情况下(非常弱,非常弱,非常强,非常强)都是最优的。数值结果表明,对于$ M = 2 $,我们的编码方案比Suh-Tse编码方案或$ M> 2 $的Mohajer-Tandon-Poor晶格编码方案具有更好的性能。此外,与$ M = 2 $时的Suh-Tse编码方案和$ M> 2 $时的Mohajer-Tandon-Poor晶格编码方案相比,编码/解码算法的简单性是我们提出的编码方案的另一个优势。更重要的是,我们的结果表明,在发射机之间更好的协作策略下,仅使用边际后验分布就可以实现带有反馈的对称高斯干扰信道的最优编码方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号