Source-Channel Coding Theorems for the Multiple-Access Relay Channel

Yonathan Murin, Ron Dabora, Deniz GündüzIEEE Trans. Information Theory 2013 · OpenReview

Abstract

This paper investigates the conditions under which separate source and channel coding is optimal for the Multiple-Access Relay Channel (MARC) with correlated sources and side information. While Shannon's separation theorem generally fails in multi-user networks, we demonstrate that "informational separation" is optimal for specific fading Gaussian environments. By employing irregular block Markov encoding and decode-and-forward relaying, we derive sufficient conditions under which independent design of source and channel codes achieves the theoretical capacity limit in phase-fading and Rayleigh fading scenarios.

Introduction

In classical information theory, the separation of source coding and channel coding is a fundamental principle for point-to-point communication. However, in complex network topologies like the Multiple-Access Relay Channel (MARC), where multiple sources transmit correlated data to a destination via a relay, joint source-channel coding is typically deemed necessary. This work explores the boundaries of this necessity, specifically examining whether separate coding can remain optimal when the relay and destination possess correlated side information.

System Model

The MARC model considered involves two transmitters sending correlated sources $S_1^m$ and $S_2^m$ to a destination, assisted by a relay. Both the relay and the destination have access to side information, $W_3^m$ and $W^m$ respectively, which are correlated with the sources. The relay operates in a decode-and-forward (DF) mode, where it decodes the source messages and forwards information to assist the destination's reconstruction.

Figure 1: Block diagram of the Multiple-Access Relay Channel (MARC) with side information at the relay and destination.

Methods and Theoretical Framework

The analysis utilizes Irregular Block Markov Encoding. Unlike regular encoding, irregular encoding allows for varying transmission rates to the relay and destination, accommodating the different qualities of side information available at each node. Source coding is handled via Slepian-Wolf coding for lossless compression. The system is evaluated under Discrete Memoryless Channel (DMC) models and specifically Gaussian noise models with phase and Rayleigh fading distributions to model real-world wireless signal propagation.

Gaussian MARC and Fading Analysis

The Gaussian MARC is characterized by channel coefficients $H_{ij,k}$ representing the link between node $i$ and node $j$ at time $k$. The received signals at the relay ($Y_3$) and destination ($Y$) are subject to additive white Gaussian noise and fading. The signal flow graph below details the mathematical relationship between transmitted signals and received noise-corrupted signals.

Figure 2: Signal flow graph and channel equations for the fading Gaussian Multiple-Access Relay Channel.

Key Results

The primary contribution is the derivation of conditions under which informational separation is optimal. Key findings include:

  • Optimality in Phase Fading: For phase-fading Gaussian MARCs, separation is shown to be optimal provided the source-to-relay links are sufficiently strong relative to the source-to-destination links.
  • Rayleigh Fading Extension: These results are extended to Rayleigh fading environments, where optimality is defined by a condition involving the exponential integral function $E_1$.
  • Side Information Synergy: Side information at the relay can significantly reduce the required channel capacity, making the relay a more efficient "helper."
  • MABRC Generalization: The authors proved that if the relay's reconstruction requirements are less stringent than the destination's (due to better side information), the MARC results translate directly to the Multiple-Access Broadcast Relay Channel (MABRC).

Conclusion and Future Work

This work establishes that separate source and channel coding is not only a practical design choice but can be theoretically optimal for the MARC under specific fading conditions. However, the study focuses on lossless reconstruction and static fading models. Future research remains to extend these findings to lossy source coding (Rate-Distortion theory) and scenarios where channel state information is imperfect.

Summary updated

Abstract

We study reliable transmission of arbitrarily correlated sources over multiple-access relay channels (MARCs) and multiple-access broadcast relay channels (MABRCs). In MARCs only the destination is interested in reconstructing the sources, while in MABRCs, both the relay and the destination want to reconstruct them. In addition to arbitrary correlation among the source signals at the users, both the relay and the destination have side information correlated with the source signals. Our objective is to determine whether a given pair of sources can be losslessly transmitted to the destination for a given number of channel symbols per source sample, defined as the source-channel rate. Sufficient conditions for reliable communication based on operational separation, as well as necessary conditions on the achievable source-channel rates are characterized. Since operational separation is generally not optimal for MARCs and MABRCs, sufficient conditions for reliable communication using joint source-channel coding schemes based on a combination of the correlation preserving mapping technique with Slepian-Wolf source coding are also derived. For correlated sources transmitted over fading Gaussian MARCs and MABRCs, we present conditions under which separation (i.e., separate and stand-alone source and channel codes) is optimal. This is the first time optimality of separation is proved for MARCs and MABRCs.
BibTeX
@article{murin2013source,
  author = {Yonathan Murin and Ron Dabora and Deniz Gündüz},
  title = {{Source-Channel Coding Theorems for the Multiple-Access Relay Channel}},
  journal = {IEEE Trans. Information Theory},
  year = {2013},
  url = {https://openreview.net/forum?id=lY8HtCf4erJ},
}
Figure