CN108712230A - Fault data restorative procedure - Google Patents
Fault data restorative procedure Download PDFInfo
- Publication number
- CN108712230A CN108712230A CN201810307447.1A CN201810307447A CN108712230A CN 108712230 A CN108712230 A CN 108712230A CN 201810307447 A CN201810307447 A CN 201810307447A CN 108712230 A CN108712230 A CN 108712230A
- Authority
- CN
- China
- Prior art keywords
- data
- xor operation
- sequence
- matrix
- data packet
- 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.)
- Pending
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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0006—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
-
- 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/0078—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
- H04L1/0079—Formats for control data
- H04L1/0082—Formats for control data fields explicitly indicating existence of error in data being transmitted, e.g. so that downstream stations can avoid decoding erroneous packet; relays
Abstract
The invention discloses fault data restorative procedures comprising two-dimentional restorative procedure, detailed process include：First, initial data is divided into the data packet of multiple same number of bits by transmitting terminal, and the data packet is carried out sequence identification, then is arranged in order composition matrix；Secondly, XOR operation is carried out to the matrix, is arranged in order composition XOR operation repairing sequence, the XOR operation sequence is arranged in order composition repair data packet and is sent to receiving terminal；Finally, after the reception data that receiving terminal detects are fault data, repair data packet is translated as XOR operation repairing sequence, finds out corresponding XOR operation repairing sequence further according to the position of missing data, and the data of missing are calculated by XOR operation and are repaired；The present invention can reduce the transmission times of data, improve transmitting efficiency.
Description
Technical field
The present invention relates to a kind of restorative procedures, it is more particularly related to a kind of restorative procedure of fault data.
Background technology
Data during transmission, are influenced by extraneous factor, often lost part number in data transmission procedure
According to, cause receiving terminal receive data it is imperfect, just need this when to repair data.In the prior art, data exist
It in one-way transmission, after finding shortage of data, is repaired generally by transmission data is repeated, because it is probability to lose data
It loses, so repeats lost complementary reparation will not be carried out according to the data difference lost every time with the data of a part always,
Keep former data complete.
Invention content
It is excellent it is an object of the invention to solve at least the above and/or defect, and provide at least to will be described later
Point.
Fault data restorative procedure of the present invention, can solve loss of data repetition transmission and data reparation is asked
Topic.
In order to realize these purposes and other advantages according to the present invention, a kind of restorative procedure of fault data is provided,
Detailed process includes：
First, initial data is divided into the data packet of multiple same number of bits by transmitting terminal, and data packet progress is suitable
Sequence identifies, then is arranged in order the multiple matrixes of composition；
Secondly, XOR operation is carried out to the matrix, is arranged in order composition XOR operation repairing sequence, the XOR operation
Sequence is arranged in order composition repair data packet and is sent to receiving terminal；
Finally, after the reception data that receiving terminal detects are fault data, repair data packet is translated as XOR operation and is repaiied
Complex sequences finds out corresponding XOR operation repairing sequence further according to the position of missing data, and is fallen vacant by XOR operation calculating
The data of mistake are simultaneously repaired.
Further, the matrix both may be three-dimensional stereo matrix；The three-dimensional stereo matrix is by multiple matrix groups
At, when initial data is huge, raising remediation efficiency.
Further, the XOR operation is according to arrangement of elements in matrix, by row XOR operation, left oblique line XOR operation with
And right oblique line XOR operation, obtain three kinds of XOR operation sequences that are mutually related；
According to three-dimensional matrice arrangement of elements, be mutually related a layer exclusive or repairing sequence, left oblique line layer XOR operation sequence are obtained
Row, right oblique line layer XOR operation sequence, and one of XOR operation sequence loses data, according to other two XOR operation sequence
Row can repair it, reduce the transmission times of transmitting terminal.
Further, the mode of preservation and the transmission of the repair data packet both can also separate together with initial data,
It can be selected according to different needs.
Further, initial data splits data into multiple data packets, and carries out sequence identification to data packet, receives number
According to the corresponding position that can find missing data in initial data according to sequence identification；
For data packet when forming matrix, the data packet carries sequence identification, and the matrix of composition is with corresponding sequence
Mark, corresponding XOR operation can efficiently find out missing data position with sequence identification.
Further, the position of missing data is determined when reparation according to sequence identification, and data are found out according to sequence identification
Corresponding XOR operation sequence in file is chosen and wherein loses an XOR operation sequence of minimum data and calculate missing number
According to.Beneficial effects of the present invention：Fault data can repair the transmission time of reduction transmitting terminal according to XOR operation sequence
Number improves efficiency of transmission.
Part is illustrated to embody by further advantage, target and the feature of the present invention by following, and part will also be by this
The research and practice of invention and be understood by the person skilled in the art.
Description of the drawings
Fig. 1 is the matrix diagram of one of embodiment；
Fig. 2 is the left and right oblique line XOR Map of one of embodiment；
Fig. 3 is the row XOR Map of one of embodiment；
Fig. 4 is the stereoscopic matrix figure of one of embodiment.
Specific implementation mode
The present invention is described in further detail below, to enable those skilled in the art being capable of evidence with reference to specification word
To implement.
It should be appreciated that such as " having ", "comprising" and " comprising " term used herein do not allot one or more
The presence or addition of a other elements or combinations thereof.
The present invention provides a kind of restorative procedure of fault data comprising two-dimentional restorative procedure, detailed process include：
First, initial data is divided into the data packet of multiple same number of bits by transmitting terminal, and data packet progress is suitable
Sequence identifies, then is arranged in order the multiple matrixes of composition；
Secondly, XOR operation is carried out to the matrix, is arranged in order composition XOR operation repairing sequence, the XOR operation
Sequence is arranged in order composition repair data packet and is sent to receiving terminal；
Finally, after the reception data that receiving terminal detects are fault data, repair data packet is translated as XOR operation and is repaiied
Complex sequences finds out corresponding XOR operation repairing sequence further according to the position of missing data, and is fallen vacant by XOR operation calculating
The data of mistake are simultaneously repaired.
Further, the matrix both may be three-dimensional stereo matrix；The three-dimensional stereo matrix is by multiple matrix groups
At, when initial data is huge, raising remediation efficiency.
Further, the XOR operation is according to arrangement of elements in matrix, by row XOR operation, left oblique line XOR operation with
And right oblique line XOR operation, obtain three kinds of XOR operation sequences that are mutually related；
Further, according to three-dimensional matrice arrangement of elements, obtain being mutually related a layer exclusive or repairing sequence, left oblique line layer are different
Or sequence of operations, right oblique line layer XOR operation sequence, and one of XOR operation sequence loses data, it is different according to other two
Or sequence of operations can repair it, reduce the transmission times of transmitting terminal.
Further, the mode of preservation and the transmission of the repair data packet both can also separate together with initial data,
It can be selected according to different needs.
Further, initial data splits data into multiple data packets, and carries out sequence identification to data packet, receives number
According to the corresponding position that can find missing data in initial data according to sequence identification；
For data packet when forming matrix, the data packet carries sequence identification, and the matrix of composition is with corresponding sequence
Mark, corresponding XOR operation can efficiently find out missing data position with sequence identification.
Further, the position of missing data is determined when reparation according to sequence identification, and data are found out according to sequence identification
Corresponding XOR operation sequence in file is chosen and wherein loses an XOR operation sequence of minimum data and calculate missing number
According to.Beneficial effects of the present invention：Fault data can repair the transmission time of reduction transmitting terminal according to XOR operation sequence
Number improves efficiency of transmission.
Embodiment
The restorative procedure of fault data of the present invention comprising two-dimentional restorative procedure, detailed process include：
Step 1: as shown in Figure 1, it is assumed that a former size of data is T bytes；The data are split：Per N/8 word
Section is used as a data packet, and gives data packet and position number consecutively, as p (L+1) indicates that the L+1 packet, L*N+2 indicate L*N+
2；Obtain S data packet, S=[ altogether in this way;T/N*8], S round numbers；By above-mentioned data packet group at the bit matrix sequence of a N*S
Row；
Step 2: the matrix is divided into M L*N bit matrix by L rows, wherein：M=[S/L], when S is equal to M*L, only
There are M L*N bit matrix；When S is more than M*L, the M+1 matrix size is (S-M*L) * N.
As shown in Fig. 2, pressing left and right oblique line exclusive or successively respectively to each L*N bit matrix sequence, two sequences of Kl and Kr are obtained
Row；Wherein
Kl1=1；
Kl2=(N+1) ⊕ 2；
Kl3=(2N+1) ⊕ (N+2) ⊕ 3；
......
Kl (N+L-2)=(L*N+N-1) ⊕ (L*N)
Kl (N+L-1)=(L+1) * N.
It similarly can get right oblique line sequence Kr.
Kr1=L*N+1；
Kr2=((L-1) * N+1) ⊕ (L*N+2)；
......
Kr (N+L-2)=(N-1) ⊕ (2N)
Kr (N+L-1)=N.
As shown in figure 3, carrying out exclusive or by Leie time to L*N bit matrix, a Ci sequence is obtained, wherein
C1b1=1 ⊕ (N+1) ⊕ (2N+1) ⊕ ... .. ⊕ (L*N+1)
C1b2=2 ⊕ (N+2) ⊕ (2N+2) ⊕ ... .. ⊕ (L*N+2)
......
C1bN=N ⊕ 2N ⊕ 3N ⊕ ... .. ⊕ ((L+1) * N)
Step 3: newly-generated Kl, Kr, Ci sequence is formed a data file, data file is sent out simultaneously with former data
It send to receiving terminal；
Step 4: receiving terminal is after receiving end of data file, secondly dimension restorative procedure is as follows：
Per in L rows, if there is missing to wrap；If lacking packet number in the L rows is less than or equal to three, repaiied by following repair mode
Bag data is lacked again：Missing bag data is reduced to following theoretical model by calculating：
It is known：
Ci sequence equations：
X1 ⊕ Y1 ⊕ Z1=C1 '
X2 ⊕ Y2 ⊕ Z2=C2 '
......
XN ⊕ YN ⊕ ZN=CN '
Note：C'Sequence=C sequences ⊕ has received data bit, similarly hereinafter
Kl sequence equations：
X1=Kl1
Y1 ⊕ X2=Kl2
Z1 ⊕ Y2 ⊕ X3=Kl3
......
Z (N-1) ⊕ YN=Kl (N+L-2)
ZN=Kl (N+L-1)
Kr sequence equations：
Z1=Kr1
Y1 ⊕ Z2=Kr2
X1 ⊕ Y2 ⊕ Z3=Kr3
......
X (n-1) Yn=Kr (N+L-2)
Xn=Kr (N+L-1)
Seek sequence：
{X1,X2,……Xn}
{Y1,Y2,……Yn}
{Z1,Z2,……Zn}
Above-mentioned two dimension repairing method, the three row data lacked in every L rows can be repaired by Kl, Kr, Ci sequence
Kl, Kr sequence data amount：Kl=Kr=N+L-1；
Ci sequence data amounts：Ci=N；
Total amount of redundant data：Rx=Kl+Kr+Ci=2N+2L-2+N=3N+2L-2
Former data volume：T=N*L
Redundant data rate：Rrate=Rx/T=(3N+2L-2)/N*L
Step 5: in the case where excluding a period of time continuous loss data cases：
It is assumed that average packet loss ratio is 50%, N=1460*8 (bit)；
Then to ensure to repair completely, it is meant that L=3/50%=6, at this time：
Kl=Kr=11685
Ci=11680
Rx=35050
T=700800
Redundant data ratio is：Rrate=50%
It is assumed that average packet loss ratio is 5%, N=1460*8 (bit)；
Then to ensure to repair completely, it is meant that L=3*100/5=60, at this time：
Kl=Kr=11739
Ci=11680
Rx=35158
T=70080
Redundant data ratio is：Rrate=5%
And so on.
On the basis of two dimension, each L*M bit matrix are pressed into three-dimensional arrangement form three-dimensional restorative procedure, as shown in Figure 4；
It can be aligned by layer and do XOR operation, sequence of layer Hi can be obtained：
H1b1=1 ⊕ ((L+1) * N+1) ⊕ ((2L+1) * N+1) ⊕ ... ⊕ ((M*L+1) N+1)
H1b2=1 ⊕ ((L+1) * N+2) ⊕ ((2L+1) * N+2) ⊕ ... ⊕ ((M*L+1) N+2)
……
H1bN=1 ⊕ ((L+1) * N+N) ⊕ ((2L+1) * N+N) ⊕ ... ⊕ ((M*L+1) N+N)
If M number is excessive, J cube can be further divided into
For every layer, with Kl the and Kr retrieval methods in two dimensional method, layer exclusive or HKl and HKr a sequence can be got.
When 3D approach repairs fault data, data reparation can be carried out according to above-mentioned sequence and two dimensional method combination, improve failure
Data repair rate.
Thirdly dimension restorative procedure is as follows：
It is assumed that in two-dimentional L*N matrix sequences, having more than three row data causes fault data that cannot repair, at this point it is possible to
The corresponding sequence of layer Hi of each missing row is first looked for, attempts to repair the missing row data by sequence of layer；Then pass through two dimension again
Method repairs remaining fault data.
Although the embodiments of the present invention have been disclosed as above, but it is not limited in listed fortune in specification and embodiments
With.It can be applied to various suitable the field of the invention completely.It for those skilled in the art, can be easily real
Now other modification.Therefore without departing from the general concept defined in the claims and the equivalent scope, the present invention is not limited to
Specific details and legend shown and described herein.
Claims (7)
1. fault data restorative procedure, which is characterized in that detailed process includes：
First, initial data is divided into the data packet of multiple same number of bits by transmitting terminal, and by the data packet carry out sequence mark
The multiple matrixes of composition are arranged in order after knowledge；
Secondly, XOR operation is carried out to the matrix, and XOR operation is arranged in order composition XOR operation repairing sequence, it is described
XOR operation repairing sequence is arranged in order composition repair data packet and is sent to receiving terminal；
Finally, after the reception data that receiving terminal detects are fault data, repair data packet is translated as XOR operation and repairs sequence
Row, find out corresponding XOR operation repairing sequence, and calculate missing by XOR operation further according to the position of missing data
Data are simultaneously repaired.
2. the restorative procedure of fault data as described in claim 1, which is characterized in that the matrix both may be three-dimensional vertical
Volume matrix；The three-dimensional stereo matrix is made of multiple matrixes.
3. the restorative procedure of fault data as described in claim 1, which is characterized in that the XOR operation is according to first in matrix
Element arrangement, by row XOR operation, left oblique line XOR operation and right oblique line XOR operation, obtain three kinds or more be mutually related it is different
Or sequence of operations.
4. three-dimensional stereo matrix as claimed in claim 2, which is characterized in that according to three-dimensional matrice arrangement of elements, carry out exclusive or
Operation simultaneously obtains three kinds or more layer exclusive or repairing sequence that are mutually related, left oblique line layer XOR operation sequence, right oblique line layer exclusive or
Sequence of operations.
5. the restorative procedure of fault data as described in claim 1, which is characterized in that the preservation of the repair data packet and hair
The mode sent both can also separate together with initial data.
6. the restorative procedure of fault data as described in claim 1, which is characterized in that initial data splits data into multiple numbers
Sequence identification is carried out according to packet, and to data packet, missing data can be found according to sequence identification in initial data by receiving data
Corresponding position；
For data packet when forming matrix, the data packet carries sequence identification, the matrix of composition with corresponding sequence identification,
Corresponding XOR operation is with sequence identification.
7. the restorative procedure of fault data as described in claim 1, which is characterized in that determined and lacked according to sequence identification when reparation
The position of data is lost, and corresponding XOR operation sequence in data file is found out according to sequence identification, data are wherein lost in selection
A minimum XOR operation sequence simultaneously calculates missing data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810307447.1A CN108712230A (en) | 2018-04-08 | 2018-04-08 | Fault data restorative procedure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810307447.1A CN108712230A (en) | 2018-04-08 | 2018-04-08 | Fault data restorative procedure |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108712230A true CN108712230A (en) | 2018-10-26 |
Family
ID=63866430
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810307447.1A Pending CN108712230A (en) | 2018-04-08 | 2018-04-08 | Fault data restorative procedure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108712230A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101119319A (en) * | 2007-09-19 | 2008-02-06 | 腾讯科技（深圳）有限公司 | Method, transmitting/receiving device and system against lost packet in data transmission process |
| CN102346693A (en) * | 2010-07-30 | 2012-02-08 | 海信集团有限公司 | Method for data storage and data recovery |
| CN103744750A (en) * | 2014-01-13 | 2014-04-23 | 杭州华为数字技术有限公司 | Method and device for recovering data |
| CN105356968A (en) * | 2015-06-24 | 2016-02-24 | 深圳大学 | Network coding method and system based on circulant permutation matrix |
| CN105703782A (en) * | 2016-03-11 | 2016-06-22 | 深圳大学 | Incremental shift matrix construction method, network coding method and system |
| US20160350188A1 (en) * | 2015-05-29 | 2016-12-01 | Industry-Academic Cooperation Foundation, Yonsei University | Method and apparatus of recovering and encoding for data recovery in storage system |
-
2018
- 2018-04-08 CN CN201810307447.1A patent/CN108712230A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101119319A (en) * | 2007-09-19 | 2008-02-06 | 腾讯科技（深圳）有限公司 | Method, transmitting/receiving device and system against lost packet in data transmission process |
| CN102346693A (en) * | 2010-07-30 | 2012-02-08 | 海信集团有限公司 | Method for data storage and data recovery |
| CN103744750A (en) * | 2014-01-13 | 2014-04-23 | 杭州华为数字技术有限公司 | Method and device for recovering data |
| US20160350188A1 (en) * | 2015-05-29 | 2016-12-01 | Industry-Academic Cooperation Foundation, Yonsei University | Method and apparatus of recovering and encoding for data recovery in storage system |
| CN105356968A (en) * | 2015-06-24 | 2016-02-24 | 深圳大学 | Network coding method and system based on circulant permutation matrix |
| CN105703782A (en) * | 2016-03-11 | 2016-06-22 | 深圳大学 | Incremental shift matrix construction method, network coding method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103929353B (en) | The treating method and apparatus of instant message | |
| SG11201806637TA (en) | Two-dimensional dot matrix barcode encoding and reading methods | |
| CN103246484B (en) | A kind of date storage method, Apparatus and system | |
| CN109547467A (en) | Media data error correction transmission and error correction method, device, equipment and storage medium | |
| CN109104286A (en) | A kind of new block generation method of the common recognition based on threshold digital signature | |
| CN101188477A (en) | A data packet sequence receiving method and device | |
| US7716559B2 (en) | Method for lost packet reconstruction and device for carrying out said method | |
| CN106997054A (en) | A kind of dispensing device, reception device, data transmission method and Transmission system | |
| CN108712230A (en) | Fault data restorative procedure | |
| CN110798455B (en) | Encrypted communication transmission system for preventing information leakage | |
| CN108279995A (en) | A kind of storage method for the distributed memory system regenerating code based on safety | |
| CN104717257B (en) | The method and device of data message transmission | |
| CN100405761C (en) | Transmitter, communication system, and communication method | |
| CN113326329A (en) | Method for pushing account-keeping person based on block chain consensus | |
| CN103914866B (en) | 3D model grouping method based on self-adaptive graph coloring in wireless network | |
| CN104572530B (en) | A kind of slave computer, host computer and data transmission method | |
| CN104954249B (en) | A kind of message forwarding method, system and device | |
| CN109934583A (en) | The generation method of credible random number sequence in a kind of block chain | |
| CN110351289A (en) | The method and device of data encryption | |
| CN115378579A (en) | Quantum entanglement-based multi-party data synchronization method and device | |
| CN105471861A (en) | Dynamic message packaging method and dynamic tunnel construction method | |
| JP2010199651A (en) | Duplicated address detection system, transmission device, and receiving device | |
| CN108683422A (en) | A kind of locality reparation coding method for holding more wrong cross-circulation convolutional codes | |
| CN105930450A (en) | Big data analysis processing tool | |
| CN112671509B (en) | Data packet anti-lost method and device based on FEC redundancy |
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 |