Capacity regions of two-user broadcast erasure channels with feedback and hidden memory

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modelled using a finite-state Markov chain representing a channel state. The channel state is unknown at the transmitter, but observations of this hidden Markov chain are available at the transmitter through feedback. Matching outer and inner bounds are derived and the capacity region is determined. The capacity region does not have a single-letter characterization and is, in this sense, uncomputable. Approximations of the capacity region are provided and two optimal coding algorithms are outlined. The first algorithm is a probabilistic coding scheme that bases its decisions on the past L feedback sequences. Its achievable rate-region approaches the capacity region exponentially fast in L. The second algorithm is a backpressure-like algorithm that performs optimally in the long run.

[1]  F. Gland,et al.  Exponential Forgetting and Geometric Ergodicity in Hidden Markov Models , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

[2]  Gunter Dueck,et al.  Partial Feedback for Two-Way and Broadcast Channels , 1980, Inf. Control..

[3]  P. Sadeghi,et al.  Finite-state Markov modeling of fading channels - a survey of principles and applications , 2008, IEEE Signal Processing Magazine.

[4]  Chih-Chun Wang,et al.  Robust and optimal opportunistic scheduling for downlink 2-flow inter-session network coding with varying channel quality , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[5]  Laurent Mevel,et al.  Exponential Forgetting and Geometric Ergodicity in Hidden Markov Models , 2000, Math. Control. Signals Syst..

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

[7]  Leandros Tassiulas,et al.  Resource Allocation and Cross-Layer Control in Wireless Networks , 2006, Found. Trends Netw..

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

[9]  Ahmed Iyanda Sulyman,et al.  High-speed satellite mobile communications: technologies and challenges , 2004, Proceedings of the IEEE.

[10]  Gerhard Kramer.  Capacity results for the discrete memoryless network , 2003, IEEE Trans. Inf. Theory.

[11]  Michael Heindlmaier,et al.  The two-user broadcast packet erasure channel with feedback and memory , 2014, 2014 International Symposium on Network Coding (NetCod).

[12]  Daniel Cygan,et al.  The land mobile satellite communication channel-recording, statistics, and channel model , 1991 .

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

[14]  Chih-Chun Wang,et al.  On the Capacity of 1-to- $K$ Broadcast Packet Erasure Channels With Channel Output Feedback , 2010, IEEE Transactions on Information Theory.

[15]  Michael Heindlmaier,et al.  On capacity regions of two-receiver broadcast packet erasure channels with feedback and memory , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[16]  Mohammad Ali Maddah-Ali,et al.  Completely Stale Transmitter Channel State Information is Still Very Useful , 2010, IEEE Transactions on Information Theory.

[17]  Christina Fragouli,et al.  Feedback-based coding algorithms for broadcast erasure channels with degraded message sets , 2012, 2012 International Symposium on Network Coding (NetCod).

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

[19]  Maria Angeles Vázquez-Castro,et al.  Statistical modeling of the LMS channel , 2001, IEEE Trans. Veh. Technol..

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

[21]  Muriel Médard,et al.  Network Coding for Multiple Unicasts: An Approach based on Linear Optimization , 2006, 2006 IEEE International Symposium on Information Theory.

[22]  Sibi Raj Bhaskaran,et al.  Gaussian Broadcast Channel With Feedback , 2008, IEEE Transactions on Information Theory.

[23]  Xiaohang Song,et al.  Network coding for the broadcast Rayleigh fading channel with feedback , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[24]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[25]  Andrea J. Goldsmith,et al.  Capacity Theorems for Discrete, Finite-State Broadcast Channels With Feedback and Unidirectional Receiver Cooperation , 2010, IEEE Transactions on Information Theory.

[26]  Chih-Chun Wang,et al.  The Capacity Region of Two-Receiver Multiple-Input Broadcast Packet Erasure Channels With Channel Output Feedback , 2014, IEEE Transactions on Information Theory.

[27]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

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

[29]  R. Gallager.  Information Theory and Reliable Communication , 1968 .