Optimal Achievable Rates for Interference Networks With Random Codes

被引：28
|
作者：
Bandemer, Bernd [1 ]
El Gamal, Abbas [2 ]
Kim, Young-Han [3 ]
机构：
[1] Univ Calif San Diego, Informat Theory & Applicat Ctr, La Jolla, CA 92093 USA
[2] Stanford Univ, Dept Elect Engn, Stanford, CA 94305 USA
[3] Univ Calif San Diego, Dept Elect & Comp Engn, La Jolla, CA 92093 USA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2015年 / 61卷 / 12期
基金：
美国国家科学基金会;
关键词：
Han-Kobayashi bound; interference network; maximum likelihood decoding; network information theory; random code ensemble; superposition coding; simultaneous decoding; CAPACITY REGION; CHANNELS;
D O I：
10.1109/TIT.2015.2476792
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The optimal rate region for interference networks is characterized when encoding is restricted to random code ensembles with superposition coding and time sharing. A simple simultaneous nonunique decoding rule, under which each receiver decodes for the intended message as well as the interfering messages, is shown to achieve this optimal rate region regardless of the relative strengths of signal, interference, and noise. This result implies that the Han-Kobayashi bound, the best known inner bound on the capacity region of the two-user pair interference channel, cannot be improved merely by using the optimal maximum likelihood decoder.
引用
收藏
页码：6536 / 6549
页数：14
相关论文
共 50 条
  • [1] Optimal Achievable Rates for Computation With Random Homologous Codes
    Sen, Pinar
    Lim, Sung Hoon
    Kim, Young-Han
    [J]. 2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 2351 - 2355
  • [2] On the Optimal Achievable Rates for Linear Computation With Random Homologous Codes
    Sen, Pinar
    Lim, Sung Hoon
    Kim, Young-Han
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (10) : 6200 - 6221
  • [3] On the achievable region with point-to-point codes for generalized interference networks
    Bae, Jung Hyun
    Lee, Jungwon
    Kang, Inyup
    [J]. 2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 1446 - 1450
  • [4] Upper Bound Scalability on Achievable Rates of Batched Codes for Line Networks
    Yang, Shenghao
    Wang, Jie
    [J]. 2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 1629 - 1634
  • [5] Achievable Rates of Two-Hop Interference Networks with Conferencing Relays
    Huang, Chuan
    Zeng, Meng
    Cui, Shuguang
    [J]. 2011 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE (GLOBECOM 2011), 2011,
  • [6] On achievable rates for interference relay channel with interference cancelation
    Sahin, Onur
    Erkip, Elza
    [J]. CONFERENCE RECORD OF THE FORTY-FIRST ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, VOLS 1-5, 2007, : 805 - +
  • [7] On Upper Bounds for the Achievable Rates of LDPC Codes
    Presman, Noam
    Litsyn, Simon
    [J]. 2009 IEEE INFORMATION THEORY WORKSHOP (ITW 2009), 2009, : 21 - 25
  • [8] On Optimal and Achievable Fix-Free Codes
    Savari, Serap A.
    Yazdi, S. M. Hossein Tabatabaei
    Abedini, Navid
    Khatri, Sunil P.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (08) : 5112 - 5129
  • [9] Achievable rates of Gaussian cognitive interference channel with common interference
    Al-Qudah, Zouhair
    Darabkh, Khalid A.
    [J]. IET COMMUNICATIONS, 2020, 14 (16) : 2802 - 2812
  • [10] Achievable Rates for Multiuser Interference Relay Channel
    Khojastepour, Mohammad Ali
    Wang, Xiaodong
    [J]. 2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS - ICC 2010, 2010,
12345