CN106230548A - A kind of encoding and decoding error correction method and system - Google Patents

Abstract

The invention discloses a kind of encoding and decoding error correction method and system, described method includes: by the word that packet segmentation is some fixed-size locations；Described packet is word for word processed, generates redundant data packets；Word in described redundant data packets is corresponding with the word in described packet；Described packet and redundant data packets are combined into coding information group.Even if the embodiment of the present invention is in the case of lost part coding information group data, equally decodes the content of raw data packets, thus avoid data packet retransmission, improve data transmission efficiency.

Description

A kind of encoding and decoding error correction method and system

Technical field

The present invention relates to data encoding technique field, particularly to a kind of encoding and decoding error correction method and system.

Background technology

Currently, along with people require to increase for video tastes, various high definitions, super clear video arise at the historic moment, simultaneously for The requirement of real-time is the most important.And selecting unreliable (UDP) transmission is the key solving real-time, lose under UDP transmits When bag is normality, inevitable choice retransmits or more structurally sound protection mechanism ensures efficiently arriving and being used of data.By The problem that the packet loss that brings in UDP transmission mode is high, needs badly and wants one can the most effectively solve network transmission coding/decoding to ask The scheme of topic.

Summary of the invention

The present invention provides a kind of encoding and decoding error correction method and system, by the coded system improved so that even if at packet loss In the case of, receiving terminal equally decodes piginal encoded data, the problem solving data encoding and decoding error correction.

The present invention provides a kind of encoding and decoding error correction method, including:

By the word that packet segmentation is some fixed-size locations；

Described packet is word for word processed, generates redundant data packets；Word in described redundant data packets and described number Corresponding according to the word in bag；

Described packet and redundant data packets are combined into coding information group.

Described described packet is word for word processed, generate redundant data packets, including:

Described packet D=(D₀,D₁,...,D_k-1), redundant data packets C=(C₀,C₁,...,C_r-1)；Wherein, described k is The number of packet, described r is the number of redundant data packets, and F is the coefficient matrix of kxr dimension；

Redundant data packets C is represented by:

As described r=2, during k=4, described packet with redundant data packets is:

$\left[\begin{array}{cccc}{D}_0& D_1& D_2& D_3\\ d_{00}& d_{10}& d_{20}& d_{30}\\ d_{01}& d_{11}& d_{21}& d_{31}\\ .& .& .& .\\ .& .& .& .\\ .& .& .& .\\ d_{0j}& d_{1j}& d_{2j}& d_{3j}\end{array}\right]\left[\begin{array}{cc}{C}_0& C_1\\ c_{00}=F_1(d_{00},d_{10},d_{20},d_{30})& c_{10}=F_2(d_{00},d_{10},d_{20},d_{30})\\ c_{01}=F_1(d_{01},d_{11},d_{21},d_{31})& c_{11}=F_2(d_{01},d_{11},d_{21},d_{31})\\ .& .\\ .& .\\ .& .\\ c_{0j}=F_1(d_{0j},d_{1j},d_{2j},d_{3j})& c_{1j}=F_2(d_{0j},d_{1j},d_{2j},d_{3j})\end{array}\right]$

Wherein, the quantity of word during described j is packet.

Described coefficient matrix

$F=\left[\begin{array}{cc}1& 1\\ 1& 2\\ 1& 4\\ 1& 8\end{array}\right];$

According to equation below computing redundancy packet C₀C₁:

$C_0=D_0\⊕D_1\⊕D_2\⊕D_3$

$C_1=D_0\⊕2D_1\⊕4D_2\⊕8D_3.$

Described described packet and redundant data packets are combined into coding information group, including:

K described packet is grouped in any k position of described coding information group.

Described method also includes:

If receiving terminal have received any k in k coding information group according to bag, can be according to the packet received Positional information in coding information group, extracts the row of correspondence from generator matrix E', forms a new matrix E'^-1:

${\stackrel{\→}{D}}^{\′}=\stackrel{\→}{D}\stackrel{\→}{C}\×E^{\′-1}$

Wherein,For decoding lost data packets out,For the packet received,For the redundant data received Bag.

A kind of encoding and decoding error correction system, including:

Packet split cells, for by word that packet segmentation is some fixed-size locations；

Redundant data packets signal generating unit, for word for word processing described packet, generates redundant data packets；Described superfluous Word in remaining packet is corresponding with the word in described packet；

Coding information group signal generating unit, for being combined into coding information group by described packet and redundant data packets.

Described redundant data packets signal generating unit, is additionally operable to:

