Approximating the rate-distortion region of the distributed source coding for three jointly gaussian tree-structured sources

Mohammad Ali Maddah-Ali; David N.C. Tse

doi:10.1109/ISIT.2009.5205868

Approximating the rate-distortion region of the distributed source coding for three jointly gaussian tree-structured sources

Mohammad Ali Maddah-Ali, David N.C. Tse

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

4 Scopus citations

Abstract

The rate-distortion region for the distributed source coding of the three jointly-Gaussian tree-structured sources with the quadratic distortion measure, is characterized within a constant gap. As a simplified counterpart of the Gaussian problem, we first investigate the rate region of a three binaryexpanded sources where each pair of the sources have a certain number of the most-significant bits in common, and the central decoder needs to reconstruct each source with a target resolution. Motivated by the result of binary-expansion model, we prove that the achievable region of the quantize-and-binning scheme and the outer-bound of the cooperative scheme has a bounded gap of 2:4771 bits.¹

Original language	English (US)
Title of host publication	2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages	1468-1472
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2009.5205868
State	Published - 2009
Externally published	Yes
Event	2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of Duration: Jun 28 2009 → Jul 3 2009

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8102

Other

Other	2009 IEEE International Symposium on Information Theory, ISIT 2009
Country/Territory	Korea, Republic of
City	Seoul
Period	6/28/09 → 7/3/09

Publisher link

10.1109/ISIT.2009.5205868

Find It

Find It at U of M Libraries

Cite this

Maddah-Ali, M. A., & Tse, D. N. C. (2009). Approximating the rate-distortion region of the distributed source coding for three jointly gaussian tree-structured sources. In 2009 IEEE International Symposium on Information Theory, ISIT 2009 (pp. 1468-1472). Article 5205868 (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2009.5205868

Approximating the rate-distortion region of the distributed source coding for three jointly gaussian tree-structured sources. / Maddah-Ali, Mohammad Ali; Tse, David N.C.
2009 IEEE International Symposium on Information Theory, ISIT 2009. 2009. p. 1468-1472 5205868 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Maddah-Ali, MA & Tse, DNC 2009, Approximating the rate-distortion region of the distributed source coding for three jointly gaussian tree-structured sources. in 2009 IEEE International Symposium on Information Theory, ISIT 2009., 5205868, IEEE International Symposium on Information Theory - Proceedings, pp. 1468-1472, 2009 IEEE International Symposium on Information Theory, ISIT 2009, Seoul, Korea, Republic of, 6/28/09. https://doi.org/10.1109/ISIT.2009.5205868

@inproceedings{45a8f29a53434c93a0eea3ea56518f23,

title = "Approximating the rate-distortion region of the distributed source coding for three jointly gaussian tree-structured sources",

abstract = "The rate-distortion region for the distributed source coding of the three jointly-Gaussian tree-structured sources with the quadratic distortion measure, is characterized within a constant gap. As a simplified counterpart of the Gaussian problem, we first investigate the rate region of a three binaryexpanded sources where each pair of the sources have a certain number of the most-significant bits in common, and the central decoder needs to reconstruct each source with a target resolution. Motivated by the result of binary-expansion model, we prove that the achievable region of the quantize-and-binning scheme and the outer-bound of the cooperative scheme has a bounded gap of 2:4771 bits.1",

author = "Maddah-Ali, \{Mohammad Ali\} and Tse, \{David N.C.\}",

year = "2009",

doi = "10.1109/ISIT.2009.5205868",

language = "English (US)",

isbn = "9781424443130",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1468--1472",

booktitle = "2009 IEEE International Symposium on Information Theory, ISIT 2009",

note = "2009 IEEE International Symposium on Information Theory, ISIT 2009 ; Conference date: 28-06-2009 Through 03-07-2009",

}

TY - GEN

T1 - Approximating the rate-distortion region of the distributed source coding for three jointly gaussian tree-structured sources

AU - Maddah-Ali, Mohammad Ali

AU - Tse, David N.C.

PY - 2009

Y1 - 2009

N2 - The rate-distortion region for the distributed source coding of the three jointly-Gaussian tree-structured sources with the quadratic distortion measure, is characterized within a constant gap. As a simplified counterpart of the Gaussian problem, we first investigate the rate region of a three binaryexpanded sources where each pair of the sources have a certain number of the most-significant bits in common, and the central decoder needs to reconstruct each source with a target resolution. Motivated by the result of binary-expansion model, we prove that the achievable region of the quantize-and-binning scheme and the outer-bound of the cooperative scheme has a bounded gap of 2:4771 bits.1

AB - The rate-distortion region for the distributed source coding of the three jointly-Gaussian tree-structured sources with the quadratic distortion measure, is characterized within a constant gap. As a simplified counterpart of the Gaussian problem, we first investigate the rate region of a three binaryexpanded sources where each pair of the sources have a certain number of the most-significant bits in common, and the central decoder needs to reconstruct each source with a target resolution. Motivated by the result of binary-expansion model, we prove that the achievable region of the quantize-and-binning scheme and the outer-bound of the cooperative scheme has a bounded gap of 2:4771 bits.1

UR - https://www.scopus.com/pages/publications/70449472857

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

U2 - 10.1109/ISIT.2009.5205868

DO - 10.1109/ISIT.2009.5205868

M3 - Conference contribution

AN - SCOPUS:70449472857

SN - 9781424443130

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1468

EP - 1472

BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009

T2 - 2009 IEEE International Symposium on Information Theory, ISIT 2009

Y2 - 28 June 2009 through 3 July 2009

ER -

Approximating the rate-distortion region of the distributed source coding for three jointly gaussian tree-structured sources

Abstract

Publication series

Other

Publisher link

Find It

Other files and links

Fingerprint

Cite this