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

TL;DR

This paper introduces a compress-and-forward scheme with backward decoding for wireless relay networks, improving decoding complexity and connecting information flow to bisubmodular capacity constraints, generalizing classical flow results.

Contribution

It proposes a novel backward decoding scheme for relay networks, linking layered decoding to bisubmodular flows and extending max-flow min-cut theorems to complex network scenarios.

Findings

Achieves reliable data rates comparable to noisy network coding.

Backward decoding reduces decoding complexity.

Generalizes flow theorems to bisubmodular capacity constraints.

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.