Distributed Space-Time Codes Using Constellation Rotation

Rate and diversity impose a fundamental tradeoff in wireless communication. We propose a novel distributed space-time coding (DSTC) scheme based on constellation rotation (DSTC-CR) for Amplify-and-Forward relay networks. The proposed code can achieve full-diversity or full-rate, and also offers a flexibility for a desired rate-diversity tradeoff. This code can work well with arbitrary signal constellation and any number of relays and achieve minimal-delay. Through analysis of pairwise error probability, coding design criteria, Chernoff bound, decoding strategies and optimal power allocation are provided. Simulation results show that DSTC-CR scheme outperforms diagonal DSTC (DDSTC) and distributed linear dispersion (DLD) code at high power. From the comparison with DDSTC, the DSTC-CR scheme can achieve the same information rate using a lower modulation order.

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

[2]  K. J. Ray Liu,et al.  Design Criteria and Performance Analysis for Distributed Space-Time Coding , 2008, IEEE Transactions on Vehicular Technology.

[3]  P. Vijay Kumar,et al.  A unified construction of space-time codes with optimal rate-diversity tradeoff , 2005, IEEE Transactions on Information Theory.

[4]  Karim Abed-Meraim,et al.  A generalized lattice decoder for asymmetrical space-time communication architecture , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[5]  A. Robert Calderbank,et al.  Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction , 1998, IEEE Trans. Inf. Theory.

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

[7]  Aleksandar Dogandzic Chernoff bounds on pairwise error probabilities of space-time codes , 2003, IEEE Trans. Inf. Theory.

[8]  Manav R. Bhatnagar,et al.  Optimum Linear Constellation Precoding for Space Time Wireless Systems , 2007, Wirel. Pers. Commun..

[9]  Lutz H.-J. Lampe,et al.  Distributed space-time block coding , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

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

[11]  Aleksandar Dogand Chernoff Bounds on Pairwise Error Probabilities of Space-Time Codes , 2003 .

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

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

[14]  Yindi Jing,et al.  Using Orthogonal and Quasi-Orthogonal Designs in Wireless Relay Networks , 2007, IEEE Transactions on Information Theory.

[15]  Sergio Barbarossa,et al.  Distributed space-time coding for regenerative relay networks , 2005, IEEE Transactions on Wireless Communications.

[16]  Nikos D. Sidiropoulos,et al.  Khatri-Rao space-time codes , 2002, IEEE Trans. Signal Process..

[17]  Anna Scaglione,et al.  Randomized Space-Time Coding for Distributed Cooperative Communication , 2007, IEEE Trans. Signal Process..

[18]  Suhas N. Diggavi,et al.  Diversity Embedded Space-Time Codes , 2008, IEEE Trans. Inf. Theory.

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

[20]  Georgios B. Giannakis,et al.  Space-time diversity systems based on linear constellation precoding , 2003, IEEE Trans. Wirel. Commun..