DocumentCode
2989989
Title
Relaying simultaneous multicasts via structured codes
Author
Gündüz, D. ; Simeone, O. ; Goldsmith, A. ; Poor, H.V. ; Shamai, Shlomo
Author_Institution
Dept. of Electr. Eng., Stanford Univ., Stanford, CA, USA
fYear
2009
fDate
June 28 2009-July 3 2009
Firstpage
2321
Lastpage
2325
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 modulo-additive 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.
Keywords
Gaussian channels; channel coding; multi-access systems; multicast communication; random codes; Gaussian channel model; cMACr; channel coding; compound multiple access channel with a relay; finite-field modulo-additive channel; linear codes; nested lattice codes; physical-layer structure; power constraint; simultaneous multicast relaying; standard random coding schemes; structured codes; two-source two-destination network; Base stations; Code standards; Decoding; Gaussian channels; Lattices; Linear code; Power system relaying; Relays; Robustness; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location
Seoul
Print_ISBN
978-1-4244-4312-3
Electronic_ISBN
978-1-4244-4313-0
Type
conf
DOI
10.1109/ISIT.2009.5205938
Filename
5205938
Link To Document