Low-Floor Detection/Decoding of LDPC-Coded Partial Response Channels

The error-rate floor phenomenon associated with iterative LDPC decoders has delayed the use of LDPC codes in certain communication and storage systems. Error floors are known to generally be caused by so-called trapping sets which have the effect of confounding the decoder. In this paper, we introduce two techniques that lower the error-rate floors for LDPC-coded partial response (PR) channels which are applicable to magnetic and optical storage. The techniques involve, via external measures, "pinning" one of the bits in each problematic trapping set and then letting the iterative decoder proceed to correct the rest of the bits. We also extend our earlier work on generalized-LDPC (G-LDPC) decoders for error-floor mitigation on the AWGN channel to partial response channels. Our simulations on PR1 and EPR4 channels demonstrate that the floor for the code chosen for this study, a 0.78(2048,1600) quasicyclic LDPC code, is lowered by orders of magnitude, beyond the reach of simulations. Because simulation in the floor region is so time-consuming, a method for accelerating such simulations is essential for research in this area. In this paper, we present an extension of Richardson's importance sampling technique for estimating the level of error floors.

[1]  Shu Lin,et al.  Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.

[2]  Yifei Zhang,et al.  Toward low LDPC-code floors: a case study , 2009, IEEE Transactions on Communications.

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

[4]  Lara Dolecek,et al.  Lowering LDPC Error Floors by Postprocessing , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[5]  Richard D. Wesel,et al.  Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes , 2007, 2007 IEEE International Conference on Communications.

[6]  Thomas J. Richardson,et al.  Error Floors of LDPC Codes , 2003 .

[7]  B. V. K. Vijaya Kumar,et al.  Error Floor Estimation of Long LDPC Codes on Partial Response Channels , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[8]  Babak Daneshrad,et al.  A performance improvement and error floor avoidance technique for belief propagation decoding of LDPC codes , 2005, 2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications.

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

[10]  Murad Hizlan,et al.  Determinate state convolutional codes , 1993, IEEE Trans. Commun..

[11]  Yang Han,et al.  LDPC Coding for Magnetic Storage: Low Floor Decoding Algorithms, System Design and Performance Analysis , 2008 .

[12]  William E. Ryan,et al.  Low-floor decoders for LDPC codes , 2009, IEEE Transactions on Communications.

[13]  E. Bertrand,et al.  Simplified trellis decoding of block codes by selective pruning , 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004..

[14]  E.R. Berlekamp,et al.  The technology of error-correcting codes , 1980, Proceedings of the IEEE.

[15]  Hua Xiao,et al.  Graph-based message-passing schedules for decoding LDPC codes , 2004, IEEE Transactions on Communications.

[16]  Michael Chertkov,et al.  Reducing the Error Floor , 2007, 2007 IEEE Information Theory Workshop.

[17]  Yang Han,et al.  Pinning techniques for low-floor detection/decoding of LDPC-Coded partial response channels , 2008, 2008 5th International Symposium on Turbo Codes and Related Topics.

[18]  V. Anantharam,et al.  Evaluation of the Low Frame Error Rate Performance of LDPC Codes Using Importance Sampling , 2007, 2007 IEEE Information Theory Workshop.

[19]  Honghai Zhang,et al.  Distributed Inter-Cell Interference Mitigation in OFDMA Wireless Data Networks , 2008, 2008 IEEE Globecom Workshops.

[20]  O. Milenkovic,et al.  Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

[21]  P. Vontobel,et al.  Graph-covers and iterative decoding of nite length codes , 2003 .

[22]  W. Ryan,et al.  LDPC decoder strategies for achieving low error floors , 2008, 2008 Information Theory and Applications Workshop.

[23]  Richard D. Wesel,et al.  Construction of irregular LDPC codes with low error floors , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[24]  Robert J. McEliece,et al.  On the BCJR trellis for linear block codes , 1996, IEEE Trans. Inf. Theory.

[25]  Lara Dolecek,et al.  Error floors in LDPC codes: Fast simulation, bounds and hardware emulation , 2008, 2008 IEEE International Symposium on Information Theory.

[26]  Yifei Zhang,et al.  Structured IRA Codes: Performance Analysis and Construction , 2007, IEEE Transactions on Communications.

[27]  David J. C. MacKay,et al.  Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check cCodes , 2003, MFCSIT.

[28]  Stephen G. Wilson,et al.  A General Method for Finding Low Error Rates of LDPC Codes , 2006, ArXiv.

[29]  William E. Ryan,et al.  On importance sampling for linear block codes , 2003, IEEE International Conference on Communications, 2003. ICC '03..