CN103067130B - Wireless communication method for packet-loss recovery and based on union line column check code and record separator (RS) code - Google Patents
Wireless communication method for packet-loss recovery and based on union line column check code and record separator (RS) code Download PDFInfo
- Publication number
- CN103067130B CN103067130B CN201210570185.0A CN201210570185A CN103067130B CN 103067130 B CN103067130 B CN 103067130B CN 201210570185 A CN201210570185 A CN 201210570185A CN 103067130 B CN103067130 B CN 103067130B
- Authority
- CN
- China
- Prior art keywords
- data
- packet
- data block
- parity check
- block
- 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.)
- Expired - Fee Related
Links
Abstract
The invention discloses a wireless communication method for packet-loss recovery and based on a union line column check code and a recorder separator (RS) code, and relates to an end-to-end communication system with a high real-time requirement. The wireless communication method aims at solving the problems that an existing packet-loss recovery method is low in efficiency and limited in application scenarios. A column odd-even check and a line odd-even check algorithms, a line column odd-even check combination RS coded algorithm, a line odd-even check and column odd-even check added with RS coded algorithm are adopted, and a packet-loss property of the system is improved. The wireless communication method for the packet-loss recovery and based on the union line column check code and the recorder separator (RS) code is applicable to the end-to-end communication system with the high real-time requirement, capable of ensuring communication quality, and suitable for application to aspects such as high-speed transmission of multimedia information like video and audio.
Description
Technical field
The present invention relates to the wireless communications method based on the loss recovery technology based on associating ranks check code and RS code.
Background technology
Along with the development of Internet and the progress of science and technology, the multimedia messagess such as the demand of people to information grows with each passing day, increasing Audio and Video adopt Internet to transmit, thus meet daily application, such as voice service, TV, mobile phone etc.These all apply the packet switching network (packet-switchednetwork) based on IP agreement (Internet Protocol).Public internet is also a packet switching network, constitutes landline and wireless link, and satellite link, still make use of IP agreement.Namely the content of Media Stream is broken into packet, transmit according to IP agreement.
But when transmitting continuous bulk information, IP agreement can not ensure the reliability transmitted, such as when data flow large in the routing node short time exceedes ability to bear time, will packet loss be produced, if transmission is video/audio information, so will cause the decline of quality.In end to end communication, excessive link noise, or the reason such as the decline of radio transmission all can cause packet loss.
For above problem, there has been proposed Transmission Control Protocol (Transmission Control Protocol), namely the information of losing is transmitted again, but be not suitable for like this in the higher communication of real-time demand.So, people also been proposed UDP (User Dategram Protocol) and RTP(Real Time Protocol), but the ability that both is improving packet loss does not well meet transmission request message, particularly when transmission of video to the requirement of quality.
Given this, forward error correction FEC(Forward Error Correction Coding can be passed through) improve the packet loss performance of system.The FEC of physical layer (Physical Layer) can correct the mistake of bit-level, but the coding of existing better performances such as turbo code etc. have larger encoding and decoding time delay, are not suitable in the higher system of real-time.Existing loss recovery method efficiency is low, and limitation is compared in application scenario.
Summary of the invention
The present invention is low in order to solve existing loss recovery method efficiency, and the problem of limitation is compared in application scenario, and proposes the loss recovery method based on associating ranks check code and RS code.
Based on the wireless communications method of loss recovery technology of associating ranks check code and RS code, its adopts row parity check, the loss recovery method of row parity check realizes radio communication, and described wireless communications method is:
At transmitting terminal, all data blocks to be sent form a data segment, have q useful information data block in each data segment, to the processing procedure of data are:
The first step, the checksum coding S1 carried out according to column direction in each data block, obtain parity check S1 code, and this parity check S1 code be placed in the end of respective data blocks as a packet, obtain a new q data block;
Checksum coding is carried out between second step, q data block obtaining in a first step, obtain checksum coding S2, and using this checksum coding S2 as checking data block, a jth symbol of i-th packet in checking data block, in a front q data block, the parity check that the jth symbol of i-th packet in each data block carries out, wherein, L symbol is had in each packet, 1≤i≤p+1,1≤j≤L, q, i and j are all positive integers;
3rd step, through the first step to second step coding after, be that unit transmits according to packet, the packet in each data block is deposited in the buffer of transmitting terminal in order line by line, when having filled a data block in the data buffer of transmitting terminal, be sent to wireless channel
Be: the data block sent by wireless channel receiving end/sending end, the packet received successively stored in the buffer of receiving terminal, then decode to the processing procedure of data at receiving terminal;
4th step, carry out parity check S1 in data block and decode, in each data block, if packet loss is less than or equal to 1, so all in this data block packets, all recover, if number of dropped packets is greater than 1, so just abandon the parity check S1 part in this block, when in data segment, each data block is completed the decoding of S1, whether all packet losses recover in inspection, if all packet losses recover, decoding completes; If all packet losses fail to recover completely, carry out the 5th step decoding;
5th step, carry out the decoding of parity check S2 between data block, all i bags before checking successively in q+1 data block, if number of dropped packets is less than or equal to 1, so utilize parity check S2 all i data packet recoveries in a front q data block, if number of dropped packets is greater than 1, so just abandon checking data fast in the redundancy corresponding with this position, after all packets all take part in S2 decoding, decoding completes, and gives user the information exported.
Based on the wireless communications method of loss recovery technology of associating ranks check code and RS code, the method that its adopts ranks parity check to encode in conjunction with RS realizes radio communication, and described wireless communications method is:
At transmitting terminal, all data blocks to be sent form a data segment, have q useful information data block in each data segment, are made up of inside each useful information data block a data sub-block, and in each data sub-block, have b information packet, to the processing procedure of data be:
Steps A 1, the checksum coding S1 carried out according to column direction inside each data sub-block in each data block, obtain parity check S1 code, and this parity check S1 code is placed in the end of each data sub-block as a packet, obtain a new q data block;
Carry out checksum coding between new q data block of steps A 2, acquisition in steps A 1, obtain checksum coding S2, and using this checksum coding S2 as checking data block;
Steps A 3, on the direction of the row of each data block, by information packet all in block, carry out (N, K) RS and encode, wherein K=a × b.
Steps A 4, through steps A 1 to steps A 3 encode after, be that unit transmits according to packet, packet in each data block is deposited in the buffer of transmitting terminal in order line by line, when having filled a data block in the data buffer of transmitting terminal, is sent to wireless channel;
Be: the data block sent by wireless channel receiving end/sending end, the packet received successively stored in the buffer of receiving terminal, then decode to the processing procedure of data at receiving terminal;
Steps A 5, carry out RS decoding to checking data block, in checking data block, K packet before first detecting, if not there is packet loss, so just all loses redundancy section, a front K packet is stored on the relevant position of data buffer; If a front K data contract out showed packet loss, so just transfer the number checking packet loss in N number of packet, be less than or equal to (N-K)/2 if there is number of dropped packets, K bag before recovering so completely, deposits in data buffer zone after losing (N-K) individual redundancy; If number of dropped packets is greater than (N-K)/2, decode unsuccessfully, lose (N-K) individual redundancy, then K bag before receiving is stored in data buffer zone;
Steps A 6, interblock parity check code S2 to be decoded, each row of data bag before checking successively in q+1 data block, if number of dropped packets is less than or equal to 1, so utilize parity check S2 all data packet recoveries in a front q data block, if number of dropped packets is greater than 1, so just abandon checking data fast in the redundancy corresponding with this position, after all packets all take part in S2 decoding, whether all packet losses recover in inspection, if all packet losses recover, decoding completes; If all packet losses fail to recover completely, carry out steps A 7 and decode;
Steps A 7, carry out the decoding of parity check S1 successively in each data sub-block, check each data sub-block successively, if number of dropped packets is less than or equal to 1, so utilize parity check S1 that all data sub-block in a front q data block are recovered, if number of dropped packets is greater than 1, so just abandon redundancy corresponding with this position in checking data block;
Steps A 8, successively a front q data block is carried out RS decoding, K packet before first detecting, if not there is packet loss, so just all loses redundancy section, a front K packet is stored on the relevant position of data buffer; If a front K data contract out showed packet loss, so just transfer the number checking packet loss in N number of packet, if number of dropped packets is less than or equal to (N-K)/2, there is data buffer zone after losing (N-K) individual redundancy in K bag before recovering so completely; If number of dropped packets is greater than (N-K)/2, decode unsuccessfully, lose (N-K) individual redundancy, then K packet before receiving is stored in data buffer zone, after completing decoding, (a × b × q) the individual information packet altogether in data buffer zone is sent to user in order.
Based on the wireless communications method of loss recovery technology of associating ranks check code and RS code, its adopts row parity check, and row parity check adds that the method that RS encodes realizes radio communication, and described wireless communications method is:
At transmitting terminal, all data blocks to be sent form a data segment, have q useful information data block in each data segment,
Step B1, the checksum coding S1 carried out according to column direction in each data block, obtain parity check S1 code, and using this parity check S1 code as a packet, obtain a new q data block, to the processing procedure of data be:;
Step B2, to a front q data block, carry out respectively longitudinal direction (N, K) RS coding, wherein K=p+1.
Step B3, carry out checksum coding between q the data block obtained in step B1, obtain checksum coding S2, and using this checksum coding S2 as checking data block;
Step B4, through step B1 to step B3 encode after, be that unit transmits according to packet, the packet in each data block is deposited in the buffer of transmitting terminal in order line by line, when having filled a data block in the data buffer of transmitting terminal, be sent to wireless channel
Be: the data block sent by wireless channel receiving end/sending end, the packet received successively stored in the buffer of receiving terminal, then decode to the processing procedure of data at receiving terminal;
Step B5, carry out the decoding of parity check S1 between data block, check all parity code check packets successively, if number of dropped packets is less than or equal to 1, so utilize parity check S1 that all parity code check packets in a front q data block are recovered, if number of dropped packets is greater than 1, so leaps in next data block and still carry out this step; If after step B5 terminates, all packet losses recover, and so decoded data are sent to user.
Step B6, carry out parity check S2 in data block and decode, in each data block, if often row packet loss is less than or equal to 1, so all in this data block packets, all recover, if number of dropped packets is greater than 1, so just abandon the parity check S2 part in this block, when in data segment, each data block is completed the decoding of S2, whether all packet losses recover in inspection, if all packet losses recover, decoding completes, and decoded data are sent to user; If all packet losses fail to recover completely, then (N-K) individual packet after in each data block is carried out S2 decoding, then carry out step B7 decoding;
Step B7, in a front q data block, carry out RS decoding respectively, if all packet losses are always completely recovered, so decoded, otherwise, carry out step B8;
If step B8 step B7 has date restoring, so just jump to step B6 and re-execute, otherwise declaration decoding terminates, and decoded data are sent to user.
The present invention has less encoding time delay, the advantage of stronger loss recovery ability.It is by adopting row parity check, and the method for row parity check makes loss recovery method efficiency high; By adopting row parity check, row parity check adds that RS coding is convenient to be applied to various occasion.
Accompanying drawing explanation
Fig. 1 is that wherein, each packet is made up of header and data message based on combining the data block pie graph be made up of several packets in the wireless communications method of the loss recovery technology of ranks check code and RS code, and 1 represents header, and 2 represent data messages;
Fig. 2 is the structural representation of the data segment be made up of the data block shown in multiple Fig. 1;
Fig. 3 be described in embodiment one based on associating ranks check code and RS code loss recovery technology wireless communications method in, the structural representation of the data segment obtained after checksum coding is carried out to the data segment shown in Fig. 2, in figure, the end of each data block increases checksum coding S1;
Fig. 4 be described in embodiment one based on associating ranks check code and RS code loss recovery technology wireless communications method in, the structural representation of the data segment obtained after the checksum coding carry out between data block to the data segment shown in Fig. 3, in figure, the packet of packet in last data block to data block relevant position above carries out checksum coding, such as, 5 represent the checksum coding S2 carried out earlier data block relevant position;
Fig. 5 is the pie graph of data sub-block be made up of multiple packet in the wireless communications method of the loss recovery technology based on associating ranks check code and RS code described in embodiment two, and wherein, 6 represent packets, and 7 represent checksum coding S1;
Fig. 6 be described in embodiment two based on associating ranks check code and RS code loss recovery technology wireless communications method in, the structural representation of the data segment obtained after checksum coding is carried out to the data sub-block shown in Fig. 5, in figure, the end of each bag increases checksum coding S1;
Fig. 7 be described in embodiment two based on associating ranks check code and RS code loss recovery technology wireless communications method in, the structural representation of the data segment obtained after RS coding is carried out on the column direction of each data block to the data segment shown in Fig. 5, in figure, 9 represent the part of carrying out RS coding;
Fig. 8 be described in embodiment three based on associating ranks check code and RS code loss recovery technology wireless communications method in, checksum coding S1 is carried out to data segment, encode carrying out the RS on each data block column direction, carrying out the checksum coding S2 between data block, the structural representation of the data segment obtained afterwards, in figure, 11 represent checksum coding S1, and 10 represent the part of carrying out RS coding;
Fig. 9 is under equivalent environment, existing communication method and the communication means described in the specific embodiment of the present invention one is adopted to realize the packet loss comparison diagram communicated, wherein, curve a correspondence adopts existing communication method, packet loss design sketch when directly sending data, and curve b represents and adopts the communication means described in embodiment one, the packet loss design sketch to data correspondence after coding;
Figure 10 is under equivalent environment, existing communication method and the communication means described in the specific embodiment of the present invention two is adopted to realize the packet loss comparison diagram communicated, wherein, curve c correspondence adopts existing communication method, packet loss design sketch during direct transmission data, curve d represents the communication means adopted described in embodiment two, packet loss design sketch corresponding after the information packet number b=21 comprised in data block is encoded, curve e represents the communication means adopted described in embodiment two, packet loss design sketch corresponding after the information packet number b=11 comprised in data block is encoded, curve f represents the communication means adopted described in embodiment two, packet loss design sketch corresponding after the information packet number b=7 comprised in data block is encoded,
Figure 11 is under equivalent environment, existing communication method and the communication means described in the specific embodiment of the present invention three is adopted to realize the packet loss comparison diagram communicated, wherein, packet loss design sketch when curve f correspondence employing existing communication method, directly transmission data, curve m represents the communication means of employing described in embodiment three, the packet loss design sketch corresponding after coding to data, and curve n representing the communication means of employing described in embodiment three, repeating packet loss design sketch corresponding to cataloged procedure to having during date restoring;
Embodiment
The wireless communications method of loss recovery technology based on associating ranks check code and RS code described in embodiment one, present embodiment, it adopts row parity check, the loss recovery method of row parity check realizes radio communication, and described wireless communications method is:
At transmitting terminal, all data blocks to be sent form a data segment, have q useful information data block in each data segment, to the processing procedure of data are:
The first step, the checksum coding S1 carried out according to column direction in each data block, obtain parity check S1 code, and this parity check S1 code be placed in the end of respective data blocks as a packet, obtain a new q data block;
Checksum coding is carried out between second step, q data block obtaining in a first step, obtain checksum coding S2, and using this checksum coding S2 as checking data block, actual checksum coding is a jth symbol of i-th packet in checking data block, in a front q data block, the parity check that the jth symbol of i-th packet in each data block carries out, wherein, L symbol is had in each packet, 1≤i≤p+1,1≤j≤L, q, i and j are all positive integers;
3rd step, through the first step to second step coding after, be that unit transmits according to packet, the packet in each data block is deposited in the buffer of transmitting terminal in order line by line, when having filled a data block in the data buffer of transmitting terminal, be sent to wireless channel
Be: the data block sent by wireless channel receiving end/sending end, the packet received successively stored in the buffer of receiving terminal, then decode to the processing procedure of data at receiving terminal;
4th step, carry out parity check S1 in data block and decode, in each data block, if packet loss is less than or equal to 1, so all in this data block packets, all recover, if number of dropped packets is greater than 1, so just abandon the parity check S1 part in this block, when in data segment, each data block is completed the decoding of S1, whether all packet losses recover in inspection, if all packet losses recover, decoding completes; If all packet losses fail to recover completely, carry out the 5th step decoding;
5th step, carry out the decoding of parity check S2 between data block, all i bags before checking successively in q+1 data block, if number of dropped packets is less than or equal to 1, so utilize parity check S2 all i data packet recoveries in a front q data block, if number of dropped packets is greater than 1, so just abandon checking data fast in the redundancy corresponding with this position, after all packets all take part in S2 decoding, decoding completes, and gives user the information exported.
In present embodiment, have q data block in each data segment, each data block is become by (p+1) individual data packet group, easily obtains,
obviously, the often value of given one group of p and q, can obtain a superfluous letter ratio, each class value can obtain the result of different packet loss performances.Only for p=20, q=20 situation representatively, carry out the emulation of anti-dropout performance.Now, superfluous letter is than=10.25%, the design sketch of input packet loss and output packet loss is illustrated in fig. 9 shown below, the complexity of the method is minimum, superfluous letter than minimum, ultrahigh in efficiency, but performance is not desirable especially, can be applied in system latency requirement high, but packet loss require it is not very high occasion.
The wireless communications method of loss recovery technology based on associating ranks check code and RS code described in embodiment two, present embodiment, the method that its adopts ranks parity check to encode in conjunction with RS realizes radio communication, and described wireless communications method is:
At transmitting terminal, all data blocks to be sent form a data segment, have q useful information data block in each data segment, are made up of inside each useful information data block a data sub-block, and in each data sub-block, have b information packet, to the processing procedure of data be:
Steps A 1, the checksum coding S1 carried out according to column direction inside each data sub-block in each data block, obtain parity check S1 code, and this parity check S1 code is placed in the end of each data sub-block as a packet, obtain a new q data block;
Carry out checksum coding between new q data block of steps A 2, acquisition in steps A 1, obtain checksum coding S2, and using this checksum coding S2 as checking data block;
Steps A 3, on the direction of the row of each data block, by information packet all in block, carry out (N, K) RS and encode, wherein, if number of dropped packets is less than or equal to 1, so packet loss just can recover completely, sends to user after recovery; If number of dropped packets is greater than 1, so we think and decode unsuccessfully, directly lose redundancy, K useful information before residue;
Steps A 4, through steps A 1 to steps A 3 encode after, be that unit transmits according to packet, packet in each data block is deposited in the buffer of transmitting terminal in order line by line, when having filled a data block in the data buffer of transmitting terminal, is sent to wireless channel;
Be: the data block sent by wireless channel receiving end/sending end, the packet received successively stored in the buffer of receiving terminal, then decode to the processing procedure of data at receiving terminal;
Steps A 5, carry out RS decoding to checking data block, in checking data block, K packet before first detecting, if not there is packet loss, so just all loses redundancy section, a front K packet is stored on the relevant position of data buffer; If a front K data contract out showed packet loss, so just transfer the number checking packet loss in N number of packet, be less than or equal to (N-K)/2 if there is number of dropped packets, K bag before recovering so completely, deposits in data buffer zone after losing (N-K) individual redundancy; If number of dropped packets is greater than (N-K)/2, decode unsuccessfully, lose (N-K) individual redundancy, then K bag before receiving is stored in data buffer zone;
Steps A 6, interblock parity check code S2 to be decoded, all packets before checking successively in q+1 data block, if number of dropped packets is less than or equal to 1, so utilize parity check S2 all data packet recoveries in a front q data block, if number of dropped packets is greater than 1, so just abandon checking data fast in the redundancy corresponding with this position, after all packets all take part in S2 decoding, whether all packet losses recover in inspection, if all packet losses recover, decoding completes; If all packet losses fail to recover completely, carry out steps A 7 and decode;
Steps A 7, carry out the decoding of parity check S1 successively in each data sub-block, check each data sub-block successively, if number of dropped packets is less than or equal to 1, so utilize parity check S1 that all data sub-block in a front q data block are recovered, if number of dropped packets is greater than 1, so just abandon redundancy corresponding with this position in checking data block;
Steps A 8, successively a front q data block is carried out RS decoding, K packet before first detecting, if not there is packet loss, so just all loses redundancy section, a front K packet is stored on the relevant position of data buffer; If a front K data contract out showed packet loss, so just transfer the number checking packet loss in N number of packet, if number of dropped packets is less than or equal to (N-K)/2, there is data buffer zone after losing (N-K) individual redundancy in K bag before recovering so completely; If number of dropped packets is greater than (N-K)/2, decode unsuccessfully, lose (N-K) individual redundancy, then K packet before receiving is stored in data buffer zone, after completing decoding, (a × b × q) the individual information packet altogether in data buffer zone is sent to user in order.
In present embodiment in each data segment
useful information=q × K.So
we can be respectively 7,11,21 with q=16, b, and (N, K) gets, and (255,231) are representative, from Figure 10, can see, the performance of the method has had and promotes greatly, and output packet loss can be made to reduce to 10
-8, even 10
-9the order of magnitude, and input packet loss less in even can error correction completely.But the cost paid is the increase of system complexity and the decline of system effectiveness, when can be listed in q=16, b=7, the form of the superfluous letter ratio of 11,21, in table 1.
| Superfluous letter ratio | |
| b=7 | 32.46% |
| b=11 | 26.94% |
| b=21 | 22.34% |
The method encoding and decoding slightly complexity are large, but superfluous letter is than high, and efficiency is lower, and performance is fine.Higher occasion is required to the packet loss of system.
Embodiment three, present embodiment are based on the wireless communications method of loss recovery technology of associating ranks check code and RS code, and its adopts row parity check, and row parity check adds that the method that RS encodes realizes radio communication, and described wireless communications method is:
At transmitting terminal, all data blocks to be sent form a data segment, have q useful information data block in each data segment,
Step B1, the checksum coding S1 carried out according to column direction in each data block, obtain parity check S1 code, and using this parity check S1 code as a packet, obtain a new q data block, to the processing procedure of data be:;
Step B2, to a front q data block, carry out respectively longitudinal direction (N, K) RS coding, in checking data block, if not there is packet loss in K packet before first detecting, so just redundancy section is all lost, a front K packet is stored on the relevant position of data buffer; If a front K data contract out showed packet loss, so just transfer the number checking packet loss in N number of packet, be less than or equal to (N-K)/2 if there is number of dropped packets e, K bag before recovering so completely, deposits in data buffer zone after losing (N-K) individual redundancy; If number of dropped packets e is greater than (N-K)/2, decode unsuccessfully, lose (N-K) individual redundancy, then K bag before receiving is stored in data buffer zone;
Step B3, carry out checksum coding between q the data block obtained in step B1, obtain checksum coding S2, and using this checksum coding S2 as checking data block;
Step B4, through step B1 to step B3 encode after, be that unit transmits according to packet, the packet in each data block is deposited in the buffer of transmitting terminal in order line by line, when having filled a data block in the data buffer of transmitting terminal, be sent to wireless channel
Be: the data block sent by wireless channel receiving end/sending end, the packet received successively stored in the buffer of receiving terminal, then decode to the processing procedure of data at receiving terminal;
Step B5, carry out the decoding of parity check S1 between data block, check all parity code check packets successively, if number of dropped packets is less than or equal to 1, so utilize parity check S1 that all parity code check packets in a front q data block are recovered, if number of dropped packets is greater than 1, so leaps in next data block and still carry out this step;
Step B6, carry out parity check S2 in data block and decode, in each data block, if packet loss is less than or equal to 1, so all in this data block packets, all recover, if number of dropped packets is greater than 1, so just abandon the parity check S2 part in this block, when in data segment, each data block is completed the decoding of S2, whether all packet losses recover in inspection, if all packet losses recover, decoding completes; If all packet losses fail to recover completely, then (N-K) individual packet after in each data block is carried out S2 decoding, then carry out step B7 decoding;
Step B7, in a front q data block, carry out RS decoding respectively, if all packet losses are always completely recovered, so decoded, otherwise, carry out step B8;
If step B8 step B7 has date restoring, so just jump to step B6 and re-execute, otherwise declaration decoding terminates, and decoded data are sent to user.
In present embodiment, only encode with (63,57) RS, q=7 is example, emulates anti-dropout performance respectively.First, if emulation does not carry out iterative decoding, when namely iterations equals 0, the performance of system, refers to Figure 11.And under same prerequisite, if carry out iterative decoding, the performance of system refers to Figure 11.We can find out clearly from Figure 11, the different corresponding different performance of iterations.In real work, for different system latency requirement, different iterationses can be specified, to obtain the anti-dropout performance being more suitable for particular job environment.
The redundancy of the method is q × (N-K+1)+N, and effective information is q × (K-1), and superfluous letter is than being
so get the prerequisite of (63,57) at (N, K) under, if q is 7, so superfluous letter is than being 28.6%.The method is the balance of encoding and decoding complexity and efficiency, can obtain more satisfactory performance, and can control iterations, thus the time delay of manual control system, be more convenient for being applied to various occasion.
Introduce the concept of a superfluous letter ratio, namely in sent data segment, the ratio of the number of redundant information and useful information.It can reflect the efficiency of information in transmitting procedure, also can reflect the performance of coding to a certain extent.Superfluous letter is than larger, and it is more that redundant information accounts for sum, and so the efficiency of information transmission is lower; But it is many to account for sum just because of redundant information, so under the prerequisite of losing identical bag, the probability of useful information packet loss reduces, and namely packet loss can decline, and so anti-dropout performance just has raising to a certain extent.At superfluous letter than identical or when being more or less the same, the complexity of balance encoding and decoding and these two factors of final anti-dropout code performance.
Operation principle: in information exchanging process is least unit usually with packet.Each packet comprises a header and data message.Header is initial as each packet; Data message comprises L symbol, and each symbol is m bit.And several information packet and checking data bag can form a data block.Visible Fig. 1 of form of data block.Here define, in each data block, comprise p packet.
At transmitting terminal and receiving terminal, there is a data buffer all respectively.At transmitting terminal, the packet in each data block is deposited in buffer in order line by line, in time having filled a data block in data buffer, just starts to be ready for sending.In data transmission procedure, be also in units of packet, send line by line, until there is no packet in data buffer.And then in the manner described above the packet in next data block is stored in buffer, by that analogy.
Similarly, at receiving terminal, the data received are in order line by line stored in data buffer, until there be p packet in data buffer, namely a complete data block, can send to user after decoding.
In transmitting procedure, we think, packet loss is in units of packet.In other words, if one or more symbols of any packet create loss, we just think that this packet entirety all lost, and wherein L, m and p are positive integer.
Claims (3)
1., based on the wireless communications method of loss recovery technology of associating ranks check code and RS code, it is characterized in that, its adopts row parity check, the loss recovery method of row parity check realizes radio communication, described wireless communications method is:
At transmitting terminal, all data blocks to be sent form a data segment, have q useful information data block in each data segment, to the processing procedure of data are:
The first step, the checksum coding S1 carried out according to column direction in each data block, obtain parity check S1 code, and this parity check S1 code be placed in the end of respective data blocks as a packet, obtain a new q data block;
Checksum coding is carried out between second step, q data block obtaining in a first step, obtain checksum coding S2, and using this checksum coding S2 as checking data block, actual checksum coding is a jth symbol of i-th packet in checking data block, in a front q data block, the parity check that the jth symbol of i-th packet in each data block carries out, wherein, L symbol is had in each packet, 1≤i≤q+1,1≤j≤L, q, i and j are all positive integers;
3rd step, through the first step to second step coding after, be that unit transmits according to packet, the packet in each data block is deposited in the buffer of transmitting terminal in order line by line, when having filled a data block in the data buffer of transmitting terminal, be sent to wireless channel
Be: the data block sent by wireless channel receiving end/sending end, the packet received successively stored in the buffer of receiving terminal, then decode to the processing procedure of data at receiving terminal;
4th step, carry out parity check S1 in data block and decode, in each data block, if packet loss is less than or equal to 1, so all in this data block packets, all recover, if number of dropped packets is greater than 1, so just abandon the parity check S1 part in this block, when in data segment, each data block is completed the decoding of S1, whether all packet losses recover in inspection, if all packet losses recover, decoding completes; If all packet losses fail to recover completely, carry out the 5th step decoding;
5th step, carry out the decoding of parity check S2 between data block, all i bags before checking successively in q+1 data block, if number of dropped packets is less than or equal to 1, so utilize parity check S2 all i data packet recoveries in a front q data block, all packets if number of dropped packets is greater than 1, so just abandon redundancy corresponding with this position in checking data block, after all take part in S2 decoding, decoding completes, and gives user the information exported.
2., based on the wireless communications method of loss recovery technology of associating ranks check code and RS code, it is characterized in that, the method that its adopts ranks parity check to encode in conjunction with RS realizes radio communication, and described wireless communications method is:
At transmitting terminal, all data blocks to be sent form a data segment, have q useful information data block in each data segment, are made up of inside each useful information data block a data sub-block, and in each data sub-block, have b information packet, to the processing procedure of data be:
Steps A 1, the checksum coding S1 carried out according to column direction inside each data sub-block in each data block, obtain parity check S1 code, and this parity check S1 code is placed in the end of each data sub-block as a packet, obtain a new q data block;
Carry out checksum coding between new q data block of steps A 2, acquisition in steps A 1, obtain checksum coding S2, and using this checksum coding S2 as checking data block;
Steps A 3, on the direction of the row of each data block, by information packet all in block, carry out (N, K) RS and encode, wherein, K=a × b;
Steps A 4, through steps A 1 to steps A 3 encode after, be that unit transmits according to packet, packet in each data block is deposited in the buffer of transmitting terminal in order line by line, when having filled a data block in the data buffer of transmitting terminal, is sent to wireless channel;
Be: the data block sent by wireless channel receiving end/sending end, the packet received successively stored in the buffer of receiving terminal, then decode to the processing procedure of data at receiving terminal;
Steps A 5, carry out RS decoding to checking data block, in checking data block, K packet before first detecting, if not there is packet loss, so just all loses redundancy section, a front K packet is stored on the relevant position of data buffer; If a front K data contract out showed packet loss, so just transfer the number checking packet loss in N number of packet, be less than or equal to (N-K)/2 if there is number of dropped packets, K bag before recovering so completely, deposits in data buffer zone after losing (N-K) individual redundancy; If number of dropped packets is greater than (N-K)/2, decode unsuccessfully, lose (N-K) individual redundancy, then K bag before receiving is stored in data buffer zone;
Steps A 6, interblock parity check code S2 to be decoded, each row of data bag before checking successively in q+1 data block, if number of dropped packets is less than or equal to 1, so utilize parity check S2 all data packet recoveries in a front q data block, if number of dropped packets is greater than 1, so just abandon redundancy corresponding with this position in checking data block, after all packets all take part in S2 decoding, whether all packet losses recover in inspection, if all packet losses recover, decoding completes; If all packet losses fail to recover completely, carry out steps A 7 and decode;
Steps A 7, carry out the decoding of parity check S1 successively in each data sub-block, check each data sub-block successively, if number of dropped packets is less than or equal to 1, so utilize parity check S1 that all data sub-block in a front q data block are recovered, if number of dropped packets is greater than 1, so just abandon redundancy corresponding with this position in checking data block;
Steps A 8, successively a front q data block is carried out RS decoding, K packet before first detecting, if not there is packet loss, so just all loses redundancy section, a front K packet is stored on the relevant position of data buffer; If a front K data contract out showed packet loss, so just transfer the number checking packet loss in N number of packet, if number of dropped packets is less than or equal to (N-K)/2, there is data buffer zone after losing (N-K) individual redundancy in K bag before recovering so completely; If number of dropped packets is greater than (N-K)/2, decode unsuccessfully, lose (N-K) individual redundancy, then K packet before receiving is stored in data buffer zone, after completing decoding, (a × b × q) the individual information packet altogether in data buffer zone is sent to user in order.
3., based on the wireless communications method of loss recovery technology of associating ranks check code and RS code, it is characterized in that, its adopts row parity check, and row parity check adds that the method that RS encodes realizes radio communication, and described wireless communications method is:
At transmitting terminal, all data blocks to be sent form a data segment, have q useful information data block in each data segment,
Step B1, the checksum coding S1 carried out according to column direction in each data block, obtain parity check S1 code, and using this parity check S1 code as a packet, obtain a new q data block, to the processing procedure of data be;
Step B2, to a front q data block, carry out respectively longitudinal direction (N, K) RS coding, wherein K=p+1;
Step B3, carry out checksum coding between q the data block obtained in step B1, obtain checksum coding S2, and using this checksum coding S2 as checking data block;
Step B4, through step B1 to step B3 encode after, be that unit transmits according to packet, the packet in each data block is deposited in the buffer of transmitting terminal in order line by line, when having filled a data block in the data buffer of transmitting terminal, be sent to wireless channel
Be: the data block sent by wireless channel receiving end/sending end, the packet received successively stored in the buffer of receiving terminal, then decode to the processing procedure of data at receiving terminal;
Step B5, carry out the decoding of parity check S1 between data block, check all parity code check packets successively, if number of dropped packets is less than or equal to 1, so utilize parity check S1 that all parity code check packets in a front q data block are recovered, if number of dropped packets is greater than 1, so leaps in next data block and still carry out this step; If after step B5 terminates, all packet losses recover, and so decoded data are sent to user;
Step B6, carry out parity check S2 in data block and decode, in each data block, if packet loss is less than or equal to 1, so all in this data block packets, all recover, if number of dropped packets is greater than 1, so just abandon the parity check S2 part in this block, when in data segment, each data block is completed the decoding of S2, whether all packet losses recover in inspection, if all packet losses recover, decoding completes, and decoded data are sent to user; If all packet losses fail to recover completely, then (N-K) individual packet after in each data block is carried out S2 decoding, then carry out step B7 decoding;
Step B7, in a front q data block, carry out RS decoding respectively, if all packet losses are always completely recovered, so decoded, otherwise, carry out step B8;
If step B8 step B7 has date restoring, so just jump to step B6 and re-execute, otherwise declaration decoding terminates, and decoded data are sent to user.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210570185.0A CN103067130B (en) | 2012-12-25 | 2012-12-25 | Wireless communication method for packet-loss recovery and based on union line column check code and record separator (RS) code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210570185.0A CN103067130B (en) | 2012-12-25 | 2012-12-25 | Wireless communication method for packet-loss recovery and based on union line column check code and record separator (RS) code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103067130A CN103067130A (en) | 2013-04-24 |
| CN103067130B true CN103067130B (en) | 2015-05-27 |
Family
ID=48109605
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210570185.0A Expired - Fee Related CN103067130B (en) | 2012-12-25 | 2012-12-25 | Wireless communication method for packet-loss recovery and based on union line column check code and record separator (RS) code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103067130B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111835462B (en) * | 2020-07-06 | 2021-08-31 | 天津大学 | Wireless sensor network packet loss recovery method based on erasure codes |
| CN112860475B (en) * | 2021-02-04 | 2023-02-28 | 山东云海国创云计算装备产业创新中心有限公司 | Method, device, system and medium for recovering check block based on RS erasure code |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1622504A (en) * | 2003-11-26 | 2005-06-01 | 上海贝尔阿尔卡特股份有限公司 | A data packet recovery method |
| CN101512989A (en) * | 2006-07-25 | 2009-08-19 | 汤姆森特许公司 | Recovery of outburst packet lose in wireless network based on Internet protocol using interleaving play and crossover packet forward error correction |
| CN101702640A (en) * | 2009-10-15 | 2010-05-05 | 联想网御科技(北京)有限公司 | Method and device for transmitting data in unidirectional network |
| CN101834700A (en) * | 2010-05-12 | 2010-09-15 | 北京邮电大学 | Unidirectional reliable transmission method and transceiving device based on data packets |
-
2012
- 2012-12-25 CN CN201210570185.0A patent/CN103067130B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1622504A (en) * | 2003-11-26 | 2005-06-01 | 上海贝尔阿尔卡特股份有限公司 | A data packet recovery method |
| CN101512989A (en) * | 2006-07-25 | 2009-08-19 | 汤姆森特许公司 | Recovery of outburst packet lose in wireless network based on Internet protocol using interleaving play and crossover packet forward error correction |
| CN101702640A (en) * | 2009-10-15 | 2010-05-05 | 联想网御科技(北京)有限公司 | Method and device for transmitting data in unidirectional network |
| CN101834700A (en) * | 2010-05-12 | 2010-09-15 | 北京邮电大学 | Unidirectional reliable transmission method and transceiving device based on data packets |
Non-Patent Citations (1)
| Title |
|---|
| IEEE802.16d/e信道编译码算法研究与DSP实现;方芳;《中国优秀硕士学位论文全文数据库》;20060201;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103067130A (en) | 2013-04-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7095729B2 (en) | Method for multimedia communication over packet channels | |
| CN101359981B (en) | Method, apparatus and system for data packet redundant encoding and decoding | |
| CN110943800B (en) | Data packet sending method, device and system, storage medium and electronic device | |
| CN102694636B (en) | Adopt sending, receiving method and the system of the HARQ technology of fountain codes | |
| CN101800757B (en) | No-feedback one-way data transmission method based on single fiber structure | |
| EP1964340B1 (en) | Network processing node and method for manipulating packets | |
| CN101562512B (en) | FEC-based selective retransmission system and retransmission method thereof | |
| JP2012114929A (en) | File download and streaming system | |
| CN102164026A (en) | Fountain code compiling method based on deep space communication environment | |
| CN102984232B (en) | Real-time flow-medium transmission method in multihop network | |
| WO2010139265A1 (en) | Method, device and communication system for retransmitting based on forward error correction | |
| CN104539387B (en) | A kind of hop-by-hop transmitting control method of water sound sensor network | |
| KR20000074685A (en) | method for adaptive hybrid ARQ using a concatenated FEC | |
| CN101090306A (en) | Code and decode multiple method in service channel | |
| CN103152652B (en) | A kind of video requency frame data network transfer method of encoding based on Cauchy RS | |
| CN103716134B (en) | The coding method of cumulative fountain codes is spent under feedback condition | |
| KR102002939B1 (en) | On-demand file recovery methods and systems | |
| CN104852788A (en) | Data broadcast ARQ method based on maximum-minimum network encoding | |
| CN102752184A (en) | Data communication system for real-time multicast service and method thereof | |
| CN103067130B (en) | Wireless communication method for packet-loss recovery and based on union line column check code and record separator (RS) code | |
| CN101552661A (en) | Method for error control | |
| CN107005349B (en) | A kind of data processing method, base station and terminal device | |
| CN113438055B (en) | Convolutional network coding transmission method based on unequal redundancy insertion | |
| CN107257244A (en) | A kind of fountain code encoding method based under broadcast environment | |
| Gu et al. | RCLTP: A rateless coding-based Licklider transmission protocol in space delay/disrupt tolerant network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150527 Termination date: 20161225 |