当前位置: X-MOL 学术IEEE Trans. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A New Class of Single Burst Error Correcting Codes with Parallel Decoding
IEEE Transactions on Computers ( IF 3.7 ) Pub Date : 2020-02-01 , DOI: 10.1109/tc.2019.2947425
Abhishek Das , Nur A. Touba

With technology scaling, burst errors or clustered errors are becoming increasingly common in different types of memories. Multiple bit upsets due to particle strikes, write disturbance errors, and magnetic field coupling are a few of the mechanisms which cause clustered errors. In this article, a new class of single burst error correcting codes are presented which correct a single burst of any size b within a codeword. A code construction methodology is presented which enables us to construct the proposed scheme from existing codes, e.g., Hamming codes. A new single step decoding methodology for the proposed class of codes is also presented which enables faster decoding. Different code constructions using Hamming codes, and BCH codes have been presented in this paper and a comparison is made with existing schemes in terms of decoding complexity and data redundancy. The proposed scheme in all cases reduces the decoder complexity for little to no increase in data redundancy, specifically for higher burst error sizes.

中文翻译:

一类新的并行解码单突发纠错码

随着技术的扩展,突发错误或集群错误在不同类型的存储器中变得越来越普遍。由于粒子撞击、写入干扰错误和磁场耦合导致的多位翻转是导致集群错误的一些机制。在本文中,提出了一类新的单突发纠错码,它可以纠正码字内任意大小 b 的单突发。提出了一种代码构建方法,它使我们能够从现有代码(例如汉明码)构建所提出的方案。还提出了一种新的单步解码方法,用于所提出的代码类别,它可以实现更快的解码。使用汉明码的不同代码构造,本文提出了BCH码和BCH码,并在解码复杂度和数据冗余方面与现有方案进行了比较。所提出的方案在所有情况下都降低了解码器复杂度,数据冗余几乎没有增加,特别是对于更高的突发错误大小。
更新日期:2020-02-01
down
wechat
bug