Analysis and Design of Binary Message-Passing Decoders
Publication: Research - peer-review › Journal article
Standard
Analysis and Design of Binary Message-Passing Decoders. / Lechner, Gottfried; Pedersen, Troels; Kramer, Gerhard.
In: IEEE Transactions on Communications, Vol. 60, No. 3, 09.03.2012, p. 601 - 607 .Publication: Research - peer-review › Journal article
Harvard
APA
CBE
MLA
Vancouver
Author
Bibtex
}
RIS
TY - JOUR
T1 - Analysis and Design of Binary Message-Passing Decoders
A1 - Lechner,Gottfried
A1 - Pedersen,Troels
A1 - Kramer,Gerhard
AU - Lechner,Gottfried
AU - Pedersen,Troels
AU - Kramer,Gerhard
PB - I E E E
PY - 2012/3/9
Y1 - 2012/3/9
N2 - Binary message-passing decoders for low-density parity-check (LDPC) codes are studied by using extrinsic information transfer (EXIT) charts. The channel delivers hard or soft decisions and the variable node decoder performs all computations in the L-value domain. A hard decision channel results in the well-know Gallager B algorithm, and increasing the output alphabet from hard decisions to two bits yields a gain of more than 1.0 dB in the required signal to noise ratio when using optimized codes. The code optimization requires adapting the mixing property of EXIT functions to the case of binary message-passing decoders. Finally, it is shown that errors on cycles consisting only of degree two and three variable nodes cannot be corrected and a necessary and sufficient condition for the existence of a cycle-free subgraph is derived.<br/>
AB - Binary message-passing decoders for low-density parity-check (LDPC) codes are studied by using extrinsic information transfer (EXIT) charts. The channel delivers hard or soft decisions and the variable node decoder performs all computations in the L-value domain. A hard decision channel results in the well-know Gallager B algorithm, and increasing the output alphabet from hard decisions to two bits yields a gain of more than 1.0 dB in the required signal to noise ratio when using optimized codes. The code optimization requires adapting the mixing property of EXIT functions to the case of binary message-passing decoders. Finally, it is shown that errors on cycles consisting only of degree two and three variable nodes cannot be corrected and a necessary and sufficient condition for the existence of a cycle-free subgraph is derived.<br/>
U2 - 10.1109/TCOMM.2011.122111.100212
DO - 10.1109/TCOMM.2011.122111.100212
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
SN - 0090-6778
IS - 3
VL - 60
SP - 601
EP - 607
ER -