Slepian-Wolf Coding over Cooperative Networks

TL;DR

This paper establishes sufficient conditions for multicasting correlated sources over cooperative networks using a joint source-Wyner-Ziv coding scheme, providing new insights into achievable rate regions and relay network communication.

Contribution

It introduces a novel joint source-Wyner-Ziv encoding and sliding-window decoding scheme with a geometrical approach to determine feasibility conditions for cooperative networks.

Findings

Derived sufficient conditions for multicasting correlated sources.

Established an achievable rate region for multicast networks.

Provided an achievability result for two-way relay networks.

Abstract

We present sufficient conditions for multicasting a set of correlated sources over cooperative networks. We propose joint source-Wyner-Ziv encoding/sliding-window decoding scheme, in which each receiver considers an ordered partition of other nodes. Subject to this scheme, we obtain a set of feasibility constraints for each ordered partition. We consolidate the results of different ordered partitions by utilizing a result of geometrical approach to obtain the sufficient conditions. We observe that these sufficient conditions are indeed necessary conditions for Aref networks. As a consequence of the main result, we obtain an achievable rate region for networks with multicast demands. Also, we deduce an achievability result for two-way relay networks, in which two nodes want to communicate over a relay network.