Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fast HARQ over Finite Blocklength Codes: A Technique for Low-Latency Reliable Communication

Published 13 Nov 2018 in cs.IT and math.IT | (1811.05148v1)

Abstract: This paper studies the performance of delay-constrained hybrid automatic repeat request HARQ protocols. Particularly, we propose a fast HARQ protocol where, to increase the end-to-end throughput, some HARQ feedback signals and successive message decodings are omitted. Considering quasi-static channels and a bursty communication model, we derive closed-form expressions for the message decoding probabilities as well as the throughput, the expected delay and the error probability of the HARQ setups. The analysis is based on recent results on the achievable rates of finite-length codes and shows the effect of the codeword length on the system performance. Moreover, we evaluate the effect of various parameters such as imperfect channel estimation and hardware on the system performance. As demonstrated, the proposed fast HARQ protocol reduces the packet transmission delay considerably, compared to state-of-the-art HARQ schemes. For example, with typical message decoding delay profiles and a maximum of 2,...,5 transmission rounds, the proposed fast HARQ protocol can improve the expected delay, compared to standard HARQ, by 27, 42, 52 and 60%, respectively, independently of the code rate/fading model.

Citations (70)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.