Channel Conditions for the Optimality of Interference Decoding Schemes for K-user Gaussian Interference Channels

被引:0
作者
Chaluvadi, Ragini [1 ]
Madhuri, Bolli [1 ]
Bhashyam, Srikrishna [1 ]
机构
[1] Indian Inst Technol Madras, Dept Elect Engn, Chennai 600036, Tamil Nadu, India
来源
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2019年
关键词
SUM-CAPACITY; OUTER BOUNDS; REGION;
D O I
10.1109/isit.2019.8849420
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The sum capacity of the general K-user Gaussian Interference Channel (GIC) is known only when the channel coefficients are such that treating interference as noise (TIN) is optimal. The Han-Kobayashi (HK) scheme achieves the best known achievable rate region for the K-user interference channel (IC). Simple HK schemes are HK schemes with Gaussian signaling, no time sharing, and no private-common power splitting. The class of simple HK (S-HK) schemes includes the TIN scheme and schemes that involve various levels of interference decoding and cancellation at each receiver. We derive conditions under which simple HK schemes achieve sum capacity for general K-user Gaussian ICs. These results generalize existing sum capacity results for the TIN scheme to the class of simple HK schemes.
引用
收藏
页码:752 / 756
页数:5
相关论文
共 17 条
  • [1] Gaussian Interference Networks: Sum Capacity in the Low-Interference Regime and New Outer Bounds on the Capacity Region
    Annapureddy, V. Sreekanth
    Veeravalli, Venugopal V.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) : 3032 - 3050
  • [2] CASE WHERE INTERFERENCE DOES NOT REDUCE CAPACITY
    CARLEIAL, AB
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (05) : 569 - 570
  • [3] Chaluvadi R., 2019, ARXIV E PRINTS
  • [4] An empirically based path loss model for wireless channels in suburban environments
    Erceg, V
    Greenstein, LJ
    Tjandra, SY
    Parkoff, SR
    Gupta, A
    Kulic, B
    Julius, AA
    Bianchi, R
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1999, 17 (07) : 1205 - 1211
  • [5] Gaussian Interference Channel Capacity to Within One Bit
    Etkin, Raul H.
    Tse, David N. C.
    Wang, Hua
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (12) : 5534 - 5562
  • [6] On the Optimality of Treating Interference as Noise
    Geng, Chunhua
    Naderializadeh, Navid
    Avestimehr, Amir Salman
    Jafar, Syed A.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (04) : 1753 - 1767
  • [7] Gnanasambandam A, 2017, CONF REC ASILOMAR C, P1842, DOI 10.1109/ACSSC.2017.8335681
  • [8] Han T. S., 1981, IEEE Transactions on Information Theory, VIT-27, P49, DOI 10.1109/TIT.1981.1056307
  • [9] Liu YP, 2011, IEEE INT SYMP INFO, P1382, DOI 10.1109/ISIT.2011.6033765
  • [10] Capacity Bounds for the Gaussian Interference Channel
    Motahari, Abolfazl Seyed
    Khandani, Amir Keyvan
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (02) : 620 - 643