## Abstract

This work considers the quadratic Gaussian multiterminal source coding problem and provides a new sufficient condition for the Berger-Tung sum-rate bound to be tight. The converse proof utilizes a generalized CEO problem where the observation noises are correlated Gaussian with a block-diagonal covariance matrix. First, the given multiterminal source coding problem is related to a set of two-terminal problems with matrix distortion constraints, for which a new lower bound on the sum-rate is given. Then, a convex optimization problem is formulated and a sufficient condition derived for the optimal BT scheme to satisfy the subgradient based Karush-Kuhn-Tucker condition. The set of sum-rate tightness problems defined by our new sufficient condition subsumes all previously known tight cases, and opens new direction for a more general partial solution.

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

Title of host publication | 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings |

Pages | 540-544 |

Number of pages | 5 |

DOIs | |

Publication status | Published - 2010 |

Externally published | Yes |

Event | Information Theory and Applications Workshop (ITA) 2010 - University of California at San Diego, San Diego, United States of America Duration: 31 Jan 2010 → 5 Feb 2010 http://ita.ucsd.edu/workshop/10/home |

### Conference

Conference | Information Theory and Applications Workshop (ITA) 2010 |
---|---|

Abbreviated title | ITA 2010 |

Country | United States of America |

City | San Diego |

Period | 31/01/10 → 5/02/10 |

Internet address |

## Keywords

- Karush-kuhn-tucker condition
- Quadratic Gaussian multiterminal source coding
- Subgradient
- Sum-rate