Tree-structure expectation propagation for decoding LDPC codes over binary erasure channels

@article{Olmos2010TreestructureEP,
  title={Tree-structure expectation propagation for decoding LDPC codes over binary erasure channels},
  author={Pablo M. Olmos and Juan Jos{\'e} Murillo-Fuentes and Fernando P{\'e}rez-Cruz},
  journal={2010 IEEE International Symposium on Information Theory},
  year={2010},
  pages={799-803}
}
  • Pablo M. Olmos, Juan José Murillo-Fuentes, Fernando Pérez-Cruz
  • Published in
    IEEE International Symposium…
    2010
  • Computer Science, Mathematics
  • Expectation Propagation is a generalization to Belief Propagation (BP) in two ways. First, it can be used with any exponential family distribution over the cliques in the graph. Second, it can impose additional constraints on the marginal distributions. We use this second property to impose pair-wise marginal distribution constraints in some check nodes of the LDPC Tanner graph. These additional constraints allow decoding the received codeword when the BP decoder gets stuck. In this paper, we… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 19 CITATIONS

    MAP decoding for LDPC codes over the binary erasure channel

    VIEW 8 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    Tree-structured expectation propagation for LDPC decoding over the AWGN channel

    VIEW 13 EXCERPTS
    CITES METHODS

    Finite-length analysis of the TEP decoder for LDPC ensembles over the BEC

    VIEW 7 EXCERPTS
    CITES METHODS & BACKGROUND

    AVN-based Elimination of Short Cycles in Tanner Graphs of QC LDPC Codes

    VIEW 1 EXCERPT
    CITES METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 10 REFERENCES

    Maxwell Construction: The Hidden Bridge Between Iterative and Maximum a Posteriori Decoding

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Tree-structured Approximations by Expectation Propagation

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Efficient erasure correcting codes

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    On decoding of low-density parity-check codes over the binary erasure channel

    VIEW 1 EXCERPT

    Capacity-achieving sequences for the erasure channel

    VIEW 2 EXCERPTS

    Improved low-density parity-check codes using irregular graphs and belief propagation

    VIEW 1 EXCERPT

    A recursive approach to low complexity codes

    VIEW 1 EXCERPT

    Markov chain expectation propagation for decoding in erasure channels

    • P. M. Olmos, J. J. Murillo-Fuentes, F. Pérez-Cruz
    • IEEE Trans. on Information Theory, In preparation.
    VIEW 2 EXCERPTS