Loading...

Achievable rate regions for relay channel with private messages with states known at the source

Akhbari, B ; Sharif University of Technology

581 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ICITIS.2010.5689739
  3. Abstract:
  4. In this paper, we consider State-Dependent Relay Channel with Private Messages (SD-RCPM) as a generalization of the state-dependent relay channel, where the relay is both a source and a sink of data. We assume that the channel state is known only to the source and investigate two main cases: SD-RCPM with non-causal Channel State Information (CSI), and SD-RCPM with causal CSI. For non-causal case, we propose a coding scheme based on Gel'fand-Pinsker type coding at the source which is informed of CSI, and Decode-and-Forward (DF) scheme at the relay. Using Shannon's strategy and DF scheme, we also propose a coding strategy for the causal case. Based on these coding strategies, we derive new achievable rate regions for this channel. Under special conditions, the derived achievable rate regions reduce to some previously known results. We also extend these achievable rate regions to Gaussian case. Providing numerical examples for the Gaussian case, we compare the derived achievable rate regions for different channel conditions
  5. Keywords:
  6. Gel'fand-pinsker coding ; Achievable rate region ; Channel conditions ; Channel state ; Coding scheme ; Coding strategy ; Decode-and-forward ; Gaussians ; Numerical example ; Relay channel ; Relay channels ; Shannon's strategy ; State-dependent ; State-dependent channels ; Gels ; Information theory ; Security of data ; Channel state information
  7. Source: ; Proceedings 2010 IEEE International Conference on Information Theory and Information Security, ICITIS 2010, 17 December 2010 through 19 December 2010 , 2010 , Pages 1080-1087 ; 9781424469406 (ISBN)
  8. URL: http://ieeexplore.ieee.org/document/5689739