Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 206

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels

Open access
Durisi, Giuseppe, Koch, Tobias, Ostman, Johan, Polyanskiy, Yury, Yang, Wei · 2016 · IEEE Transactions on Communications

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tcomm.2015.2511087

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 206

Metadata

Authors
Durisi, G., Koch, T., Ostman, J., Polyanskiy, Y., & Yang, W.
Venue
IEEE Transactions on Communications
Published
2016-02
Volume
64
Issue
2
Pages
618-629
ISSN
0090-6778 (ISSN-L)
OpenAlex
W2193895645
Cited by
206
References
1
FWCI
7.22
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels. https://app.cochat.ai/papers/10.1109/tcomm.2015.2511087
The paper
Durisi, G., Koch, T., Ostman, J., Polyanskiy, Y., & Yang, W. (2016). Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels. IEEE Transactions on Communications. https://doi.org/10.1109/tcomm.2015.2511087

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.