On the design of 2x2 full-rate full-diversity space-time block codes

被引:0
作者
Ghaderipoor, Alireza [1 ]
Hqjiaghayi, Mahdi [1 ]
Tellambura, Chintha [1 ]
机构
[1] Univ Alberta, Dept Elect & Comp Engn, Edmonton, AB T6G 2V4, Canada
来源
GLOBECOM 2007: 2007 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-11 | 2007年
关键词
D O I
暂无
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
There has been considerable research on the design of space-time block codes (STBCs) that guarantee full diversity without sacrificing the data rate. The main challenge is to maximize the coding gain by maximizing the determinant criterion. It is shown that the most of previous STBCs with full rate and full diversity order (FRFD) (e.g. threaded algebraic space-time (TAST) codes) are constructed via a unitary generator matrix. However, the unitary matrix has been represented using only a small number parameters to enable algebraic code design. In this paper, for a 2 x 2 STBC, we use a more general unitary matrix with a large number of parameters for STBC design. We obtain an upper bound on the coding gain and show that the maximum coding gain is attainable only with PAM signaling. Since optimum parameters for the case of QAM signaling is analytically intractable, we search using the genetic algorithm (GA) method. We also use the union bound criterion for code parameter search by GA. Our simulation results show that with both criteria, the optimum code for QAM signaling is the Golden code. The proposed code significantly outperforms other existing STBCs with the gains about 2 dB at a symbol error rate of 10 3 for BPSK and 4-PAM. The proposed code performs identically to the Golden code for QAM.
引用
收藏
页码:3406 / 3410
页数:5
相关论文
共 13 条
[1]   The Golden code: A 2x2 full-rate space-time code with nonvanishing determinants [J].
Belfiore, JC ;
Rekaya, G ;
Viterbo, E .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (04) :1432-1436
[2]   Systematic construction of full diversity algebraic constellations [J].
Damen, MO ;
El Gamal, H ;
Beaulieu, NC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (12) :3344-3349
[3]   A construction of a space-time code based on number theory [J].
Damen, MO ;
Tewfik, A ;
Belfiore, JC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (03) :753-760
[4]   An optimal two transmit antenna space-time code and its stacked extensions [J].
Dayal, P ;
Varanasi, MK .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4348-4355
[5]   THE DESIGN OF TRELLIS CODED MPSK FOR FADING CHANNELS - SET PARTITIONING FOR OPTIMUM CODE DESIGN [J].
DIVSALAR, D ;
SIMON, MK .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1988, 36 (09) :1013-1021
[6]   Universal space-time coding [J].
El Gamal, H ;
Damen, MO .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (05) :1097-1119
[7]  
GUEY JC, 1996, P IEEE VEH TECHN C A, V1, P136
[8]  
Michalewicz Z., 1992, GENETIC ALGORITHMS D
[9]  
Sandhu S, 2001, GLOB TELECOMM CONF, P1073, DOI 10.1109/GLOCOM.2001.965637
[10]   Space-time block codes from orthogonal designs [J].
Tarokh, V ;
Jafarkhani, H ;
Calderbank, AR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (05) :1456-1467