Algebraic space-time codes for quasi-synchronous cooperative diversity

被引:0
作者
Hammons, AR [1 ]
机构
[1] Johns Hopkins Univ, Appl Phys Lab, Laurel, MD 20707 USA
来源
2005 International Conference on Wireless Networks, Communications and Mobile Computing, Vols 1 and 2 | 2005年
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:11 / 15
页数:5
相关论文
共 10 条
[1]   On the theory of space-time codes for PSK modulation [J].
Hammons, AR ;
El Gamal, H .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) :524-542
[2]  
HAMMONS AR, 2005, WORKSH COD CRYPT BER
[3]  
HAMMONS AR, 2004, INT S INF THEOR ITS
[4]  
HAMMONS AR, 2004, IEEE INF THEOR WORKS
[5]  
HAMMONS AR, 2004, UNPUB IEEE T INF MAR
[6]  
HAMMONS AR, UNPUB ALGEBRAIC SPAC
[7]  
LI Y, 2004, FULL DIVERSITY DISTR
[8]   A rank criterion for QAM space-time codes [J].
Liu, YJ ;
Fitz, MP ;
Takeshita, OY .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (12) :3062-3079
[9]  
LU HF, IN PRESS IEEE T INFO
[10]   Space-time codes for high data rate wireless communication: Performance criterion and code construction [J].
Tarokh, V ;
Seshadri, N ;
Calderbank, AR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (02) :744-765