Layered LDPC Decoding Over $GF(q)$ for Magnetic Recording Channel

This paper proposes a layered decoding algorithm for the low-density parity-check (LDPC) codes over GF(q). The layered decoding can be applied to parity-check matrices that are structured in layers, such as quasi-cyclic (QC) parity-check matrices. When simulated over a magnetic recording channel, the layered decoder outperforms the conventional decoder in the number of inner iterations and in the block error rate.

[1]  D. Mackay,et al.  Low density parity check codes over GF(q) , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).

[2]  Zhixing Yang,et al.  Fast Min-Sum Algorithms for Decoding of LDPC over GF(q) , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Chengdu.

[3]  David Declercq,et al.  Extended MinSum Algorithm for Decoding LDPC Codes over GF ( q ) , .

[4]  D.E. Hocevar,et al.  A reduced complexity decoder architecture via layered decoding of LDPC codes , 2004, IEEE Workshop onSignal Processing Systems, 2004. SIPS 2004..

[5]  Hongxin Song,et al.  Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording , 2003 .

[6]  Naresh R. Shanbhag,et al.  Low-power VLSI decoder architectures for LDPC codes , 2002, ISLPED '02.

[7]  Shu Lin,et al.  A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols , 2003, IEEE Communications Letters.

[8]  David Declercq,et al.  Extended minsum algorithm for decoding LDPC codes over GF(/sub q/ , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[9]  P. Savazzi,et al.  Efficient design of non-binary LDPC codes for magnetic recording channels, robust to error bursts , 2008, 2008 5th International Symposium on Turbo Codes and Related Topics.