TY - GEN

T1 - Coding theorems for the compress and estimate source coding problem

AU - Kipnis, Alon

AU - Rini, Stefano

AU - Goldsmith, Andrea J.

PY - 2017/8/9

Y1 - 2017/8/9

N2 - We consider the remote source coding setting in which a source realization is estimated from a lossy compressed sequence of noisy observations. Unlike in the optimal remote source coding problem, however, the encoder is bound to use good codes with respect to the observation sequence, i.e., codes that are optimal for the lossy reconstruction of the observation, rather than the remote source. This encoding strategy is denoted as the compress-and-estimate (CE) scheme. For the case of an i.i.d source observed through a memoryless channel, we show that the distortion in the CE scheme is characterized by a single-letter expression, referred to as the CE distortion-rate function (CE-DRF). In particular, we show that the CE-DRF can be attained by estimating the source from the output of a remote encoder employing any sequence of good codes with respect to the observation sequence. In addition, we show that the limiting distortion in estimating any finite sub-block of the source realization from the output of a remote encoder employing good codes, averaged over all sub-blocks, is also bounded by the CE-DRF.

AB - We consider the remote source coding setting in which a source realization is estimated from a lossy compressed sequence of noisy observations. Unlike in the optimal remote source coding problem, however, the encoder is bound to use good codes with respect to the observation sequence, i.e., codes that are optimal for the lossy reconstruction of the observation, rather than the remote source. This encoding strategy is denoted as the compress-and-estimate (CE) scheme. For the case of an i.i.d source observed through a memoryless channel, we show that the distortion in the CE scheme is characterized by a single-letter expression, referred to as the CE distortion-rate function (CE-DRF). In particular, we show that the CE-DRF can be attained by estimating the source from the output of a remote encoder employing any sequence of good codes with respect to the observation sequence. In addition, we show that the limiting distortion in estimating any finite sub-block of the source realization from the output of a remote encoder employing good codes, averaged over all sub-blocks, is also bounded by the CE-DRF.

UR - http://www.scopus.com/inward/record.url?scp=85034043381&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2017.8006993

DO - 10.1109/ISIT.2017.8006993

M3 - Conference contribution

AN - SCOPUS:85034043381

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2568

EP - 2572

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

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 25 June 2017 through 30 June 2017

ER -