General and new inner bound for multiple-access relay channel and two certain capacity theorems

In this study, the authors obtain a general and new achievable rate region and some certain capacity theorems for multiple-access relay channel (MARC), using partial decode-and-forward (PDF) strategy at the relay, superposition coding at the transmitters and multiple-access and relay channel (RC) decoding schemes. (a) The authors general rate region (i) generalises the achievability part of Slepian-Wolf multiple-access capacity theorem to the MARC, (ii) extends the Cover-El Gamal best achievable rate for the RC with PDF strategy to the MARC, (iii) gives the Kramer-Wijengaarden anticipated rate region for the MARC and (iv) meets max-flow min-cut outer bound for some important classes of the MARC. (b) They extend the results to the Gaussian case as an important practical aspect of MARC and obtain (v) a general and new achievable rate region for Gaussian Slepian-Wolf MARC. Finally, they evaluate their inner bounds for Gaussian MARC numerically, and illustrate specifically that when the relay is closer to the transmitters, their rates are greater than the previous corresponding rates.

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

[2]  Andrea J. Goldsmith,et al.  Study of Gaussian Relay Channels with Correlated Noises , 2010, IEEE Transactions on Communications.

[3]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[4]  Mohammad Reza Aref,et al.  New achievable rate and a certain capacity result for a stochastic two relay network with no interference , 2009, IET Commun..

[5]  M.R. Aref,et al.  Capacity of a more general glass of relay channels , 2008, 2008 International Symposium on Information Theory and Its Applications.

[6]  Gerhard Kramer,et al.  Hierarchical sensor networks: capacity bounds and cooperative strategies using the multiple-access relay channel model , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[7]  Lalitha Sankar,et al.  RELAY COOPERATION IN MULTIACCESS NETWORKS , 2007 .

[8]  T. Cover.  Some Advances in Broadcast Channels , 1975 .

[9]  Young-Han Kim.  Capacity of a Class of Deterministic Relay Channels , 2008, IEEE Trans. Inf. Theory.

[10]  Aaron D. Wyner,et al.  Recent results in the Shannon theory , 1974, IEEE Trans. Inf. Theory.

[11]  Ralf Koetter,et al.  Rate regions for multiple access relay channels with relay-source feedback , 2009, 2009 IEEE Information Theory Workshop.

[12]  Wei Yu,et al.  Capacity of a Class of Modulo-Sum Relay Channels , 2007, IEEE Transactions on Information Theory.

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

[14]  Mohammad Reza Aref,et al.  The capacity of the semideterministic relay channel , 1982, IEEE Trans. Inf. Theory.

[15]  Mohammad Reza Aref,et al.  Unified approach to the capacity evaluation of the relay channel , 2009, IET Commun..

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

[17]  D. Slepian,et al.  A coding theorem for multiple access channels with correlated sources , 1973 .