The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Finite Block-Length Analysis of the Incremental Redundancy HARQ
Open accessAbstract
This letter studies the power-limited throughput of a communication system utilizing incremental redundancy (INR) hybrid automatic repeat request (HARQ). We use some recent results on the achievable rates of finite-length codes to analyze the system performance. With codewords of finite length, we derive closed-form expressions for the outage probabilities of INR HARQ and study the throughput in the cases with variable-length coding. Moreover, we evaluate the effect of feedback delay on the throughput and derive sufficient conditions for the usefulness of the HARQ protocols, in terms of power-limited throughput. The results show that, for a large range of HARQ feedback delays, the throughput is increased by finite-length coding INR HARQ, if the sub-codeword lengths are properly adapted.
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
Channel Coding Rate in the Finite Blocklength Regime
Polyanskiy, Y., Poor, H. V., & Verdu, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2043769 · Cited by 3,885
Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength
Yang, W., Durisi, G., Koch, T., & Polyanskiy, Y. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2318726 · Cited by 609
Incremental Redundancy Hybrid ARQ Schemes Based on Low-Density Parity-Check Codes
Sesia, S., Caire, G., & Vivier, G. (2004) · IEEE Transactions on Communications · doi:10.1109/tcomm.2004.833022 · Cited by 195
Popovsk, P., Brau, V., Mayer, H. P., Fertl, P., Ren, Z., Gonzales-Serrano, D., Ström, E. G., Svensson, T., Taoka, H., Agyapong, P. K., et al. (2013) · Chalmers Research (Chalmers University of Technology) · Cited by 115
Self-citationQuasi-static SIMO fading channels at finite blocklength
Yang, W. Q., Durisi, G., Koch, T., & Polyanskiy, Y. (2013) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2013.6620483 · Cited by 92
On the Performance of MIMO-ARQ Systems with Channel State Information at the Receiver
Makki, B., & Eriksson, T. (2014) · IEEE Transactions on Communications · doi:10.1109/tcomm.2014.033014.130223 · Cited by 55
Self-citation
Cited by
She, C., Chen, Z., Yang, C., Quek, T. Q. S., Li, Y., & Vucetic, B. (2018) · IEEE Transactions on Communications · doi:10.1109/tcomm.2018.2851244 · Cited by 88
Metadata
- Authors
- Makki, B., Svensson, T., & Zorzi, M.
- Venue
- IEEE Wireless Communications Letters
- Published
- 2014-10
- Volume
- 3
- Issue
- 5
- Pages
- 529-532
- ISSN
- 2162-2337 (ISSN-L)
- 2162-2345
- OpenAlex
- W2078191478
- Cited by
- 285
- References
- 6
- FWCI
- 15.02
- 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: Finite Block-Length Analysis of the Incremental Redundancy HARQ. https://app.cochat.ai/papers/10.1109/lwc.2014.2353059
- The paper
- Makki, B., Svensson, T., & Zorzi, M. (2014). Finite Block-Length Analysis of the Incremental Redundancy HARQ. IEEE Wireless Communications Letters. https://doi.org/10.1109/lwc.2014.2353059
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.