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
Signal constellations for quasi-orthogonal space-time block codes with full diversity
IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
Alamouti-codes based four-antenna transmission schemes with phase feedback
IEEE Communications Letters
Channel orthogonalizing precoder for open-loop QO-STBC systems
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
MIMO systems based on modulation diversity
IEEE Transactions on Communications
Hi-index | 0.00 |
In this letter, we present a new maximum likelihood (ML) decoding algorithm for space time block codes (STBCs) that employ multidimensional constellations. We start with a lattice representation for STBCs which transforms complex channel models into real matrix equations. Based on the lattice representation, we propose a new decoding algorithm for quasi-orthogonal STBCs (QO-STBC) which allows simpleML decoding with performance identical to the conventional ML decoder. Multidimensional rotated constellations are constructed for the QO-STBCs to achieve full diversity. As a consequence, for quasi-orthogonal designs with an arbitrary number of transmit antennas N (N ≥ 4), the proposed decoding scheme achieves full rate and full diversity while reducing the decoding complexity from O(McN/2) to O(McN/4) in a Mc-QAM constellation.