i.i.d. Mixed Inputs and Treating Interference as Noise are gDoF Optimal for the Symmetric Gaussian Two-user Interference Channel

被引:0
|
作者
Dytso, Alex [1 ]
Tuninetti, Daniela [1 ]
Devroye, Natasha [1 ]
机构
[1] Univ Illinois, Chicago, IL 60607 USA
关键词
CAPACITY;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
While a multi-letter limiting expression of the capacity region of the two-user Gaussian interference channel is known, capacity is generally considered to be open as this is not computable. Other computable capacity outer bounds are known to be achievable to within 1/2 bit using Gaussian inputs and joint decoding in the simplified Han and Kobayashi (single-letter) achievable rate region. This work shows that the simple scheme known as "treating interference as noise" without time-sharing attains the capacity region outer bound of the symmetric Gaussian interference channel to within either a constant gap, or a gap of order O(log log (SNR)), for all parameter regimes. The scheme is therefore optimal in the generalized Degrees of Freedom (gDoF) region sense almost surely. The achievability is obtained by using i.i.d. mixed inputs (i.e., a superposition of discrete and Gaussian random variables) in the multi-letter capacity expression, where the optimal number of points in the discrete part of the inputs, as well as the optimal power split among the discrete and continuous parts of the inputs, are characterized in closed form. An important practical implication of this result is that the discrete part of the inputs behaves as a "common message" whose contribution can be removed from the channel output, even though joint decoding is not employed. Moreover, time-sharing may be mimicked by varying the number of points in the discrete part of the inputs.
引用
收藏
页码:1716 / 1720
页数:5
相关论文
共 49 条
  • [21] POWER ALLOCATION FOR THE MULTI-CARRIER TWO-USER GAUSSIAN INTERFERENCE CHANNEL
    Pischella, Mylene
    Le Ruyet, Didier
    2012 IEEE 13TH INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS (SPAWC), 2012, : 214 - 218
  • [22] Achievable DoF of an Underlay Two-User Gaussian Interference Channel in Heterogeneous Networks
    Shin, Dae Kyu
    Choi, Wan
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2013, 61 (01) : 279 - 290
  • [23] Optimum Spectral and Energy Efficiency Tradeoff in Two-User Gaussian Interference Channel
    Cai, Donghong
    Wu, Jingxian
    Yang, Jing
    Fan, Pingzhi
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2018, 7 (03) : 468 - 471
  • [24] On the DoF Region of the MIMO Gaussian Two-User Interference Channel With an Instantaneous Relay
    Liu, Tang
    Tuninetti, Daniela
    Chung, Sae-Young
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (07) : 4453 - 4471
  • [25] On the Capacity of the Two-User Symmetric Interference Channel With Transmitter Cooperation and Secrecy Constraints
    Mohapatra, Parthajit
    Murthy, Chandra R.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (10) : 5664 - 5689
  • [26] Maximizing the Minimum Achievable Secrecy Rate in a Two-User Gaussian Interference Channel
    Mirzaee, Meysam
    Akhlaghi, Soroush
    2014 IRAN WORKSHOP ON COMMUNICATION AND INFORMATION THEORY (IWCIT), 2014,
  • [27] Multiple-Layer Power Allocation for Two-User Gaussian Interference Channel
    Chen, Zhengchuan
    Dong, Yunquan
    Fan, Pingyi
    Wu, Dapeng Oliver
    Ben Letaief, Khaled
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2017, 66 (10) : 9162 - 9176
  • [28] Achievable Information Rates for Channels with Insertions, Deletions, and Intersymbol Interference with i.i.d. Inputs
    Hu, Jun
    Duman, Tolga M.
    Erden, M. Fatih
    Kavcic, Aleksandar
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2010, 58 (04) : 1102 - 1111
  • [29] Limited Rate Feedback for Two-User MISO Gaussian Interference Channel With and Without Secrecy
    Yang, Xinjie
    Swindlehurst, A. Lee
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2018, 66 (18) : 4884 - 4897
  • [30] Maximizing the Minimum Achievable Secrecy Rate for a Two-User Gaussian Weak Interference Channel
    Mirzaee, Meysam
    Akhlaghi, Soroush
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2019, 14 (08) : 2190 - 2202