An Achievable Rate Region for the Gaussian Z-interference Channel with Conferencing

被引:4
作者
Do, Hieu T. [1 ,2 ]
Oechtering, Tobias J. [1 ,2 ]
Skoglund, Mikael [1 ,2 ]
机构
[1] Royal Inst Technol KTH, Sch Elect Engn, Stockholm, Sweden
[2] Royal Inst Technol KTH, ACCESS Linnaeus Ctr, Stockholm, Sweden
来源
2009 47TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1 AND 2 | 2009年
关键词
CAPACITY;
D O I
10.1109/ALLERTON.2009.5394841
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper presents an achievable rate region for a 2-user Gaussian Z-interference channel with a noiseless and bidirectional digital communication link between the receivers. The region is achieved by utilizing the rate-splitting encoding technique, and the decode-and-forward and compress-and-forward strategies. In the very strong interference regime, the capacity region is achieved. In the weak interference regime, the asymptotic sum rate is characterized and shown to be possibly unbounded, which is in contrast to a recent result by Yu and Zhou for a similar scenario, however, with a unidirectional communication link between the receivers.
引用
收藏
页码:75 / +
页数:2
相关论文
共 18 条
[1]   INTERFERENCE CHANNELS [J].
CARLEIAL, AB .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (01) :60-70
[2]   ON THE GAUSSIAN INTERFERENCE CHANNEL [J].
COSTA, MHM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (05) :607-615
[3]   Duality between channel capacity and rate distortion with two-sided state information [J].
Cover, TM ;
Chiang, M .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (06) :1629-1638
[4]  
COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084
[5]   PROOF OF DATA COMPRESSION THEOREM OF SLEPIAN AND WOLF FOR ERGODIC SOURCES [J].
COVER, TM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (02) :226-228
[6]  
DRAPER S, 2003, P ALL C COMM CONTR C
[7]   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
[8]  
HAN TS, 1981, IEEE T INFORM THEORY, V27, P49
[9]  
KRAMER G, COMMUNICATIONS, P162
[10]  
LIU N, 2009, INF THEOR 2008 ISIT, P2422