Increasing the Lifetime of Flash Memories Using Multi-Dimensional Graph-Based Codes
Increasing the Lifetime of Flash Memories Using Multi-Dimensional Graph-Based Codes
复制标题
DOI：
10.1109/itw44776.2019.8989395
复制
发表时间：
2019-08
期刊：
影响因子：
--
通讯作者：
Ahmed Hareedy;Rohith Kuditipudi;Robert Calderbank
中科院分区：
文献类型：
--
作者：
Ahmed Hareedy;Rohith Kuditipudi;Robert Calderbank
为了满足数据密集型应用的需求，数据存储设备的密度要求越来越高。随着密度的增加，出现了各种各样的误差来源。在密集存储设备中，基于多维图的码能够减轻干扰和信道不均匀性等误差源。近年来，提出了一种提高基于循环的MD空间耦合码性能的技术。该技术仔细地重新定位循环，以尽量减少短周期的数量。然而，当它们组合在一起形成更高级的对象时，循环变得更加有害，例如，吸收集合，包括低重量的码字。在本文中，我们展示了如何利用MD重定位来最小化MD代码图中有害对象的数量。此外，我们还展示了通过关注对象而不是周期来节省搬迁安排的数量。我们的技术适用于各种一维(OD)码。仿真结果表明，与具有相似参数的外径码相比，采用本技术设计的外径码在实际Flash系统中具有显著的寿命增益。
In order to meet the demands of data-hungry applications, data storage devices are required to be increasingly denser. Various sources of error appear with this increase in density. Multi-dimensional (MD) graph-based codes are capable of mitigating error sources like interference and channel non-uniformity in dense storage devices. Recently, a technique was proposed to enhance the performance of MD spatially-coupled codes that are based on circulants. The technique carefully relocates circulants to minimize the number of short cycles. However, cycles become more detrimental when they combine together to form more advanced objects, e.g., absorbing sets, including low-weight codewords. In this paper, we show how MD relocations can be exploited to minimize the number of detrimental objects in the graph of an MD code. Moreover, we demonstrate the savings in the number of relocation arrangements earned by focusing on objects rather than cycles. Our technique is applicable to a wide variety of one-dimensional (OD) codes. Simulation results reveal significant lifetime gains in practical Flash systems achieved by MD codes designed using our technique compared with OD codes having similar parameters.