Computer Science – Information Theory
Scientific paper
2010-06-15
Computer Science
Information Theory
34 pages, submitted to IEEE Transactions on Information Theory
Scientific paper
In this work, the rate region of the vector Gaussian multiple description problem with individual and central quadratic distortion constraints is studied. In particular, an outer bound to the rate region of the L-description problem is derived. The bound is obtained by lower bounding a weighted sum rate for each supporting hyperplane of the rate region. The key idea is to introduce at most L-1 auxiliary random variables and further impose upon the variables a Markov structure according to the ordering of the description weights. This makes it possible to greatly simplify the derivation of the outer bound. In the scalar Gaussian case, the complete rate region is fully characterized by showing that the outer bound is tight. In this case, the optimal weighted sum rate for each supporting hyperplane is obtained by solving a single maximization problem. This contrasts with existing results, which require solving a min-max optimization problem.
Kleijn Bastiaan W.
Zhang Guoqiang
Østergaard Jan
No associations
LandOfFree
Bounding the Rate Region of Vector Gaussian Multiple Descriptions with Individual and Central Receivers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Bounding the Rate Region of Vector Gaussian Multiple Descriptions with Individual and Central Receivers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounding the Rate Region of Vector Gaussian Multiple Descriptions with Individual and Central Receivers will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-105130