The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength
Open accessAbstract
This paper investigates the maximal achievable rate for a given blocklength and error probability over quasi-static multiple-input multiple-output fading channels, with and without channel state information at the transmitter and/or the receiver. The principal finding is that outage capacity, despite being an asymptotic quantity, is a sharp proxy for the finite-blocklength fundamental limits of slow-fading channels. Specifically, the channel dispersion is shown to be zero regardless of whether the fading realizations are available at both transmitter and receiver, at only one of them, or at neither of them. These results follow from analytically tractable converse and achievability bounds. Numerical evaluation of these bounds verifies that zero dispersion may indeed imply fast convergence to the outage capacity as the blocklength increases. In the example of a particular 1 × 2 single-input multiple-output Rician fading channel, the blocklength required to achieve 90% of capacity is about an order of magnitude smaller compared with the blocklength required for an AWGN channel with the same capacity. For this specific scenario, the coding/decoding schemes adopted in the LTE-Advanced standard are benchmarked against the finite-blocklength achievability and converse bounds.
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.
Integrity signals
Registry
Cites
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.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
W., J. W., Abramowitz, M., & Stegun, I. A. (1965) · Mathematics of Computation · doi:10.2307/2004114 · Cited by 18,663
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
Owen, D. B., Abramowitz, M., & Stegun, I. A. (1965) · Technometrics · doi:10.2307/1266136 · Cited by 16,138
Fundamentals of Wireless Communication
Tse, D., & Viswanath, P. (2005) · doi:10.1017/cbo9780511807213 · Cited by 13,162
Capacity of Multi‐antenna Gaussian Channels
Telatar, E. (1999) · European Transactions on Telecommunications · doi:10.1002/ett.4460100604 · Cited by 11,234
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas
Foschini, G. J., & Gans, M. J. (1998) · Wireless Personal Communications · doi:10.1023/a:1008889222784 · Cited by 10,091
Continuous Univariate Distributions.
Omori, Y., Johnson, N. L., Kotz, S., & Balakrishnan, N. (1995) · Journal of the American Statistical Association · doi:10.2307/2291547 · Cited by 9,084
Principles of mathematical analysis
Rudin, W. (1964) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 5,195
Cited by
Toward Massive, Ultrareliable, and Low-Latency Wireless Communication With Short Packets
Durisi, G., Koch, T., & Popovski, P. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2016.2537298 · Cited by 1,154
Self-citationShe, C., Sun, C., Gu, Z., Li, Y., Yang, C., Poor, H. V., & Vucetic, B. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2021.3053601 · Cited by 405
Cross-Layer Optimization for Ultra-Reliable and Low-Latency Radio Access Networks
She, C., Yang, C., & Quek, T. Q. S. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2762684 · Cited by 309
Deep learning for hybrid 5G services in mobile edge computing systems: learn from a digital twin
Dong, R., She, C., Hardjawana, W., Li, Y., & Vucetic, B. (2019) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2927312 · Cited by 295
Finite Block-Length Analysis of the Incremental Redundancy HARQ
Makki, B., Svensson, T., & Zorzi, M. (2014) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2014.2353059 · Cited by 285
Metadata
- Authors
- Yang, W., Durisi, G., Koch, T., & Polyanskiy, Y.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2014-07
- Volume
- 60
- Issue
- 7
- Pages
- 4232-4265
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2036533317
- Cited by
- 609
- References
- 40
- FWCI
- 13.97
- 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: Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength. https://app.cochat.ai/papers/10.1109/tit.2014.2318726
- The paper
- Yang, W., Durisi, G., Koch, T., & Polyanskiy, Y. (2014). Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2014.2318726
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.