A Novel Construction of Multi-Group Decodable Space-Time Block Codes

Complex Orthogonal Design (COD) codes are known to have the lowest detection complexity among Space-Time Block Codes (STBCs). However, the rate of square COD codes decreases exponentially with the number of transmit antennas. The Quasi-Orthogonal Design (QOD) codes emerged to provide a compromise between rate and complexity as they offer higher rates compared to COD codes at the expense of an increase of decoding complexity through partially relaxing the orthogonality conditions. The QOD codes were then generalized with the so called g-symbol and g-group decodable STBCs where the number of orthogonal groups of symbols is no longer restricted to two as in the QOD case. However, the adopted approach for the construction of such codes is based on sufficient but not necessary conditions which may limit the achievable rates for any number of orthogonal groups. In this paper, we limit ourselves to the case of Unitary Weight (UW)-g-group decodable STBCs for 2a transmit antennas where the weight matrices are required to be single thread matrices with non-zero entries ∈{± 1,± j} and address the problem of finding the highest achievable rate for any number of orthogonal groups. This special type of weight matrices guarantees full symbol-wise diversity and subsumes a wide range of existing codes in the literature. We show that in this case an exhaustive search can be applied to find the maximum achievable rates for UW-g-group decodable STBCs with g>;1. For this purpose, we extend our previously proposed approach for constructing UW-2-group decodable STBCs based on necessary and sufficient conditions to the case of UW-g-group decodable STBCs in a recursive manner.

[1]  B. Sundar Rajan,et al.  Multigroup ML Decodable Collocated and Distributed Space-Time Block Codes , 2010, IEEE Transactions on Information Theory.

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

[3]  R. CalderbankA.,et al.  Space-time codes for high data rate wireless communication , 2006 .

[4]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[5]  Daniel B. Shapiro,et al.  Anticommuting Matrices: 10456 , 1998 .

[6]  Jocelyn Fiorina,et al.  A New Low-Complexity Decodable Rate-5/4 STBC for Four Transmit Antennas with Nonvanishing Determinants , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[7]  B. Sundar Rajan,et al.  Multigroup Decodable STBCs From Clifford Algebras , 2009, IEEE Transactions on Information Theory.

[8]  B. Sundar Rajan,et al.  Multi-group ML Decodable Collocated and Distributed Space Time Block Codes , 2007, ArXiv.

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

[10]  Jocelyn Fiorina,et al.  A Novel Construction of 2-Group Decodable 4X4 Space-Time Block Codes , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[11]  A. Robert Calderbank,et al.  Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction , 1998, IEEE Trans. Inf. Theory.

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

[13]  Yi Hong,et al.  On Fast-Decodable Space–Time Block Codes , 2007, IEEE Transactions on Information Theory.

[14]  Constantinos B. Papadias,et al.  Improved quasi-orthogonal codes through constellation rotation , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[15]  Ari Hottinen,et al.  Square-matrix embeddable space-time block codes for complex signal constellations , 2002, IEEE Trans. Inf. Theory.

[16]  B. Sundar Rajan,et al.  High-rate, 2-group ML-decodable STBCs for 2m transmit antennas , 2009, 2009 IEEE International Symposium on Information Theory.

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

[18]  Chau Yuen,et al.  Group-Decodable Space-Time Block Codes with Code Rate > 1 , 2011, IEEE Transactions on Communications.

[19]  B. Sundar Rajan,et al.  Minimum-Decoding-Complexity, Maximum-rate Space-Time Block Codes from Clifford Algebras , 2006, 2006 IEEE International Symposium on Information Theory.

[20]  B. Sundar Rajan,et al.  Maximum rate of 3- and 4-real-symbol ML decodable unitary weight STBCs , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

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

[22]  Serdar Sezginer,et al.  Full-rate full-diversity 2 x 2 space-time codes of reduced decoder complexity , 2007, IEEE Communications Letters.

[23]  B. Sundar Rajan,et al.  High-Rate, Multisymbol-Decodable STBCs From Clifford Algebras , 2009, IEEE Transactions on Information Theory.

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

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

[26]  Olav Tirkkonen.  Maximal symbolwise diversity in non-orthogonal space-time block codes , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).