ISIT 2009, IEEE International Symposium on Information Theory, June 28-July 3rd, 2009, Seoul, Korea
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.
Type:
Conférence
City:
Seoul
Date:
2009-06-28
Department:
Systèmes de Communication
Eurecom Ref:
2928
Copyright:
© 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
See also:
