Galois Field Multiplier and Erasure Correction Codec System

Abstract

The application discloses a Galois field multiplier and an erasure correction codec system. Wherein, the Galois field multiplier includes a plurality of basic operation units connected in series and a plurality of cycle processing units connected in series, the total number of basic operation units and the total number of cycle processing units are based on the data bit width of the input data of the Galois field multiplier Sure. Each basic operation unit performs Galois field multiplication on the received data and the target generator, and outputs the result of the multiplication to the next operation unit and the corresponding loop processing unit. The cyclic processing unit group is used to determine the current cycle times according to the input data, the initialization data and the Galois field multiplication operation result output by the basic operation unit group, and output the final calculation result. The application can not only effectively reduce the hardware resource and area consumption of the storage system, but also support the flexible configuration of Galois field polynomials.

Description

technical field [0001] The present application relates to the field of computer technology, in particular to a Galois field multiplier and an erasure correction codec system. Background technique [0002] In the fields of data transmission and data storage, erasure codes are favored for their lower storage costs. RS code (Reed-Solomon, Reed-Solomon code) is a relatively common EC code (Erasure Code, erasure code), which can calculate N check data blocks based on M data blocks. Among the total number of M+N data blocks, only N normal data blocks can be selected arbitrarily to recover all the original data. Especially in the field of data storage, erasure coding is an extremely important means to ensure data reliability. RS erasure coding process such as figure 1 As shown, where B is the matrix used for encoding, the gray part such as the lower half B11 is the Cauchy or Vandermonde matrix, D is the storage data disk that needs erasure correction, and the obtained C is the e...

AI Technical Summary

Problems solved by technology

At this time, the hardware resource overhead increases, resulting in the fact that the original advantages of the table lookup GF multiplier are not obvious, and there is a problem of introducing larger chip area and space resources.

Images