• DocumentCode
    3065600
  • Title

    Capacity of a class of broadcast relay channels

  • Author

    Behboodi, Arash ; Piantanida, Pablo

  • Author_Institution
    Dept. of Telecommun., SUPELEC, Gif-sur-Yvette, France
  • fYear
    2010
  • fDate
    13-18 June 2010
  • Firstpage
    590
  • Lastpage
    594
  • Abstract
    Consider the broadcast relay channel (BRC) which consists of a source sending information over a two user broadcast channel in presence of two relay nodes that help the transmission to the destinations. Clearly, this network with five nodes involves all the problems encountered in relay and broadcast channels. New inner bounds on the capacity region of this class of channels are derived. These results can be seen as a generalization and hence unification of previous work in this topic. Our bounds are based on the idea of recombination of message bits and various effective coding strategies for relay and broadcast channels. Capacity result is obtained for the semi-degraded BRC-CR, where one relay channel is degraded while the other one is reversely degraded. An inner and upper bound is also presented for the degraded BRC with common relay (BRC-CR), where both the relay and broadcast channel are degraded which is the capacity for the Gaussian case. Application of these results arise in the context of opportunistic cooperation of cellular networks.
  • Keywords
    Gaussian channels; broadcast channels; cellular radio; channel capacity; channel coding; Gaussian case channel capacity; broadcast relay channel capacity; cellular networks; channel coding strategy; inner bound; relay channel coding; relay nodes; semidegraded BRC-CR; upper bound; Broadcasting; Channel capacity; Decoding; Degradation; Fading; Land mobile radio cellular systems; Region 8; Relays; Stochastic processes; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
  • Conference_Location
    Austin, TX
  • Print_ISBN
    978-1-4244-7890-3
  • Electronic_ISBN
    978-1-4244-7891-0
  • Type

    conf

  • DOI
    10.1109/ISIT.2010.5513531
  • Filename
    5513531