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

Author(s)
Chapman, Christian; Kinsinger, Matthew; Agaskar, Ameya P.; Bliss, Daniel W.
Thumbnail
Downloadentropy-21-00845-v2.pdf (1.596Mb)
Publisher with Creative Commons License
Terms of use
Metadata
Show full item record
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
Date issued
2019-08
URI
https://hdl.handle.net/1721.1/125370
Department
Lincoln Laboratory
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
ISSN
1099-4300
Collections