Algebraic space-time codes for quasi-synchronous cooperative diversity

Li and Xia have recently investigated the design of space-time codes that achieve full spatial diversity for quasi-synchronous cooperative communications. They show that certain of the binary space-time trellis codes derived from the Hammons-El Gamal stacking construction are delay tolerant and can be used in the multilevel code constructions by Lu and Kumar to produce delay tolerant space-time codes for PSK and QAM signaling. In this paper, we present various generalizations of the Lu-Kumar construction that also preserve the delay tolerance of the underlying constituent codes. We investigate the delay tolerance of short block codes derived from the stacking construction. We identify an algebraic constraint that, if satisfied, is sufficient to guarantee a certain level of delay tolerance and, based on this constraint, exhibit a new construction of short block codes that achieve significant levels of delay tolerance.

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

[2]  Youjian Liu,et al.  A rank criterion for QAM space-time codes , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[3]  Hesham El Gamal,et al.  On the theory of space-time codes for PSK modulation , 2000, IEEE Trans. Inf. Theory.

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

[5]  A. Roger Hammons On space-time codes and constellation labelling , 2004, Information Theory Workshop.

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