Abstract

A scheme for recovery of a signal by distributed listeners in the presence of Gaussian interference is constructed by exhausting an "iterative power reduction" property. An upper bound for the scheme's achieved mean-squared-error distortion is derived. The strategy exposes a parameter search problem, which, when solved, causes the scheme to outperform others of its kind. Performance of a blocklength-one scheme is simulated and is seen to improve over plain source coding without compression in the presence of many interferers, and experiences less outages over ensembles of channels.

Original languageEnglish (US)
Article number845
JournalEntropy
Volume21
Issue number9
DOIs
StatePublished - Jan 1 2019

Fingerprint

exhausting
plains
coding
recovery
interference
causes

Keywords

  • Distributed source coding
  • Lattice codes
  • Network information theory

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Cite this

Distributed recovery of a Gaussian source in interference with successive lattice processing. / Chapman, Christian; Kinsinger, Matthew; Agaskar, Ameya; Bliss, Daniel.

In: Entropy, Vol. 21, No. 9, 845, 01.01.2019.

Research output: Contribution to journalArticle

Chapman, Christian ; Kinsinger, Matthew ; Agaskar, Ameya ; Bliss, Daniel. / Distributed recovery of a Gaussian source in interference with successive lattice processing. In: Entropy. 2019 ; Vol. 21, No. 9.
@article{f9ab7789ecba4622839018e068295e71,
title = "Distributed recovery of a Gaussian source in interference with successive lattice processing",
abstract = "A scheme for recovery of a signal by distributed listeners in the presence of Gaussian interference is constructed by exhausting an {"}iterative power reduction{"} property. An upper bound for the scheme's achieved mean-squared-error distortion is derived. The strategy exposes a parameter search problem, which, when solved, causes the scheme to outperform others of its kind. Performance of a blocklength-one scheme is simulated and is seen to improve over plain source coding without compression in the presence of many interferers, and experiences less outages over ensembles of channels.",
keywords = "Distributed source coding, Lattice codes, Network information theory",
author = "Christian Chapman and Matthew Kinsinger and Ameya Agaskar and Daniel Bliss",
year = "2019",
month = "1",
day = "1",
doi = "10.3390/e21090845",
language = "English (US)",
volume = "21",
journal = "Entropy",
issn = "1099-4300",
publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",
number = "9",

}

TY - JOUR

T1 - Distributed recovery of a Gaussian source in interference with successive lattice processing

AU - Chapman, Christian

AU - Kinsinger, Matthew

AU - Agaskar, Ameya

AU - Bliss, Daniel

PY - 2019/1/1

Y1 - 2019/1/1

N2 - A scheme for recovery of a signal by distributed listeners in the presence of Gaussian interference is constructed by exhausting an "iterative power reduction" property. An upper bound for the scheme's achieved mean-squared-error distortion is derived. The strategy exposes a parameter search problem, which, when solved, causes the scheme to outperform others of its kind. Performance of a blocklength-one scheme is simulated and is seen to improve over plain source coding without compression in the presence of many interferers, and experiences less outages over ensembles of channels.

AB - A scheme for recovery of a signal by distributed listeners in the presence of Gaussian interference is constructed by exhausting an "iterative power reduction" property. An upper bound for the scheme's achieved mean-squared-error distortion is derived. The strategy exposes a parameter search problem, which, when solved, causes the scheme to outperform others of its kind. Performance of a blocklength-one scheme is simulated and is seen to improve over plain source coding without compression in the presence of many interferers, and experiences less outages over ensembles of channels.

KW - Distributed source coding

KW - Lattice codes

KW - Network information theory

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

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

U2 - 10.3390/e21090845

DO - 10.3390/e21090845

M3 - Article

AN - SCOPUS:85071942268

VL - 21

JO - Entropy

JF - Entropy

SN - 1099-4300

IS - 9

M1 - 845

ER -