Fast encoding and decoding method and system for erasure coded data
A decoding method and fast coding technology, which are applied in the fast coding and decoding method and system field of erasure code data, can solve the problems of unfavorable promotion, slow operation speed, and increased system cost, and achieve the effect of reducing the number of operations and improving the processing speed
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0074] In a preferred embodiment of the present invention, in step S11 of the coding method (or step S21 of the coding method), the generating matrix is an m×n matrix. Since any number multiplied by 1 is itself, using as many 1s as possible in the generator matrix can reduce the number of multiplications. When transforming the Vandermonde matrix to obtain the generating matrix, it is only necessary to set the first row element to be 1. For example, for the Vandermonde matrix G1 in the above background technology, let a 1 =1 to get the first generating matrix (or call it the Vandermond-Sun matrix):
[0075] Each of them a i are different from each other and not 0, a typical example is
[0076]
[0077] When transforming the Cauchy matrix to obtain the generating matrix, the Cauchy matrix needs to be transformed twice in rows and columns, so that the first row and the first column are both 1: the first row and column transformation, multiply all rows by the row No. The...
Embodiment 2
[0112] When decoding, if the original data fragments that do not exceed the redundancy number m of the check code are lost, the check code block can be used to participate in decoding to obtain the lost original data blocks. The traditional Reed-Solomon decoding method needs to solve the inverse matrix of the n×n order square matrix, which requires O(n 3 ) calculation amount (using Gaussian elimination method, where n is the number of original data slices).
[0113] The decoding method of the present invention does not need to calculate the inverse matrix of the n×n order square matrix, but only needs to calculate the k×k order square matrix decoding matrix G little The inverse matrix of , where k is the number of check code blocks used in decoding, has 0<k≤m (when k is 0, it means that the original data blocks have been received, and the decoded data can be directly composed without using the decoding matrix) . Since k is always less than or equal to the number n of origina...
Embodiment 3
[0133] See attached image 3 In another preferred embodiment of the present invention, the process of the encoding method is further described in the form of a computer detailed data processing flow:
[0134] Step S102 : Initialize the encoder according to the slice number n and the redundancy number m, and prepare to generate the matrix. Here, the Sun matrix is selected as the generating matrix, and its characteristic is that the first row and the first column of the matrix are both 1. The generator matrix can be transformed from a Vandermonde matrix or a Cauchy matrix. Such as the example transformed by the Cauchy matrix, using G ij =A matrix in the form of (i×j) / (i+j-1), where i and j represent the rows and columns of the matrix, respectively.
[0135] Then, according to the m×n elements of the Sun matrix, prepare an m×n×32-byte encoded multiplication cache table to store each element G in the Sun matrix ij Galois field multiplicative data for . For each element, u...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com