Name
Title | ||
|---|---|---|
A New Sufficient Condition for Sum-Rate Tightness in Quadratic Gaussian Multiterminal Source Coding |
Abstract | ||
|---|---|---|
This paper considers the quadratic Gaussian multiterminal (MT) source coding problem and provides a new sufficient condition for the Berger–Tung (BT) sum-rate bound to be tight. The converse proof utilizes a set of virtual remote sources given which the observed sources are block independent with a maximum block size of 2. The given MT source coding problem is then related to a set of two-terminal problems with matrix-distortion constraints, for which a new lower bound on the sum-rate is given. By formulating a convex optimization problem over all distortion matrices, a sufficient condition is derived for the optimal BT scheme to satisfy the subgradient-based Karush–Kuhn–Tucker condition. The subset of the quadratic Gaussian MT problem satisfying our new sufficient condition subsumes all previously known tight cases, and our proof technique opens a new direction for more general partial solutions. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/TIT.2012.2216995 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
source code,convex optimization,lower bound,information theory,satisfiability,karush kuhn tucker | Block size,Discrete mathematics,Combinatorics,Subgradient method,Upper and lower bounds,Matrix (mathematics),Quadratic equation,Gaussian,Covariance matrix,Convex optimization,Mathematics | Journal |
Volume | Issue | ISSN |
59 | 1 | 0018-9448 |
ISBN | Citations | PageRank |
978-1-4244-7014-3 | 3 | 0.56 |
References | Authors | |
8 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yang Yang | 1 | 27 | 5.71 |
| Yifu Zhang | 2 | 170 | 15.01 |
| Zixiang Xiong | 3 | 3444 | 275.03 |