An algorithm for detecting unreliable code sequence segments and its applications

被引:5
作者
Freudenberger, J [1 ]
Slender, B [1 ]
机构
[1] Univ Ulm, Dept Telecommun & Appl Informat Theory, D-89081 Ulm, Germany
关键词
convolutional codes; list decoding; reliability output; repeat request; Viterbi decoding;
D O I
10.1109/TCOMM.2004.836556
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 [电气工程]; 0809 [电子科学与技术];
摘要
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.
引用
收藏
页码:1833 / 1839
页数:7
相关论文
共 15 条
[1]
Bossert M., 1999, Channel Coding for Telecommunications
[2]
VITERBI ALGORITHM [J].
FORNEY, GD .
PROCEEDINGS OF THE IEEE, 1973, 61 (03) :268-278
[3]
FORNEY GD, 1974, INFORM CONTROL, V25, P222, DOI 10.1016/S0019-9958(74)90870-5
[6]
ON THE ERROR EXPONENT OF CONVOLUTIONALLY CODED ARQ [J].
HASHIMOTO, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (02) :567-575
[7]
Composite scheme LR+Th for decoding with erasures and its effective equivalence to Forney's rule [J].
Hashimoto, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (01) :78-93
[8]
Performance of explicit error detection and threshold decision in decoding with erasures [J].
Hashimoto, T ;
Taguchi, M .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (05) :1650-1655
[9]
Johannesson R., 1999, FUNDAMENTALS CONVOLU
[10]
LIST AND SOFT SYMBOL OUTPUT VITERBI ALGORITHMS - EXTENSIONS AND COMPARISONS [J].
NILL, C ;
SUNDBERG, CEW .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1995, 43 (2-4) :277-287