Diversity versus Channel Knowledge at Finite Block-Length
Paper in proceedings, 2012

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.

Author

Wei Yang

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

Giuseppe Durisi

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

Tobias Koch

Universidad Carlos III de Madrid

Yury Polyanskiy

Massachusetts Institute of Technology (MIT)

IEEE Information Theory Workshop (ITW), Lausanne, 3-7 September 2012

572-576 6404740
978-146730223-4 (ISBN)

Areas of Advance

Information and Communication Technology

Subject Categories

Telecommunications

DOI

10.1109/ITW.2012.6404740

ISBN

978-146730223-4

More information

Latest update

4/11/2018