Sum Rate of the Vacationing-CEO Problem

Author

Soundararajan, Rajiv ; Wagner, Aaron B. ; Vishwanath, Sriram

Author_Institution

Dept. of Electr. & Comput. Eng., Univ. of Texas at Austin, Austin, TX, USA

Volume

58

Issue

10

fYear

2012

Firstpage

6304

Lastpage

6319

Abstract

The vacationing chief executive officer (CEO) problem combines the salient features of the so-called CEO problem and the multiple-description (MD) problem. In this setting, noisy versions of a source are observed by two encoders, as in the CEO problem. In addition, we require that each encoder generate MDs of the source, as in the MD problem. The vacationing-CEO problem arises in asynchronous multicast networks, and solving it is an essential step in developing a general theory for multiencoder and multidecoder lossy compression. In this paper, an achievable sum rate and two sum rate lower bounds are presented for the quadratic Gaussian vacationing-CEO problem. These bounds exactly determine the optimal sum rate over a wide range of parameters.

Keywords

encoding; multicast communication; asynchronous multicast networks; multidecoder lossy compression; multiencoder lossy compression; multiple description problem; optimal sum rate; quadratic Gaussian vacationing CEO problem; Decoding; Noise; Noise measurement; Random variables; Receivers; Source coding; Gaussian multiterminal source coding; multiple-description (MD) coding; network information theory; rate distortion theory;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2012.2204722

Filename

6230654