Method and device for solving polynomial error position

Abstract

The invention discloses a method and a device for solving an error location polynomial. The method comprises the following steps of: inputting coefficients of odd-term syndromes and even-term syndromes into a first period of each turn of iteration, and calculating a modification value required by the subsequent turn of iteration; judging whether the modification value is 0 in a second period of each turn of iteration, and outputting the coefficients and intermediate quantity of an intermediate polynomial, which are required by the subsequent turn of iteration, according to a judgment result; and calculating the coefficients of the error location polynomial, which are required by the subsequent turn of iteration, in the second period of each turn of iteration, according to the modification value, the coefficients of the error location polynomial, which are required by this turn of iteration, and the coefficients and the intermediate quantity of the intermediate polynomial, which are required by this turn of iteration. By adoption of an IBM iteration circuit for solving the error location polynomial provided by the invention, key path time delay is greatly reduced, and the problems about area and time sequence are solved in an equilibrium way, so the method and the device for solving the error location polynomial can be applied to high-frequency data transmission.

Description

technical field

[0001] The present application relates to the fields of digital communication and data information processing, in particular to a method and device for solving polynomials in error positions. Background technique

[0002] Error-correcting code technology is widely used in data communication, data storage, etc. Now common error-correcting codes include: RS (Reed-Solomon Reed-Solomon) code, BCH code, and Hamming code. Among them, Hamming code has a small code distance. Only one error can be corrected. RS codes and BCH codes can perform multi-bit error correction, so they are widely used. In the decoding process of BCH code, the most critical step is to solve the key equation to obtain the error location polynomial, which occupies the largest resources and the largest amount of calculation.

[0003] For a binary BCH code that can correct up to t errors, the solution to the key equation is to obtain 2t syndrome values ​​S 1 , S 2 ,...,S 2t To determine the e...

Images