Described packet D=(D₀,D₁,...,D_k-1), redundant data packets C=(C₀,C₁,...,C_r-1)；Wherein, described k is The number of packet, described r is the number of redundant data packets, and F is the coefficient matrix of kxr dimension；

Redundant data packets C is represented by:

Described coding information group signal generating unit, is additionally operable to:

K described packet is grouped in any k position of described coding information group.

Described system also includes:

Decoding unit, if having received any k in k coding information group according to bag for receiving terminal, can basis The packet received positional information in coding information group, extracts the row of correspondence from generator matrix E', forms one newly Matrix E'^-1:

${\stackrel{\→}{D}}^{\′}=\stackrel{\→}{D}\stackrel{\→}{C}\×E^{\′-1}$

Wherein,For decoding lost data packets out,For the packet received,For the redundant data received Bag.

In the embodiment of the present invention, owing to have employed technique scheme, compared with prior art, according to raw data packets by One generates redundant data packets, then by coding information group generated along to raw data packets and redundant data packets.Receiving terminal is according to connecing The data received, even if in the case of lost part coding information group data, equally decoding the interior of raw data packets Hold, thus avoid data packet retransmission, improve data transmission efficiency.

Other features and advantages of the present invention will illustrate in the following description, and, partly become from description Obtain it is clear that or understand by implementing the present invention.The purpose of the present invention and other advantages can be by the explanations write Structure specifically noted in book, claims and accompanying drawing realizes and obtains.

Below by drawings and Examples, technical scheme is described in further detail.

Accompanying drawing explanation

Accompanying drawing is for providing a further understanding of the present invention, and constitutes a part for description, with the reality of the present invention Execute example together for explaining the present invention, be not intended that limitation of the present invention.In the accompanying drawings:

The encoding and decoding error correction method principle flow chart that Fig. 1 provides for the embodiment of the present invention 1.

The encoding error correction scheme schematic diagram that Fig. 2 provides for the embodiment of the present invention 1.

The decoding and error method schematic diagram that Fig. 3 provides for the embodiment of the present invention 1.

The code correction sending method schematic diagram that Fig. 4 provides for the embodiment of the present invention 1.

The decoding and error method of reseptance schematic diagram that Fig. 5 provides for the embodiment of the present invention 1.

The encoding and decoding error correction system structural representation that Fig. 6 provides for the embodiment of the present invention 2.

Detailed description of the invention

Below in conjunction with accompanying drawing, the preferred embodiments of the present invention are illustrated, it will be appreciated that preferred reality described herein Execute example be merely to illustrate and explain the present invention, be not intended to limit the present invention.

As it is shown in figure 1, a kind of encoding and decoding error correction method principle flow chart provided for the embodiment of the present invention 1, wherein,

Step 11, by the word that packet segmentation is some fixed-size locations；

Step 12, word for word processes described packet, generates redundant data packets；Word in described redundant data packets with Word in described packet is corresponding；

Step 13, is combined into coding information group by described packet and redundant data packets.

Wherein, described packet is word for word processed, generate redundant data packets, including:

Described packet D=(D₀,D₁,...,D_k-1), redundant data packets C=(C₀,C₁,...,C_r-1)；Wherein, described k is The number of packet, described r is the number of redundant data packets, and F is the coefficient matrix of kxr dimension；

Redundant data packets C is represented by:

As described r=2, during k=4, described packet with redundant data packets is:

$\left[\begin{array}{cccc}{D}_0& D_1& D_2& D_3\\ d_{00}& d_{10}& d_{20}& d_{30}\\ d_{01}& d_{11}& d_{21}& d_{31}\\ .& .& .& .\\ .& .& .& .\\ .& .& .& .\\ d_{0j}& d_{1j}& d_{2j}& d_{3j}\end{array}\right]\left[\begin{array}{cc}{C}_0& C_1\\ c_{00}=F_1(d_{00},d_{10},d_{20},d_{30})& c_{10}=F_2(d_{00},d_{10},d_{20},d_{30})\\ c_{01}=F_1(d_{01},d_{11},d_{21},d_{31})& c_{11}=F_2(d_{01},d_{11},d_{21},d_{31})\\ .& .\\ .& .\\ .& .\\ c_{0j}=F_1(d_{0j},d_{1j},d_{2j},d_{3j})& c_{1j}=F_2(d_{0j},d_{1j},d_{2j},d_{3j})\end{array}\right]$

Wherein, the quantity of word during described j is packet.

Described coefficient matrix

According to equation below computing redundancy packet C₀ C₁:

$C_0=D_0\⊕D_1\⊕D_2\⊕D_3$

