.png){kind=icon}
Return
Set Message-Passing Decoding Algorithms for Regular Non-Binary LDPC Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2017.2746101.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In the check node (CN) update of non-binary message-passing algorithms, each element of reliability vectors takes the same computational complexity. However, our analysis indicates that various elements in the same vector have various correct probabilities, thus have different contributions to error performance. In order to match computational complexity with correct probability, all elements in a vector are partitioned into different sets. For the extended min-sum (EMS) decoding, various strategies are applied for sets according to their correct probability. For the trellis-based EMS decoding, it is interesting that set partition only involves fixed paths, thus it does not need to search over the whole trellis of a CN. Complexity analysis and simulation results show that the proposed algorithms efficiently decode non-binary low-density parity-check codes, including ultra-sparse ones.
Keywords:
Non-binary LDPC codes
check node update
set partition
fixed paths
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}
ShareSaveShareSaveShareSave
ShareSave
View more