ECC system supporting different-length Reed-Solomon codes whose
generator polynomials have common roots
    1.
    发明授权
    ECC system supporting different-length Reed-Solomon codes whose generator polynomials have common roots 失效
    ECC系统支持不同长度的里德 - 所罗门码,其生成多项式具有共同的根

    公开(公告)号:US5768296A

    公开(公告)日:1998-06-16

    申请号:US761689

    申请日:1996-12-06

    CPC classification number: H03M13/6516 H03M13/151 H03M13/35

    Abstract: A Reed-Solomon error-correction coding (ECC) scheme selectively supports two different-length codes to optimize the trade-off between error performance and the amount of disk space required to store protection symbols. The encoder contains two sets of alpha multipliers; part of one set is multiplexed with the other depending on which code is being used. Also, a shift register within the encoder is selectively lengthened or shortened depending on the code. The code pair is selected so that the generator polynomial of the shorter code is a complete divisor of the generator polynomial of the longer code. Thus, one code is a sub-code of the other. Accordingly, the ECC system is able to use the same syndrome calculator for each code. The error-correction decoder uses those syndromes that correspond to the roots of the generator polynomial of the code being used.

    Abstract translation: Reed-Solomon纠错编码(ECC)方案选择性地支持两个不同长度的代码来优化误差性能与存储保护符号所需的磁盘空间量之间的权衡。 编码器包含两组α乘数; 根据正在使用的代码,一组的一部分与另一组复用。 此外,根据代码,编码器内的移位寄存器被选择性地延长或缩短。 选择代码对,使得较短代码的生成多项式是较长代码的生成多项式的完全除数。 因此,一个代码是另一个的子代码。 因此,ECC系统能够对每个代码使用相同的校正子计算器。 纠错解码器使用与所使用代码的生成多项式的根相对应的那些校正子。

Patent Agency Ranking