Capacity bounds for two-way relay channels

被引:62
作者
Nam, Wooseok [1 ]
Chung, Sae-Young [1 ]
Lee, Yong H. [1 ]
机构
[1] Korea Adv Inst Sci & Technol, Sch EECS, Taejon 305701, South Korea
来源
2008 INTERNATIONAL ZURICH SEMINAR ON COMMUNICATIONS | 2008年
关键词
D O I
10.1109/IZS.2008.4497296
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We provide achievable rate regions for two-way relay channels (TRC). At first, for a binary TRC, we show that the subspace-sharing of linear codes can achieve the capacity region. And, for a Gaussian TRC, we propose the subset-sharing of lattice codes. In some cases, the proposed lattice coding scheme can achieve within 1/2-bit the capacity and is asymptotically optimal at high signal-to-noise ratio (SNR) regimes.
引用
收藏
页码:144 / 147
页数:4
相关论文
共 15 条
[1]  
[Anonymous], 1991, ELEMENT INFORM THEOR
[2]  
[Anonymous], 2003, PROC 41 ANN ALLERTON
[3]   Random codes: Minimum distances and error exponents [J].
Barg, A ;
Forney, GD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (09) :2568-2573
[4]   Capacity and lattice strategies for canceling known interference [J].
Erez, U ;
Shamai, S ;
Zamir, R .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (11) :3820-3833
[5]   Achieving 1/2 log(1+SNR) on the AWGN channel with lattice encoding and decoding [J].
Erez, U ;
Zamir, R .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (10) :2293-2314
[6]  
Katti S., ACM SIGCOMM 07
[7]  
KNOPP R, 2007, GDR ISIS M MAR
[8]  
KNOPP R, 2006, INT ZUR SEM COMM FEB
[9]   Averaging bounds for lattices and linear codes [J].
Loeliger, HA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (06) :1767-1773
[10]  
Narayanan K., 2007, 45 ALL C COMM CONTR