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

Adnan Raja, Pramod Viswanath

Research output: Contribution to journalArticle

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

Fingerprint

Decoding
Network coding
coding
Computer science
Wireless networks
information flow
computer science

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

Cite this

Compress-and-forward scheme for relay networks : Backword decoding and connection to bisubmodular flows. / Raja, Adnan; Viswanath, Pramod.

In: IEEE Transactions on Information Theory, Vol. 60, No. 9, 6858021, 09.2014, p. 5627-5638.

Research output: Contribution to journalArticle

@article{f3cbdb1566af49f7beed49e484a44594,
title = "Compress-and-forward scheme for relay networks: Backword decoding and connection to bisubmodular flows",
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.",
keywords = "Wireless communication, bisubmodular flows, capacity, max flow min-cut, relay networks",
author = "Adnan Raja and Pramod Viswanath",
year = "2014",
month = "9",
doi = "10.1109/TIT.2014.2334328",
language = "English (US)",
volume = "60",
pages = "5627--5638",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

TY - JOUR

T1 - Compress-and-forward scheme for relay networks

T2 - Backword decoding and connection to bisubmodular flows

AU - Raja, Adnan

AU - Viswanath, Pramod

PY - 2014/9

Y1 - 2014/9

N2 - 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.

AB - 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.

KW - Wireless communication

KW - bisubmodular flows

KW - capacity

KW - max flow min-cut

KW - relay networks

UR - http://www.scopus.com/inward/record.url?scp=84906707853&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84906707853&partnerID=8YFLogxK

U2 - 10.1109/TIT.2014.2334328

DO - 10.1109/TIT.2014.2334328

M3 - Article

AN - SCOPUS:84906707853

VL - 60

SP - 5627

EP - 5638

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 9

M1 - 6858021

ER -