Square-matrix embeddable space-time block codes for complex signal constellations
IEEE Transactions on Information Theory
High-rate codes that are linear in space and time
IEEE Transactions on Information Theory
Signal constellations for quasi-orthogonal space-time block codes with full diversity
IEEE Transactions on Information Theory
Single-symbol maximum likelihood decodable linear STBCs
IEEE Transactions on Information Theory
High-rate, single-symbol ML decodable precoded DSTBCs for cooperative networks
IEEE Transactions on Information Theory
High-rate, multisymbol-decodable STBCs from Clifford algebras
IEEE Transactions on Information Theory
High-rate, 2-group ML-decodable STBCs for 2m transmit antennas
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
LR-aided MMSE lattice decoding is DMT optimal for all approximately universal codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
A simple design of space-time block codes achieving full diversity with linear receivers
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Space-time block codes with symbol-by-symbol maximum likelihood detections
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
IEEE Transactions on Information Theory
| Hi-index | 755.02 |
A space-time block code (STBC) in K symbols (variables) is called a g-group decodable STBC if its maximum-likelihood (ML) decoding metric can be written as a sum of g terms, for some positive integer g greater than one, 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 multigroup decodable codes using Clifford algebras. Without assuming that the number of variables in each group is the same, a method of explicitly constructing the weight matrices of full-diversity, delay-optimal multigroup decodable codes is presented for arbitrary number of antennas. For the special case of 2a number of transmit antennas, we construct two subclass of2a codes: 1) a class of 2a-group decodable codes with rate a/2(a-1), which is, equivalently, a class of single-symbol decodable codes, and 2) a class of (2a-2) -group decodable codes with rate (a-1)/2(a-2), i.e., a class of double-symbol decodable codes.