LDPC codes for partial-erasure channels in multi-level memories

In this paper, we develop a new channel model, which we name the q-ary partial erasure channel (QPEC). QPEC has a q-ary input, and its output is either one symbol or a set of M possible values. This channel mimics situations when current/voltage levels in measurement channels are only partially known, due to high read rates or imperfect current/voltage sensing. Our investigation is concentrated on the performance of low-density parity-check (LDPC) codes when used over this channel, due to their low decoding complexity with iterative-decoding algorithms. We give the density evolution equations of this channel, and develop its decoding-threshold analysis. Part of the analysis shows that finding the exact decoding threshold efficiently lies upon a solution to an open problem in additive combinatorics. For this part, we give bounds and approximations.

[1]  Harold Davenport,et al.  On the Addition of Residue Classes , 1935 .

[2]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[3]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[4]  Daniel A. Spielman,et al.  Practical loss-resilient codes , 1997, STOC '97.

[5]  Michael Mitzenmacher,et al.  Analysis of random processes via And-Or tree evaluation , 1998, SODA '98.

[6]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[7]  G. Károlyi.  Cauchy-Davenport theorem in group extensions , 2005 .

[8]  David Burshtein,et al.  Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels , 2005, IEEE Transactions on Information Theory.

[9]  Harald Niederreiter,et al.  Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..

[10]  Terence Tao,et al.  Additive combinatorics , 2007, Cambridge studies in advanced mathematics.

[11]  Vsevolod F. Lev,et al.  Open problems in additive combinatorics , 2007 .

[12]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[13]  A. Cauchy.  Oeuvres complètes: Recherches sur les nombres , 2009 .

[14]  Jehoshua Bruck,et al.  Codes for Asymmetric Limited-Magnitude Errors With Application to Multilevel Flash Memories , 2010, IEEE Transactions on Information Theory.

[15]  Richard D. Wesel,et al.  Soft Information for LDPC Decoding in Flash: Mutual-Information Optimized Quantization , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[16]  Gou Hosoya,et al.  国際会議参加報告:2014 IEEE International Symposium on Information Theory , 2014 .