Relay-mapper aided multi-user lattice coding for the multiple-access relay channel

被引:0
作者
Lee, Chung-Pi [1 ]
Lin, Shih-Chun [2 ]
Su, Hsuan-Jung [1 ]
Poor, H. Vincent [3 ]
机构
[1] Natl Taiwan Univ, Grad Inst Commun Engn, Taipei, Taiwan
[2] Natl Taiwan Univ Sci & Technol, Dept Elect & Comp Engn, Taipei, Taiwan
[3] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
来源
2013 47TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS) | 2013年
关键词
TRADEOFF;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper considers the multi-antenna multiple access relay channel (MARC), in which multiple users transmit messages to a common destination with the assistance of a relay. In a variety of MARC settings, the dynamic decode and forward (DDF) protocol is very useful due to its outstanding rate performance. However, the lack of good structured codebooks so far hinders practical applications of DDF for MARC. In this work, a new structured MARC code, one-to-one relay-mapper aided multiuser lattice coding (O-MLC), is proposed. It is shown that, in order to approach the rate performance obtained previously by using an unstructured code book with maximum-likelihood decoding, it is crucial to use a new K-stage coset decoder instead of the one-stage decoder proposed in previous works. However, if O-MLC is decoded with the one-stage decoder only, it can still achieve the optimal DDF diversity-multiplexing gain tradeoff when the signal-to-noise ratio is high. Simulation results show that the proposed coding scheme outperforms existing schemes in terms of outage probabilities.
引用
收藏
页数:6
相关论文
共 18 条
[1]   On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels [J].
Azarian, K ;
El Gamal, H ;
Schniter, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4152-4172
[2]   On the optimality of the ARQ-DDF protocol [J].
Azarian, Kambiz ;
El Gamal, Hesham ;
Schniter, Philip .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (04) :1718-1724
[3]   A case for amplify-forward relaying in the block-fading multiple-access channel [J].
Chen, Deqiang ;
Azarian, Kambiz ;
Laneman, J. Nicholas .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (08) :3728-3733
[4]   On maximum-likelihood detection and the search for the closest lattice point [J].
Damen, MO ;
El Gamal, H ;
Caire, G .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (10) :2389-2402
[5]   Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels [J].
El Gamal, H ;
Caire, G ;
Damen, MO .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (06) :968-985
[6]   Lattices which are good for (almost) everything [J].
Erez, U ;
Litsyn, S ;
Zamir, R .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (10) :3401-3416
[7]   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
[8]  
HAUSL C, 2006, P INT WORKSH WIR AD
[9]   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
[10]   On the white Gaussian multiple-access relay channel [J].
Kramer, G ;
van Wijngaarden, AJ .
2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, :40-40