Feedback-based coding algorithms for broadcast erasure channels with degraded message sets

We consider single-hop broadcast packet erasure channels (BPEC) with degraded message sets and instantaneous feedback regularly available from all receivers, and demonstrate that the main principles of the virtual-queue-based algorithms in [1], which were proposed for multiple unicast sessions, can still be applied to this setting and lead to capacity-achieving algorithms. Specifically, we propose a generic class of algorithms and intuitively describe its rationale and properties that result in its efficiency. We then apply this class of algorithms to three examples of BPEC channels (with different numbers of users and 2 or 3 degraded message sets) and show that the achievable throughput region matches a known capacity outer bound, assuming feedback availability through a separate public channel. If the feedback channel is not public, all users can still decode their messages, albeit at some overhead which results in an achievable throughput that differs from the outer bound by O(N/L), where L is the packet length. These algorithms do not require any prior knowledge of channel statistics for their operation.

[1]  Abbas El Gamal,et al.  The feedback capacity of degraded broadcast channels (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[2]  Babak Hassibi,et al.  The capacity region of multiple input erasure broadcast channels , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

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

[4]  Chih-Chun Wang On the Capacity of 1-to-K Broadcast Packet Erasure Channels With Channel Output Feedback , 2012, IEEE Trans. Inf. Theory.

[5]  Lawrence H. Ozarow,et al.  An achievable region and outer bound for the Gaussian broadcast channel with feedback , 1984, IEEE Trans. Inf. Theory.

[6]  Christina Fragouli,et al.  Degraded Multicasting with Network Coding over the Combination Network , 2011, 2011 International Symposium on Networking Coding.

[7]  Yuhong Yang Elements of Information Theory (2nd ed.). Thomas M. Cover and Joy A. Thomas , 2008 .

[8]  Leandros Tassiulas,et al.  Broadcast erasure channel with feedback - Capacity and algorithms , 2009, 2009 Workshop on Network Coding, Theory, and Applications.

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

[10]  Leandros Tassiulas,et al.  Multiuser Broadcast Erasure Channel With Feedback—Capacity and Algorithms , 2010, IEEE Transactions on Information Theory.

[11]  Chih-Chun Wang Capacity of 1-to-K Broadcast Packet Erasure Channels with Channel Output Feedback (Full Version) , 2010, ArXiv.