.png){kind=icon}
Return
Two Bit-Flipping Decoding Algorithms for Low-Density Parity-Check Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2009.03.041129.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, a low complexity decoding algorithm for binary linear block codes is applied to low-density parity-check (LDPC) codes and improvements are described, namely an extension to soft-decision decoding and a loop detection mechanism. For soft decoding, only one real-valued addition per code symbol is needed, while the remaining operations are only binary as in the hard decision case. The decoding performance is considerably increased by the loop detection. Simulation results are used to compare the performance with other known decoding strategies for LDPC codes, with the result that the presented algorithms offer excellent performances at smaller complexity.
Keywords:
Belief propagation algorithm
bit-flipping decoding
hard-decision decoding
low-density parity-check codes
soft-decision decoding
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
Organization
Cited Papers
.png){kind=icon}
Reduced complexity iterative decoding of low-density parity check codes based on belief propagation
PREAI
ShareSaveShareSaveShareSave
ShareSaveShareSaveShareSave
View more