Low Complexity Bounds on a Class of Irregular LDPC Belief-Propagation Decoding Thresholds.
Francesca VattaAlessandro SoranzoMassimiliano ComissoGiulia ButtazzoniFulvio BabichPublished in: SoftCOM (2020)
Keyphrases
- belief propagation
- low density parity check
- low complexity
- ldpc codes
- decoding algorithm
- message passing
- graphical models
- distributed video coding
- graph cuts
- markov random field
- approximate inference
- stereo matching
- rate allocation
- error correction
- pairwise
- fixed point
- loopy belief propagation
- vlsi architecture
- upper bound
- motion estimation
- computational complexity
- turbo codes
- free energy
- error resilience
- image transmission
- lower bound
- distributed source coding
- joint source channel
- channel coding
- image compression
- machine learning