Relaying simultaneous multicasts via structured codes

  • Authors:

  • D. Gündüz;O. Simeone;A. Goldsmith;H. V. Poor;S. Shamai

  • Affiliations:

  • Dept. of Electrical Engineering, Stanford Univ., Stanford, CA and Dept. of Electrical Engineering, Princeton Univ., Princeton, NJ;CWCSPR, New Jersey Institute of Technology, Newark, NJ;Dept. of Electrical Engineering, Stanford Univ., Stanford, CA;Dept. of Electrical Engineering, Princeton Univ., Princeton, NJ;Dept. of Electrical Engineering, Technion, Haifa, Israel

  • Venue:
  • ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.