Cyclic Division Algebras: A Tool for Space-Time Coding
Foundations and Trends in Communications and Information Theory
Design of optimal space-time codes in TDD/TDMA 4G systems
WSEAS TRANSACTIONS on COMMUNICATIONS
Asymptotic-information-lossless designs and the diversity-multiplexing tradeoff
IEEE Transactions on Information Theory
On full diversity space-time block codes with partial interference cancellation group decoding
IEEE Transactions on Information Theory
Recursive space-time trellis codes using differential encoding
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Space-time codes achieving the DMD tradeoff of the MIMO-ARQ channel
IEEE Transactions on Information Theory
On the densest MIMO lattices from cyclic division algebras
IEEE Transactions on Information Theory
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Novel rotated quasi-orthogonal space-time block codes with the fixed nearest neighbor number
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
The RF-chain limited MIMO system: part I: optimum diversity-multiplexing tradeoff
IEEE Transactions on Wireless Communications
An elementary condition for non-norm elements
IEEE Transactions on Information Theory
Construction methods for asymmetric and multiblock space-time codes
IEEE Transactions on Information Theory
Normalized minimum determinant calculation for multi-block and asymmetric space-time codes
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
IEEE Transactions on Information Theory
Multigroup ML decodable collocated and distributed space-time block codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Efficient space-time codes from cyclic division algebras
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Hi-index | 755.56 |
A space-time block-code scheme (STBC-scheme) is a family of STBCs {C(SNR)}, indexed by the signal-to-noise ratio (SNR) such that the rate of each STBC scales with SNR. An STBC-scheme is said to have a nonvanishing determinant if the coding gain of every STBC in the scheme is lower-bounded by a fixed nonzero value. The nonvanishing determinant property is important from the perspective of the diversity multiplexing-gain (DM-G) tradeoff: a concept that characterizes the maximum diversity gain achievable by any STBC-scheme transmitting at a particular rate. This correspondence presents a systematic technique for constructing STBC-schemes with nonvanishing determinant, based on cyclic division algebras. Prior constructions of STBC-schemes from cyclic division algebra have either used transcendental elements, in which case the scheme may have vanishing determinant, or is available with nonvanishing determinant only for two, three, four, and six transmit antennas. In this correspondence, we construct STBC-schemes with nonvanishing determinant for the number of transmit antennas of the form 2k, 3·2k, 2·3k, and qk(q-1)/2, where q is any prime of the form 4s+3. For cyclic division algebra based STBC-schemes, in a recent work by Elia et al., the nonvanishing determinant property has been shown to be sufficient for achieving DM-G tradeoff. In particular, it has been shown that the class of STBC-schemes constructed in this correspondence achieve the optimal DM-G tradeoff. Moreover, the results presented in this correspondence have been used for constructing optimal STBC-schemes for arbitrary number of transmit antennas, by Elia et al.