CN106877975A - Can sawtooth decoding distributed storage in hard decision joint decoding method - Google Patents
Can sawtooth decoding distributed storage in hard decision joint decoding method Download PDFInfo
- Publication number
- CN106877975A CN106877975A CN201611264034.7A CN201611264034A CN106877975A CN 106877975 A CN106877975 A CN 106877975A CN 201611264034 A CN201611264034 A CN 201611264034A CN 106877975 A CN106877975 A CN 106877975A
- Authority
- CN
- China
- Prior art keywords
- decoding
- hard decision
- sawtooth
- distributed storage
- matrix
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0047—Decoding adapted to other signal detection operation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0047—Decoding adapted to other signal detection operation
- H04L1/0048—Decoding adapted to other signal detection operation in conjunction with detection of multiuser or interfering signals, e.g. iteration between CDMA or MIMO detector and FEC decoder
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
Abstract
The invention provides it is a kind of can sawtooth decoding distributed storage in hard decision joint decoding method, comprise the following steps:S1, initialising subscriber number K, block length L and shift matrix T；S2, ZigZag decode staggered superposition figure；S3, equation group；S4, the left and right edge system of synchronization process equation group；S5, test matrix H；Raw information is obtained in S6, Hard decision decoding, back substitution；S7, end.The beneficial effects of the invention are as follows：Can disposably decode and obtain all of storage information.
Description
Technical field
The present invention relates to distributed storage, more particularly to a kind of hard decision can combine and translate in the distributed storage of sawtooth decoding
The method of code.
Background technology
Distributed storage, is to store on multiple servers data dispersion.Distributed storage is relative to centrally stored
For, with Internet era information data huge explosion, it is centrally stored in security and memory capacity and has been difficult to meet
The data storage requirement of large-scale application so that storage server turns into the bottleneck of systematic function.Distributed network storage system is
A large amount of storage servers externally provide storage service by network interconnection as an entirety.It utilizes multiple servers effective
Shared storage load, make system storage speed, reliability and autgmentability obtain greatly lifting.
We are typically regarded as making the output signal of demodulator limited N-bit quantization hard decision, higher than threshold value
Be considered 1, be considered 0. for most common binary system less than threshold value, the output supply hard decision of demodulator makes
0,1 value is only limitted to, if receiving voltage amplitude is less than 0, demodulator is output as 0, if receiving voltage amplitude is more than 0, solved
Device is adjusted to be output as 1.
The operation principle of sawtooth decoding is that raw information is changed into the smaller encoding block of digit, and can take wherein one
Divide to enter row decoding reduction.Encoding block can disperse storage on a different server, and extraction unit lacing is only needed to when extracting data
Code block, which improves the efficiency and security of data storage.
Traditional centralised storage technology needs to be stored in all data on one server, this performance to server
There is requirement very high with building environment, once the artificial error of appearance or natural calamity cause server failure, it will cause
Loss of data, so as to cause greatly loss.In order to avoid unexpected generation, by the way of some companies are stored using backup, one
As by three parts of data duplication, be then stored in improving disaster tolerance on three different servers.But the method can be made
Into the significant wastage of memory space, particularly big data epoch, so as to increase entreprise cost.
Researcher is had at present to propose that sawtooth is decoded the decoding for distributed storage.But, existing sawtooth decoding
To decode by turn, in decoding process if one at mistake, can cause subsequent decoding position error, there is no error correcting capability, influence
The performance of decoding efficiency and whole distributed memory system.
The content of the invention
In order to solve the problems of the prior art, can firmly sentence in the distributed storage of sawtooth decoding the invention provides a kind of
The certainly method of joint decoding.
The invention provides it is a kind of can in the distributed storage of sawtooth decoding hard decision joint decoding method, it is including following
Step:
S1, initialising subscriber number K, block length L and shift matrix T；
S2, ZigZag decode staggered superposition figure；
S3, equation group；
S4, the left and right edge system of synchronization process equation group；
S5, test matrix H；
Raw information is obtained in S6, Hard decision decoding, back substitution；
S7, end.
As a further improvement on the present invention, in step s 4, the x-coefficient matrix to the left side is processed, synchronization process
The y sytem matrixes on the right, relational expression most at last between coefficient x only represents with the equation group equation containing y coefficients, this equation group
Coefficient matrix be check matrix H.
As a further improvement on the present invention, in step s 6, unknown number x is initialized, according to the relation between x and y, is obtained
To initial y information, row decoding is entered using hard decision, raw information is obtained in last back substitution.
As a further improvement on the present invention, in step sl, according to shift matrix, to number of users K, block length L and
Shift matrix T is encoded into 6 encoding blocks.
As a further improvement on the present invention, in step s 2, according to (n, k) MDS yards of property, random selection coding
K i.e. decodable code in block.
The beneficial effects of the invention are as follows：By such scheme, can disposably decode and obtain all of storage information.
Brief description of the drawings
Fig. 1 be the present invention plant can sawtooth decoding distributed storage in hard decision joint decoding method flow chart.
Fig. 2 is that the present invention is planted and the decoding process of method of hard decision joint decoding can shown in the distributed storage of sawtooth decoding
It is intended to.
Fig. 3 is that the present invention is planted and the decoding process of method of hard decision joint decoding can shown in the distributed storage of sawtooth decoding
It is intended to.
Fig. 4 is that the present invention is planted and the decoding process of method of hard decision joint decoding can shown in the distributed storage of sawtooth decoding
It is intended to.
Specific embodiment
The invention will be further described for explanation and specific embodiment below in conjunction with the accompanying drawings.
As shown in Figures 1 to 4, it is a kind of can sawtooth decoding distributed storage in hard decision joint decoding method, including
Following steps:
S1, initialising subscriber number K, block length L and shift matrix T；
S2, ZigZag decode staggered superposition figure；
S3, equation group；
S4, the left and right edge system of synchronization process equation group；
S5, test matrix H；
Raw information is obtained in S6, Hard decision decoding, back substitution；
S7, end.
In step s 4, the x-coefficient matrix to the left side is processed, the y sytem matrixes on the right of synchronization process, is most at last
Relational expression between number x only represents that the coefficient matrix of this equation group is check matrix H with the equation group equation containing y coefficients.
In step s 6, unknown number x is initialized, according to the relation between x and y, initial y information is obtained, using sentences firmly
Determine into row decoding, raw information is obtained in last back substitution.
In step sl, according to shift matrix, 6 codings are encoded into number of users K, block length L and shift matrix T
Block.
In step s 2, according to (n, k) MDS yards of property, the random k i.e. decodable code chosen in encoding block.
The principle of sawtooth decoding：Existing sawtooth decoding utilizes the MDS properties of (n, k) code, and k raw information is encoded into
N encoding block, randomly selects k in n encoding block, then to its XOR by turn, can successively obtain known bits position.It is first
First, original information is divided into the k packet of a length of L, i.e. S1And S2,….Sk；Si,j∈ { 0,1 }, represents SiIn jth
Position, i ∈ 1,2 ..., k }, j ∈ 1,2,3 ..., L }.This k is referred to as original non-coding bag according to bag.
If Fig. 2 is the decoding process of (4,2) code, in this example, it will be assumed that L is 4.C1And C2By will be original non-
The code word of XOR generation is constituted by turn after coding bag displacement, referred to as check code bag.C1By S1And S20, Ran Houzai are moved to right respectively
By column data XOR by turn.C2It is by non-coding bag S1And S20 and 1 is moved to right respectively, then again by column data XOR by turn.
The C of generation1And C2Data length be respectively L=4, L=5.Numeral inside bracket represents the order of decoding, because C2
One does not have add operation with other information, so decoding S first1,1,S1,1Bracketed indications be 1；The S that will be decoded1,1
It is updated to C1In first, S1,1, it is known that then XOR can decode S2,1.Therefore S2,1Labeled as 2；S1,2Can be from C2
In decode come, by S1,2Labeled as 3；Then S2,2Labeled as 4；Raw information is recovered successively according to this coding/decoding method.
The principle of hard decision：Hard decision is typically regarded as making the output signal of demodulator limited N-bit quantization, high
It is considered 1 in threshold value, 0 is considered less than threshold value.
Principle of the invention：Using hard decision, disposably decoding obtains all of initial data to the present invention, and is not increasing
Plus EDC error detection and correction is carried out on the premise of any information, the correct of the initial information that user stores is ensure that to a certain extent.
Specific example is as follows：
Assuming that number of users K=3, block length L=7, shift matrix T=[0 11；1 0 1；1 1 0].According to displacement square
3 raw informations are encoded into 6 coding block codes, as shown in Figure 3 by battle array.
According to (n, k) MDS yards of property, the random k i.e. decodable code chosen in encoding block.C is chosen in this example1、
C2、C3Enter row decoding.The linear superposition block for being obtained according to shift matrix T and ZigZag network code mode first, obtains following side
Journey group:
S1,1=y1 S2,1=y9
S1,2+S2,1+S3,1=y2 S1,1+S2,2+S3,1=y10
S1,3+S2,2+S3,2=y3 S1,2+S2,3+S3,2=y11
S1,4+S2,3+S3,3=y4 S1,3+S2,4+S3,3=y12
S1,5+S2,4+S3,4=y5 S1,4+S2,5+S3,4=y13
S1,6+S2,5+S3,5=y6 S1,5+S2,6+S3,5=y14
S1,7+S2,6+S3,6=y7 S1,6+S2,7+S3,6=y15
S2,7+S3,7=y8 S1,7+S3,7=y16
C1Equation group C2Equation group
S3,1=y17
S1,1+S2,1+S3,2=y18
S1,2+S2,2+S3,3=y19
S1,3+S2,3+S3,4=y20
S1,4+S2,4+S3,5=y21
S1,5+S2,5+S3,6=y22
S1,6+S2,6+S3,7=y23
S1,7+S2,7=y24
C3Equation group
Then above-mentioned equation group is directed to, a series of computing is carried out, equation (1) (2) (3) in Fig. 4 can be obtained, as firmly
Check equations needed for judgement.Using Hard decision decoding, each y is solved, further according to the relation between y and s, disposably decoded
To all of s.When y is in storing process, mistake is there occurs, hard decision can carry out certain EDC error detection and correction, it is ensured that s's
Correctly.Once made a mistake without information, it is necessary to abandon all original user's initial informations simultaneously, storage is believed again at once
Breath.
The present invention provide it is a kind of can sawtooth decoding distributed storage in hard decision joint decoding method, in existing saw
Tooth is decoded to be transported with the basis of distributed storage, the binary linear decoded with sawtooth is superimposed to the initial information of user
Calculate, the check equations for being needed are iterated decoding and solve all of initial information using hard decision.There is three below excellent
Point：
1. disposable decoding obtains all of storage information.
2. the mistake for occurring in pair storage, hard decision can carry out certain EDC error detection and correction.
3. EDC error detection and correction can be carried out under conditions of redundancy is not increased.
Potential application field of the invention is the distributed cloud storage based on network code framework, and special being directed to can sawtooth
The storage coded system of decoding design.Sawtooth decoding is substituted into and decoded information by turn by turn because of information bit, and certain dislocation position can cause
Subsequent bit decoding error.Therefore sawtooth decoding is without error correcting capability.The present invention is not increasing any information on sawtooth decoded base
On the premise of, there is provided error correction.
Above content is to combine specific preferred embodiment further description made for the present invention, it is impossible to assert
Specific implementation of the invention is confined to these explanations.For general technical staff of the technical field of the invention,
On the premise of not departing from present inventive concept, some simple deduction or replace can also be made, should be all considered as belonging to of the invention
Protection domain.
Claims (5)
1. it is a kind of can sawtooth decoding distributed storage in hard decision joint decoding method, it is characterised in that including following step
Suddenly:
S1, initialising subscriber number K, block length L and shift matrix T；
S2, ZigZag decode staggered superposition figure；
S3, equation group；
S4, the left and right edge system of synchronization process equation group；
S5, test matrix H；
Raw information is obtained in S6, Hard decision decoding, back substitution；
S7, end.
2. it is according to claim 1 can sawtooth decoding distributed storage in hard decision joint decoding method, its feature
It is：In step s 4, the x-coefficient matrix to the left side is processed, the y sytem matrixes on the right of synchronization process, most coefficient x at last
Between relational expression only represent that the coefficient matrix of this equation group is check matrix H with the equation group equation containing y coefficients.
3. it is according to claim 2 can sawtooth decoding distributed storage in hard decision joint decoding method, its feature
It is：In step s 6, unknown number x is initialized, according to the relation between x and y, initial y information is obtained, is entered using hard decision
Raw information is obtained in row decoding, last back substitution.
4. it is according to claim 3 can sawtooth decoding distributed storage in hard decision joint decoding method, its feature
It is：In step sl, according to shift matrix, 6 encoding blocks are encoded into number of users K, block length L and shift matrix T.
5. it is according to claim 4 can sawtooth decoding distributed storage in hard decision joint decoding method, its feature
It is：In step s 2, according to (n, k) MDS yards of property, the random k i.e. decodable code chosen in encoding block.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611264034.7A CN106877975B (en) | 2016-12-30 | 2016-12-30 | Hard decision joint decoding method in distributed storage capable of zigzag decoding |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611264034.7A CN106877975B (en) | 2016-12-30 | 2016-12-30 | Hard decision joint decoding method in distributed storage capable of zigzag decoding |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106877975A true CN106877975A (en) | 2017-06-20 |
| CN106877975B CN106877975B (en) | 2020-11-20 |
Family
ID=59164458
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611264034.7A Active CN106877975B (en) | 2016-12-30 | 2016-12-30 | Hard decision joint decoding method in distributed storage capable of zigzag decoding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106877975B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113541863A (en) * | 2021-06-02 | 2021-10-22 | 香港中文大学（深圳） | Data encoding method, data decoding method, electronic device, and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101299613A (en) * | 2007-04-30 | 2008-11-05 | 华为技术有限公司 | Method and apparatus for decoding ZigZag code |
| CN105356892A (en) * | 2015-06-24 | 2016-02-24 | 深圳大学 | Network coding method and system |
-
2016
- 2016-12-30 CN CN201611264034.7A patent/CN106877975B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101299613A (en) * | 2007-04-30 | 2008-11-05 | 华为技术有限公司 | Method and apparatus for decoding ZigZag code |
| CN105356892A (en) * | 2015-06-24 | 2016-02-24 | 深圳大学 | Network coding method and system |
Non-Patent Citations (2)
| Title |
|---|
| MINGJUN DAI: "optimal reconstruction bandwidth scheme for zigzag-decodable code with combination property in cloud storage system", 《2015 INTERNATIONAL CONFERENCE ON CONNECTED VEHICLES AND EXPO (ICCVE)》 * |
| 刘晨: "基于LDPC码的分布式视频编码系统的实现", 《中国硕士期刊学术库》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113541863A (en) * | 2021-06-02 | 2021-10-22 | 香港中文大学（深圳） | Data encoding method, data decoding method, electronic device, and storage medium |
| CN113541863B (en) * | 2021-06-02 | 2024-01-09 | 香港中文大学（深圳） | Data encoding method, data decoding method, electronic device, and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106877975B (en) | 2020-11-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103124182B (en) | File download and streaming system | |
| CN105356968B (en) | The method and system of network code based on cyclic permutation matrices | |
| CN106161012A (en) | A kind of quantum key distribution after-treatment system based on polarization code error correction and method | |
| CN113676190A (en) | Polar code encoding method and device | |
| CN106612172A (en) | Data change recovery algorithm capable of restoring data authenticity in cloud storage | |
| CN110389848B (en) | Partial repetition code construction method based on block construction and fault node repair method | |
| CN105356892B (en) | The method and system of network code | |
| CN108132854B (en) | Erasure code decoding method capable of simultaneously recovering data elements and redundant elements | |
| US11070231B2 (en) | Reducing storage of blockchain metadata via dictionary-style compression | |
| CN106788891A (en) | A kind of optimal partial suitable for distributed storage repairs code constructing method | |
| CN106484559A (en) | A kind of building method of check matrix and the building method of horizontal array correcting and eleting codes | |
| CN103746774A (en) | Error resilient coding method for high-efficiency data reading | |
| CN108762978B (en) | Grouping construction method of local part repeated cyclic code | |
| CN111858169A (en) | Data recovery method, system and related components | |
| CN101252413A (en) | Method for removing small ring of length 4 in fountain code generated matrix and uses thereof | |
| CN103703446A (en) | Data reconstruction method and apparatus against byzantine failure in network storage, and method and apparatus for restoring failure data | |
| Ivanichkina et al. | Mathematical methods and models of improving data storage reliability including those based on finite field theory | |
| CN106877975A (en) | Can sawtooth decoding distributed storage in hard decision joint decoding method | |
| WO2017041232A1 (en) | Encoding and decoding framework for binary cyclic code | |
| CN210110352U (en) | ECC device for correcting multi-bit errors in NAND Flash | |
| CN107665152B (en) | Decoding method of erasure code | |
| CN104320147B (en) | A kind of Raptor code methods of system unequal error protection | |
| US9350390B2 (en) | Encoder, decoder and semiconductor device including the same | |
| CN110798225A (en) | Data error correction method, device and equipment and readable storage medium | |
| CN101882972A (en) | Decoding method of Raptor code |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20201105 Address after: 224000 in Jiangsu Province in the south of Yancheng City District Xindu street landscape Avenue branch building 22 North Building (CND) Applicant after: Yancheng Yunda Technology Co.,Ltd. Address before: 518000 Nanhai Road, Guangdong, Shenzhen, No. 3688, No. Applicant before: SHENZHEN University |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: A Method for Hard Decision Joint Decoding in Distributed Storage with Sawtooth Decoding Effective date of registration: 20230404 Granted publication date: 20201120 Pledgee: Bank of Nanjing Co.,Ltd. Yancheng branch Pledgor: Yancheng Yunda Technology Co.,Ltd. Registration number: Y2023980037194 |