Diversity multiplexing tradeoff of asynchronous cooperative relay networks

The assumption of nodes in a cooperative communication relay network operating in synchronous fashion is often unrealistic. In the present paper we consider two different models of asynchronous operation in cooperative-diversity networks experiencing slow fading and examine the corresponding diversity-multiplexing tradeoffs (DMT). For both models, we propose protocols and distributed space-time codes that asymptotically achieve the transmit diversity bound for all multiplexing gains and for number of relays N ges 2.

[1]  Jieying Chen,et al.  An adaptive limited feedback scheme for MIMO-OFDMA based on optimal stopping , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

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

[3]  Yindi Jing,et al.  Distributed Space-Time Coding in Wireless Relay Networks , 2006, IEEE Transactions on Wireless Communications.

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

[5]  Narayan Prasad,et al.  High performance static and dynamic cooperative communication protocols for the half duplex fading relay channel , 2010, IEEE Transactions on Wireless Communications.

[6]  Elza Erkip,et al.  User cooperation diversity. Part II. Implementation aspects and performance analysis , 2003, IEEE Trans. Commun..

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

[8]  P. Vijay Kumar,et al.  Explicit, Minimum-Delay Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeo , 2004 .

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

[10]  Jean-Claude Belfiore,et al.  Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme , 2006, IEEE Transactions on Information Theory.

[11]  P. Vijay Kumar,et al.  Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design , 2008, ArXiv.

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

[13]  B. Sundar Rajan,et al.  Full-diversity, high-rate space-time block codes from division algebras , 2003, IEEE Trans. Inf. Theory.

[14]  Elza Erkip,et al.  Multiple-Antenna Cooperative Wireless Systems: A Diversity–Multiplexing Tradeoff Perspective , 2006, IEEE Transactions on Information Theory.

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

[16]  P. Vontobel.  Symbolwise graph-cover decoding: Connecting sum-product algorithm decoding and bethe free energy minimization , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[17]  M. Effros,et al.  A continuity theory for lossless source coding over networks , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[18]  Xiang-Gen Xia,et al.  Full diversity distributed space-time trellis codes for asynchronous cooperative communications , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

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

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

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

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

[23]  B. Sundar Rajan,et al.  Distributed Space Time Codes with Low Decoding Complexity for Asynchronous Relay Networks , 2007, ArXiv.

[24]  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.

[25]  P. Vijay Kumar,et al.  DMT of Multi-hop Cooperative Networks - Part I: Basic Results , 2008, ArXiv.

[26]  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.