Networking

Diversity Versus Channel Knowledge at Finite Block-Length

Free registration required

Executive Summary

The authors study the maximal achievable rate for a given block-length n and block error probability over Rayleigh block-fading channels in the non-coherent setting and in the finite block-length regime. Their results show that for a given block-length and error probability, 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. In this paper, they shed light on this fundamental tension by providing upper and lower bounds in the non-coherent setting.

  • Format: PDF
  • Size: 114.19 KB