.png){kind=icon}
Return
An Adaptive Single/Multiple Symbol Flipping Decoding Algorithm for Non-Binary LDPC Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2022.3201236.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This letter presents an adaptive single/multiple distance-symbol flipping decoding algorithm with prediction (ASMD-SFDP). Different from the D-SFDP, the presented algorithm consider both the global maximization and sec-maximization values of the reliability fluctuation quantity (RFQ). Flipping operation is performed only when the global maximization is greater than or equal to zero. Furthermore, a new flipping strategy is introduced based on the numerical gap between the global maximization and sec-maximization. The flipping operation is performed adaptively: 1) If the gap is greater than or equal to a designed threshold, only single symbol is flipped; 2) Otherwise, multiple symbols are flipped. Simulation results show that the presented algorithm can achieve a significant performance gain of 0.4 similar to 0.5 dB compared with the original D-SFDP algorithm. More interestingly, the presented algorithm also shows a much faster convergence speed.
Keywords:
Symbols
Iterative decoding
Prediction algorithms
Reliability
Maximum likelihood decoding
Complexity theory
Sun
NB-LDPC codes
flipping strategy
iterative decoding
symbol flipping decoding
convergence speed
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
Cited Papers
ShareSaveThree iodocuprate hybrids symmetrically modulated by positional isomers and the chiral conformation of N-benzyl-methylpyridinium.png)
RSC Advances
RSC AdvancesIF0
PREAI
ShareSaveConstruction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: A finite geometry approach
PREAI
ShareSaveShareSaveShareSaveShareSave
View more