Worst-case expected-rate loss of slow-fading channels

For delay-limited communication over block-fading channels, the difference between the ergodic capacity and the maximum expected rate for coding over a finite number of coherent blocks represents the penalty incurred by the delay constraint. This paper introduces a notion of worst-case expected-rate loss. Focusing on the slow-fading scenario (one block delay), the worst-case expected-rate loss is precisely characterized for the point-to-point fading channel and is characterized to within one bit for the fading-paper channel.

[1]  Lizhong Zheng,et al.  Writing on Fading Paper and Causal Transmitter CSI , 2006, 2006 IEEE International Symposium on Information Theory.

[2]  David Burshtein,et al.  On the Fading-Paper Achievable Region of the Fading MIMO Broadcast Channel , 2008, IEEE Transactions on Information Theory.

[3]  J. Nicholas Laneman,et al.  Writing on Dirty Paper with Resizing and its Application to Quasi-Static Fading Broadcast Channels , 2007, 2007 IEEE International Symposium on Information Theory.

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

[5]  Philip A. Whiting,et al.  Broadcasting over uncertain channels with decoding delay constraints , 2006, IEEE Transactions on Information Theory.

[6]  A. Goldsmith,et al.  Capacity definitions and coding strategies for general channels with receiver side information , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[7]  Shlomo Shamai,et al.  Variable-Rate Channel Capacity , 2010, IEEE Transactions on Information Theory.

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

[9]  Shlomo Shamai,et al.  Secret Writing on Dirty Paper: A Deterministic View , 2012, IEEE Transactions on Information Theory.

[10]  Gregory W. Wornell,et al.  Secure Broadcasting Over Fading Channels , 2008, IEEE Transactions on Information Theory.

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