Block-fading channels at finite blocklength
Paper in proceeding, 2013

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 the theoretical results and the data rates achievable with the coding scheme used in LTE-Advanced are reported.

Error probabilities

Tight bound

Data rates

Block fading channel

Fading channels Asymptotic behaviors

Lte-advanced

Coding scheme

Author

Wei Yang

Chalmers, Signals and Systems, Communication, Antennas and Optical Networks

Giuseppe Durisi

Chalmers, Signals and Systems, Communication, Antennas and Optical Networks

Tobias Koch

Universidad Carlos III de Madrid

Yury Polyanskiy

Massachusetts Institute of Technology (MIT)

Proceedings of the International Symposium on Wireless Communication Systems

21540217 (ISSN) 21540225 (eISSN)

410-413
978-380073529-7 (ISBN)

Areas of Advance

Information and Communication Technology

Subject Categories

Telecommunications

ISBN

978-380073529-7

More information

Latest update

10/5/2023