Decoding, Performance Analysis, and Optimal Signal Designs for Coordinate Interleaved Orthogonal Designs

Space-time block codes (STBC) using coordinate interleaved orthogonal designs (CIOD) proposed recently by Khan and Rajan allow single-complex symbol decoding and offer higher data rates than orthogonal STBC. In this paper, we present the channel decoupling property of CIOD codes. A new general maximum likelihood method is derived, enabling the calculation of the symbol pair-wise error probability and union bound (UB) on symbol error rate (SER). Extensive simulation results show that the UB is within 0.1 dB from the simulated SER when SER < 10-2. The UB thus can be used to accurately predict and optimize the performance of CIOD codes. Furthermore, a new signal design combining signal rotation and power allocation is presented for constellations with uneven powers of real and imaginary parts such as rectangular quadrature amplitude modulation.

[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]  Babak Hassibi,et al.  High-rate codes that are linear in space and time , 2002, IEEE Trans. Inf. Theory.

[3]  Petre Stoica,et al.  Space-Time block codes: A maximum SNR approach , 2001, IEEE Trans. Inf. Theory.

[4]  Mohamed-Slim Alouini,et al.  Digital Communication over Fading Channels: Simon/Digital Communications 2e , 2004 .

[5]  Dong Wang,et al.  On Optimal Quasi-Orthogonal Space–Time Block Codes With Minimum Decoding Complexity , 2005, IEEE Transactions on Information Theory.

[6]  B. Sundar Rajan,et al.  Rectangular co-ordinate interleaved orthogonal designs , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[7]  B. S. Rajan,et al.  Space-time block codes from co-ordinate interleaved orthogonal designs , 2002, Proceedings IEEE International Symposium on Information Theory,.

[8]  Chintha Tellambura,et al.  WLC16-3: Performance Analysis and Optimal Signal Designs for Minimum Decoding Complexity ABBA Codes , 2006, IEEE Globecom 2006.

[9]  B. Sundar Rajan,et al.  Single-symbol maximum likelihood decodable linear STBCs , 2006, IEEE Transactions on Information Theory.

[10]  Norman C. Beaulieu,et al.  A useful integral for wireless communication theory and its application to rectangular signaling constellation error rates , 2006, IEEE Transactions on Communications.

[11]  Changchuan Yin,et al.  A squaring method to simplify the decoding of orthogonal space-time block codes , 2001, IEEE Trans. Commun..

[12]  Chau Yuen,et al.  Quasi-orthogonal STBC with minimum decoding complexity , 2005, IEEE Transactions on Wireless Communications.

[13]  Chau Yuen,et al.  Decoding of quasiorthogonal space-time block code with noise whitening , 2003, 14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003..

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

[15]  Xue-Bin Liang,et al.  Orthogonal designs with maximal rates , 2003, IEEE Trans. Inf. Theory.

[16]  Xiang-Gen Xia,et al.  On optimal quasi-orthogonal space-time block codes with minimum decoding complexity , 2005, ISIT.

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

[18]  Xiang-Gen Xia,et al.  Upper bounds of rates of complex orthogonal space-time block code , 2003, IEEE Trans. Inf. Theory.

[19]  Chau Yuen,et al.  Construction of quasi orthogonal STBC with minimum decoding complexity , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..