2007/06/24 by Petros Elia, Elia, Petros, P. Vijay Kumar +1
Computer Science · Mathematics · #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Information Theory (cs.IT) #Networking and Internet Architecture (cs.NI) #cs.DM #cs.IT #cs.NI #math.IT
paper · pdf · doi:10.48550/arxiv.0706.3502
arxiv created 2007/07/13 · arxiv updated 2009/12/01
Explicit codes are constructed that achieve the diversity-multiplexing gain tradeoff 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. A particularly simple code construction that makes use of the Alamouti code as a basic building block is provided for the single relay case. 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.