$C_1=D_0\⊕2D_1\⊕4D_2\⊕8D_3.$

Described packet and redundant data packets are combined into coding information group, including:

K described packet is grouped in any k position of described coding information group.

If receiving terminal have received any k in k coding information group according to bag, can be according to the packet received Positional information in coding information group, extracts the row of correspondence from generator matrix E', forms a new matrix E'^-1:

${\stackrel{\→}{D}}^{\′}=\stackrel{\→}{D}\stackrel{\→}{C}\×E^{\′-1}$

Wherein,For decoding lost data packets out,For the packet received,For the redundant data received Bag.

Specifically, the encoding and decoding error correction method of a kind of solving network jitter, comprise the following steps:

Packet segmentation.Split in packet is carried out the bag that first encoding operation is by, be many by packet segmentation Individual fixed-size location, fixed-size location is referred to as word, if word length is 16bits, a packet is j word.Coding is to k initial data Bag word for word processes, and generates corresponding word in m redundant data packets.Shown in specific as follows.

$\left[\begin{array}{cccc}{D}_0& D_1& D_2& D_3\\ d_{00}& d_{10}& d_{20}& d_{30}\\ d_{01}& d_{11}& d_{21}& d_{31}\\ .& .& .& .\\ .& .& .& .\\ .& .& .& .\\ d_{0j}& d_{1j}& d_{2j}& d_{3j}\end{array}\right]\left[\begin{array}{cc}{C}_0& C_1\\ c_{00}=F_1(d_{00},d_{10},d_{20},d_{30})& c_{10}=F_2(d_{00},d_{10},d_{20},d_{30})\\ c_{01}=F_1(d_{01},d_{11},d_{21},d_{31})& c_{11}=F_2(d_{01},d_{11},d_{21},d_{31})\\ .& .\\ .& .\\ .& .\\ c_{0j}=F_1(d_{0j},d_{1j},d_{2j},d_{3j})& c_{1j}=F_2(d_{0j},d_{1j},d_{2j},d_{3j})\end{array}\right]$

Encoding operation.If k raw data packets D=(D₀,D₁,...,D_k-1), r redundant data packets C=(C₀,C₁,..., C_r-1), so coding information group Group represents Y=(D₁,D₂,...,D_k,C₀,C₁,...,C_r-1), n=k+r.F is the square of kxr dimension Battle array, then the C in a Group is represented by as follows:

$\stackrel{\→}{C}=\stackrel{\→}{D}F.$

Construct in this way is redundant code, and information group (is normally placed in any k position of code character with constant form Above: D₀,D₁,...,D_k-1).If with packet as object, then front k the bag of this coding information group is exactly k and is protected Packet.

Coefficient matrixThis matrix element is all at finite field gf (2¹⁶Carry out in).

Coding computing formula:

$C_0=D_0\⊕D_1\⊕D_2\⊕D_3$

$C_1=D_0\⊕2D_1\⊕4D_2\⊕8D_3$

Generate redundant data packets C₀ C₁, transmitting terminal just can send original packet and redundant data packets successively.Specifically can be found in Fig. 2.

Decoding computing.If sending original packet D in way₀ D₂Lose, then receiving terminal just can recover according to the bag received The original packet lost, detailed process is as follows:

At receiving terminal, if recipient have received any k in k Group according to bag, can be according to the number received According to the positional information wrapped in Group, from generator matrix E', extract the row of correspondence, form a new matrix E'^-1:

(For decoding loss data out,For the initial data received,For receive Coded data)

$E=\left[\begin{array}{cccc}D1& D3& C0& C1\\ 0& 0& 1& 1\\ 1& 0& 1& 2\\ 0& 0& 1& 4\\ 0& 1& 1& 8\end{array}\right]=>E^{\′-1}=\left[\begin{array}{cccc}-\frac{2}{3}& 1& -\frac{1}{3}& 0\\ \frac{4}{3}& 0& -\frac{7}{3}& 1\\ \frac{4}{3}& 0& -\frac{1}{3}& 0\\ -\frac{1}{3}& 0& \frac{1}{3}& 0\end{array}\right]$

The original packet formula lost:

$D_0=-\frac{2}{3}D1\⊕\frac{4}{3}D3\⊕\frac{4}{3}{C}_0\⊕-\frac{1}{3}{C}_1$

$D_3=-\frac{1}{3}D1\⊕-\frac{7}{3}D3\⊕-\frac{1}{3}{C}_0\⊕\frac{1}{3}{C}_1.$

Referring specifically to Fig. 3.

