arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.05638cs.ITmath.IT
收藏

直接成形码的性能研究

On the Performance of Direct Shaping Codes

Yi Liu, Paul H. Siegel

摘要:

在这项工作中,我们研究了最近提出的直接成形代码的闪存。该速率-1代码旨在通过在存储结构化数据时最小化编程单元的平均分数来减少SLC(每个单元一位)闪存的磨损。然后,我们描述了这种算法的适应,提供MLC(每单元两位)闪存的数据整形。它使用了一个页面相关的成本模型,并被设计为与逐行、基于页面的并行编程的标准过程兼容。我们还给出了实验结果,证明MLC数据整形码的性能时,适用于英文和中文文本。然后,我们研究了潜在的错误传播特性的直接成形代码时,在嘈杂的闪存设备中使用。特别是,我们模型的误差传播作为一个有偏的随机游走在多维空间。我们证明了一个上界的错误传播概率,并提出了一个算法,可以在数值上接近下界。最后,我们研究了直接成形码的渐近性能。我们证明了SLC直接成形码是次优的意义上说,它只能实现最小的平均成本率为1的代码在一定条件下的源分布。

英文摘要:

In this work, we study a recently proposed direct shaping code for flash memory. This rate-1 code is designed to reduce the wear for SLC (one bit per cell) flash by minimizing the average fraction of programmed cells when storing structured data. Then we describe an adaptation of this algorithm that provides data shaping for MLC (two bits per cell) flash memory. It makes use of a page-dependent cost model and is designed to be compatible with the standard procedure of row-by-row, page-based, wordline programming. We also give experimental results demonstrating the performance of MLC data shaping codes when applied to English and Chinese language text. We then study the potential error propagation properties of direct shaping codes when used in a noisy flash device. In particular, we model the error propagation as a biased random walk in a multidimensional space. We prove an upper bound on the error propagation probability and propose an algorithm that can numerically approach a lower bound. Finally, we study the asymptotic performance of direct shaping codes. We prove that the SLC direct shaping code is suboptimal in the sense that it can only achieve the minimum average cost for a rate-1 code under certain conditions on the source distribution.

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

↑