Distributed Information Bottleneck Method for Discrete and Gaussian Sources - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Distributed Information Bottleneck Method for Discrete and Gaussian Sources

Résumé

We study the problem of distributed information bottleneck, in which multiple encoders separately compress their observations in a manner such that, collectively, the compressed signals preserve as much information as possible about another signal. The model generalizes Tishby's centralized information bottleneck method to the setting of multiple distributed encoders. We establish single-letter characterizations of the information-rate region of this problem for both i) a class of discrete memoryless sources and ii) memoryless vector Gaussian sources. Furthermore, assuming a sum constraint on rate or complexity, for both models we develop Blahut-Arimoto type iterative algorithms that allow to compute optimal information-rate trade-offs, by iterating over a set of self-consistent equations.

Dates et versions

hal-01806552 , version 1 (03-06-2018)

Identifiants

Citer

Inaki Estella Aguerri, Abdellatif Zaidi. Distributed Information Bottleneck Method for Discrete and Gaussian Sources. International Zurich Seminar on Information and Communication, Feb 2018, Zurich, Switzerland. ⟨hal-01806552⟩
87 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More