A method for convergence analysis of iterative probabilistic decoding

A novel analytical approach to performance evaluation of soft-decoding algorithms for binary linear block codes based on probabilistic iterative error correction is presented. A convergence condition establishing the critical noise rate below which the expected bit-error probability tends to zero is theoretically derived. It explains the capability of iterative probabilistic decoding of binary linear block codes with sparse parity-check matrices to correct, with probability close to one, error patterns with the number of errors (far) beyond half the code minimum distance. Systematic experiments conducted on truncated simplex codes seem to agree well with the convergence condition. The method may also be interesting for the theoretical analysis of the so-called turbo codes.

[1]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[2]  Ed Dawson,et al.  A Comparison of Fast Correlation Attacks , 1996, FSE.

[3]  Tadao Kasami,et al.  A Low-Weight Trellis-Based Iterative Soft-Decision Decoding Algorithm for Binary Linear Block Codes , 1999, IEEE Trans. Inf. Theory.

[4]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[5]  Shu Lin,et al.  An Iterative Soft-Decision Decoding Algorithm , 1996 .

[6]  Martin Bossert,et al.  Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes , 1986, IEEE Trans. Inf. Theory.

[7]  Carlos R. P. Hartmann,et al.  An optimum symbol-by-symbol decoding rule for linear codes , 1976, IEEE Trans. Inf. Theory.

[8]  Jovan Dj. Golic,et al.  A Comparison of Cryptanalytic Principles Based on Iterative Error-Correction , 1991, EUROCRYPT.

[9]  Kencheng Zeng,et al.  On the Linear Syndrome Method in Cryptanalysis , 1988, CRYPTO.

[10]  J. D. Golic.  Computation of low-weight parity-check polynomials , 1996 .

[11]  Martin Bossert,et al.  On Iterative Soft-Decision Decoding of Linear Binary Block Codes and Product Codes , 1998, IEEE J. Sel. Areas Commun..

[12]  Miodrag V. Zivkovic.  On two probabilistic decoding algorithms for binary linear codes , 1991, IEEE Trans. Inf. Theory.

[13]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.