On the Responsiveness-Diversity-Multiplexing Tradeoff

The work analyzes the error performance of high-SNR, high-rate, point-to-point, outage-limited, wireless communications, with bursty and delay-limited information. In this setting, the bit-arrival process is stochastic and bursty, and the bits are limited by a strict delay condition. In the presence of fixed transmission rate, errors are due to both decoding and delay violations, and are attributed to sequences of atypical bursts of information and a typical fading realizations. For the case of fast Rayleigh channel fading, and compound Poisson bit-arrival process, the work presents bounds on a tradeoff between diversity and the ratio of average bit-arrival rate to ergodic-capacity. This tradeoff describes a uniform scalar effect of burstiness on the maximum amount of diversity that can be accumulated given a delay limitation. For large burstiness, the bounds are tight. As a practical consequence, the tradeoff addresses the question of how much of the maximum allowable time should be spent on coding and how much for timely and responsive accommodation of the queue.

[1]  Tara Javidi,et al.  Optimal Operating Point in MIMO Channel for Delay-Sensitive and Bursty Traffic , 2006, 2006 IEEE International Symposium on Information Theory.

[2]  Adam Shwartz,et al.  Large Deviations For Performance Analysis , 2019 .

[3]  Damon Wischik,et al.  Big Queues, Springer Lecture Notes in Mathematics , 2004 .

[4]  Georgios B. Giannakis,et al.  Queuing with adaptive modulation and coding over wireless links: cross-Layer analysis and design , 2005, IEEE Transactions on Wireless Communications.

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

[6]  Rohit Negi,et al.  An information-theoretic approach to queuing in wireless channels with large delay bounds , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[7]  Ward Whitt,et al.  Exponential Approximations for Tail Probabilities in Queues II: Sojourn Time and Workload , 1996, Oper. Res..

[8]  Ward Whitt,et al.  Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times , 1995, Oper. Res..

[9]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[10]  J. Belfiore,et al.  Optimal Space-Time Codes for the Amplify-and-Forward Cooperative Channel , 2005 .

[11]  Jean C. Walrand,et al.  Effective bandwidths for multiclass Markov fluids and other ATM sources , 1993, TNET.

[12]  Alan Weiss,et al.  Large Deviations For Performance Analysis: Queues, Communication and Computing , 1995 .

[13]  K. J. Ray Liu,et al.  Jointly optimized bit-rate/delay control policy for wireless packet networks with fading channels , 2002, IEEE Trans. Commun..

[14]  Ward Whitt,et al.  Squeezing the Most Out of ATM , 1995, IEEE Trans. Commun..

[15]  Andrea J. Goldsmith,et al.  Joint Source and Channel Coding for MIMO Systems: Is it Better to be Robust or Quick? , 2008, IEEE Transactions on Information Theory.

[16]  Frank Kelly,et al.  Notes on effective bandwidths , 1994 .

[17]  P. Vijay Kumar,et al.  Explicit, Minimum-Delay Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeo , 2004 .

[18]  Petros Elia Asymptotic universal optimality in wireless multi-antenna delay -limited communications and wireless networks , 2006 .

[19]  P. Vijay Kumar,et al.  Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff , 2006, IEEE Transactions on Information Theory.

[20]  Andrea J. Goldsmith,et al.  Optimizing end-to-end distortion in MIMO systems , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[21]  Jean-Claude Belfiore,et al.  Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative Channel , 2005, IEEE Transactions on Information Theory.