Generally Dimensional and Constellation Expansion Free Space–Time Block Codes for QAM With Full Diversity

This correspondence presents new rate-1 space-time block codes (STBCs) attending full diversity over every quadrature amplitude modulation (QAM) constellation when the number of Tx antennas is a power of two. From the simulation results, our design performs very closely to the quasi-orthogonal code with constellation rotation over 4-QAM and 16-QAM in the case of four Tx antennas over quasi-static Rayleigh fading channels. Moreover, the proposed codes would not cause any constellation expansion over QAM symbols in contrast with the quasi-orthogonal codes with constellation rotations

[1]  Dimitris A. Pados,et al.  An adaptive two-stage algorithm for ML and sub-ML decoding of binary linear block codes , 2003, IEEE Trans. Inf. Theory.

[2]  Jakov Snyders,et al.  Reliability-based code-search algorithms for maximum-likelihood decoding of block codes , 1997, IEEE Trans. Inf. Theory.

[3]  Ran Gozali,et al.  Space-Time Codes for High Data Rate Wireless Communications , 2002 .

[4]  Chilukuri K. Mohan,et al.  Efficient Heuristic Search Algorithms for Soft-Decision Decoding of Linear Block Codes , 1998, IEEE Trans. Inf. Theory.

[5]  B. Dorsch,et al.  A decoding algorithm for binary block codes and J -ary output channels (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[6]  G. David Forney,et al.  Generalized minimum distance decoding , 1966, IEEE Trans. Inf. Theory.

[7]  Ming-Yang Chen,et al.  Full-diversity quasi-orthogonal space-time block codes for M-PSK modulations , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

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

[9]  Soo-Chang Pei,et al.  Deriving new quasi-orthogonal space-time block codes and relaxed designing viewpoints with full transmit diversity , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[10]  A. Robert Calderbank,et al.  Space-Time block codes from orthogonal designs , 1999, IEEE Trans. Inf. Theory.

[11]  Jack K. Wolf,et al.  Efficient maximum likelihood decoding of linear block codes using a trellis , 1978, IEEE Trans. Inf. Theory.

[12]  Chau Yuen,et al.  Quasi-Orthogonal Space-Time Block Code , 2007, Communications and Signal Processing.

[13]  Siavash M. Alamouti,et al.  A simple transmit diversity technique for wireless communications , 1998, IEEE J. Sel. Areas Commun..

[14]  Hamid Jafarkhani.  A quasi-orthogonal space-time block code , 2001, IEEE Trans. Commun..

[15]  Karim Abed-Meraim,et al.  Diagonal algebraic space-time block codes , 2002, IEEE Trans. Inf. Theory.

[16]  David Chase,et al.  Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.

[17]  Marc P. C. Fossorier,et al.  An improved method to compute lists of binary vectors that optimize a given weight function with application to soft-decision decoding , 2001, IEEE Communications Letters.

[18]  Shu Lin,et al.  Computationally efficient soft-decision decoding of linear block codes based on ordered statistics , 1996, IEEE Trans. Inf. Theory.

[19]  B. Sundar Rajan,et al.  Full-diversity, high-rate space-time block codes from division algebras , 2003, IEEE Trans. Inf. Theory.