Efficient erasure code lightweight automatic decoding method in finite field and intelligent terminal module

Abstract

The invention belongs to the technical field of information processing, and discloses an efficient erasure code lightweight automatic decoding method in a finite field, and an intelligent terminal module. The method comprises the steps: forming a check matrix according to each element generation rule; generating a unit matrix, and forming a new matrix by the matrix and the check matrix according to an up-down sequence; selecting the ith failure position, and determining a first non-zero element at the lower half part of the ith column of the new matrix; updating the row where other non-zero elements are located; setting the NZj row in the matrix as an all-zero element; when the matrix elements of the lower half part become all-zero elements, ending matrix transformation, wherein thecorresponding columns of the corresponding failure elements can be recovered if participating in the transformation process; and calculating the failure code elements in sequence. The failure code elements can be obtained through direct calculation, the thought is concise, code implementation of software and hardware is facilitated, matrix inversion operation on a finite field is eliminated, thecalculation workload required by decoding is greatly reduced, and the operation efficiency is improved.

Description

technical field [0001] The invention belongs to the technical field of information processing, and in particular relates to an efficient erasure correction code lightweight automatic decoding method on a finite field and an intelligent terminal module. Background technique [0002] Erasure coding is a data reliability protection method. This coding method divides the original data into different information groups. Assuming that the original information is divided into k original information groups, and then uses erasure coding technology to interleave the data to generate a certain r redundant information packets, among n=k+r information packets, when t erasure errors occur, t≤r, the remaining n-t information packets can be used for decoding and erasure correction code decoding for lost data recover. Erasure coding can provide higher reliability than the replication method, and the data redundancy is much smaller than the replication method, so it has applications in diffe...

AI Technical Summary

Problems solved by technology

[0006] (2) The merge decoding method does not completely eliminate the inversion operation of the matrix. When there are 2 or more errors, the time cost of decoding is still high, and when the number of errors reaches the upper limit of the error tolerance of the erasure code, the merge The decoding method will be completely equivalent to the matrix inversion

[0008] In the process of data recovery, the time cost of decoding is an important factor to consider. Although the existing algorithms such as the merge decoding method can be successfully decoded, the complexity of the algorithm degenerates to the equation set when the number of errors increases. In the case of loss of check elements, basically all algorithms need to restore the data elements first, and then further obtain the check elements from the recovered data elements, and cannot obtain the check elements at one time. elements, so implementing a decoding recovery operation can restore data elements and check elements at the same time, and the complexity of the decoding method can be lower than that of matrix inversion, which can quickly decode certain technical difficulties

Images