New coding strategies for the relay channel

This paper studies coding strategies for a three-node relay channel. We first review the basic coding strategies of Cover and El Gamal for the relay channel. Next, two new coding strategies superimposing cooperation and facilitation are developed. One of the coding strategies is shown to include the generalized strategy of Cover and El Gamal. For certain parameters of the Gaussian relay channel, the two new strategies give higher achievable rates than the generalized strategy of Cover and El Gamal

[1]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[2]  Federico Kuhlmann,et al.  Achievability proof of some multiuser channel coding theorems using backward decoding , 1989, IEEE Trans. Inf. Theory.

[3]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[4]  Te Sun Han,et al.  A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.

[5]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.