On the complexity of sphere decoding in digital communications
IEEE Transactions on Signal Processing
Four-Group Decodable Space–Time Block Codes
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
A universal lattice code decoder for fading channels
IEEE Transactions on Information Theory
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
Closest point search in lattices
IEEE Transactions on Information Theory
On maximum-likelihood detection and the search for the closest lattice point
IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
Hi-index | 0.02 |
This paper proposes the design of a new family of fast-decodable, full-rank, flexible-rate linear dispersion codes (LDCs) for MIMO systems with arbitrary numbers of transmit and receive antennas. The codewords of LDCs can be expressed as a linear combination of certain dispersion matrices and, in this new family of LDCs, we propose to have orthogonal rows in as many dispersion matrices as possible. We show that, with the proposed code, the number of levels in the tree search and hence the complexity of the sphere decoder (SD) at the receiver can be substantially reduced. Monte Carlo computer simulation has shown that the LDCs with and without the orthogonal structure have nearly identical bit-error-rate (BER) performances. However, the complexity of the SD used for decoding the proposed family of LDCs is substantially reduced.