Block-fading channels at finite blocklength

This tutorial paper deals with the problem of characterizing the maximal achievable rate R(n; ϵ )at a given blocklength n and error probability ϵ over block-fading channels. We review recent results that establish tight bounds on R(n; ϵ )and characterize its asymptotic behavior. Comparison between t...

Full description

Bibliographic Details
Main Authors: Yang, Wei, Durisi, Giuseppe, Koch, Tobias, Polyanskiy, Yury
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Institute of Electrical and Electronics Engineers (IEEE) 2015
Online Access:http://hdl.handle.net/1721.1/93766
https://orcid.org/0000-0002-2109-0979