Approximately-Universal Space-Time Codes for the Parallel, Multi-Block and Cooperative-Dynamic-Decode-and-Forward Channels - Computer Science > Information TheoryReportar como inadecuado




Approximately-Universal Space-Time Codes for the Parallel, Multi-Block and Cooperative-Dynamic-Decode-and-Forward Channels - Computer Science > Information Theory - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: Explicit codes are constructed that achieve the diversity-multiplexing gaintradeoff of the cooperative-relay channel under the dynamic decode-and-forwardprotocol for any network size and for all numbers of transmit and receiveantennas at the relays.A particularly simple code construction that makes use of the Alamouti codeas a basic building block is provided for the single relay case.Along the way, we prove that space-time codes previously constructed in theliterature for the block-fading and parallel channels are approximatelyuniversal, i.e., they achieve the DMT for any fading distribution. It is shownhow approximate universality of these codes leads to the first DMT-optimum codeconstruction for the general, MIMO-OFDM channel.



Autor: Petros Elia, P. Vijay Kumar

Fuente: https://arxiv.org/







Documentos relacionados