Space-ime codes that are approximately universal for the parallel, multi-block and cooperative DDF channels

Authors:
Petros Elia;P. Vijay Kumar
Affiliations:
Mobile Communications Department, EURECOM, Sophia Antipolis Cedex, France;ECE, Indian Institute of Science, Bangalore, India
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 8
Cited 2

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
Cooperative diversity in wireless networks: Efficient protocols and outage behavior

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
Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff

IEEE Transactions on Information Theory
Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative Channel

IEEE Transactions on Information Theory
Constructions of Multiblock Space–Time Coding Schemes That Achieve the Diversity–Multiplexing Tradeoff

IEEE Transactions on Information Theory

Constructions of DMT optimal vector codes for asynchronous cooperative networks using decode-and-forward protocols

IEEE Transactions on Wireless Communications
DMT optimality of LR-aided linear decoders for a general class of channels, lattice designs, and system models

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

Explicit codes are constructed that achieve the diversity-multiplexing gain tradeoff (DMT) of the cooperative-relay channel under the dynamic decode-and-forward protocol for any network size and for all numbers of transmit and receive antennas at the relays. Along the way, we prove that space-time codes previously constructed in the literature for the block-fading and parallel channels are approximately universal, i.e., they achieve the DMT for any fading distribution. It is shown how approximate universality of these codes leads to the first DMT-optimum code construction for the general, MIMO-OFDM channel.