Worst-Case Expected-Rate Loss of Slow-Fading Channels Conference Paper uri icon

abstract

  • 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. 2012 IEEE.

name of conference

  • 2012 IEEE International Symposium on Information Theory Proceedings

published proceedings

  • 2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT)

author list (cited authors)

  • Yoo, J. W., Liu, T., & Shamai (Shitz), S.

citation count

  • 3

complete list of authors

  • Yoo, Jae Won||Liu, Tie||Shamai (Shitz), Shlomo

publication date

  • January 2012