Distributed recovery of a Gaussian source in interference with successive lattice processing
Name
entropy-21-00845-v2.pdf
Size
1.6 MB
Format
Adobe PDF
Checksum (MD5)
274dd367b1beeb353dab13696e74ead3
Author(s)
Chapman, Christian
Kinsinger, Matthew
Agaskar, Ameya P.
Bliss, Daniel W.
Date Issued
August 2019
Journal
Entropy
Publisher
Multidisciplinary Digital Publishing Institute
Citation
Chapman, Christian, Matthew Kinsinger, Ameya P. Agaskar, and Daniel W. Bliss, "Distributed recovery of a Gaussian source in interference with successive lattice processing." Entropy 21, 9 (2019): no. 845 doi 10.3390/e21090845 ©2019 Author(s)
Version
Final published version
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: network information theory; distributed source coding; lattice codes
MIT Department
Lincoln Laboratory
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.3390/e21090845
