On Joint Source-Channel Coding for Correlated Sources Over Multiple-Access Relay Channels

DOI10.1109/TIT.2014.2343626zbMATH Open1360.94208arXiv1407.7103MaRDI QIDQ2986100FDOQ2986100

Authors: Yonathan Murin, Ron Dabora, Deniz Gunduz

Publication date: 16 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We study the transmission of correlated sources over discrete memoryless (DM) multiple-access-relay channels (MARCs), in which both the relay and the destination have access to side information arbitrarily correlated with the sources. As the optimal transmission scheme is an open problem, in this work we propose a new joint source-channel coding scheme based on a novel combination of the correlation preserving mapping (CPM) technique with Slepian-Wolf (SW) source coding, and obtain the corresponding sufficient conditions. The proposed coding scheme is based on the decode-and-forward strategy, and utilizes CPM for encoding information simultaneously to the relay and the destination, whereas the cooperation information from the relay is encoded via SW source coding. It is shown that there are cases in which the new scheme strictly outperforms the schemes available in the literature. This is the first instance of a source-channel code that uses CPM for encoding information to two different nodes (relay and destination). In addition to sufficient conditions, we present three different sets of single-letter necessary conditions for reliable transmission of correlated sources over DM MARCs. The newly derived conditions are shown to be at least as tight as the previously known necessary conditions.

Full work available at URL: https://arxiv.org/abs/1407.7103

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (5)

This page was built for publication: On Joint Source-Channel Coding for Correlated Sources Over Multiple-Access Relay Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986100)