A Bit Level Erasure Codes Solution Based on Galois Field

The storage system has to use Galois Field to do CODEC because the massive data requirement. But the multiplication and division operation in Galois Field is different from the normal. So an extra hardware module is always designed to solve this problem which added to the data path slowed the transmission and also cost extra area. We proposed a bit level erasure codes solution in this paper to improve the erasure code’s CODEC replaced the Galois Field LUT module to a matrix. With the matrix the data operation can work in bit level only by selection and exclusive-or. With the hardware with Reed-Solomon codes Vandermonde and Cauchy, we can find the speed advantages trade off the cost of area by our solution.