Q-ary LDPC decoders with reduced complexity

Q-ary low-density parity-check (LDPC) codes achieve exceptional error performance at the expense of computation simplicity. Solutions to accelerate the decoding process have become one of the focuses in literature. In this paper, a decoding method is proposed, based on the subcode concept, to speed up the dominant iterative process. The method leads to speed improvement with moderate error-performance penalty.