论文信息 - Exact probability of erasure and a decoding algorithm for convolutional codes on the binary erasure channel

Exact probability of erasure and a decoding algorithm for convolutional codes on the binary erasure channel

Analytic expressions for the exact probability of erasure for systematic, rate- 1/2 convolutional codes used to communicate over the binary erasure channel and decoded using the soft-input, soft-output (SISO) and a posteriori probability (APP) algorithms are given. An alternative forward-backward algorithm which produces the same result as the SISO algorithm is also given. This low-complexity implementation, based upon lookup tables, is of interest for systems which use convolutional codes, such as turbo codes.

[1] T. N. Morrissey. A Markovian analysis of Viterbi decoders for convolutional codes , 1969 .

[2] John Cocke,et al. Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[3] A. J. Vinck,et al. Syndrome decoding of convolutional codes , 2002 .

[4] G. Stewart. Gaussian Elimination, Perturbation Theory, and Markov Chains , 1993 .

[5] A. Robert Calderbank,et al. On a technique to calculate the exact performance of a convolutional code , 1995, IEEE Trans. Inf. Theory.

[6] Dariush Divsalar,et al. A soft-input soft-output APP module for iterative decoding of concatenated codes , 1997, IEEE Communications Letters.

[7] J. B. Anderson,et al. Turbo codes for binary symmetric and binary erasure channels , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[8] D. Truhachev,et al. Analytic expression for the exact bit error probability of the (7,5) convolutional code , 2002, Proceedings IEEE International Symposium on Information Theory,.

[9] Paul H. Siegel,et al. On the capacity of finite state channels and the analysis of convolutional accumulate-m codes , 2003 .

[10] C. Méasson,et al. Further analytic properties of exit-like curves and applications , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..