arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2202.05661cs.ITmath.IT
收藏

NAND闪存的自适应读取暂停

Adaptive Read Thresholds for NAND Flash

Borja Peleato, Rajiv Agarwal, John Cioffi, Minghai Qin, Paul H. Siegel

摘要:

NAND闪存上增加的读取时间的主要来源来自以下事实:在存在噪声的情况下,必须使用不同的读取阈值电压多次读取闪存介质以使解码器成功。本文提出了一种算法,使用有限的重读次数来表征噪声分布和恢复存储的信息。硬解码和软解码都被考虑。对于硬解码,本文试图找到一个读阈值最小化的比特错误率(BER),并推导出一个表达式的码字错误率。对于软解码,它表明,最小化BER和最小化码字错误率是竞争的目标,在存在有限数量的允许的重读,并提出了两者之间的权衡。所提出的方法不需要有关噪声分布的任何先验知识,但可以在可用时利用这些信息。每个读取阈值都是基于先前读取的结果来选择的,遵循通过动态规划向后递归导出的最优策略。的方法和结果进行了研究,从一个SLC闪存的角度与高斯噪声的每个级别,但本文解释了如何将该方法扩展到其他情况。

英文摘要:

A primary source of increased read time on NAND flash comes from the fact that in the presence of noise, the flash medium must be read several times using different read threshold voltages for the decoder to succeed. This paper proposes an algorithm that uses a limited number of re-reads to characterize the noise distribution and recover the stored information. Both hard and soft decoding are considered. For hard decoding, the paper attempts to find a read threshold minimizing bit-error-rate (BER) and derives an expression for the resulting codeword-error-rate. For soft decoding, it shows that minimizing BER and minimizing codeword-error-rate are competing objectives in the presence of a limited number of allowed re-reads, and proposes a trade-off between the two. The proposed method does not require any prior knowledge about the noise distribution, but can take advantage of such information when it is available. Each read threshold is chosen based on the results of previous reads, following an optimal policy derived through a dynamic programming backward recursion. The method and results are studied from the perspective of an SLC Flash memory with Gaussian noise for each level but the paper explains how the method could be extended to other scenarios.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