Non-Binary LDPC Code Optimization for Partial-Response Channels

In this paper, we analyze and optimize non- binary low-density parity-check (NB-LDPC) codes for magnetic recording applications. While the topic of the error floor performance of binary LDPC codes over additive white Gaussian noise (AWGN) channels has recently received considerable attention, very little is known about the error floor performance of NB-LDPC codes over other types of channels, despite the early results demonstrating superior characteristics of NB-LDPC codes relative to their binary counterparts. We first show that, due to outer looping between detector and decoder in the receiver, the error profile of NB-LDPC codes over partial-response (PR) channels is qualitatively different from the error profile over AWGN channels - this observation motivates us to introduce new combinatorial definitions aimed at capturing decoding errors that dominate PR channel error floor region. We call these errors (or objects) balanced absorbing sets (BASs), which are viewed as a special subclass of previously introduced absorbing sets (ASs). Additionally, we prove that due to the more restrictive definition of BASs (relative to the more general class of ASs), an additional degree of freedom can be exploited in code design for PR channels. We then demonstrate that the proposed code optimization aimed at removing dominant BASs offers improvements in the frame error rate (FER) in the error floor region by up to 2.5 orders of magnitude over the uninformed designs. Our code optimization technique carefully yet provably removes BASs from the code while preserving its overall structure (node degree, quasi-cyclic property, regularity, etc.). The resulting codes outperform existing binary and NB-LDPC solutions for PR channels by about 2.5 and 1.5 orders of magnitude, respectively.

[1]  David J. C. MacKay,et al.  Low-density parity check codes over GF(q) , 1998, IEEE Communications Letters.

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

[3]  Lara Dolecek,et al.  Analysis and Enumeration of Absorbing Sets for Non-Binary Graph-Based Codes , 2014, IEEE Trans. Commun..

[4]  Bane Vasic,et al.  Coding and Signal Processing for Magnetic Recording Systems , 2004 .

[5]  Lin Wang,et al.  Design of Protograph LDPC Codes for Partial Response Channels , 2012, IEEE Transactions on Communications.

[6]  Seungjune Jeon,et al.  Binary SOVA and Nonbinary LDPC Codes for Turbo Equalization in Magnetic Recording Channels , 2010, IEEE Transactions on Magnetics.

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

[8]  ZhouBo,et al.  High performance non-binary quasi-cyclic LDPC codes on euclidean geometries , 2009 .

[9]  Giulio Colavolpe,et al.  On the application of factor graphs and the sum-product algorithm to ISI channels , 2005, IEEE Transactions on Communications.

[10]  Paul H. Siegel,et al.  Turbo decoding for partial response channels , 2000, IEEE Trans. Commun..

[11]  E.F. Haratsch,et al.  Quasi-Cyclic LDPC Codes for the Magnetic Recording Channel: Code Design and VLSI Implementation , 2007, IEEE Transactions on Magnetics.

[12]  William E. Ryan,et al.  Low-Floor Detection/Decoding of LDPC-Coded Partial Response Channels , 2010, IEEE Journal on Selected Areas in Communications.

[13]  Lara Dolecek,et al.  Asymptotic Distribution of Absorbing Sets and Fully Absorbing Sets for Regular Sparse Code Ensembles , 2011, IEEE Transactions on Communications.

[14]  Lara Dolecek,et al.  Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes , 2009, IEEE Transactions on Information Theory.