Compress-and-Forward Scheme for Relay Networks: Backword Decoding and Connection to Bisubmodular Flows

DOI10.1109/TIT.2014.2334328zbMATH Open1360.94445arXiv1012.0416OpenAlexW2007494434MaRDI QIDQ2986172FDOQ2986172

Authors: Adnan Raja, P. Viswanath 

Publication date: 16 May 2017

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

Abstract: In this paper, a compress-and-forward scheme with backward decoding is presented for the unicast wireless relay network. The encoding at the source and relay is a generalization of the noisy network coding scheme (NNC). While it achieves the same reliable data rate as noisy network coding scheme, the backward decoding allows for a better decoding complexity as compared to the joint decoding of the NNC scheme. Characterizing the layered decoding scheme is shown to be equivalent to characterizing an information flow for the wireless network. A node-flow for a graph with bisubmodular capacity constraints is presented and a max-flow min-cut theorem is proved for it. This generalizes many well-known results of flows over capacity constrained graphs studied in computer science literature. The results for the unicast relay network are generalized to the network with multiple sources with independent messages intended for a single destination.

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

Mathematics Subject Classification ID

Decoding (94B35)

Cited In (2)

• Exploiting the <inline-formula> <tex-math notation="LaTeX">$N$ </tex-math></inline-formula>-to-1 Mapping in Compress-and-Forward Relaying
• Compress-Forward Coding With BPSK Modulation for the Half-Duplex Gaussian Relay Channel

This page was built for publication: Compress-and-Forward Scheme for Relay Networks: Backword Decoding and Connection to Bisubmodular Flows

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