Approximately-Universal Space-Time Codes for the Parallel, Multi-Block and Cooperative-Dynamic-Decode-and-Forward Channels
| dc.creator | Elia, Petros | |
| dc.creator | Kumar, P. Vijay | |
| dc.date | 2007-06-24 | |
| dc.date | 2007-07-13 | |
| dc.date.accessioned | 2026-07-07T08:17:21Z | |
| dc.date.available | 2026-07-07T08:17:21Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0706.3502 | |
| dc.identifier | http://arxiv.org/abs/0706.3502 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/134060 | |
| dc.subject | Information Theory | |
| dc.subject | Discrete Mathematics | |
| dc.subject | Networking and Internet Architecture | |
| dc.title | Approximately-Universal Space-Time Codes for the Parallel, Multi-Block and Cooperative-Dynamic-Decode-and-Forward Channels | |
| dc.type | text |