一种可迭代译码的张量积码及其在数据存储中的应用
An Iteratively Decodable Tensor Product Code with Application to Data Storage
摘要：
错误模式校正码（EPCC）可以被构造为提供针对维特比检测器的输出处的符号间干扰信道的主要错误事件的校正子解码表。为了使校正子表的大小易于管理，并且使可能的错误事件列表的大小合理，EPCC的码字长度需要足够短。然而，这种短长度代码的速率对于硬盘驱动器应用来说太低。为了适应所需的大冗余，可以只记录具有符号校正码的EPCC张量积的奇偶校验位的高度压缩函数。在本文中，我们提出的张量错误模式校正码（T-EPCC）是线性时间可编码的，也设计了一个低复杂度的软迭代解码算法EPCC的张量积与q元LDPC（T-EPCC-qLDPC）。仿真结果表明，T-EPCC-qLDPC在1/2 KB扇区内实现了与单级qLDPC几乎相同的性能，但译码复杂度降低了50%。此外，在相同的解码器复杂度下，1 KB T-EPCC-qLDPC的性能优于1/2 KB单级qLDPC。
英文摘要：
The error pattern correcting code (EPCC) can be constructed to provide a syndrome decoding table targeting the dominant error events of an inter-symbol interference channel at the output of the Viterbi detector. For the size of the syndrome table to be manageable and the list of possible error events to be reasonable in size, the codeword length of EPCC needs to be short enough. However, the rate of such a short length code will be too low for hard drive applications. To accommodate the required large redundancy, it is possible to record only a highly compressed function of the parity bits of EPCC's tensor product with a symbol correcting code. In this paper, we show that the proposed tensor error-pattern correcting code (T-EPCC) is linear time encodable and also devise a low-complexity soft iterative decoding algorithm for EPCC's tensor product with q-ary LDPC (T-EPCC-qLDPC). Simulation results show that T-EPCC-qLDPC achieves almost similar performance to single-level qLDPC with a 1/2 KB sector at 50% reduction in decoding complexity. Moreover, 1 KB T-EPCC-qLDPC surpasses the performance of 1/2 KB single-level qLDPC at the same decoder complexity.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
