Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:1409.3330 (cs)
[Submitted on 11 Sep 2014 (v1), last revised 17 Sep 2014 (this version, v2)]

Title:Finite Block-length Analysis of the Incremental Redundancy HARQ

Authors:Behrooz Makki, Tommy Svensson, Michele Zorzi
View PDF
Abstract: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.
Comments: appears in IEEE Wireless Communication Letters 2014
Subjects: Information Theory (cs.IT)
Cite as: arXiv:1409.3330 [cs.IT]
  (or arXiv:1409.3330v2 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.1409.3330
Related DOI: https://doi.org/10.1109/LWC.2014.2353059

Submission history

From: Behrooz Makki [view email]
[v1] Thu, 11 Sep 2014 05:57:32 UTC (103 KB)
[v2] Wed, 17 Sep 2014 11:13:11 UTC (103 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2014-09
Change to browse by:
cs
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Behrooz Makki
Tommy Svensson
Michele Zorzi
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)