English

LDPC Codes for Partial-Erasure Channels in Multi-Level Memories

Information Theory 2014-02-13 v4 math.IT

Abstract

In this paper, we develop a new channel model, which we name the qq-ary partial erasure channel (QPEC). QPEC has a qq-ary input, and its output is either one symbol or a set of MM 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-pheck (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.

Keywords

Cite

@article{arxiv.1401.4799,
  title  = {LDPC Codes for Partial-Erasure Channels in Multi-Level Memories},
  author = {Rami Cohen and Yuval Cassuto},
  journal= {arXiv preprint arXiv:1401.4799},
  year   = {2014}
}

Comments

7 pages, 3 figures. Partial version was submitted to ISIT 2014

R2 v1 2026-06-22T02:49:34.177Z