Simultaneous multicasting of messages with the help of a relay is studied. A two-source two-destination network is considered, in which each destination can receive directly only the signal from one of the sources, so that the reception of the message from the other source (and multicasting) is enabled by the presence of the relay. An outer bound is derived which is shown to be achievable in the case of finite-field moduloadditive channels by using linear codes, highlighting the benefits of structured codes in exploiting the underlying physical-layer structure of the network. Results are extended to the Gaussian channel model as well, providing achievable rate regions based on nested lattice codes. It is shown that for a wide range of power constraints, the performance with lattice codes approaches the upper bound and surpasses the rates achieved by the standard random coding schemes. © 2009 IEEE.
Relaying simultaneous multicasts via structured codes / Gunduz, D.; Simeone, O.; Goldsmith, A. J.; Poor, H. V.; Shamai, S.. - (2009), pp. 2321-2325. (Intervento presentato al convegno 2009 IEEE International Symposium on Information Theory, ISIT 2009 tenutosi a Seoul, kor nel 2009) [10.1109/ISIT.2009.5205938].
Relaying simultaneous multicasts via structured codes
D. Gunduz;
2009
Abstract
Simultaneous multicasting of messages with the help of a relay is studied. A two-source two-destination network is considered, in which each destination can receive directly only the signal from one of the sources, so that the reception of the message from the other source (and multicasting) is enabled by the presence of the relay. An outer bound is derived which is shown to be achievable in the case of finite-field moduloadditive channels by using linear codes, highlighting the benefits of structured codes in exploiting the underlying physical-layer structure of the network. Results are extended to the Gaussian channel model as well, providing achievable rate regions based on nested lattice codes. It is shown that for a wide range of power constraints, the performance with lattice codes approaches the upper bound and surpasses the rates achieved by the standard random coding schemes. © 2009 IEEE.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
