Bounds on the information capacity of a broadcast channel with quantizing receivers

Christian D. Chapman, Adam R. Margetts, Daniel Bliss

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

A base node seeks to receive to a broadcast. The base is too far away to observe the broadcast itself, and instead listens through a LAN to several helper nodes which can hear the broadcast. The helpers want to convey exactly what they hear back to base, but the LAN constrains the sum of the data rates from helper to base so the helpers must quantize. A capacity for the system exists but is very difficult to reach. Bounds are found on the capacity of such a system with channel state information available at the helpers and in interference environments where the receivers experience correlated noise. The bounds are tight when the LANs constraint is very high or low. Trials of the bounds reveal that while the systems capacity is stable varying the ratio of scattered-path to line-of-sight signal power seen at the helpers, strategies for achieving the capacity must change.

Original languageEnglish (US)
Title of host publicationConference Record - Asilomar Conference on Signals, Systems and Computers
PublisherIEEE Computer Society
Pages281-285
Number of pages5
Volume2016-February
ISBN (Print)9781467385763
DOIs
StatePublished - Feb 26 2016
Event49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 - Pacific Grove, United States
Duration: Nov 8 2015Nov 11 2015

Other

Other49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
CountryUnited States
CityPacific Grove
Period11/8/1511/11/15

Fingerprint

Channel capacity
Local area networks
Channel state information

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing

Cite this

Chapman, C. D., Margetts, A. R., & Bliss, D. (2016). Bounds on the information capacity of a broadcast channel with quantizing receivers. In Conference Record - Asilomar Conference on Signals, Systems and Computers (Vol. 2016-February, pp. 281-285). [7421131] IEEE Computer Society. https://doi.org/10.1109/ACSSC.2015.7421131

Bounds on the information capacity of a broadcast channel with quantizing receivers. / Chapman, Christian D.; Margetts, Adam R.; Bliss, Daniel.

Conference Record - Asilomar Conference on Signals, Systems and Computers. Vol. 2016-February IEEE Computer Society, 2016. p. 281-285 7421131.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chapman, CD, Margetts, AR & Bliss, D 2016, Bounds on the information capacity of a broadcast channel with quantizing receivers. in Conference Record - Asilomar Conference on Signals, Systems and Computers. vol. 2016-February, 7421131, IEEE Computer Society, pp. 281-285, 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015, Pacific Grove, United States, 11/8/15. https://doi.org/10.1109/ACSSC.2015.7421131
Chapman CD, Margetts AR, Bliss D. Bounds on the information capacity of a broadcast channel with quantizing receivers. In Conference Record - Asilomar Conference on Signals, Systems and Computers. Vol. 2016-February. IEEE Computer Society. 2016. p. 281-285. 7421131 https://doi.org/10.1109/ACSSC.2015.7421131
Chapman, Christian D. ; Margetts, Adam R. ; Bliss, Daniel. / Bounds on the information capacity of a broadcast channel with quantizing receivers. Conference Record - Asilomar Conference on Signals, Systems and Computers. Vol. 2016-February IEEE Computer Society, 2016. pp. 281-285
@inproceedings{7f9ef05ebb474caba6b186e4c0c850bc,
title = "Bounds on the information capacity of a broadcast channel with quantizing receivers",
abstract = "A base node seeks to receive to a broadcast. The base is too far away to observe the broadcast itself, and instead listens through a LAN to several helper nodes which can hear the broadcast. The helpers want to convey exactly what they hear back to base, but the LAN constrains the sum of the data rates from helper to base so the helpers must quantize. A capacity for the system exists but is very difficult to reach. Bounds are found on the capacity of such a system with channel state information available at the helpers and in interference environments where the receivers experience correlated noise. The bounds are tight when the LANs constraint is very high or low. Trials of the bounds reveal that while the systems capacity is stable varying the ratio of scattered-path to line-of-sight signal power seen at the helpers, strategies for achieving the capacity must change.",
author = "Chapman, {Christian D.} and Margetts, {Adam R.} and Daniel Bliss",
year = "2016",
month = "2",
day = "26",
doi = "10.1109/ACSSC.2015.7421131",
language = "English (US)",
isbn = "9781467385763",
volume = "2016-February",
pages = "281--285",
booktitle = "Conference Record - Asilomar Conference on Signals, Systems and Computers",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Bounds on the information capacity of a broadcast channel with quantizing receivers

AU - Chapman, Christian D.

AU - Margetts, Adam R.

AU - Bliss, Daniel

PY - 2016/2/26

Y1 - 2016/2/26

N2 - A base node seeks to receive to a broadcast. The base is too far away to observe the broadcast itself, and instead listens through a LAN to several helper nodes which can hear the broadcast. The helpers want to convey exactly what they hear back to base, but the LAN constrains the sum of the data rates from helper to base so the helpers must quantize. A capacity for the system exists but is very difficult to reach. Bounds are found on the capacity of such a system with channel state information available at the helpers and in interference environments where the receivers experience correlated noise. The bounds are tight when the LANs constraint is very high or low. Trials of the bounds reveal that while the systems capacity is stable varying the ratio of scattered-path to line-of-sight signal power seen at the helpers, strategies for achieving the capacity must change.

AB - A base node seeks to receive to a broadcast. The base is too far away to observe the broadcast itself, and instead listens through a LAN to several helper nodes which can hear the broadcast. The helpers want to convey exactly what they hear back to base, but the LAN constrains the sum of the data rates from helper to base so the helpers must quantize. A capacity for the system exists but is very difficult to reach. Bounds are found on the capacity of such a system with channel state information available at the helpers and in interference environments where the receivers experience correlated noise. The bounds are tight when the LANs constraint is very high or low. Trials of the bounds reveal that while the systems capacity is stable varying the ratio of scattered-path to line-of-sight signal power seen at the helpers, strategies for achieving the capacity must change.

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

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

U2 - 10.1109/ACSSC.2015.7421131

DO - 10.1109/ACSSC.2015.7421131

M3 - Conference contribution

AN - SCOPUS:84969760103

SN - 9781467385763

VL - 2016-February

SP - 281

EP - 285

BT - Conference Record - Asilomar Conference on Signals, Systems and Computers

PB - IEEE Computer Society

ER -