On the Compound Broadcast Channel: Multiple Description Coding and Interference Decoding

This work investigates the general two-user compound Broadcast Channel (BC) in which an encoder wishes to transmit two private messages W1 and W2 to two receivers while being oblivious to the actual channel realizations controlling the communication. The focus is on the characterization of the largest achievable rate region by resorting to more involved encoding and decoding techniques than the usual coding schemes of the standard BC. Involved decoding schemes are first explored, and an achievable rate region is derived based on the principle of Interference Decoding (ID), in which each receiver decodes its intended message and chooses to (non-uniquely) decode, or not, the interfering non-itended message. This decoding scheme is shown to be capacity achieving for a class of non-trivial compound BEC/BSC broadcast channels while the worst-case of Marton’s inner bound—based on No Interference Decoding (NID)—fails to achieve the capacity region. Involved encoding schemes are later investigated, and an achievable rate region is derived based on Multiple Description (MD) coding wherin the encoder transmits a common description as well as multiple dedicated private descriptions to the many possible channel realizations of the users. It turns out that MD coding yields larger inner bounds than the single description scheme—Common Description (CD) coding—for a class of compound Multiple Input Single Output Broadcast Channels (MISO BC).

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

[2]  Ying-Chang Liang,et al.  The capacity region of a class of two-user degraded compound broadcast channels , 2013, 2013 IEEE International Symposium on Information Theory.

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

[4]  Ying-Chang Liang,et al.  The capacity region of a new class of K-receiver degraded compound broadcast channels , 2014, 2014 IEEE International Symposium on Information Theory.

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

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

[7]  Abbas El Gamal,et al.  Simultaneous nonunique decoding is rate-optimal , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

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

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

[11]  Syed Ali Jafar,et al.  On the Degrees of Freedom of Finite State Compound Wireless Networks , 2011, IEEE Transactions on Information Theory.

[12]  Shlomo Shamai,et al.  On the Synergistic Benefits of Alternating CSIT for the MISO Broadcast Channel , 2013, IEEE Transactions on Information Theory.

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

[14]  Abbas El Gamal,et al.  The capacity region of a class of three-receiver broadcast channels with degraded message sets , 2007, IEEE Transactions on Information Theory.

[15]  Shlomo Shamai,et al.  On Degrees of Freedom Region of MIMO Networks Without Channel State Information at Transmitters , 2012, IEEE Transactions on Information Theory.

[16]  Suhas N. Diggavi,et al.  Is Non-Unique Decoding Necessary? , 2012, IEEE Transactions on Information Theory.

[17]  Thomas M. Cover,et al.  Elements of information theory (2. ed.) , 2006 .

[18]  Shlomo Shamai,et al.  The Capacity Region of the Degraded Multiple-Input Multiple-Output Compound Broadcast Channel , 2009, IEEE Transactions on Information Theory.

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

[20]  Shlomo Shamai,et al.  On the Compound MIMO Broadcast Channel , 2007 .

[21]  Arun Padakandla,et al.  A new coding theorem for three user discrete memoryless broadcast channel , 2012, ArXiv.

[22]  François Baccelli,et al.  Interference Networks With Point-to-Point Codes , 2011, IEEE Transactions on Information Theory.

[23]  Mohammad Ali Maddah-Ali.  On the degrees of freedom of the compound MISO broadcast channels with finite states , 2010, 2010 IEEE International Symposium on Information Theory.

[24]  Hans S. Witsenhausen,et al.  A conditional entropy bound for a pair of discrete random variables , 1975, IEEE Trans. Inf. Theory.

[25]  Pablo Piantanida,et al.  On the role of interference decoding in compound broadcast channels , 2013, 2013 IEEE Information Theory Workshop (ITW).

[26]  Shlomo Shamai,et al.  Capacity of compound state-dependent channels with states known at the transmitter , 2010, 2009 IEEE International Symposium on Information Theory.

[27]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[28]  Syed A. Jafar,et al.  Interference Alignment: A New Look at Signal Dimensions in a Communication Network , 2011, Found. Trends Commun. Inf. Theory.

[29]  Chandra Nair,et al.  Capacity regions of two new classes of 2-receiver broadcast channels , 2009, 2009 IEEE International Symposium on Information Theory.