Multigroup decodable STBCs from Clifford algebras
IEEE Transactions on Information Theory
On fast-decodable space-time block codes
IEEE Transactions on Information Theory
On optimal quasi-orthogonal space-time block codes with minimum decoding complexity
IEEE Transactions on Information Theory
Quasi-orthogonal STBC with minimum decoding complexity
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
Space-time block codes from orthogonal designs
IEEE Transactions on Information Theory
Square-matrix embeddable space-time block codes for complex signal constellations
IEEE Transactions on Information Theory
Orthogonal designs with maximal rates
IEEE Transactions on Information Theory
Single-symbol maximum likelihood decodable linear STBCs
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
A Space-Time Block Code (STBC) in K--variables is said to be g-Group ML-Decodable (GMLD) if its Maximum-Likelihood (ML) decoding metric can be written as a sum of g independent terms, with each term being a function of a subset of the K variables. In this paper, a construction method to obtain high-rate, 2-GMLD STBCs for 2m transmit antennas, m 1, is presented. The rate of the STBC obtained for 2m transmit antennas is 2m-2+1/2m complex symbols per channel use. The design method is illustrated for the case of 4 and 8 transmit antennas. The code obtained for 4 transmit antennas is equivalent to the rate-5/4 Quasi-Orthogonal design (QOD) proposed by Yuen, Guan and Tjung.