More than the specific algorithm for the encoding and decoding error correction method of a kind of solving network jitter realizes process.

It practice, after raw data packets is encoded by queue, obtain D₀,D₁,...,D_k-1, see Fig. 4, the most only include D₀ D₁ D₂ D₃, as example.D₀ D₁ D₂ D₃After encoded, obtain redundant data packets C₀ C₁, unification is organized as coding information After group, send data.

Receiving terminal as it is shown in figure 5, wherein, obtains C after receiving data decoding₀ C₁And D₁ D₃, lost initial data Bag D₀ D₂.At this time, it may be necessary to according to the decoding data received and error correction, obtain packet D₀ D₂, then form complete Packet is sent to the various application on upper strata.

The embodiment of the present invention, owing to have employed technique scheme, compared with prior art, according to raw data packets one by one Generate redundant data packets, then by coding information group generated along to raw data packets and redundant data packets.Receiving terminal is according to reception The data arrived, even if in the case of lost part coding information group data, equally decoding the content of raw data packets, Thus avoid data packet retransmission, improve data transmission efficiency.

As shown in Figure 6, a kind of encoding and decoding error correction system structural representation provided for the embodiment of the present invention 2, specific as follows:

Packet split cells 21, for by word that packet segmentation is some fixed-size locations；

Redundant data packets signal generating unit 22, for word for word processing described packet, generates redundant data packets；Described Word in redundant data packets is corresponding with the word in described packet；

Coding information group signal generating unit 23, for being combined into coding information group by described packet and redundant data packets.

It is also preferred that the left above-mentioned redundant data packets signal generating unit 21, it is additionally operable to:

Described packet D=(D₀,D₁,...,D_k-1), redundant data packets C=(C₀,C₁,...,C_r-1)；Wherein, described k is The number of packet, described r is the number of redundant data packets, and F is the coefficient matrix of kxr dimension；

Redundant data packets C is represented by:

It is also preferred that the left above-mentioned coding information group signal generating unit 23, it is additionally operable to:

K described packet is grouped in any k position of described coding information group.

It is also preferred that the left said system also includes:

Decoding unit 24, if having received any k in k coding information group according to bag, Ji Kegen for receiving terminal According to the packet received positional information in coding information group, from generator matrix E', extract the row of correspondence, form one New matrix E'^-1:

${\stackrel{\→}{D}}^{\′}=\stackrel{\→}{D}\stackrel{\→}{C}\×E^{\′-1}$

Wherein,For decoding lost data packets out,For the packet received,For the redundant data received Bag.

In sum, in the embodiment of the present invention, owing to have employed technique scheme, compared with prior art, according to former Beginning packet generates redundant data packets one by one, then by coding information group generated along to raw data packets and redundant data packets.Connect Receiving end is according to the data received, even if in the case of lost part coding information group data, equally decoding original The content of packet, thus avoid data packet retransmission, improve data transmission efficiency.

Those skilled in the art are it should be appreciated that embodiments of the invention can be provided as method, system or computer program Product.Therefore, the reality in terms of the present invention can use complete hardware embodiment, complete software implementation or combine software and hardware Execute the form of example.And, the present invention can use at one or more computers wherein including computer usable program code The shape of the upper computer program implemented of usable storage medium (including but not limited to disk memory and optical memory etc.) Formula.

The present invention is with reference to method, equipment (system) and the flow process of computer program according to embodiments of the present invention Figure and/or block diagram describe.It should be understood that can the most first-class by computer program instructions flowchart and/or block diagram Flow process in journey and/or square frame and flow chart and/or block diagram and/or the combination of square frame.These computer programs can be provided Instruction arrives the processor of general purpose computer, special-purpose computer, Embedded Processor or other programmable data processing device to produce A raw machine so that the instruction performed by the processor of computer or other programmable data processing device is produced for real The device of the function specified in one flow process of flow chart or multiple flow process and/or one square frame of block diagram or multiple square frame now.

These computer program instructions may be alternatively stored in and computer or other programmable data processing device can be guided with spy Determine in the computer-readable memory that mode works so that the instruction being stored in this computer-readable memory produces and includes referring to Make the manufacture of device, this command device realize at one flow process of flow chart or multiple flow process and/or one square frame of block diagram or The function specified in multiple square frames.

These computer program instructions also can be loaded in computer or other programmable data processing device so that at meter Perform sequence of operations step on calculation machine or other programmable devices to produce computer implemented process, thus at computer or The instruction performed on other programmable devices provides for realizing at one flow process of flow chart or multiple flow process and/or block diagram one The step of the function specified in individual square frame or multiple square frame.

