.png){kind=icon}
Return
Reliability-Based Iterative Decoding Algorithm for LDPC Codes With Low Variable-Node Degree
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2014.2363112.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, a new reliability-based iterative majority-logic decoding (RBI-MLGD) algorithm that computes the extrinsic information of previous iterations of the variable node is proposed. This decoding algorithm is called historical-extrinsic reliability-based iterative decoder (HE-RBID) and improves the bit-error-rate performance of the previous RBI-MLGD. HE-RBID is particularly interesting for codes with a low degree of variable node, where traditional RBI-MLGD algorithms do not provide a good behavior. HE-RBID ensures a good performance without searching for the minimum at the check node and only by exchanging 1-bit messages between variable and check nodes.
Keywords:
Low-density Parity-Check (LDPC) codes
decoding
bit-flipping
historical-extrinsic reliability-based iterative decoder (HE-RBID)
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
Cited Papers
Reduced complexity iterative decoding of low-density parity check codes based on belief propagation
.png){kind=icon}
PREAI
ShareSaveShareSave
ShareSaveShareSave
ShareSave no more
no more