On Distributed Lossy Coding of Symmetrically Correlated Gaussian Sources
Lists
Only you see this
Abstract
A distributed lossy compression network with $L$ encoders and a decoder is considered. Each encoder observes a source and sends a compressed version to the decoder. The decoder produces a joint reconstruction of target signals with the mean squared error distortion below a given threshold. It is assumed that the observed sources can be expressed as the sum of target signals and corruptive noises which are independently generated from two symmetric multivariate Gaussian distributions. The minimum compression rate of this network versus the distortion threshold is referred to as the rate-distortion function, for which an explicit lower bound is established by solving a minimization problem. Our lower bound matches the well-known Berger-Tung upper bound for some values of the distortion threshold. The asymptotic gap between the upper and lower bounds is characterized in the large $L$ limit.
BibTeX
@inproceedings{zhou2022distributed,
author = {Siyao Zhou and Sadaf Salehkalaibar and Jingjing Qian and Jun Chen and Wuxian Shi and Yiqun Ge and Wen Tong},
title = {{On Distributed Lossy Coding of Symmetrically Correlated Gaussian Sources}},
booktitle = {CISS},
year = {2022},
url = {https://openreview.net/forum?id=OBpmT1fzkJ9n},
}| Generalized Gaussian Multiterminal Source Coding: The Symmetric Case | arXiv · 2017 |
| Robust Distributed Compression of Symmetrically Correlated Gaussian Sources | arXiv · 2018 |
| The Price of Distributed: Rate Loss in the CEO Problem | arXiv · 2022 |
| Generalized Gaussian Multiterminal Source Coding in the High-Resolution Regime | arXiv · 2019 |
| Shannon Bounds for Quadratic Rate-Distortion Problems | IEEE Journal on Selected Areas in Information Theory · 2024 |
| Distortion Bounds for Transmitting Correlated Sources with Common Part over MAC | arXiv · 2016 |