Attaining Forney´s bound for erasure decision by likelihood-ratio test plus threshold decision

Author

Hashimoto, Takeshi

Author_Institution

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

fYear

1997

fDate

29 Jun-4 Jul 1997

Firstpage

432

Abstract

We propose a new erasure decision scheme for decoding with erasures and show that the scheme also attains the bounds on the erasure probability and undetected error probability which are first derived for Forney´s (1968) optimal scheme. The new scheme gives, when applied to convolutional codes, bounds which are related to those for block codes by Forney´s inverse concatenation construction without substantial increase in decoder complexity

Keywords

block codes; coding errors; concatenated codes; convolutional codes; decision theory; error detection codes; error statistics; inverse problems; maximum likelihood decoding; optimisation; probability; ARQ; Forney´s bound; Forney´s inverse concatenation; Forney´s optimal scheme; block codes; concatenated coding; convolutional codes; decoder complexity; erasure decision; erasure probability; error detection; likelihood-ratio test; threshold decision; undetected error probability; Automatic repeat request; Block codes; Concatenated codes; Convolutional codes; Decoding; Error probability; Feedback; Information theory; Testing; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on

Conference_Location

Ulm

Print_ISBN

0-7803-3956-8

Type

conf

DOI

10.1109/ISIT.1997.613369

Filename

613369