Decoding For Iterative Reed-solomon Coding Schemes
Decoding For Iterative Reed-solomon Coding Schemes
复制标题
迭代里德-所罗门编码方案的解码
DOI：
10.1109/20.617715
复制
发表时间：
1997
期刊：
影响因子：
--
通讯作者：
V. Krachkovsky
中科院分区：
文献类型：
--
作者：
Victor Yu.Krachkovsky;Yuan Xing Lee;V. Krachkovsky
对于高密度数据存储系统，通道错误可能以突发的形式出现。这种误差相关性会在数据处理的后续阶段显著降低误码率。为了纠正错误突发，使用了交织的读所罗门(RS)码。通常，在解交织之后，通过相同的纠错算法逐个解码接收的字。提出了一种新的交织码译码方法。它基于覆盖错误定位器的概念，错误定位器定位两个或更多相邻单词中的错误位置。为了计算覆盖误差定位多项式，提出了一种改进的Berlekamp-Massey算法。结果表明，在一定的失败概率下，该算法可以纠正比设计纠错能力更多的错误。该算法在交织编码方案的更一般情况下也可能有用，其中行和列都由RS码编码。
For high density data storage systems channel errors may appear in the form of bursts. This error correlation can significantly degrade the bit error rate on the subsequent stages of data processing. To correct error bursts the interleaved Read-Solomon (RS) codes are used. Usually, after the deinterleaving, the received words are decoded one by one by the same error correction algorithm. In this paper, a novel approach for the decoding of interleaved codes is proposed. It is based on a notion of covering error locators that locate error positions in two or more adjacent words. To compute the covering error locator polynomial, a modification of the Berlekamp-Massey algorithm is proposed. It is shown that with a certain probability of failure the proposed algorithm can correct more errors than the designed error correction ability. The algorithm may also be useful in a more general case of interleaved coding schemes with both rows and columns encoded by RS code.