The Maximum Han-Kobayashi Sum-Rate for Gaussian Interference Channels

被引:0
作者
Haghi, Ali [1 ]
Khandani, Amir K. [1 ]
机构
[1] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON, Canada
来源
2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY | 2016年
关键词
Interference channels; Han-Kobayashi; Power splitting; Time sharing; Support function; Concave envelope; CAPACITY; BOUNDS; REGION;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The best known achievable rate region for the two-user Gaussian interference channel is due to the Han-Kobayashi (HK) scheme. The HK achievable region includes the regions achieved by all other known schemes. However, mathematical expressions that characterize the HK region are complicated and involve a time sharing variable and two arbitrary power splitting variables. Accordingly, the boundary points of the HK region, and in particular the maximum HK sum-rate, are not known in general. This paper studies the sum-rate of the HK scheme with Gaussian inputs. For the weak interference class, this study fully characterizes the maximum achievable sum-rate and shows that the weak interference class is partitioned into five regions. For each region, the optimal power splitting and the corresponding maximum achievable sum-rate are expressed in closed forms. Moreover, we show that the same approach can be adopted to characterize all boundary points.
引用
收藏
页码:2204 / 2208
页数:5
相关论文
共 15 条
[1]   Gaussian Interference Networks: Sum Capacity in the Low-Interference Regime and New Outer Bounds on the Capacity Region [J].
Annapureddy, V. Sreekanth ;
Veeravalli, Venugopal V. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) :3032-3050
[2]  
[Anonymous], 2011, Network information theory
[3]  
Boyd S, 2004, CONVEX OPTIMIZATION
[4]   CASE WHERE INTERFERENCE DOES NOT REDUCE CAPACITY [J].
CARLEIAL, AB .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (05) :569-570
[5]   Gaussian Interference Channel Capacity to Within One Bit [J].
Etkin, Raul H. ;
Tse, David N. C. ;
Wang, Hua .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (12) :5534-5562
[6]  
HAN TS, 1981, IEEE T INFORM THEORY, V27, P49
[7]  
Luenberger D. G., 2008, SPRINGER SCI BUSINES, V116
[8]  
Mehanna O., 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), P1273, DOI 10.1109/ALLERTON.2010.5707060
[9]   Capacity Bounds for the Gaussian Interference Channel [J].
Motahari, Abolfazl Seyed ;
Khandani, Amir Keyvan .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (02) :620-643
[10]  
Nair, 2012, INF THEOR APPL WORKS