.png){kind=icon}
.png){kind=icon}
Return
Efficient Stochastic Decoding of Non-Binary LDPC Codes with Degree-Two Variable Nodes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2011.122211.111737.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, we present an optimized version of the relaxed half-stochastic (RHS) algorithm targeted at non-binary LDPC codes with a variable node degree equal to two. The new algorithm has significantly fewer multiplications while maintaining an error-correction performance and a decoding iteration count identical to those of the original.
Keywords:
LDPC codes
non-binary
stochastic decoding