Title
Tree-structured expectation propagation for LDPC decoding over the AWGN channel
Abstract
In this paper, we propose the tree-structured expectation propagation (TEP) algorithm for low-density parity-check (LDPC) decoding over the additive white Gaussian noise (AWGN) channel. By imposing a tree-like approximation over the graphical model of the code, this algorithm introduces pairwise marginal constraints over pairs of variables, which provide joint information of the variables related. Thanks to this, the proposed TEP decoder improves the performance of the standard belief propagation (BP) solution. An efficient way of constructing the tree-like structure is also described. The simulation results illustrate the TEP decoder gain in the finite-length regime, compared to the standard BP solution. For code lengths shorter than n = 512, the gain in the waterfall region achieves up to 0.25 dB. We also notice a remarkable reduction of the error floor.
Year
DOI
Venue
2012
10.1109/MLSP.2012.6349716
Machine Learning for Signal Processing
Keywords
Field
DocType
AWGN channels,approximation theory,decoding,parity check codes,trees (mathematics),AWGN channel,LDPC decoding,TEP decoder,additive white Gaussian noise channel,belief propagation solution,error floor reduction,finite-length regime,low-density parity-check decoding,pairwise marginal constraint,tree-like approximation,tree-structured expectation propagation
Low-density parity-check code,Computer science,Theoretical computer science,Artificial intelligence,Expectation propagation,Belief propagation,Sequential decoding,Pattern recognition,Approximation theory,Algorithm,Decoding methods,Graphical model,Additive white Gaussian noise
Conference
ISSN
ISBN
Citations 
1551-2541 E-ISBN : 978-1-4673-1025-3
978-1-4673-1025-3
0
PageRank 
References 
Authors
0.34
0
6