D-MG tradeoff and optimal codes for a class of AF and DF cooperative communication Protocols

被引:3
作者
Elia, Petros [1 ]
Vinodh, K. [2 ]
Anand, M. [3 ]
Kumar, R. Vijay [2 ,4 ]
机构
[1] Univ So Calif, Los Angeles, CA 90089 USA
[2] Indian Inst Sci, Dept Elect Commun Engn, Bangalore 560012, Karnataka, India
[3] Univ Illinois, Dept Elect & Comp Engn, Coordinated Sci Lab, Urbana, IL 61801 USA
[4] Univ Southern Calif Los Angeles, Dept Elect Engn Syst, Los Angeles, CA 90089 USA
来源
2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7 | 2007年
关键词
D O I
10.1109/ISIT.2007.4557303
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 [电气工程]; 0809 [电子科学与技术];
摘要
Cooperative relay communication in a fading channel environment under the orthogonal amplify-and-forward (OAF), non-orthogonal and orthogonal selection decode-and- forward (NSDF and OSDF) protocols is considered here. The diversity-multiplexing gain tradeoff (DMT) of the three protocols is determined and DMT-optimal distributed space-time code constructions are provided. The codes constructed are sphere decodable and in some instances incur minimum possible delay. Included in our results is the perhaps surprising finding that the OAF and NAF protocols have identical DMT when the time durations of the broadcast and cooperative phases are optimally chosen to suit the respective protocol. Two variants of the NSDF protocol are considered: fixed-NSDF and variable-NSDF protocol. In the variable-NSDF protocol, the fraction of time occupied by the broadcast phase is allowed to vary with multiplexing gain. In the two-relay case, the variable-NSDF protocol is shown to improve on the DMT of the best previously-known static protocol for higher values of multiplexing gain. Our results also establish that the fixed-NSDF protocol has a better DMT than the NAF protocol for any number of relays.
引用
收藏
页码:681 / +
页数:2
相关论文
共 11 条
[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]
ELIA P, 2006, IEEE T INFORM UNPUB
[3]
Explicit space-time codes achieving the diversity-multiplexing gain tradeoff [J].
Elia, Petros ;
Kumar, K. Raj ;
Pawar, Sameer A. ;
Kumar, P. Vijay ;
Lu, Hsiao-Feng .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (09) :3869-3884
[4]
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
[5]
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks [J].
Laneman, JN ;
Wornell, GW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (10) :2415-2425
[6]
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
[7]
Approximately universal codes over slow-fading channels [J].
Tavildar, Saurabha ;
Viswanath, Pramod .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (07) :3233-3258
[8]
YANG S, 2006, IEEE T WIR UNPUB MAR
[9]
YANG S, 2005, IEEE T WIR UNPUB SEP
[10]
YUKSEL M, 2006, IEEE T INF UNPUB SEP