An algorithm for detecting unreliable code sequence segments and its applications

Author

Freudenberger, Jürgen ; Stender, Boris

Author_Institution

Dept. of Telecommun. & Appl. Inf. Theor., Univ. of Ulm, Germany

Volume

52

Issue

11

fYear

2004

Firstpage

1833

Lastpage

1839

Abstract

Let the Viterbi algorithm be applied for maximum-likelihood decoding of a terminated convolutional code using a trellis. We propose an additional procedure that permits a receiver to locate unreliable segments within an estimated code sequence. This reliability output may be used, for example, to request retransmissions, in systems with error concealment, or in channel-coding systems with unequal error protection.

Keywords

Viterbi decoding; channel coding; maximum likelihood decoding; trellis codes; Viterbi algorithm; channel-coding system; code sequence segment; error concealment; estimated code sequence; maximum likelihood decoding; request retransmission; terminated convolutional code; trellis code; unequal error protection; Automatic repeat request; Communications Society; Convolutional codes; Error correction codes; Information theory; Maximum likelihood decoding; Maximum likelihood detection; Maximum likelihood estimation; Testing; Viterbi algorithm; 65; Convolutional codes; Viterbi decoding; list decoding; reliability output; repeat request;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/TCOMM.2004.836556

Filename

1356190