TY - JOUR
T1 - Cascade, triangular, and two-way source coding with degraded side information at the second user
AU - Chia, Yeow Khiang
AU - Permuter, Haim H.
AU - Weissman, Tsachy
N1 - Funding Information:
Manuscript received October 18, 2010; revised March 31, 2011; accepted June 21, 2011. Date of publication September 12, 2011; date of current version January 06, 2012. This work was supported in part by the National Science Foundation (NSF) under Grants CCF-1049413 and 4101-38047, and the Center for Science of Information (CSoI), an NSF Science and Technology Center, under Grant CCF-0939370. The material in this paper was presented in part at the Allerton Conference on Communication, Control, and Computing, Mon-ticello, IL, September 2011 and the Allerton Conference on Communication, Control, and Computing, Monticello, IL, September–October, 2010.
PY - 2012/1/1
Y1 - 2012/1/1
N2 - In this paper, we consider the cascade and triangular rate-distortion problems where the same side information is available at the source node and user 1, and the side information available at user 2 is a degraded version of the side information at the source node and user 1. We characterize the rate-distortion region for these problems. For the cascade setup, we show that, at user 1, decoding and rebinning the codeword sent by the source node for user 2 is optimum. We then extend our results to the two-way cascade and triangular setting, where the source node is interested in lossy reconstruction of the side information at user 2 via a rate limited link from user 2 to the source node. We characterize the rate-distortion regions for these settings. Complete explicit characterizations for all settings are given in the quadratic Gaussian case. We conclude with two further extensions: a triangular source coding problem with a helper, and an extension of our two-way cascade setting in the quadratic Gaussian case.
AB - In this paper, we consider the cascade and triangular rate-distortion problems where the same side information is available at the source node and user 1, and the side information available at user 2 is a degraded version of the side information at the source node and user 1. We characterize the rate-distortion region for these problems. For the cascade setup, we show that, at user 1, decoding and rebinning the codeword sent by the source node for user 2 is optimum. We then extend our results to the two-way cascade and triangular setting, where the source node is interested in lossy reconstruction of the side information at user 2 via a rate limited link from user 2 to the source node. We characterize the rate-distortion regions for these settings. Complete explicit characterizations for all settings are given in the quadratic Gaussian case. We conclude with two further extensions: a triangular source coding problem with a helper, and an extension of our two-way cascade setting in the quadratic Gaussian case.
KW - Cascade source coding
KW - quadratic Gaussian
KW - source coding with a helper
KW - triangular source coding
KW - two-way source coding
UR - http://www.scopus.com/inward/record.url?scp=84855708782&partnerID=8YFLogxK
U2 - 10.1109/TIT.2011.2167738
DO - 10.1109/TIT.2011.2167738
M3 - Article
AN - SCOPUS:84855708782
SN - 0018-9448
VL - 58
SP - 189
EP - 206
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 1
M1 - 6017119
ER -