摘要
该文针对Reed-Solomon码纠错算法计算复杂度较高、运算时间较长等问题,提出一种自适应数据逐层分解的Reed-Solomon码的迭代译码纠错方法。首先,接收码通过逐层分解将随机错误或突发错误分散于不同的子序列中,缩小突发或随机错误的查找范围;其次,制定约束规则确定错误数目,同时根据不同的伴随矩阵维数自适应选择迭代求解关键方程的方法,定位子序列中误码的位置;最后,计算正确码字,结束纠错。实验测试表明,该算法在保证不漏检误码的前提下,能够有效简化计算多项式的维数,减少计算量和复杂度,纠错时效优于DFT(Discrete Fourier Transform)算法和BM(Berlekamp-Massey)算法。特别是对2维码数据的纠错测试中,与传统算法相比,该算法纠错时效可提升一个数量级。
In order to reduce the computational complexity, an improved decoding algorithm based on a layer-wise decomposition transform is proposed for Reed-Solomon （RS） codes in this paper. Firstly, the received codewords are split into a number of sub-sequence codewords by layer-wise decomposition. The random or burst error are dispersed in different sub-sequences, narrowing search areas of the burst or random errors. Secondly, the appropriate rules are developed to determine the number of errors. To help locate the error pattern of the sub-sequence, an adaptive iterative method to solve the key equation is used according to the adjoin matrix dimension. Finally, the correct codewords are obtained by subtracting error estimation from the received sequence. The tests show that in premise of detecting all errors the order of the polynomial is reduced and the computational complexity is lowered. The rate of error correction of the proposed algorithm is higher than DFT （Discrete Fourier Transform） algorithm and BM （Berlekamp-Massey） algorithm. Especially in the tests of the two-dimensional code, error correction efficiency is improved one order of magnitude.
出处
《电子与信息学报》
EI
CSCD
北大核心
2015年第5期1173-1179,共7页
Journal of Electronics & Information Technology
基金
河北省科技支撑项目资助课题
