Title :
Multiplicatively Repeated Nonbinary LDPC Codes
Author :
Kasai, Kenta ; Declercq, David ; Poulliat, Charly ; Sakaniwa, Kohichi
Author_Institution :
Dept. of Commun. & Integrated Syst., Tokyo Inst. of Technol., Tokyo, Japan
Abstract :
We propose nonbinary LDPC codes concatenated with multiplicative repetition codes. By multiplicatively repeating the (2,3)-regular nonbinary LDPC mother code of rate 1/3, we construct rate-compatible codes of lower rates 1/6, 1/9, 1/12,.... Surprisingly, such simple low-rate nonbinary LDPC codes outperform the best low-rate binary LDPC codes so far. Moreover, we propose the decoding algorithm for the proposed codes, which can be decoded with almost the same computational complexity as that of the mother code.
Keywords :
computational complexity; concatenated codes; parity check codes; computational complexity; concatenated codes; decoding algorithm; multiplicative repeated nonbinary LDPC codes; rate-compatible codes; Channel coding; Decoding; Equations; Iterative decoding; Sparse matrices; Iterative decoding; low-rate code; nonbinary low-density parity-check code; rate compatible code; repetition code;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2011.2162259