Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels
Name
Polyanskiy_Short-packet.pdf
Size
411.27 KB
Format
Adobe PDF
Checksum (MD5)
f3e0b32cffde3dc4fc54e917f235ae98
Author(s)
Durisi, Giuseppe
Koch, Tobias
Ostman, Johan
Polyanskiy, Yury
Yang, Wei
Date Issued
December 2015
Journal
IEEE Transactions on Communications
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Durisi, Giuseppe et al. “Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels.” IEEE Transactions on Communications 64, 2 (February 2016): 618–629 © 2016 Institute of Electrical and Electronics Engineers (IEEE)
Version
Original manuscript
Abstract
Motivated by the current interest in ultra-reliable, low-latency, machine-type communication systems, we investigate the tradeoff between reliability, throughput, and latency in the transmission of information over multiple-antenna Rayleigh block-fading channels. Specifically, we obtain finite-blocklength, finite-SNR upper and lower bounds on the maximum coding rate achievable over such channels for a given constraint on the packet error probability. Numerical evidence suggests that our bounds delimit tightly the maximum coding rate already for short blocklengths (packets of about 100 symbols). Furthermore, our bounds reveal the existence of a tradeoff between the rate gain obtainable by spreading each codeword over all available time-frequency-spatial degrees of freedom, and the rate loss caused by the need of estimating the fading coefficients over these degrees of freedom. In particular, our bounds allow us to determine the optimal number of transmit antennas and the optimal number of time-frequency diversity branches that maximize the rate. Finally, we show that infinite-blocklength performance metrics such as the ergodic capacity and the outage capacity yield inaccurate throughput estimates.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/tcomm.2015.2511087
