.png){kind=icon}
Return
Low-Complexity Decoding for Non-Binary LDPC Codes in High Order Fields
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2010.05.070096.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a new implementation of the Extended Min-Sum (EMS) decoder for non-binary LDPC codes. A particularity of the new algorithm is that it takes into accounts the memory problem of the non-binary LDPC decoders, together with a significant complexity reduction per decoding iteration. The key feature of our decoder is to truncate the vector messages of the decoder to a limited number n(m). of values in order to reduce the memory requirements. Using the truncated messages, we propose an efficient implementation of the EMS decoder which reduces the order of complexity to O(n(m) log(2) n(m)). This complexity starts to be reasonable enough to compete with binary decoders. The performance of the low complexity algorithm with proper compensation is quite good with respect to the important complexity reduction, which is shown both with a simulated density evolution approach and actual simulations.
Keywords:
Iterative decoding
non-binary LDPC codes
low complexity algorithm
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
ShareSaveThree iodocuprate hybrids symmetrically modulated by positional isomers and the chiral conformation of N-benzyl-methylpyridinium.png)
RSC Advances
RSC AdvancesIF0
PREAI
ShareSaveShareSave
ShareSave
View more