当前位置: X-MOL 学术IEEE Trans. Inform. Theory › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Syndrome-Coupled Rate-Compatible Error-Correcting Codes: Theory and Application
IEEE Transactions on Information Theory ( IF 2.5 ) Pub Date : 2020-04-01 , DOI: 10.1109/tit.2020.2966439
Pengfei Huang , Yi Liu , Xiaojie Zhang , Paul H. Siegel , Erich F. Haratsch

Rate-compatible error-correcting codes (ECCs), which consist of a set of extended codes, are of practical interest in both wireless communications and data storage. In this work, we first study the lower bounds for rate-compatible ECCs, thus proving the existence of good rate-compatible codes. Then, we propose a general framework for constructing rate-compatible ECCs based on cosets and syndromes of a set of nested linear codes. We evaluate our construction from two points of view. From a combinatorial perspective, we show that we can construct rate-compatible codes with increasing minimum distances, and we discuss decoding algorithms and correctable patterns of errors and erasures. From a probabilistic point of view, we prove that we are able to construct capacity-achieving rate-compatible codes, generalizing a recent construction of capacity-achieving rate-compatible polar codes. Applications of rate-compatible codes to data storage are considered. We design two-level rate-compatible codes based on Bose-Chaudhuri-Hocquenghem (BCH) and low-density parity-check (LDPC) codes which are two popular codes widely used in the data storage industry, and then we evaluate the performance of these codes in multi-level cell (MLC) flash memories. We also examine code performance on binary and $q$ -ary symmetric channels. Finally, we briefly discuss two variations of our main construction and their relative performance.

中文翻译:

综合征耦合速率兼容纠错码:理论与应用

速率兼容的纠错码 (ECC) 由一组扩展码组成,在无线通信和数据存储方面都具有实际意义。在这项工作中,我们首先研究了速率兼容 ECC 的下界,从而证明了良好的速率兼容代码的存在。然后,我们提出了一个通用框架,用于基于一组嵌套线性码的陪集和综合症来构建速率兼容的 ECC。我们从两个角度评估我们的建设。从组合的角度来看,我们表明我们可以构建具有增加的最小距离的速率兼容代码,并且我们讨论了解码算法和可纠正的错误和擦除模式。从概率的角度来看,我们证明我们能够构建容量实现速率兼容的代码,概括最近构建的容量实现速率兼容的极化码。考虑了速率兼容代码在数据存储中的应用。我们设计了基于 Bose-Chaudhuri-Hocquenghem (BCH) 和低密度奇偶校验 (LDPC) 码这两种在数据存储行业中广泛使用的流行码的两级速率兼容码,然后我们评估了性能这些代码位于多级单元 (MLC) 闪存中。我们还检查了二进制和 $q$ -ary 对称通道上的代码性能。最后,我们简要讨论了我们主要结构的两种变体及其相对性能。我们设计了基于 Bose-Chaudhuri-Hocquenghem (BCH) 和低密度奇偶校验 (LDPC) 码这两种在数据存储行业中广泛使用的流行代码的两级速率兼容代码,然后我们评估了这些代码位于多级单元 (MLC) 闪存中。我们还检查了二进制和 $q$ -ary 对称通道上的代码性能。最后,我们简要讨论了我们主要结构的两种变体及其相对性能。我们设计了基于 Bose-Chaudhuri-Hocquenghem (BCH) 和低密度奇偶校验 (LDPC) 码这两种在数据存储行业中广泛使用的流行代码的两级速率兼容代码,然后我们评估了这些代码位于多级单元 (MLC) 闪存中。我们还检查了二进制和 $q$ -ary 对称通道上的代码性能。最后,我们简要讨论了我们主要结构的两种变体及其相对性能。
更新日期:2020-04-01
down
wechat
bug