Binary SOVA and Nonbinary LDPC Codes for Turbo Equalization in Magnetic Recording Channels

Nonbinary low-density parity check (LDPC) codes can provide coding gains over binary LDPC codes at the cost of increased complexity. For magnetic recording channels, optimal detectors for the nonbinary codes are symbol-based, which are significantly more complex than binary detectors. In this paper, we investigate the feasibility of using much less complex bit-based soft output Viterbi algorithm (SOVA) as a channel detector for nonbinary LDPC codes and performing turbo iterations between the SOVA and the nonbinary LDPC decoder. We show that performance gains can still be obtained by the turbo iterations by using the bit-based SOVA, although the performance gains are suboptimal to the symbol-based detectors. This scheme can be useful in low-complexity nonbinary LDPC coding systems.

[1]  Joachim Hagenauer,et al.  A Viterbi algorithm with soft-decision outputs and its applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[2]  Matthew C. Davey,et al.  Error-Correction using Low Density Parity Check Codes , 1999 .

[3]  A. Risso.  Layered LDPC Decoding Over $GF(q)$ for Magnetic Recording Channel , 2009, IEEE Transactions on Magnetics.

[4]  Wu Chang,et al.  Performance and Decoding Complexity of Nonbinary LDPC Codes for Magnetic Recording , 2008, IEEE Transactions on Magnetics.

[5]  Peter A. Hoeher,et al.  Optimal subblock-by-subblock detection , 1995, IEEE Trans. Commun..

[6]  Zongwang Li,et al.  A class of good quasi-cyclic low-density parity check codes based on progressive edge growth graph , 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004..

[7]  Paul H. Siegel,et al.  Soft-decision Reed-Solomon decoding on partial response channels , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[8]  H. Wymeersch,et al.  Log-domain decoding of LDPC codes over , .

[9]  Alessandro Risso.  Layered LDPC Decoding Over for Magnetic Recording Channel , 2009 .

[10]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

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

[12]  Wu Chang,et al.  Nonbinary LDPC Codes for 4-kB Sectors , 2008, IEEE Transactions on Magnetics.

[13]  Evangelos Eleftheriou,et al.  Progressive edge-growth Tanner graphs , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[14]  David Declercq,et al.  Decoding Algorithms for Nonbinary LDPC Codes Over GF$(q)$ , 2007, IEEE Transactions on Communications.

[15]  J. R. Cruz,et al.  Comments on "Performance and Decoding Complexity of Nonbinary LDPC Codes for Magnetic Recording" , 2008 .

[16]  D. Mackay,et al.  Low-Density Parity Check Codes over , 1998 .

[17]  J. R. Cruz,et al.  Optimal channel detection for nonbinary coded partial response channels , 2009, IEEE Transactions on Communications.

[18]  Jaekyun Moon,et al.  Equalization For Maximum Likelihood Detectors , 1994, Digest of the Magnetic Recording Conference.