DocumentCode
960181
Title
On the Error Exponents of ARQ Channels With Deadlines
Author
Gopala, Praveen Kumar ; Nam, Young-Han ; El Gamal, Hesham
Author_Institution
Ohio State Univ., Columbus
Volume
53
Issue
11
fYear
2007
Firstpage
4265
Lastpage
4273
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.
Keywords
automatic repeat request; channel coding; decoding; telecommunication channels; ARQ channel; ARQ transmission round; Forney memoryless decoding; automatic repeat request memoryless channel; error exponent; Automatic repeat request; Delay; Feeds; Maximum likelihood decoding; Memoryless systems; Monte Carlo methods; Output feedback; Redundancy; Transmitters; Upper bound; Erasure decoding; error exponents; incremental redundancy Automatic Repeat reQuest (ARQ); joint decoding;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2007.907431
Filename
4373406
Link To Document