## 2013 |

Yang, Wei; Durisi, Giuseppe; Koch, Tobias; Polyanskiy, Yury Quasi-Static SIMO Fading Channels at Finite Blocklength Inproceedings 2013 IEEE International Symposium on Information Theory, pp. 1531–1535, IEEE, Istanbul, 2013, ISSN: 2157-8095. Abstract | Links | BibTeX | Tags: achievability bounds, AWGN channel, AWGN channels, channel capacity, channel dispersion, channel gains, Dispersion, error probability, error statistics, Fading, fading channels, fading realizations, fast convergence, finite blocklength, maximal achievable rate, numerical evaluation, outage capacity, quasistatic SIMO fading channels, Random variables, Receivers, SIMO Rician channel, single-input multiple-output, Transmitters, zero dispersion @inproceedings{Yang2013a, title = {Quasi-Static SIMO Fading Channels at Finite Blocklength}, author = {Wei Yang and Giuseppe Durisi and Tobias Koch and Yury Polyanskiy}, url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6620483}, issn = {2157-8095}, year = {2013}, date = {2013-01-01}, booktitle = {2013 IEEE International Symposium on Information Theory}, pages = {1531--1535}, publisher = {IEEE}, address = {Istanbul}, abstract = {We investigate the maximal achievable rate for a given blocklength and error probability over quasi-static single-input multiple-output (SIMO) fading channels. Under mild conditions on the channel gains, it is shown that the channel dispersion is zero regardless of whether the fading realizations are available at the transmitter and/or the receiver. The result follows from computationally and analytically tractable converse and achievability bounds. Through numerical evaluation, we verify that, in some scenarios, zero dispersion indeed entails fast convergence to outage capacity as the blocklength increases. In the example of a particular 1×2 SIMO Rician channel, the blocklength required to achieve 90% of capacity is about an order of magnitude smaller compared to the blocklength required for an AWGN channel with the same capacity.}, keywords = {achievability bounds, AWGN channel, AWGN channels, channel capacity, channel dispersion, channel gains, Dispersion, error probability, error statistics, Fading, fading channels, fading realizations, fast convergence, finite blocklength, maximal achievable rate, numerical evaluation, outage capacity, quasistatic SIMO fading channels, Random variables, Receivers, SIMO Rician channel, single-input multiple-output, Transmitters, zero dispersion}, pubstate = {published}, tppubtype = {inproceedings} } We investigate the maximal achievable rate for a given blocklength and error probability over quasi-static single-input multiple-output (SIMO) fading channels. Under mild conditions on the channel gains, it is shown that the channel dispersion is zero regardless of whether the fading realizations are available at the transmitter and/or the receiver. The result follows from computationally and analytically tractable converse and achievability bounds. Through numerical evaluation, we verify that, in some scenarios, zero dispersion indeed entails fast convergence to outage capacity as the blocklength increases. In the example of a particular 1×2 SIMO Rician channel, the blocklength required to achieve 90% of capacity is about an order of magnitude smaller compared to the blocklength required for an AWGN channel with the same capacity. |

## 2012 |

Durisi, Giuseppe; Koch, Tobias; Polyanskiy, Yury Diversity Versus Channel Knowledge at Finite Block-Length Inproceedings 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. |