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

Jae Won Yoo, Tie Liu, Shlomo Shamai

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publication2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages2186-2190
Number of pages5
DOIs
StatePublished - 2012
Event2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States
Duration: 1 Jul 20126 Jul 2012

Publication series

NameIEEE International Symposium on Information Theory - Proceedings

Conference

Conference2012 IEEE International Symposium on Information Theory, ISIT 2012
Country/TerritoryUnited States
CityCambridge, MA
Period1/07/126/07/12

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Cite this