Matrix analysis
Eigenvalues and condition numbers of random matrices
SIAM Journal on Matrix Analysis and Applications
IEEE Transactions on Information Theory
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
IEEE Transactions on Information Theory
Full-diversity, high-rate space-time block codes from division algebras
IEEE Transactions on Information Theory
Universal space-time trellis codes
IEEE Transactions on Information Theory
Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels
IEEE Transactions on Information Theory
STBC-schemes with nonvanishing determinant for certain number of transmit antennas
IEEE Transactions on Information Theory
Approximately universal codes over slow-fading channels
IEEE Transactions on Information Theory
The MIMO ARQ Channel: Diversity–Multiplexing–Delay Tradeoff
IEEE Transactions on Information Theory
Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff
IEEE Transactions on Information Theory
Perfect Space–Time Block Codes
IEEE Transactions on Information Theory
Perfect Space–Time Codes for Any Number of Antennas
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 | 754.90 |
For the quasi-static, Rayleigh-fading multiple-input multiple-output (MIMO) channel with nt transmit and nr receive antennas, Zheng and Tse showed that there exists a fundamental tradeoff between diversity and spatial-multiplexing gains, referred to as the diversity-multiplexing gain (D-MG) tradeoff. Subsequently, El Gamal, Caire, and Damen considered signaling across the same channel using an L-round automatic retransmission request (ARQ) protocol that assumes the presence of a noiseless feedback channel capable of conveying one bit of information per use of the feedback channel. They showed that given a fixed number L of ARQ rounds and no power control, there is a tradeoff between diversity and multiplexing gains, termed the diversity-multiplexing-delay (DMD) tradeoff. This tradeoff indicates that the diversity gain under the ARQ scheme for a particular information rate is considerably larger than that obtainable in the absence of feedback. In this paper, a set of sufficient conditions under which a space-time (ST) code will achieve the DMD tradeoff is presented. This is followed by two classes of explicit constructions of ST codes which meet these conditions. Constructions belonging to the first class achieve minimum delay and apply to a broad class of fading channels whenever nr ≥ nt and either L|nt or nt|L. The second class of constructions do not achieve minimum delay, but do achieve the DMD tradeoff of the fading channel for all statistical descriptions of the channel and for all values of the parameters nr,nt, L.