On the Error Exponents of ARQ Channels with Deadlines

TL;DR

This paper analyzes the error performance of ARQ channels with a maximum number of transmission rounds, demonstrating that incremental redundancy ARQ achieves better error exponents than traditional memoryless decoding methods.

Contribution

It introduces an upper bound on ARQ rounds and shows that incremental redundancy ARQ outperforms Forney's decoding in error exponent performance.

Findings

Incremental redundancy ARQ has superior error exponents.

An upper bound on ARQ rounds influences error performance.

Incremental redundancy outperforms memoryless decoding.

Abstract

We consider communication over Automatic Repeat reQuest (ARQ) memoryless channels with deadlines. In particular, an upper bound L is imposed on the maximum number of ARQ transmission rounds. In this setup, it is shown that incremental redundancy ARQ outperforms Forney's memoryless decoding in terms of the achievable error exponents.