• DocumentCode
    3502961
  • Title

    On the capacity of the noncausal relay channel

  • Author

    Wang, Lele ; Naghshvar, Mohammad

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of California San Diego, La Jolla, CA, USA
  • fYear
    2011
  • fDate
    July 31 2011-Aug. 5 2011
  • Firstpage
    1347
  • Lastpage
    1351
  • Abstract
    This paper studies the noncausal relay channel, also known as the relay channel with unlimited lookahead, introduced by El Gamal, Hassanpour, and Mammen. Unlike the standard relay channel model, where the relay encodes its signal based on the previous received output symbols, the relay in the noncausal relay channel encodes its signal as a function of the entire received sequence. In the existing coding schemes, the relay uses this noncausal information solely to recover the transmitted message and then cooperates with the sender to communicate this message to the receiver. However, it is shown in this paper that by applying the Gelfand-Pinsker coding scheme, the relay can take further advantage of the noncausally available information, which can achieve strictly higher rates than existing coding schemes. This paper also provides a new upper bound on the capacity of the noncausal relay that strictly improves upon the cutset bound. These new lower and upper bounds on the capacity coincide for the class of degraded noncausal relay channels and establish the capacity for this class.
  • Keywords
    channel capacity; channel coding; Gelfand-Pinsker coding scheme; coding schemes; cutset bound; noncausal information; noncausal relay channel capacity; relay signal encoding; transmitted message recovery; unlimited lookahead; Decoding; Encoding; Markov processes; Receivers; Relays; Resource description framework; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
  • Conference_Location
    St. Petersburg
  • ISSN
    2157-8095
  • Print_ISBN
    978-1-4577-0596-0
  • Electronic_ISBN
    2157-8095
  • Type

    conf

  • DOI
    10.1109/ISIT.2011.6033757
  • Filename
    6033757