On the error exponent of convolutionally coded ARQ

Author

Hashimoto, Takeshi

Author_Institution

Dept. of Electr. Eng., Univ. of Electro-Commun., Tokyo, Japan

Volume

40

Issue

2

fYear

1994

fDate

3/1/1994 12:00:00 AM

Firstpage

567

Lastpage

575

Abstract

Forney´s (1968) exponent is effectively the best one for the block-coded automatic repeat-request systems (ARQ) and it has been conjectured that a counterpart of Forney´s exponent is attainable by convolutional codes with reasonable decoder complexity. In the paper, it is show that the scheme of Yamamoto and Itoh (1980), which is known to be one of the simplest convolutionally coded ARQ schemes, actually gives a better performance than ever expected and that it has an error exponent quite close to the conjectured counterpart of Forney´s exponent at relatively low rates. It is further shown that the likelihood ratio test used by Yamamoto and Itoh gives Forney´s exponent in the case of block-coded ARQ

Keywords

block codes; convolutional codes; decoding; error analysis; maximum likelihood estimation; Forney´s exponent; block-coded automatic repeat-request systems; convolutionally coded ARQ; decoder complexity; error exponent; likelihood ratio test; performance; Automatic repeat request; Block codes; Code standards; Conferences; Convolutional codes; Decoding; Error probability; Feedback; Testing; Viterbi algorithm;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.312188

Filename

312188