Streaming Transmitter over Block-Fading Channels with Delay Constraint

Data streaming transmission over a block fading channel is studied. It is assumed that the transmitter receives a new message at each channel block at a constant rate, which is fixed by an underlying application, and tries to deliver the arriving messages by a common deadline. Various transmission schemes are proposed and compared with an informed transmitter upper bound in terms of the average decoded rate. It is shown that in the single receiver case the adaptive joint encoding (aJE) scheme is asymptotically optimal, in that it achieves the ergodic capacity as the transmission deadline goes to infinity; and it closely follows the performance of the informed transmitter upper bound in the case of finite transmission deadline. On the other hand, in the presence of multiple receivers with different signal-to-noise ratios (SNR), memoryless transmission (MT), time sharing (TS) and superposition transmission (ST) schemes are shown to be more robust than the joint encoding (JE) scheme as they have gradual performance loss with decreasing SNR.

[1]  Abbas Jamalipour,et al.  Wireless communications , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[2]  S. Hanly,et al.  Multi-access fading channels: delay-limited capacities , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[3]  Pravin Varaiya,et al.  Capacity of fading channels with channel side information , 1997, IEEE Trans. Inf. Theory.

[4]  Tracey Ho,et al.  Erasure coding for real-time streaming , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[5]  Shlomo Shamai,et al.  Fading Channels: Information-Theoretic and Communication Aspects , 1998, IEEE Trans. Inf. Theory.

[6]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[7]  Shlomo Shamai,et al.  Information theoretic considerations for cellular mobile radio , 1994 .

[8]  Deniz Gündüz,et al.  Real-time broadcasting over block-fading channels , 2011, 2011 8th International Symposium on Wireless Communication Systems.

[9]  Deniz Gündüz,et al.  Opportunistic cooperation by dynamic resource allocation , 2007, IEEE Transactions on Wireless Communications.

[10]  Enrico Magli,et al.  Sliding-Window Digital Fountain Codes for Streaming of Multimedia Contents , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[11]  Stark C. Draper,et al.  Streaming data over fading wireless channels: The diversity-multiplexing tradeoff , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[12]  Shlomo Shamai,et al.  A broadcast approach for a single-user slowly fading MIMO channel , 2003, IEEE Trans. Inf. Theory.

[13]  Upena Dalal,et al.  Wireless Communication , 2010 .

[14]  Ahmed Badr,et al.  Diversity Embedded Streaming Erasure Codes (DE-SCo): Constructions and Optimality , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[15]  M. J. Gans,et al.  On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas , 1998, Wirel. Pers. Commun..

[16]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

[17]  David Tse,et al.  Outage Capacity of the Fading Relay Channel in the Low-SNR Regime , 2006, IEEE Transactions on Information Theory.

[18]  Roy D. Yates,et al.  Fading broadcast channels with state information at the receivers , 2009, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[19]  Gerard Maral,et al.  Satellite Communications Systems: Systems, Techniques and Technology , 2020 .

[20]  Shlomo Shamai,et al.  A broadcast strategy for the Gaussian slowly fading channel , 1997, Proceedings of IEEE International Symposium on Information Theory.