Authors: Mihaljević, Miodrag J. 
Golić, Jovan Dj.
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: A method for convergence analysis of iterative probabilistic decoding
Journal: IEEE Transactions on Information Theory
Volume: 46
Issue: 6
First page: 2206
Last page: 2211
Issue Date: 1-Jan-2000
Rank: M22
ISSN: 0018-9448
DOI: 10.1109/18.868493
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.
Keywords: Convergence condition | Iterative error-correction decoding | Linear block codes
Publisher: IEEE

Show full item record


checked on May 23, 2024

Page view(s)

checked on May 10, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.