arrow
Return

Dithered Belief Propagation Decoding

delete2012-08-01
delete28
PRE
AI
F
François Leduc-Primeau *
S
Saied Hemati
S
Shie Mannor
W
Warren J. Gross
DOI:10.1109/TCOMM.2012.050812.110115Adelete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

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

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Communications cover
IEEE Transactions on Communications
IF:
8.3
Papers:
1.2W
Citations:
3.6W

Organization

T
Technion Israel Institute of Technology
Scholars:
1.6W
Papers: 1.5W
Citations: 2.0W
M
McGill University
Scholars:
5.5W
Papers: 4.9W
Citations: 7.0W