Vector Gaussian Successive Refinement With Degraded Side Information
Information Theory
2020-02-19 v1 math.IT
Abstract
We investigate the problem of the successive refinement for Wyner-Ziv coding with degraded side information and obtain a complete characterization of the rate region for the quadratic vector Gaussian case. The achievability part is based on the evaluation of the Tian-Diggavi inner bound that involves Gaussian auxiliary random vectors. For the converse part, a matching outer bound is obtained with the aid of a new extremal inequality. Herein, the proof of this extremal inequality depends on the integration of the monotone path argument and the doubling trick as well as information-estimation relations.
Keywords
Cite
@article{arxiv.2002.07324,
title = {Vector Gaussian Successive Refinement With Degraded Side Information},
author = {Yinfei Xu and Xuan Guang and Jian Lu and Jun Chen},
journal= {arXiv preprint arXiv:2002.07324},
year = {2020}
}
Comments
19 pages, 1 figure