Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels
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-block...
Main Authors: | , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2017
|
Online Access: | http://hdl.handle.net/1721.1/111025 https://orcid.org/0000-0002-2109-0979 |
_version_ | 1811080876454313984 |
---|---|
author | Durisi, Giuseppe Koch, Tobias Ostman, Johan Polyanskiy, Yury Yang, Wei |
author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Durisi, Giuseppe Koch, Tobias Ostman, Johan Polyanskiy, Yury Yang, Wei |
author_sort | Durisi, Giuseppe |
collection | MIT |
description | 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. |
first_indexed | 2024-09-23T11:38:17Z |
format | Article |
id | mit-1721.1/111025 |
institution | Massachusetts Institute of Technology |
language | en_US |
last_indexed | 2024-09-23T11:38:17Z |
publishDate | 2017 |
publisher | Institute of Electrical and Electronics Engineers (IEEE) |
record_format | dspace |
spelling | mit-1721.1/1110252022-10-01T04:57:28Z Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels Durisi, Giuseppe Koch, Tobias Ostman, Johan Polyanskiy, Yury Yang, Wei Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Polyanskiy, Yury 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. 2017-08-28T17:39:19Z 2017-08-28T17:39:19Z 2015-12 Article http://purl.org/eprint/type/JournalArticle 0090-6778 http://hdl.handle.net/1721.1/111025 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) https://orcid.org/0000-0002-2109-0979 en_US http://dx.doi.org/10.1109/tcomm.2015.2511087 IEEE Transactions on Communications Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) arXiv |
spellingShingle | Durisi, Giuseppe Koch, Tobias Ostman, Johan Polyanskiy, Yury Yang, Wei Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels |
title | Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels |
title_full | Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels |
title_fullStr | Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels |
title_full_unstemmed | Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels |
title_short | Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels |
title_sort | short packet communications over multiple antenna rayleigh fading channels |
url | http://hdl.handle.net/1721.1/111025 https://orcid.org/0000-0002-2109-0979 |
work_keys_str_mv | AT durisigiuseppe shortpacketcommunicationsovermultipleantennarayleighfadingchannels AT kochtobias shortpacketcommunicationsovermultipleantennarayleighfadingchannels AT ostmanjohan shortpacketcommunicationsovermultipleantennarayleighfadingchannels AT polyanskiyyury shortpacketcommunicationsovermultipleantennarayleighfadingchannels AT yangwei shortpacketcommunicationsovermultipleantennarayleighfadingchannels |