Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

LDPC Codes for Partial-Erasure Channels in Multi-Level Memories (1401.4799v4)

Published 20 Jan 2014 in cs.IT and math.IT

Abstract: 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-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.

Citations (7)

Summary

We haven't generated a summary for this paper yet.