On the Error Exponents of ARQ Channels With Deadlines

  • Authors:

  • P. K. Gopala;Young-Han Nam;H. El Gamal

  • Affiliations:

  • Ohio State Univ., Columbus;-;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2007

Quantified Score

Hi-index 754.90

Visualization

Abstract

In this correspondence, 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.