### 2012

Durisi, Giuseppe; Koch, Tobias; Polyanskiy, Yury

Diversity Versus Channel Knowledge at Finite Block-Length Inproceedings

In: 2012 IEEE Information Theory Workshop, pp. 572–576, IEEE, Lausanne, 2012, ISBN: 978-1-4673-0223-4.

Abstract | Links | BibTeX | Tags: Approximation methods, block error probability, channel coherence time, Channel estimation, channel knowledge, Coherence, diversity, diversity reception, error statistics, Fading, finite block-length, maximal achievable rate, noncoherent setting, Rayleigh block-fading channels, Rayleigh channels, Receivers, Signal to noise ratio, Upper bound

@inproceedings{Durisi2012,

title = {Diversity Versus Channel Knowledge at Finite Block-Length},

author = {Giuseppe Durisi and Tobias Koch and Yury Polyanskiy},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6404740},

isbn = {978-1-4673-0223-4},

year = {2012},

date = {2012-01-01},

booktitle = {2012 IEEE Information Theory Workshop},

pages = {572--576},

publisher = {IEEE},

address = {Lausanne},

abstract = {We study the maximal achievable rate R*(n, ∈) for a given block-length n and block error probability o 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, ∈) 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.},

keywords = {Approximation methods, block error probability, channel coherence time, Channel estimation, channel knowledge, Coherence, diversity, diversity reception, error statistics, Fading, finite block-length, maximal achievable rate, noncoherent setting, Rayleigh block-fading channels, Rayleigh channels, Receivers, Signal to noise ratio, Upper bound},

pubstate = {published},

tppubtype = {inproceedings}

}

We study the maximal achievable rate R*(n, ∈) for a given block-length n and block error probability o 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, ∈) 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.