Distributed Space Time Codes for the Amplify-and-Forward Multiple-Access Relay Channel
| dc.creator | Badr, Maya | |
| dc.creator | Belfiore, Jean-Claude | |
| dc.date | 2008-04-09 | |
| dc.date.accessioned | 2026-07-07T09:31:19Z | |
| dc.date.available | 2026-07-07T09:31:19Z | |
| dc.description | In this work, we present a construction of a family of space-time block codes for a Multi-Access Amplify-and- Forward Relay channel with two users and a single half-duplex relay. It is assumed that there is no Channel Side Information at the transmitters and that they are not allowed to cooperate together. Using the Diversity Multiplexing Tradeoff as a tool to evaluate the performance, we prove that the proposed scheme is optimal in some sense. Moreover, we provide numerical results which show that the new scheme outperforms the orthogonal transmission scheme, e. g. time sharing and offers a significant gain. | |
| dc.description | 5 pages, 7 figures | |
| dc.identifier | https://arxiv.org/abs/0804.1493 | |
| dc.identifier | http://arxiv.org/abs/0804.1493 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/158419 | |
| dc.subject | Information Theory | |
| dc.subject | H.1.1 | |
| dc.title | Distributed Space Time Codes for the Amplify-and-Forward Multiple-Access Relay Channel | |
| dc.type | text |