Cooperative lattice coding and decoding in half-duplex channels

被引:27
作者
Murugan, Arul [1 ]
Azarian, Karnbiz [1 ]
El Gamal, Hesharn [1 ]
机构
[1] Ohio State Univ, Dept Elect Engn, Columbus, OH 43210 USA
关键词
lattice coding; lattice decoding; half-duplex channels; tree search; MMSE-Fano decoder; amplify and forward; decode and forward; cooperative multiple access; DIVERSITY; SPACE; PROTOCOLS; TRADEOFF; SEARCH;
D O I
10.1109/JSAC.2007.070204
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We propose novel lattice coding/decoding schemes for half-duplex outage-limited cooperative channels. These schemes are inspired by the cooperation protocols of Azarian et al. and enjoy an excellent performance-complexity tradeoff. More specifically, for the relay channel, we first use our lattice coding framework to generalize Yang and Belfiore implementation of the non-orthogonal amplify and forward cooperation protocol. This generalization is shown to offer significant performance gains while keeping the decoding complexity manageable. We then devise a novel variant of the dynamic decode and forward protocol, along with a lattice-coded implementation, which enjoys a near-optimal diversity-multiplexing tradeoff with a low encoding/decoding complexity. Finally, for the cooperative multiple-access channel, we present a lattice-coded implementation of the non-orthogonal amplify and forward protocol and demonstrate its excellent performance-complexity tradeoff. Throughout the paper, we establish the performance gains of our proposed protocols via a comprehensive simulation study.
引用
收藏
页码:268 / 279
页数:12
相关论文
共 22 条
[11]   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
[12]   Averaging bounds for lattices and linear codes [J].
Loeliger, HA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (06) :1767-1773
[13]  
MITRA U, 2003, P 41 ALL C COMM CONT
[14]   Space-time diversity enhancement's using collaborative communications [J].
Mitran, P ;
Ochiai, H ;
Tarokh, V .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (06) :2041-2057
[15]   A unified framework for tree search decoding: Rediscovering the sequential decoder [J].
Murugan, AD ;
El Gamal, H ;
Damen, MO ;
Caire, G .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (03) :933-953
[16]   User cooperation diversity - Part II: Implementation aspects and performance analysis [J].
Sendonaris, A ;
Erkip, E ;
Aazhang, B .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2003, 51 (11) :1939-1948
[17]   User cooperation diversity - Part 1: System description [J].
Sendonaris, A ;
Erkip, E ;
Aazhang, B .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2003, 51 (11) :1927-1938
[18]   Cooperative space-time coding for wireless networks [J].
Stefanov, A ;
Erkip, E .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2005, 53 (11) :1804-1809
[19]  
YANG S, 2005, UNPUB IEEE T INF SEP
[20]   Capacity-approaching turbo coding and iterative decoding for relay channels [J].
Zhang, Z ;
Duman, TM .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2005, 53 (11) :1895-1905