Constructions of DMT Optimal Vector Codes for Asynchronous Cooperative Networks Using Decode-and-Forward Protocols

An asynchronous cooperative network where different time delays exist among nodes is considered in this paper. Assuming the signals are OFDM modulated, it is first shown that the diversity-multiplexing tradeoff (DMT) achieved by the non-orthogonal selection decode-and-forward (NSDF) protocol for this network is the same as that for the synchronous one. In contrast to the complicated approximately universal "matrix" codes, where each relay uses a different codebook, a systematic construction of an extremely simple "vector" code is proposed. Given the transmitted codeword vector, this vector will be used by all nodes in the network for signal transmission; hence, the proposed coding scheme greatly reduces the complexity of relay deployment and decoding. Furthermore, it is proven that the proposed scheme is optimal in terms of the DMT of the NSDF protocol for this asynchronous network, provided all time delays are distinct. Finally, it is shown that the proposed code design can be extended to the orthogonal selection decode-and-forward protocol and remains to be DMT optimal.

[1]  P. Vijay Kumar,et al.  Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff , 2006, IEEE Transactions on Information Theory.

[2]  Xiang-Gen Xia,et al.  Shift-full-rank matrices and applications in space-time trellis codes for relay networks with asynchronous cooperative diversity , 2006, IEEE Transactions on Information Theory.

[3]  Xiang-Gen Xia,et al.  Distributive High-Rate Space–Frequency Codes Achieving Full Cooperative and Multipath Diversities for Asynchronous Cooperative Communications , 2009, IEEE Transactions on Vehicular Technology.

[4]  P. Vijay Kumar,et al.  D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols , 2009, IEEE Transactions on Information Theory.

[5]  P. Vijay Kumar,et al.  Approximately-Universal Space-Time Codes for the Parallel, Multi-Block and Cooperative-Dynamic-Decode-and-Forward Channels , 2007, ArXiv.

[6]  Shuangqing Wei,et al.  Diversity–Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks , 2007, IEEE Transactions on Information Theory.

[7]  Xiang-Gen Xia,et al.  A Simple Alamouti Space–Time Transmission Scheme for Asynchronous Cooperative Systems , 2007, IEEE Signal Processing Letters.

[8]  Jean-Claude Belfiore,et al.  Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative Channel , 2005, IEEE Transactions on Information Theory.

[9]  Elza Erkip,et al.  User cooperation diversity. Part I. System description , 2003, IEEE Trans. Commun..

[10]  Hsiao-feng Lu,et al.  Constructions of Multiblock Space–Time Coding Schemes That Achieve the Diversity–Multiplexing Tradeoff , 2008, IEEE Transactions on Information Theory.

[11]  Hsiao-feng Lu.  Optimal Code Constructions for SIMO-OFDM Frequency Selective Fading Channels , 2007, 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks.

[12]  Xiang-Gen Xia,et al.  A Family of Distributed Space-Time Trellis Codes With Asynchronous Cooperative Diversity , 2005, IEEE Transactions on Communications.

[13]  Philip Schniter,et al.  On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels , 2005, IEEE Transactions on Information Theory.

[14]  Hsiao-feng Lu.  Constructions of fully-diverse high-rate space-frequency codes for asynchronous cooperative relay networks , 2008, 2008 IEEE International Symposium on Information Theory.

[15]  Gregory W. Wornell,et al.  Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.

[16]  Hsiao-feng Lu.  Explicit Constructions of Multi-Block Space-Time Codes That Achieve The Diversity-Multiplexing Tradeoff , 2006, 2006 IEEE International Symposium on Information Theory.

[17]  Pramod Viswanath,et al.  Approximately universal codes over slow-fading channels , 2005, IEEE Transactions on Information Theory.

[18]  P. Vijay Kumar,et al.  Space-time codes that are approximately universal for the parallel, multi-block and cooperative DDF channels , 2009, 2009 IEEE International Symposium on Information Theory.

[19]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

[20]  Gregory W. Wornell,et al.  Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks , 2003, IEEE Trans. Inf. Theory.

[21]  Mohamed Oussama Damen,et al.  Delay-Tolerant Distributed-TAST Codes for Cooperative Diversity , 2007, IEEE Transactions on Information Theory.