State-Dependent Relay Channel with Private Messages with partial causal and non-causal Channel State Information

Abstract

In this paper, we introduce a discrete memoryless State-Dependent Relay\nChannel with Private Messages (SD-RCPM) as a generalization of the\nstate-dependent relay channel. We investigate two main cases: SD-RCPM with\nnon-causal Channel State Information (CSI), and SD-RCPM with causal CSI. In\neach case, it is assumed that partial CSI is available at the source and relay.\nFor non-causal case, we establish an achievable rate region using\nGel'fand-Pinsker type coding scheme at the nodes informed of CSI, and\nCompress-and-Forward (CF) scheme at the relay. Using Shannon's strategy and CF\nscheme, an achievable rate region for causal case is obtained. As an example,\nthe Gaussian version of SD-RCPM is considered, and an achievable rate region\nfor Gaussian SD-RCPM with non-causal perfect CSI only at the source, is\nderived. Providing numerical examples, we illustrate the comparison between\nachievable rate regions derived using CF and Decode-and-Forward (DF) schemes.\n