TY - GEN

T1 - On the Gaussian K-description problem under symmetric distortion constraints

AU - Tian, Chao

AU - Mohajer, Soheil

AU - Diggavi, Suhas

PY - 2008/10/6

Y1 - 2008/10/6

N2 - We consider multiple description (MD) coding for the Gaussian source under the symmetric mean squared error distortion constraints. With focus on the three description problem, we provide inner and outer bounds for the rate region, between which the gap can be bounded by some small constants. At the heart of this result is a novel lower bound for the sum rate, which is derived through generalization of the well-known bounding technique by Ozarow. In contrast to the original method, we expand the probability space by more than one (instead of only one) random variable, and further impose a particular Markov structure on them. The outer bound is then established by applying this technique to several bounding planes of the rate region. For the inner bound, we consider a simple scheme of combining successive refinement coding and lossless multilevel diversity coding (MLD). Both the inner and outer bounds can be written as the intersection of ten half spaces with matching normal directions, and thus can be easily compared. The small gap between them, where the boundary of the MD rate region clearly resides, suggests the surprising competitiveness of this simple achievability scheme. The geometric structure of the MLD rate region provides important guidelines as to the normal directions of the outer bound hyperplanes, which demonstrates an intimate connection between MD and MLD coding. These results can be generalized and improved in various ways which are also discussed.

AB - We consider multiple description (MD) coding for the Gaussian source under the symmetric mean squared error distortion constraints. With focus on the three description problem, we provide inner and outer bounds for the rate region, between which the gap can be bounded by some small constants. At the heart of this result is a novel lower bound for the sum rate, which is derived through generalization of the well-known bounding technique by Ozarow. In contrast to the original method, we expand the probability space by more than one (instead of only one) random variable, and further impose a particular Markov structure on them. The outer bound is then established by applying this technique to several bounding planes of the rate region. For the inner bound, we consider a simple scheme of combining successive refinement coding and lossless multilevel diversity coding (MLD). Both the inner and outer bounds can be written as the intersection of ten half spaces with matching normal directions, and thus can be easily compared. The small gap between them, where the boundary of the MD rate region clearly resides, suggests the surprising competitiveness of this simple achievability scheme. The geometric structure of the MLD rate region provides important guidelines as to the normal directions of the outer bound hyperplanes, which demonstrates an intimate connection between MD and MLD coding. These results can be generalized and improved in various ways which are also discussed.

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

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

U2 - 10.1109/ITA.2008.4601081

DO - 10.1109/ITA.2008.4601081

M3 - Conference contribution

AN - SCOPUS:52949136299

SN - 1424426707

SN - 9781424426706

T3 - 2008 Information Theory and Applications Workshop - Conference Proceedings, ITA

SP - 401

EP - 405

BT - 2008 Information Theory and Applications Workshop - Conference Proceedings, ITA

T2 - 2008 Information Theory and Applications Workshop - ITA

Y2 - 27 January 2008 through 1 February 2008

ER -