General and new inner bound for multiple‐access relay channel and two certain capacity theorems
Open Access
- 1 September 2013
- journal article
- research article
- Published by Institution of Engineering and Technology (IET) in IET Communications
- Vol. 7 (13) , 1348-1359
Abstract
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.Keywords
This publication has 16 references indexed in Scilit:
- New achievable rate and a certain capacity result for a stochastic two relay network with no interferenceIET Communications, 2009
- Unified approach to the capacity evaluation of the relay channelIET Communications, 2009
- Rate regions for multiple access relay channels with relay-source feedback2009
- On the Discrete Memoryless Relay Channel with Relay-Transmitter Feedback2006
- Cooperative strategies and capacity theorems for relay networksIEEE Transactions on Information Theory, 2005
- Writing on dirty paper (Corresp.)IEEE Transactions on Information Theory, 1983
- The capacity of the semideterministic relay channel (Corresp.)IEEE Transactions on Information Theory, 1982
- Capacity theorems for the relay channelIEEE Transactions on Information Theory, 1979
- A Coding Theorem for Multiple Access Channels With Correlated SourcesBell System Technical Journal, 1973
- Three-terminal communication channelsAdvances in Applied Probability, 1971