A Posteriory Probability Decoding of Nonsystematically Encoded Block Codes

被引：5
作者：
H. Griesser
V. R. Sidorenko
机构：
来源：
Problems of Information Transmission | 2002年 / 38卷 / 3期
关键词：
System Theory; Posteriory Probability; Block Code; Complexity Property; Posteriori Probability;
D O I：
10.1023/A:1020309101422
中图分类号：
学科分类号：
摘要：
We consider the problem of symbol-by-symbol a posteriori probability (APP) decoding for information symbols of nonsystematically encoded block codes. This problem arises at soft concatenated decoding of generalized concatenated block codes. The well-known BCJR algorithm for efficient APP decoding is not able to solve the problem if it runs on the minimal code trellis of a block code. We introduce an extended trellis representation for block codes, which includes encoding information and thus makes it possible to apply the BCJR algorithm as well as trellis-based decoding in the dual code space. Complexity properties of the extended trellis are investigated.
引用
收藏
页码：182 / 193
页数：11
相关论文
共 26 条
[1]  
Blokh E.I.(1974)Encoding of Generalized Concatenated Codes Probl. Peredachi Inf. 10 45-50
[2]  
Zyablov V.V.(1995)On the Trellis Structure of Block Codes IEEE Trans. Inf. Theory 41 1924-1937
[3]  
Kschischang F.R.(1997)The Euler Characteristic of the Minimal Code Trellis Is Maximal Probl. Peredachi Inf. 33 87-93
[4]  
Sorokine V.(1996)On the BCJR Trellis for Linear Block Codes IEEE Trans. Inf. Theory 42 1072-1092
[5]  
Sidorenko V.(1974)Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate IEEE Trans. Inf. Theory 20 284-287
[6]  
McEliece R.J.(1976)An Optimum Symbol-by-Symbol Decoding Rule for Linear Codes IEEE Trans. Inf. Theory 22 514-517
[7]  
Bahl L.(1996)Iterative Decoding of Binary Block and Convolutional Codes IEEE Trans. Inf. Theory 42 429-445
[8]  
Cocke J.(2001)Codes on Graphs: Normal Realizations IEEE Trans. Inf. Theory 47 520-548
[9]  
Jelinek F.(1996)Optimal Sectionalization of a Trellis IEEE Trans. Inf. Theory 42 689-703
[10]  
Raviv J.(1996)On the Intractability of Permuting a Block Code to Minimize Trellis Complexity IEEE Trans. Inf. Theory 42 2042-2048
123