Compress-and-forward scheme for relay networks: Backword decoding and connection to bisubmodular flows

Adnan Raja, Pramod Viswanath

Research output: Contribution to journalArticlepeer-review

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 (NNC) scheme. While it achieves the same reliable data rate as NNC scheme, the backward decoding allows for a better decoding complexity as compared with 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 presented. 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.

Original languageEnglish (US)
Article number6858021
Pages (from-to)5627-5638
Number of pages12
JournalIEEE Transactions on Information Theory
Volume60
Issue number9
DOIs
StatePublished - Sep 2014

Keywords

  • Wireless communication
  • bisubmodular flows
  • capacity
  • max flow min-cut
  • relay networks

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'Compress-and-forward scheme for relay networks: Backword decoding and connection to bisubmodular flows'. Together they form a unique fingerprint.

Cite this