A Class of Four-Group Quasi-Orthogonal STBC Achieving Full Rate and Full Diversity for Any Number of Antennas

We propose and construct a new class of full-rate full-diversity quasi-orthogonal space-time block code (QO-STBC), namely four-group QO-STBC (4Gp-QOSTBC), which can support any number of transmit antennas. 4Gp-QOSTBC can linearly separate the symbols into four independent groups, such that symbols within a group is orthogonal to all other symbols in another groups, and the maximum-likelihood (ML) decoder of the code only needs to jointly decode the symbols within the same group. The number of symbols required for joint detection of the newly proposed 4Gp-QOSTBC is half of that required by the existing QO-STBCs with the same code rate, and their full-diversity decoding performances are comparable. We also extend the proposed code construction to obtain 6Gp-QOSTBC and 8Gp-QOSTBC, which have even lower decoding complexity, albeit at a slight loss in code rate

[1]  Ari Hottinen,et al.  A Space-Time Coding Concept for a Multi-Element Transmitter , 2001 .

[2]  Constantinos B. Papadias,et al.  Capacity-approaching space-time codes for systems employing four transmitter antennas , 2003, IEEE Trans. Inf. Theory.

[3]  Chau Yuen,et al.  On the search for high-rate quasiorthogonal space-time block code , 2004, 2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754).

[4]  Constantinos B. Papadias,et al.  Full rate full diversity linear quasi-orthogonal space-time codes for any transmit antennas , 2003 .

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

[6]  Babak Hassibi,et al.  High-rate codes that are linear in space and time , 2002, IEEE Trans. Inf. Theory.

[7]  Constantinos B. Papadias,et al.  Full-Rate Full-Diversity Linear Quasi-Orthogonal Space-Time Codes for Any Number of Transmit Antennas , 2004, EURASIP J. Adv. Signal Process..

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

[9]  Chau Yuen,et al.  Quasi-orthogonal STBC with minimum decoding complexity: further results , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[10]  Constantinos B. Papadias,et al.  Improved quasi-orthogonal codes through constellation rotation , 2003, IEEE Trans. Commun..

[11]  Chau Yuen,et al.  Optimizing quasi-orthogonal STBC through group-constrained linear transformation , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[12]  Moon Ho Lee,et al.  On single-symbol and double-symbol decodable STBCs , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[13]  Ari Hottinen,et al.  Minimal non-orthogonality rate 1 space-time block code for 3+ Tx antennas , 2000, 2000 IEEE Sixth International Symposium on Spread Spectrum Techniques and Applications. ISSTA 2000. Proceedings (Cat. No.00TH8536).

[14]  X. Xia,et al.  Quasi-orthogonal space-time block codes with full diversity , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

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

[16]  Olav Tirkkonen,et al.  Multi-Antenna Transceiver Techniques for 3G and Beyond: Hottinen/Multi-antenna , 2003 .

[17]  Yong Liang Guan,et al.  On the Search for High-Rate Quasi-Orthogonal Space–Time Block Code , 2006, Int. J. Wirel. Inf. Networks.

[18]  Chau Yuen,et al.  Full-rate full-diversity STBC with constellation rotation , 2003, The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring..

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