2011 Data Compression Conference 2011
DOI: 10.1109/dcc.2011.33
|View full text |Cite
|
Sign up to set email alerts
|

On the Rate Region of the Vector Gaussian One-Helper Distributed Source-Coding Problem

Abstract: In this paper we consider the rate region of the vector Gaussian one-helper distributed source coding problem. In particular, we derive optimality conditions under which a weighted sum rate is minimum by using a contradiction-based argument. When the sources are specified to be scalar, the optimality conditions can always be constructed for any weighted sum rate. In the derivation of the optimality conditions, we introduce a new concept of "source enhancement", which can be viewed as a dual to the wellknown "c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2011
2011
2015
2015

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(8 citation statements)
references
References 13 publications
0
8
0
Order By: Relevance
“…We shall show that this is indeed true. Source enhancement and Oohama's converse technique are lifted directly from [1] and [6]. The distortion projection, on the other hand, requires an extension beyond what was needed in the scalar helper case [7].…”
Section: It Follows Thatmentioning
confidence: 99%
See 2 more Smart Citations
“…We shall show that this is indeed true. Source enhancement and Oohama's converse technique are lifted directly from [1] and [6]. The distortion projection, on the other hand, requires an extension beyond what was needed in the scalar helper case [7].…”
Section: It Follows Thatmentioning
confidence: 99%
“…The enhanced optimization problem (P) is now defined as We next show that v(P) lower bounds v(P) using a variation on an argument of Zhang [6]. Since KX KX by (45), we may coupleX to (X,Ỹ) in such a way that…”
Section: B Source Enhancementmentioning
confidence: 99%
See 1 more Smart Citation
“…We shall show that this is indeed true. Source enhancement and Oohama's converse technique are lifted directly from [1,6]. The distortion projection, on the other hand, requires an extension beyond what was needed in the scalar helper case [7].…”
Section: Overview Of the Converse Argumentmentioning
confidence: 99%
“…We derive the rate-distortion (RD) function for an arbitrary node in the network with a distortion constraint defined in form of a covariance matrix, cf. [6], [7]. In Section II, we introduce the notation and formulate the problem, which turns out to involve joint coding of multiple sources.…”
Section: Introductionmentioning
confidence: 99%