Return
Dithered Belief Propagation Decoding
DOI:10.1109/TCOMM.2012.050812.110115A.png)
Abstract
En 中文
We introduce two dithered belief propagation decoding algorithms to lower the error floor with a minimal hardware overhead. One of the algorithms can additionally improve the decoding performance in the waterfall region using a large iteration limit but with a negligible increase in the average time complexity.
Keywords:
LDPC codes
belief propagation decoding
error floor
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W

