Kramer, Gerhard

Lechner, Gottfried

Pedersen, Troels

Binary message-passing decoders for LDPC codes are analyzed using EXIT charts. For the analysis, the variablenode decoder performs all computations in the L-value domain. For the special case of a hard decision channel, this leads to the well know Gallager B algorithm, while the analysis can be extended to channels with larger output alphabets. By increasing the output alphabet from hard decisions to four symbols, a gain of more than 1.0 dB is achieved using optimized codes. For this code optimization, the mixing property of EXIT functions has tobe modified to the case of binary message-passing decoders

EXIT Chart Analysis of Binary Message-Passing Decoders

Crossref

http://vbn.aau.dk/files/18904781/Lechner2007.pdf

EXIT Chart Analysis of Binary Message-Passing Decoders

Abstract

Similar works

Full text

Available Versions

VBN

Crossref