Obviously, those skilled in the art can carry out various change and the modification essence without deviating from the present invention to the present invention God and scope.So, if these amendments of the present invention and modification belong to the scope of the claims in the present invention and equivalent technologies thereof Within, then the present invention is also intended to comprise these change and modification.

Claims (10)

1. an encoding and decoding error correction method, it is characterised in that including:

By the word that packet segmentation is some fixed-size locations；

Described packet is word for word processed, generates redundant data packets；Word in described redundant data packets and described packet In word corresponding；

Described packet and redundant data packets are combined into coding information group.

2. the method for claim 1, it is characterised in that described word for word process described packet, generates redundancy Packet, including:

Described packet D=(D₀,D₁,...,D_k-1), redundant data packets C=(C₀,C₁,...,C_r-1)；Wherein, described k is data The number of bag, described r is the number of redundant data packets, and F is the coefficient matrix of kxr dimension；

Redundant data packets C is represented by:

3. method as claimed in claim 2, it is characterised in that as described r=2, during k=4, described packet and redundant digit According to bag it is:

$\left[\begin{array}{cccc}{D}_0& D_1& D_2& D_3\\ d_{00}& d_{10}& d_{20}& d_{30}\\ d_{01}& d_{11}& d_{21}& d_{31}\\ .& .& .& .\\ .& .& .& .\\ .& .& .& .\\ d_{0j}& d_{1j}& d_{2j}& d_{3j}\end{array}\right]\left[\begin{array}{cc}{C}_0& C_1\\ c_{00}=F_1(d_{00},d_{10},d_{20},d_{30})& c_{10}=F_2(d_{00},d_{10},d_{20},d_{30})\\ c_{01}=F_1(d_{01},d_{11},d_{21},d_{31})& c_{11}=F_2(d_{01},d_{11},d_{21},d_{31})\\ .& .\\ .& .\\ .& .\\ c_{0j}=F_1(d_{0j},d_{1j},d_{2j},d_{3j})& c_{1j}=F_2(d_{0j},d_{1j},d_{2j},d_{3j})\end{array}\right]$

Wherein, the quantity of word during described j is packet.

4. method as claimed in claim 3, it is characterised in that described coefficient matrix

$F=\left[\begin{array}{cc}1& 1\\ 1& 2\\ 1& 4\\ 1& 8\end{array}\right];$

According to equation below computing redundancy packet C₀C₁:

$C_0=D_0\⊕D_1\⊕D_2\⊕D_3$

$C_1=D_0\⊕2D_1\⊕4D_2\⊕8D_3.$

5. the method for claim 1, it is characterised in that described described packet and redundant data packets are combined into volume Code information group, including:

K described packet is grouped in any k position of described coding information group.

6. the method for claim 1, it is characterised in that described method also includes:

If receiving terminal have received any k in k coding information group according to bag, can compile according to the packet received Positional information in code information group, extracts the row of correspondence from generator matrix E', forms a new matrix E^'-1:

${\stackrel{\→}{D}}^{\′}=\stackrel{\→}{D}\stackrel{\→}{C}\×E^{\′-1}$

Wherein,For decoding lost data packets out,For the packet received,For the redundant data packets received.

7. an encoding and decoding error correction system, it is characterised in that including:

Packet split cells, for by word that packet segmentation is some fixed-size locations；

Redundant data packets signal generating unit, for word for word processing described packet, generates redundant data packets；Described redundant digit Corresponding with the word in described packet according to the word in bag；

Coding information group signal generating unit, for being combined into coding information group by described packet and redundant data packets.

8. system as claimed in claim 7, it is characterised in that described redundant data packets signal generating unit, is additionally operable to:

Described packet D=(D₀,D₁,...,D_k-1), redundant data packets C=(C₀,C₁,...,C_r-1)；Wherein, described k is data The number of bag, described r is the number of redundant data packets, and F is the coefficient matrix of kxr dimension；

Redundant data packets C is represented by:

9. system as claimed in claim 7, it is characterised in that described coding information group signal generating unit, is additionally operable to:

K described packet is grouped in any k position of described coding information group.

10. system as claimed in claim 7, it is characterised in that described system also includes:

Decoding unit, if having received any k in k coding information group according to bag for receiving terminal, can be according to being received To packet coding information group in positional information, extract from generator matrix E' correspondence row, form a new square Battle array E^'-1:

${\stackrel{\→}{D}}^{\′}=\stackrel{\→}{D}\stackrel{\→}{C}\×E^{\′-1}$

Wherein,For decoding lost data packets out,For the packet received,For the redundant data packets received.