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.
Published in:
Communications Letters, IEEE
(Volume:16
,
Issue:
3
)
Date of Publication: March 2012