## 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.

Original language | English |
---|---|

Article number | 6293895 |

Pages (from-to) | 408-423 |

Number of pages | 16 |

Journal | IEEE Transactions on Information Theory |

Volume | 59 |

Issue number | 1 |

DOIs | |

Publication status | Published - Jan 2013 |

Externally published | Yes |

## Keywords

- Karush-Kuhn-Tucker (KKT) condition
- Quadratic Gaussian multiterminal source coding
- Remote sources
- Subgradient
- Sum rate