Approximately optimal wireless broadcasting

Sreeram Kannan, Adnan Raja, Pramod Viswanath

Research output: Contribution to journalArticle

Abstract

We study a wireless broadcast network, where a single source reliably communicates independent messages to multiple destinations, with the potential aid of relays and cooperation between destinations. The wireless nature of the medium is captured by the broadcast nature of transmissions as well as the superposition of transmitted signals plus independent Gaussian noise at the received signal at any radio. We propose a scheme that can achieve rate tuples within a constant gap away from the cut-set bound, where the constant is independent of channel coefficients and power constraints. First, for a deterministic broadcast network, we propose a new coding scheme, constructed by adopting a receiver-centric viewpoint, that uses quantize-and-forward relaying as an inner code concatenated with an outer Marton code for the induced deterministic broadcast channel. This scheme is shown to achieve the cut-set bound evaluated with product form distributions. This result is then lifted to the Gaussian network by using a deterministic network called the discrete superposition network as a formal quantization interface. This two-stage construction circumvents the difficulty involved in working with a vector nonlinear non-Gaussian broadcast channel that arises if we construct a similar scheme directly for the Gaussian network.

Original languageEnglish (US)
Article number6259856
Pages (from-to)7154-7167
Number of pages14
JournalIEEE Transactions on Information Theory
Volume58
Issue number12
DOIs
StatePublished - Nov 26 2012

Fingerprint

broadcasting
Broadcasting
broadcast
Concatenated codes
Wireless networks
coding
radio
recipient

Keywords

  • Broadcast network
  • Marton code
  • broadcast-relay channels
  • capacity
  • multiuser channels
  • network information theory
  • wireless networks

ASJC Scopus subject areas

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

Cite this

Approximately optimal wireless broadcasting. / Kannan, Sreeram; Raja, Adnan; Viswanath, Pramod.

In: IEEE Transactions on Information Theory, Vol. 58, No. 12, 6259856, 26.11.2012, p. 7154-7167.

Research output: Contribution to journalArticle

Kannan, Sreeram ; Raja, Adnan ; Viswanath, Pramod. / Approximately optimal wireless broadcasting. In: IEEE Transactions on Information Theory. 2012 ; Vol. 58, No. 12. pp. 7154-7167.
@article{61bb8c12cf794c7ea5e21cb892b0557c,
title = "Approximately optimal wireless broadcasting",
abstract = "We study a wireless broadcast network, where a single source reliably communicates independent messages to multiple destinations, with the potential aid of relays and cooperation between destinations. The wireless nature of the medium is captured by the broadcast nature of transmissions as well as the superposition of transmitted signals plus independent Gaussian noise at the received signal at any radio. We propose a scheme that can achieve rate tuples within a constant gap away from the cut-set bound, where the constant is independent of channel coefficients and power constraints. First, for a deterministic broadcast network, we propose a new coding scheme, constructed by adopting a receiver-centric viewpoint, that uses quantize-and-forward relaying as an inner code concatenated with an outer Marton code for the induced deterministic broadcast channel. This scheme is shown to achieve the cut-set bound evaluated with product form distributions. This result is then lifted to the Gaussian network by using a deterministic network called the discrete superposition network as a formal quantization interface. This two-stage construction circumvents the difficulty involved in working with a vector nonlinear non-Gaussian broadcast channel that arises if we construct a similar scheme directly for the Gaussian network.",
keywords = "Broadcast network, Marton code, broadcast-relay channels, capacity, multiuser channels, network information theory, wireless networks",
author = "Sreeram Kannan and Adnan Raja and Pramod Viswanath",
year = "2012",
month = "11",
day = "26",
doi = "10.1109/TIT.2012.2211566",
language = "English (US)",
volume = "58",
pages = "7154--7167",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "12",

}

TY - JOUR

T1 - Approximately optimal wireless broadcasting

AU - Kannan, Sreeram

AU - Raja, Adnan

AU - Viswanath, Pramod

PY - 2012/11/26

Y1 - 2012/11/26

N2 - We study a wireless broadcast network, where a single source reliably communicates independent messages to multiple destinations, with the potential aid of relays and cooperation between destinations. The wireless nature of the medium is captured by the broadcast nature of transmissions as well as the superposition of transmitted signals plus independent Gaussian noise at the received signal at any radio. We propose a scheme that can achieve rate tuples within a constant gap away from the cut-set bound, where the constant is independent of channel coefficients and power constraints. First, for a deterministic broadcast network, we propose a new coding scheme, constructed by adopting a receiver-centric viewpoint, that uses quantize-and-forward relaying as an inner code concatenated with an outer Marton code for the induced deterministic broadcast channel. This scheme is shown to achieve the cut-set bound evaluated with product form distributions. This result is then lifted to the Gaussian network by using a deterministic network called the discrete superposition network as a formal quantization interface. This two-stage construction circumvents the difficulty involved in working with a vector nonlinear non-Gaussian broadcast channel that arises if we construct a similar scheme directly for the Gaussian network.

AB - We study a wireless broadcast network, where a single source reliably communicates independent messages to multiple destinations, with the potential aid of relays and cooperation between destinations. The wireless nature of the medium is captured by the broadcast nature of transmissions as well as the superposition of transmitted signals plus independent Gaussian noise at the received signal at any radio. We propose a scheme that can achieve rate tuples within a constant gap away from the cut-set bound, where the constant is independent of channel coefficients and power constraints. First, for a deterministic broadcast network, we propose a new coding scheme, constructed by adopting a receiver-centric viewpoint, that uses quantize-and-forward relaying as an inner code concatenated with an outer Marton code for the induced deterministic broadcast channel. This scheme is shown to achieve the cut-set bound evaluated with product form distributions. This result is then lifted to the Gaussian network by using a deterministic network called the discrete superposition network as a formal quantization interface. This two-stage construction circumvents the difficulty involved in working with a vector nonlinear non-Gaussian broadcast channel that arises if we construct a similar scheme directly for the Gaussian network.

KW - Broadcast network

KW - Marton code

KW - broadcast-relay channels

KW - capacity

KW - multiuser channels

KW - network information theory

KW - wireless networks

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

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

U2 - 10.1109/TIT.2012.2211566

DO - 10.1109/TIT.2012.2211566

M3 - Article

AN - SCOPUS:84869461242

VL - 58

SP - 7154

EP - 7167

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 12

M1 - 6259856

ER -