Codes and iterative decoding on general graphs
作者： Niclas Wiberg , Hans-Andrea Loeliger , Ralf Kotter
关键词: Soft output Viterbi algorithm 、 List decoding 、 Discrete mathematics 、 Iterative Viterbi decoding 、 Turbo code 、 Sequential decoding 、 Convolutional code 、 Tanner graph 、 Mathematics 、 Viterbi algorithm
摘要: A general framework, based on ideas of Tanner, for the description codes and iterative decoding (“turbo coding”) is developed. Just like trellis-based code descriptions are naturally matched to Viterbi decoding, Tanner graphs (which may be viewed as generalized trellises) decoding. Two basic algorithms versions Berrou et al. Hagenauer, respectively) shown natural generalizations forward-backward algorithm (Bahl al.) algorithm, respectively, arbitrary graphs. The careful derivation these clarifies, in particular, which a priori probabilities admissible how they properly dealt with. For cycle (a class binary linear block codes), complete characterization given error patterns that corrected by after infinitely many iterations.
sci-hub.se 参考文章(14)
Jan C. Willems, Models for Dynamics Dynamics Reported. pp. 171- 269 ,(1989) , 10.1007/978-3-322-96657-5_5
Jem Nilsson, R Kotter, Iterative Decoding of Product Code Constructions international symposium on information theory and its applications. pp. 1059- ,(1994)
L. Bahl, J. Cocke, F. Jelinek, J. Raviv, Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) IEEE Transactions on Information Theory. ,vol. 20, pp. 284- 287 ,(1974) , 10.1109/TIT.1974.1055186
Hans-Andrea Loeliger, G. David Forney, Thomas Mittelholzer, Mitchell D. Trott, Minimality and observability of group systems Linear Algebra and its Applications. pp. 937- 963 ,(1994) , 10.1016/0024-3795(94)90375-1
G.D. Forney, Dimension/length profiles and trellis complexity of linear block codes IEEE Transactions on Information Theory. ,vol. 40, pp. 1741- 1752 ,(1994) , 10.1109/18.340452
J. Hagenauer, P. Hoeher, A Viterbi algorithm with soft-decision outputs and its applications IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond. ,vol. 47, pp. 1680- 1686 ,(1989) , 10.1109/GLOCOM.1989.64230
C. Berrou, A. Glavieux, P. Thitimajshima, Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 international conference on communications. ,vol. 2, pp. 1064- 1070 ,(1993) , 10.1109/ICC.1993.397441
L.R. Rabiner, A tutorial on hidden Markov models and selected applications in speech recognition Proceedings of the IEEE. ,vol. 77, pp. 267- 296 ,(1989) , 10.1109/5.18626
R. Gallager, Low-Density Parity-Check Codes ,(1963)
R. Tanner, A recursive approach to low complexity codes IEEE Transactions on Information Theory. ,vol. 27, pp. 533- 547 ,(1981) , 10.1109/TIT.1981.1056404