...
【24h】

LDPC Codes for 2D Arrays

机译:二维阵列的LDPC码

获取原文
获取原文并翻译 | 示例
           

摘要

Binary codes over 2D arrays are very useful in data storage, where each array column represents a storage device or unit that may suffer failure. In this paper, we propose a new framework for probabilistic construction of codes on 2D arrays. Instead of a pure combinatorial erasure model used in traditional array codes, we propose a mixed combinatorial-probabilistic model of limiting the number of column failures, and assuming a binary erasure channel in each failing column. For this model, we give code constructions and detailed analysis that allow sustaining a large number of column failures with graceful degradation in the fraction of erasures correctable in failing columns. Another advantage of the new framework is that it uses low-complexity iterative decoding. The key component in the analysis of the new codes is to analyze the decoding graphs induced by the failed columns, and infer the decoding performance as a function of the code design parameters, as well as the array size and failure parameters. A particularly interesting class of codes, called probabilistically maximum distance separable (MDS) array codes, gives fault-tolerance that is equivalent to traditional MDS array codes. The results also include a proof that the 2D codes outperform standard 1D low-density parity-check codes.
机译:2D阵列上的二进制代码在数据存储中非常有用,其中每个阵列列代表一个可能会发生故障的存储设备或单元。在本文中,我们为二维阵列上的代码的概率构造提出了一个新的框架。代替传统阵列代码中使用的纯组合擦除模型,我们提出了一种混合组合概率模型,该模型限制列故障的数量,并假设每个故障列中都有一个二进制擦除通道。对于此模型,我们给出代码构造和详细的分析,以允许维持大量的列故障,并适当降低故障列中可纠正的擦除比例。新框架的另一个优点是它使用了低复杂度的迭代解码。分析新代码的关键部分是分析由失败列引起的解码图,并根据代码设计参数以及数组大小和失败参数来推断解码性能。一类特别有趣的代码,称为概率最大距离可分离(MDS)阵列代码,可提供与传统MDS阵列代码等效的容错能力。结果还包括2D码优于标准1D低密度奇偶校验码的证明。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号