Multigroup-Decodable STBCs from Clifford Algebras

A space-time block code (STBC) in K symbols (variables) is called g-group decodable STBC if its maximum-likelihood decoding metric can be written as a sum of g terms such that each term is a function of a subset of the K variables and each variable appears in only one term. In this paper we provide a general structure of the weight matrices of multi-group decodable codes using Clifford algebras. Without assuming that the number of variables in each group to be the same, a method of explicitly constructing the weight matrices of full-diversity, delay-optimal g-group decodable codes is presented for arbitrary number of antennas. For the special case of Nt = 2a we construct two subclass of codes: (i) A class of 2a-group decodable codes with rate a/(2(a-1)), which is, equivalently, a class of single-symbol decodable codes, (ii) A class of (2a-2)-group decodable with rate (a-1)/(2(a-2)), i.e., a class of double-symbol decodable codes. Simulation results show that the DSD codes of this paper perform better than previously known quasi-orthogonal designs

[1]  Ari Hottinen,et al.  Square-matrix embeddable space-time block codes for complex signal constellations , 2002, 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]  Signal constellations for quasi-orthogonal space-time block codes with full diversity , 2004, IEEE Transactions on Information Theory.

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

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

[6]  Chau Yuen,et al.  A Class of Four-Group Quasi-Orthogonal STBC Achieving Full Rate and Full Diversity for Any Number of Antennas , 2005, 2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications.

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

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