Achievable Rate Regions and Performance Comparison of Half Duplex Bi-Directional Relaying Protocols

被引:113
作者
Kim, Sang Joon [1 ]
Devroye, Natasha [2 ]
Mitran, Patrick [3 ]
Tarokh, Vahid [1 ]
机构
[1] Harvard Univ, Sch Engn & Appl Sci, Cambridge, MA 02138 USA
[2] Univ Illinois, Dept Elect & Comp Engn, Chicago, IL 60607 USA
[3] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada
关键词
Achievable rate regions; bi-directional communication; compress and forward; relaying; CAPACITY THEOREMS; CODING THEOREM; BOUNDS;
D O I
10.1109/TIT.2011.2165132
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In a bi-directional relay channel, two nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of a relay. In this paper, we derive achievable rate regions for four new half-duplex protocols and compare these to four existing half-duplex protocols and outer bounds. In time, our protocols consist of either two or three phases. In the two phase protocols, both users simultaneously transmit during the first phase and the relay alone transmits during the second phase, while in the three phase protocol the two users sequentially transmit followed by a transmission from the relay. The relay may forward information in one of four manners; we outline existing amplify and forward (AF), decode and forward (DF), lattice based, and compress and forward (CF) relaying schemes and introduce the novel mixed forward scheme. The latter is a combination of CF in one direction and DF in the other. We derive achievable rate regions for the CF and Mixed relaying schemes for the two and three phase protocols. We provide a comprehensive treatment of eight possible half-duplex bi-directional relaying protocols in Gaussian noise, obtaining their relative performance under different SNR and relay geometries.
引用
收藏
页码:6405 / 6418
页数:14
相关论文
共 33 条
[1]   Network information flow [J].
Ahlswede, R ;
Cai, N ;
Li, SYR ;
Yeung, RW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1204-1216
[2]  
[Anonymous], 2006, Elements of Information Theory
[3]  
[Anonymous], 2010, Lecture notes on network information theory
[4]  
Berger T., 1977, MULTITERMINAL SOURCE
[5]   WRITING ON DIRTY PAPER [J].
COSTA, MHM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :439-441
[6]  
COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084
[7]   Bounds on capacity and minimum energy-per-bit for AWGN relay channels [J].
El Gamal, A ;
Mohseni, M ;
Zahedi, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) :1545-1561
[8]   A PROOF OF MARTON CODING THEOREM FOR THE DISCRETE MEMORYLESS BROADCAST CHANNEL [J].
ELGAMAL, A ;
VANDERMEULEN, EC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (01) :120-122
[9]  
Gunduz D., 2008, 46 ANN ALL C COMM CO
[10]  
HAN TS, 1981, IEEE T INFORM THEORY, V27, P49