Achievable rate regions for the two-way relay channel

被引:238
作者
Rankov, Boris [1 ]
Wittneben, Armin [1 ]
机构
[1] ETH, Commun Technol Lab, CH-8092 Zurich, Switzerland
来源
2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS | 2006年
关键词
D O I
10.1109/ISIT.2006.261638
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
We study the two-way communication problem for the relay channel. Hereby, two terminals communicate simultaneously in both directions with the help of one relay. We consider the restricted two-way problem, i.e., the encoders at both terminals do not cooperate. We provide achievable rate regions for different cooperation strategies, such as decode-and-forward based on block Markov superposition coding and compress-and-forward based on Wyner-Ziv source coding. We also evaluate the regions for the special case of additive white Gaussian noise channels. We show that a combined strategy of block Markov superposition coding and Wyner-Ziv coding achieves the cut-set upper bound on the sum-rate of the two-way relay channel when the relay is in the proximity of one of the terminals.
引用
收藏
页码:1668 / +
页数:2
相关论文
共 9 条
[1]  
COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084
[2]  
Cover TM, 2006, Elements of Information Theory
[3]  
GASTPAR M, 2002, P IEEE INT S INF THE, P137
[4]  
HAN TS, 1984, IEEE T INFORM THEORY, V30, P35, DOI 10.1109/TIT.1984.1056847
[5]   Capacity bounds and power allocation for wireless relay channels [J].
Host-Madsen, A ;
Zhang, JS .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (06) :2020-2040
[6]   Cooperative strategies and capacity theorems for relay networks [J].
Kramer, G ;
Gastpar, M ;
Gupta, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (09) :3037-3063
[7]   Cooperative diversity in wireless networks: Efficient protocols and outage behavior [J].
Laneman, JN ;
Tse, DNC ;
Wornell, GW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (12) :3062-3080
[8]  
LAPIDOTH A, LECT NOTES
[9]  
Shannon ClaudeElwood., 1961, PROC 4 BERKELEY S MA, V1, P611