IEEE Transactions on Information Theory
Space-time block codes from orthogonal designs
IEEE Transactions on Information Theory
Representation theory for high-rate multiple-antenna code design
IEEE Transactions on Information Theory
Diagonal algebraic space-time block codes
IEEE Transactions on Information Theory
High-rate codes that are linear in space and time
IEEE Transactions on Information Theory
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Full-diversity, high-rate space-time block codes from division algebras
IEEE Transactions on Information Theory
STBC-schemes with nonvanishing determinant for certain number of transmit antennas
IEEE Transactions on Information Theory
Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff
IEEE Transactions on Information Theory
Perfect Space–Time Codes for Any Number of Antennas
IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
Hi-index | 754.84 |
Nonvanishing determinants have emerged as an attractive criterion enabling a space-time code achieve the optimal diversity-multiplexing gains tradeoff. It seems that cyclic division algebras play the most crucial role in designing a space-time code with nonvanishing determinants. In this paper, we explicitly construct space-time codes for arbitrary numbers of transmit antennas that achieve nonvanishing determinants and the optimal diversity-multiplexing gains tradeoff over Z[i]. Unlike previous methods usually arising a field compositum for two or more fields, our scheme, which only requires one simple extension, constitutes a much more efficient and feasible advancement whether in theory or practice.