Computer Science – Information Theory
Scientific paper
2012-04-13
Computer Science
Information Theory
5 pages, submitted to ITW 2012
Scientific paper
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.
Durisi Giuseppe
Koch Tobias
Polyanskiy Yury
Yang Wei
No associations
LandOfFree
Diversity versus Channel Knowledge at Finite Block-Length does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Diversity versus Channel Knowledge at Finite Block-Length, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Diversity versus Channel Knowledge at Finite Block-Length will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-143750