Networking

Space-Time Codes That Are Approximately Universal for the Parallel, Multi-Block and Cooperative DDF Channels

Free registration required

Executive Summary

Explicit codes are constructed that achieve the diversity-multiplexing gain tradeoff (DMT) of the cooperativerelay 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, the authors prove that spacetime codes previously constructed in the literature for the blockfading 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.

  • Format: PDF
  • Size: 196.16 KB