A Graph-Based Framework for Transmission of Correlated Sources Over Broadcast Channels

In this paper, we consider the communication problem that involves transmission of correlated sources over broadcast channels. We consider a graph-based framework for this information transmission problem. The system involves a source coding module and a channel coding module. In the source coding module, the sources are efficiently mapped into a nearly semi-regular bipartite graph, and in the channel coding module, the edges of this graph are reliably transmitted over a broadcast channel. We consider nearly semi-regular bipartite graphs as discrete interface between source coding and channel coding in this multiterminal setting. We provide an information-theoretic characterization of 1) the rate of exponential growth (as a function of the number of channel uses) of the size of the bipartite graphs whose edges can be reliably transmitted over a broadcast channel and 2) the rate of exponential growth (as a function of the number of source samples) of the size of the bipartite graphs which can reliably represent a pair of correlated sources to be transmitted over a broadcast channel.

[1]  Kannan Ramchandran,et al.  A Graph-Based Framework for Transmission of Correlated Sources Over Multiple-Access Channels , 2007, IEEE Transactions on Information Theory.

[2]  Shlomo Shamai,et al.  On the achievable throughput of a multiantenna Gaussian broadcast channel , 2003, IEEE Transactions on Information Theory.

[3]  Andrea J. Goldsmith,et al.  Capacity and optimal resource allocation for fading broadcast channels - Part I: Ergodic capacity , 2001, IEEE Trans. Inf. Theory.

[4]  Shlomo Shamai,et al.  The capacity region of the Gaussian MIMO broadcast channel , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[5]  Abbas El Gamal,et al.  The capacity of a class of broadcast channels , 1979, IEEE Trans. Inf. Theory.

[6]  Kannan Ramchandran,et al.  Achievable rates for multiple-access channels with correlated messages , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[7]  Andrea J. Goldsmith,et al.  Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels , 2003, IEEE Trans. Inf. Theory.

[8]  Edward C. van der Meulen,et al.  A proof of Marton's coding theorem for the discrete memoryless broadcast channel , 1981, IEEE Trans. Inf. Theory.

[9]  Robert G. Gallager,et al.  Capacity and coding for degraded broadcast channels , 1974 .

[10]  H. Witsenhausen.  ON SEQUENCES OF PAIRS OF DEPENDENT RANDOM VARIABLES , 1975 .

[11]  Yasutada Oohama.  Gaussian multiterminal source coding , 1997, IEEE Trans. Inf. Theory.

[12]  Masoud Salehi,et al.  Multiple access channels with arbitrarily correlated sources , 1980, IEEE Trans. Inf. Theory.

[13]  Thomas M. Cover,et al.  Comments on Broadcast Channels , 1998, IEEE Trans. Inf. Theory.

[14]  Max H. M. Costa,et al.  Broadcast channels with arbitrarily correlated sources , 1987, IEEE Trans. Inf. Theory.

[15]  Todd P. Coleman,et al.  Joint Source-Channel Decoding for Transmitting Correlated Sources over Broadcast Networks , 2006, 2006 IEEE International Symposium on Information Theory.

[16]  Abbas El Gamal,et al.  An outer bound to the capacity region of the broadcast channel , 2006, ISIT.

[17]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[18]  Patrick P. Bergmans,et al.  A simple converse for broadcast channels with additive white Gaussian noise (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[19]  Bruce E. Hajek,et al.  Evaluation of an achievable rate region for the broadcast channel , 1979, IEEE Trans. Inf. Theory.

[20]  Wei Yu,et al.  Sum capacity of Gaussian vector broadcast channels , 2004, IEEE Transactions on Information Theory.

[21]  Ertem Tuncel.  Lossless joint source-channel coding across broadcast channels with decoder side information , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[22]  Kenneth H. Rosen,et al.  Discrete Mathematics and its applications , 2000 .

[23]  A. Sridharan.  Broadcast Channels , 2022 .

[24]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[25]  David Tse,et al.  Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality , 2003, IEEE Trans. Inf. Theory.

[26]  Hiroshi Sato,et al.  An outer bound to the capacity region of broadcast channels (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[27]  Rudolf Ahlswede,et al.  On source coding with side information via a multiple-access channel and related problems in multi-user information theory , 1983, IEEE Trans. Inf. Theory.

[28]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

[29]  Edward C. van der Meulen,et al.  Random coding theorems for the general discrete memoryless broadcast channel , 1975, IEEE Trans. Inf. Theory.

[30]  Katalin Marton,et al.  A coding theorem for the discrete memoryless broadcast channel , 1979, IEEE Trans. Inf. Theory.

[31]  David Tse,et al.  Optimal power allocation over parallel Gaussian broadcast channels , 1997, Proceedings of IEEE International Symposium on Information Theory.

[32]  Shlomo Shamai,et al.  The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel , 2006, IEEE Transactions on Information Theory.

[33]  Ertem Tuncel,et al.  Slepian-Wolf coding over broadcast channels , 2006, IEEE Transactions on Information Theory.

[34]  Rudolf Ahlswede,et al.  Source coding with side information and a converse for degraded broadcast channels , 1975, IEEE Trans. Inf. Theory.

[35]  Giuseppe Longo,et al.  The information theory approach to communications , 1977 .

[36]  Thomas M. Cover,et al.  An achievable rate region for the broadcast channel , 1975, IEEE Trans. Inf. Theory.

[37]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[38]  Robert M. Gray,et al.  Source coding for a simple network , 1974 .

[39]  Patrick P. Bergmans,et al.  Random coding theorem for broadcast channels with degraded components , 1973, IEEE Trans. Inf. Theory.

[40]  Aaron D. Wyner,et al.  The common information of two dependent random variables , 1975, IEEE Trans. Inf. Theory.

[41]  János Körner,et al.  General broadcast channels with degraded message sets , 1977, IEEE Trans. Inf. Theory.