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

被引:0
|
作者
Truong, Lan, V [1 ]
Yamamoto, Hirosuke [2 ]
机构
[1] Natl Univ Singapore, Dept Comp Sci, Singapore 117417, Singapore
[2] Univ Tokyo, Sch Frontier Sci, Chiba 2778561, Japan
关键词
Interference channels; Signal to noise ratio; Integrated circuits; Decoding; Channel coding; Transmitters; Gaussian interference channel with feedback; feedback; posterior matching; iterated function systems; ADDITIVE NOISE CHANNELS; CODING SCHEME; REGION;
D O I
10.1109/TIT.2019.2945806
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 $M\geq 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.
引用
收藏
页码:722 / 741
页数:20
相关论文
共 50 条
  • [31] On the Symmetric Feedback Capacity of the K-User Cyclic Z-Interference Channel
    Tandon, Ravi
    Mohajer, Soheil
    Poor, H. Vincent
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (05) : 2713 - 2734
  • [32] Symmetric Decentralized Interference Channels with Noisy Feedback
    Perlaza, Samir M.
    Tandon, Ravi
    Poor, H. Vincent
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 1021 - 1025
  • [33] Outer bounds on the capacity of Gaussian interference channels
    Kramer, G
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (03) : 581 - 586
  • [34] On the Capacity Region of Gaussian Interference Channels with State
    Duan, Ruchen
    Liang, Yingbin
    Shamai, Shlomo
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 1097 - +
  • [35] K-user Interference Channels: General Outer Bound and Sum-capacity for Certain Gaussian Channels
    Tuninetti, Daniela
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 1166 - 1170
  • [36] Comments on " Feedback Capacity of Stationary Gaussian Channels"
    Derpich, Milan S.
    Ostergaard, Jan
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (03) : 1848 - 1851
  • [37] CAPACITY OF MISMATCHED GAUSSIAN CHANNELS WITH AND WITHOUT FEEDBACK
    IHARA, S
    PROBABILITY THEORY AND RELATED FIELDS, 1990, 84 (04) : 453 - 471
  • [38] On the Noisy Feedback Capacity of Gaussian Broadcast Channels
    Pillai, Sibi Raj B.
    Prabhakaran, Vinod M.
    2015 IEEE INFORMATION THEORY WORKSHOP (ITW), 2015,
  • [39] LIMITATIONS OF THE CAPACITY OF THE M-USER BINARY ADDER CHANNEL DUE TO PHYSICAL CONSIDERATIONS
    BARDAVID, I
    PLOTNIK, E
    ROM, R
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (03) : 662 - 673
  • [40] On The Capacity of Gaussian MIMO Channels Under Interference Constraints
    Loyka, Sergey
    2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 3037 - 3042