Data codec method based on binary reed-solomon code

A technology of Reed-Solomon codes and encoding and decoding methods, applied in the field of distributed storage systems, can solve the problems of large storage capacity of node data, high computational complexity, complex system structure, etc., and achieve increased speed, fast update speed, and reduced The effect of cost consumption

Active Publication Date: 2016-04-20
SHENZHEN CESTBON TECH CO
View PDF3 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] In order to solve the problems in the prior art, the present invention provides a method for constructing, reconstructing and updating data based on Reed-Solomon code in the binary domain, which solves the problem in the prior art that the system structure of the traditional storage device is relatively complicated and adopts The encoding method has a large amount of node data storage, and the problem of high computational complexity in the process of encoding and decoding updates ensures the redundancy of the system, effectively reduces the amount of calculations when updating data, and reduces the computational complexity in the process of encoding and decoding. Computational complexity, and the purpose of improving the effectiveness of the repair process (including computational overhead and repair time) after node failure

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Data codec method based on binary reed-solomon code
  • Data codec method based on binary reed-solomon code
  • Data codec method based on binary reed-solomon code

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0016] The present invention will be further described below with reference to the accompanying drawings and specific embodiments.

[0017] The traditional Reed-Solomon code construction is based on finite field GF(q). In order to reduce the complexity of Reed-Solomon, we propose a binary-field-based Reed-Solomon Code (BinaryReed-SolomonCode, abbreviated as BRS code) ; We know that for k original data blocks (length Lbit), let s i,j represents the data block s i The value of the jth bit in the i =s i,1 s i,2 ...s i,L , i=0,1,2,...,k-1. The difficulty lies in successfully finding n-k independent check data blocks, so that any k data blocks in the n data blocks (including original data blocks and check data blocks) are linearly independent. In general, we call data blocks that satisfy the above conditions (n, k) independent.

[0018] For example, take a file S={s 0 ,s 1}, contains two original data blocks s 0 , s 1 . It can be clearly seen that using XOR coding, ther...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The present invention relates to the field of distributed storage systems, and particularly relates to a data codec method based on binary Reed-Solomon (BRS) code. The method comprises the following steps: (A) using initial data to create a BRS code; (B) updating the BRS code; (C) recreating the BRS code; x-or operations are used in the operations in step (A), step (B), and step (C). The benefits of the present invention are: the method greatly increases data upload and download speeds, thereby significantly reducing system operation complexity (e.g. metadata updating, broadcasting updated data, etc.); the method has high application value and development potential with respect to actual distributed storage systems.

Description

【Technical field】 [0001] The invention relates to the field of distributed storage systems, in particular to a data encoding and decoding method based on binary domain Reed Solomon codes. 【Background technique】 [0002] With the rapid development of computer network applications, the amount of network information data has become larger and larger, and mass information storage has become particularly important. The continuous growth of data storage pressure drives the rapid development of the entire storage market; distributed storage is characterized by its high cost performance, Advantages such as low initial investment and pay-as-you-go have increasingly become the mainstream technology of today's big data storage. The failure of storage nodes in distributed storage systems has become a normal state. When the storage nodes deployed by the system become unreliable, redundancy must be introduced to improve the reliability of nodes when they fail. The easiest way to introduce...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H03M13/15H04L29/08
CPCH03M13/1515H04L67/1097H03M13/3761H03M13/611G06F11/1076H03M13/616
Inventor 李挥侯韩旭陈俊朱兵李硕彦
Owner SHENZHEN CESTBON TECH CO
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap