Diversity versus Channel Knowledge at Finite Block-Length
Information Theory
2012-08-21 v2 math.IT
Abstract
We study the maximal achievable rate R*(n, \epsilon) for a given block-length n and block error probability \epsilon over Rayleigh block-fading channels in the noncoherent setting and in the finite block-length regime. Our results show that for a given block-length and error probability, R*(n, \epsilon) is not monotonic in the channel's coherence time, but there exists a rate maximizing coherence time that optimally trades between diversity and cost of estimating the channel.
Cite
@article{arxiv.1204.2927,
title = {Diversity versus Channel Knowledge at Finite Block-Length},
author = {Wei Yang and Giuseppe Durisi and Tobias Koch and Yury Polyanskiy},
journal= {arXiv preprint arXiv:1204.2927},
year = {2012}
}
Comments
5 pages, to appear in Information Theory Workshop (ITW) 2012