Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
On Space-Time Block Codes from Complex Orthogonal Designs
Wireless Personal Communications: An International Journal
Generalized Alamouti codes for trading quality of service against data rate in MIMO UMTS
EURASIP Journal on Applied Signal Processing
Linear dispersion codes for MIMO systems based on frame theory
IEEE Transactions on Signal Processing
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
Space-time block codes: a maximum SNR approach
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
IEEE Transactions on Information Theory
Capacity-approaching space-time codes for systems employing four transmitter antennas
IEEE Transactions on Information Theory
Orthogonal designs with maximal rates
IEEE Transactions on Information Theory
Upper bounds of rates of complex orthogonal space-time block codes
IEEE Transactions on Information Theory
On the nonexistence of rate-one generalized complex orthogonal designs
IEEE Transactions on Information Theory
Signal constellations for quasi-orthogonal space-time block codes with full diversity
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Single-symbol maximum likelihood decodable linear STBCs
IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
A transmitter diversity scheme for wideband CDMA systems based on space-time spreading
IEEE Journal on Selected Areas in Communications
High-rate, single-symbol ML decodable precoded DSTBCs for cooperative networks
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
A low ML-decoding complexity, high coding gain, full-rate, full-diversity STBC for 4 × 2 MIMO system
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Multigroup ML decodable collocated and distributed space-time block codes
IEEE Transactions on Information Theory
Orthogonal-like space-time-coded CPM systems with fast decoding for three and four transmit antennas
IEEE Transactions on Information Theory
On space-time block codes from coordinate interleaved orthogonal designs
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
An Improved Full Rate Full Diversity QOSTBC with Linear Decoding in MIMO Systems
Wireless Personal Communications: An International Journal
Single-Symbol Maximum Likelihood Decodable STBCs with Fewer Zero-Entries
Wireless Personal Communications: An International Journal
No-Zero-Entry Space-Time Block Codes Over Time-Selective Fading Channels for MIMO Systems
Wireless Personal Communications: An International Journal
Hi-index | 755.02 |
Orthogonal space-time block codes (OSTBC) from orthogonal designs have both advantages of complex symbolwise maximum-likelihood (ML) decoding and full diversity. However, their symbol rates are upper bounded by 3/4 for more than two antennas for complex symbols. To increase the symbol rates, they have been generalized to quasi-orthogonal space-time block codes (QOSTBC) in the literature but the diversity order is reduced by half and the complex symbol-wise ML decoding is significantly increased to complex symbol pair-wise (pair of complex symbols) ML decoding. The QOSTBC has been modified by rotating half of the complex symbols for achieving the full diversity while maintaining the complex symbol pair-wise ML decoding. The optimal rotation angles for any signal constellation of any finite symbols located on both square lattices and equal-literal triangular lattices have been found by Su-Xia, where the optimality means the optimal diversity product (or product distance). QOSTBC has also been modified by Yuen-Guan-Tjhung by rotating information symbols in another way such that it has full diversity and in the meantime it has real symbol pair-wise ML decoding (the same complexity as complex symbol-wise decoding) and the optimal rotation angle for square and rectangular QAM constellations has been found. In this paper, we systematically study general linear transformations of information symbols for QOSTBC to have both full diversity and real symbol pair-wise ML decoding. We present the optimal transformation matrices (among all possible linear transformations not necessarily symbol rotations) of information symbols for QOSTBC with real symbol pair-wise ML decoding such that the optimal diversity product is achieved for both general square QAM and general rectangular QAM signal constellations. Furthermore, our newly proposed optimal linear transformations for QOSTBC also work for general QAM constellations in the sense that QOSTBC have full diversity with good diversity product property and real symbol pair-wise ML decoding. Interestingly, the optimal diversity products for square QAM constellations from the optimal linear transformations of information symbols found in this paper coincide with the ones presented by Yuen-Guan-Tjhung by using their optimal rotations. However, the optimal diversity products for (nonsquare) rectangular QAM constellations from the optimal linear transformations of information symbols found in this paper are better than the ones presented byYuen-Guan-Tjhung by using their optimal rotations. In this paper, we also present the optimal transformations for the co-ordinate interleaved orthogonal designs (CIOD) proposed by Khan-Rajan for rectangular QAM constellations.