• DocumentCode
    2982719
  • Title

    Approximate capacity region of the two-pair bidirectional Gaussian relay network

  • Author

    Sezgin, Aydin ; Khajehnejad, M. Amin ; Avestimehr, A. Salman ; Hassibi, Babak

  • Author_Institution
    Caltech, Pasadena, CA, USA
  • fYear
    2009
  • fDate
    June 28 2009-July 3 2009
  • Firstpage
    2018
  • Lastpage
    2022
  • Abstract
    We study the capacity of the Gaussian two-pair fullduplex directional (or two-way) relay network with a single-relay supporting the communication of the pairs. This network is a generalization of the well known bidirectional relay channel, where we have only one pair of users. We propose a novel transmission technique which is based on a specific superposition of lattice codes and random Gaussian codes at the source nodes. The relay attempts to decode the Gaussian codewords and the superposition of the lattice codewords of each pair. Then it forwards this information to all users. We analyze the achievable rate of this scheme and show that for all channel gains it achieves to within 2 bits/sec/Hz per user of the cut-set upper bound on the capacity region of the two-pair bidirectional relay network.
  • Keywords
    Gaussian channels; random codes; source coding; Gaussian codewords; approximate capacity region; bidirectional Gaussian relay network; bidirectional relay channel; channel gains; lattice codes; random Gaussian codes; source nodes; Bidirectional control; Bit error rate; Decoding; Differential equations; Error analysis; Information theory; Lattices; Network coding; Relays; 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.5205584
  • Filename
    5205584