Code Design for Multihop Wireless Relay Networks

We consider a wireless relay network, where a transmitter node communicates with a receiver node with the help of relay nodes. Most coding strategies considered so far assume that the relay nodes are used for one hop. We address the problem of code design when relay nodes may be used for more than one hop. We consider as a protocol a more elaborated version of amplify-and-forward, called distributedspace-time coding, where the relay nodes multiply their received signal with a unitary matrix, in such a way that the receiver senses a space-time code. We first show that in this scenario, as expected, the so-called full-diversity condition holds, namely, the codebook of distributed space-time codewords has to be designed such that the difference of any two distinct codewords is full rank. We then compute the diversity of the channel, and show that it is given by the minimum number of relay nodes among the hops. We finally give a systematic way of building fully diverse codebooks and provide simulation results for their performance.

[1]  Yindi Jing,et al.  Cooperative diversity in wireless relay networks with multiple-antenna nodes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[2]  Babak Hassibi,et al.  On the sphere-decoding algorithm I. Expected complexity , 2005, IEEE Transactions on Signal Processing.

[3]  Jean-Claude Belfiore,et al.  Diversity of MIMO Multihop Relay Channels - Part I: Amplify-and-Forward , 2007, ArXiv.

[4]  Frédérique Oggier,et al.  A Coding Strategy for Wireless Networks with no Channel Information , 2006 .

[5]  C. Rao Asymptotic Analysis of Wireless Systems with Rayleigh Fading , 2007 .

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

[7]  Emanuele Viterbo,et al.  A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.

[8]  Xiang-Gen Xia,et al.  A distributed space-time coding in asynchronous wireless relay networks , 2008, IEEE Transactions on Wireless Communications.

[9]  B. Sundar Rajan,et al.  Distributed Space-Time Codes with Reduced Decoding Complexity , 2006, 2006 IEEE International Symposium on Information Theory.

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

[11]  Frédérique E. Oggier,et al.  A Coding Scheme for Wireless Networks with Multiple Antenna Nodes and No Channel Information , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[12]  B. Sundar Rajan,et al.  Partially-Coherent Distributed Space-Time Codes with Differential Encoder and Decoder , 2006, ISIT.

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

[14]  B. Sundar Rajan,et al.  Partially-coherent distributed space-time codes with differential encoder and decoder , 2006, IEEE Journal on Selected Areas in Communications.

[15]  Frédérique E. Oggier,et al.  An Algebraic Family of Distributed Space-Time Codes for Wireless Relay Networks , 2006, 2006 IEEE International Symposium on Information Theory.

[16]  Yindi Jing,et al.  Distributed differential space-time coding for wireless relay networks , 2008, IEEE Transactions on Communications.

[17]  Yindi Jing,et al.  CTH17-1: Using Orthogonal and Quasi-Orthogonal Designs in Wireless Relay Networks , 2006, IEEE Globecom 2006.

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

[19]  Frédérique E. Oggier,et al.  An Algebraic Coding Scheme for Wireless Relay Networks With Multiple-Antenna Nodes , 2008, IEEE Transactions on Signal Processing.

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

[21]  B. Sundar Rajan,et al.  A Non-orthogonal Distributed Space-Time Coded Protocol Part I: Signal Model and Design Criteria , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Chengdu.

[22]  Pranav Dayal,et al.  Distributed QAM-Based Space-Time Block Codes for Efficient Cooperative Multiple-Access Communication , 2008, IEEE Transactions on Information Theory.

[23]  J. Belfiore,et al.  Optimal Space-Time Codes for the Amplify-and-Forward Cooperative Channel , 2005 .