|Mihaljević, Miodrag J.
Golić, Jovan Dj.
|Mathematical Institute of the Serbian Academy of Sciences and Arts
|A method for convergence analysis of iterative probabilistic decoding
|IEEE Transactions on Information Theory
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.
|Convergence condition | Iterative error-correction decoding | Linear block codes
Show full item record
checked on Feb 28, 2024
checked on Feb 22, 2024
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.