首页> 外文会议>IEEE VLSI Test Symposium >Systematic b-adjacent symbol error correcting reed-solomon codes with parallel decoding
【24h】

Systematic b-adjacent symbol error correcting reed-solomon codes with parallel decoding

机译:具有并行解码的系统性b相邻符号纠错里德所罗门码

获取原文

摘要

With technology scaling, the probability of write disturbances affecting neighboring memory cells in nonvolatile memories is increasing. Multilevel cell (MLC) phase change memories (PCM) specifically suffer from such errors which affects multiple adjacent memory cells. Reed Solomon (RS) codes offer good error protection since they can correct multi-bit symbols at a time. But beyond single symbol error correction, the decoding complexity as well as the decoding latency is very high. This paper proposes a systematic b-adjacent symbol error correcting code based on Reed-Solomon codes with a low latency and low complexity parallel one step decoding scheme. A general code construction methodology is presented which can correct any errors within b-adjacent symbols. The proposed codes are compared to existing adjacent symbol error correcting Reed-Solomon codes, and it is shown that the proposed codes achieve better decoder latency. The proposed codes are also shown to achieve much better redundancy compared to symbol error correcting orthogonal Latin square (OLS) codes.
机译:随着技术的发展,写干扰影响非易失性存储器中的相邻存储单元的可能性正在增加。多级单元(MLC)相变存储器(PCM)特别受到此类错误的影响,这些错误会影响多个相邻的存储单元。里德·所罗门(RS)码提供了良好的错误保护,因为它们可以一次校正多位符号。但是,除了单符号纠错之外,解码复杂度以及解码等待时间都非常高。本文提出了一种基于Reed-Solomon码的系统的b邻符号纠错码,该码具有低等待时间和低复杂度的并行一步解码方案。提出了一种通用的代码构造方法,该方法可以纠正b相邻符号内的任何错误。将提出的代码与现有的相邻符号纠错的里德-所罗门代码进行比较,并且表明提出的代码实现了更好的解码器等待时间。与符号纠错正交拉丁方(OLS)码相比,建议的码还显示出更好的冗余性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号