On the Optimality of Interference Decoding Schemes for K-User Gaussian Interference Channels

被引:0
作者
Chaluvadi, Ragini [1 ]
Bolli, Madhuri [2 ]
Bhashyam, Srikrishna [1 ]
机构
[1] Indian Inst Technol Madras, Dept Elect Engn, Chennai 600036, Tamil Nadu, India
[2] Qualcomm India Pvt Ltd, Hyderabad 500081, Telangana, India
关键词
Gaussian Interference Channel; Han-Kobayashi scheme; treating interference as noise (TIN); ACHIEVABLE RATE REGION; CAPACITY BOUNDS;
D O I
10.3390/e21111053
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
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 is an extensively studied coding scheme 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. For the 2-user GIC, simple HK schemes are sufficient to achieve all known sum capacity results-sum capacity under mixed, strong and noisy interference conditions. We derive channel conditions under which simple HK schemes achieve sum capacity for general K-user Gaussian ICs. For the K-user GIC, these results generalize existing sum capacity results for the TIN scheme to the class of simple HK schemes.
引用
收藏
页数:30
相关论文
共 40 条
  • [31] 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,
  • [32] 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
  • [33] The Two-User Causal Cognitive Interference Channel: Novel Outer Bounds and Constant Gap Result for the Symmetric Gaussian Noise Channel in Weak Interference
    Cardone, Martina
    Tuninetti, Daniela
    Knopp, Raymond
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (09) : 4993 - 5017
  • [34] How Large Portion of K/2 DoF Can We Achieve at Finite SNR in the Gaussian Interference Channel?
    Nam, Junyoung
    Ko, Young-Jo
    2015 49TH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, 2015, : 1299 - 1304
  • [35] Improper Signaling for SISO Two-User Interference Channels With Additive Asymmetric Hardware Distortion
    Soleymani, Mohammad
    Lameiro, Christian
    Santamaria, Ignacio
    Schreier, Peter J.
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (12) : 8624 - 8638
  • [36] A Game-Theoretic Approach Based on Pricing Scheme on the Two-User Gaussian Interference Channel
    Khani, Atena Ebrahim
    Seyfe, Babak
    2014 IRAN WORKSHOP ON COMMUNICATION AND INFORMATION THEORY (IWCIT), 2014,
  • [37] A GAME-THEORETIC APPROACH TO TRANSMITTER COVARIANCE MATRIX DESIGN FOR BROADBAND MIMO GAUSSIAN INTERFERENCE CHANNELS
    Anandkumar, A. J. G.
    Lambotharan, S.
    Chambers, J. A.
    2009 IEEE/SP 15TH WORKSHOP ON STATISTICAL SIGNAL PROCESSING, VOLS 1 AND 2, 2009, : 301 - 304
  • [38] Second-order Rate Analysis of A Two-user Gaussian Interference Channel with Heterogeneous Blocklength Constraints
    Dong, Kailun
    Lin, Pin-Hsun
    Mross, Marcel
    Jorswieck, Eduard A.
    2024 IEEE 25TH INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS, SPAWC 2024, 2024, : 921 - 925
  • [39] Delay in Cooperative Communications: Achieving Higher Multiplexing Gain in Gaussian Interference Channels With Full-Duplex Transmitters
    Haghi, Ali
    Mohammadizadeh, Neda
    Khandani, Amir K.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (12) : 8250 - 8272
  • [40] A Convex Approach to Near-Optimal Beamforming Designs for Two-User MISO Fading Interference Channels
    Choi, Sang Won
    Kim, Juyeop
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2017, 65 (07) : 3110 - 3122