A new general inner bound for multiple-access relay channel with non-causal side information at one encoder and common message

A general achievable rate region and two certain capacity regions for Slepian–Wolf multiple‐access relay channel with non‐causal side information at one encoder

“…As we mentioned in previous sections, none of which has been proved to be optimal. Figure 6, illustrated a situation that the coding used in this paper is better than coding studied in [43].…”

“…As can be easily seen our results can be reduced to the results in [41], as we mentioned in corollary 16. Finally, we compare the private achievable rate region of the informed encoder (R 2 ) for the Gaussian MARC with using the irregular block Markov encoding and successive decoding studied in this paper and the regular block Markov encoding and backward decoding studied in [43], Figure 6,when…”

“…To obtain the capacity inner bound for the MARC three different strategies can be used: irregular encoding successive decoding, regular encoding backward decoding and regular encoding sliding‐window decoding, none of which has been proved to be optimal. In [43], regular block Markov encoding and backward decoding have been used to study the effect of non‐causal side information available at one encoder on the achievable rate region of discrete memoryless MARC, however, in the present paper, the irregular block Markov encoding and successive decoding are used to achieve a capacity inner bound by appropriately applying binning scheme, superposition coding, Markov block encoding and Gel'fand–Pinsker method. As easily seen, in the presence of side information non‐causally known at one encoder, none of these achievable rate regions includes the other.…”

“…Researchers extensively studied the capacity inner bound for MARC with coding strategies of DF, CF and amplify and forward (AF) in [38], [39] and [40]. A new achievable rate region for Slepian-Wolf MARC was derived in [41], also, the capacity inner bounds for discrete and memoryless MARC with partial decode and forward (PDF) strategy and regular block Markov coding/backward decoding with and without non-causal SI known at one transmitter were obtained in [42] and [43], respectively. The capacity inner bound for DM-MARC with non-causal SI known at the relay and its extension to Gaussian case was studied in [44].…”

Effects of relay and side information at one encoder on the coverage regions in Gaussian multiple‐access channel

“…In our previous work, 16 we studied the capacity inner bound for discrete memoryless MARC (DM-MARC) in the presence of noncausal SI available at one source with using PDF strategy at the relay. Due to the practical importance of analysis of communications performances such as coverage region and energy efficiency, in the present article, our previous achievable rate region is extended to the general Gaussian multiple-access relay channel (GMARC) with SI known noncausally only at one encoder by using general dirty paper coding (GDPC).…”