Worst-case expected-capacity loss of slow-fading channels
From MaRDI portal
Publication:2989205
DOI10.1109/TIT.2013.2248877zbMATH Open1364.94486arXiv1208.4790MaRDI QIDQ2989205FDOQ2989205
Authors: Jaewon Yoo, Tie Liu, Chao Tian, S. Shamai 
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: For delay-limited communication over block-fading channels, the difference between the ergodic capacity and the maximum achievable expected rate for coding over a finite number of coherent blocks represents a fundamental measure of the penalty incurred by the delay constraint. This paper introduces a notion of worst-case expected-capacity loss. Focusing on the slow-fading scenario (one-block delay), the worst-case additive and multiplicative expected-capacity losses are precisely characterized for the point-to-point fading channel. Extension to the problem of writing on fading paper is also considered, where both the ergodic capacity and the additive expected-capacity loss over one-block delay are characterized to within one bit per channel use.
Full work available at URL: https://arxiv.org/abs/1208.4790
Communication theory (94A05) Information theory (general) (94A15) Channel models (including quantum) in information and communication theory (94A40)
Cited In (1)
This page was built for publication: Worst-case expected-capacity loss of slow-fading channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989205)
