Method and device for bandwidth self-adapting data ranking protection

TECHNICAL FIELD

The present disclosure relates to the data ranking protection technology, and in particular to a method and a device for bandwidth self-adapting data ranking protection in a system having a fixed bandwidth and adopting a one-way communication technology.

BACKGROUND

The problems of large data capacity, code stream fluctuation, error codes and packet loss must be settled when real-time data are transmitted over a wireless channel with a fixed bandwidth. A traditional method solves the problems of large data capacity and code stream fluctuation by reserving certain bandwidth for the code stream to be transmitted, selects a suitable error correction code protection algorithm to protect the transmitted data, and solves the problems of error code and packet loss by adopting a retransmission technology and the like. However, the retransmission approach will become helpless in an environment with a strict demand on time delay and a limitation in retransmission, particularly in a one-way communication environment, for example, broadcast communication. Although the error correction code protection algorithm may improve the reliability of data transmission, it cannot completely and effectively solve the problem of error code; in particular, for some important data, once error code occurs, it will cause error spread and cause the whole transmitted data unable to be decoded.

SUMMARY

In view of the above, a main objective of the present disclosure is to provide a method and a device for bandwidth self-adapting data ranking protection, which can guarantee the reliability of the transmission and decoding of important data.

In order to achieve the objective, the technical solution of the present disclosure is implemented as follows.

A method for bandwidth self-adapting data ranking protection comprises:

performing redundancy protection computation on a data block to be transmitted so as to generate a redundant code of the data block, and setting a priority for the redundant code; and

determining whether bandwidth occupied by a redundant code with a highest priority is greater than current residual bandwidth; if the bandwidth occupied by the redundant code with the highest priority is not greater than the current residual bandwidth, carrying the redundant code with the highest priority in the current residual bandwidth; otherwise, according to a descending order of the priority, searching in residual redundant codes for a redundant code whose data amount is less than or equal to the current residual bandwidth, and carrying a found redundant code in the current residual bandwidth.

Preferably, the method may further comprise: after carrying the redundant code in the current residual bandwidth, when it is determined that there still exists residual bandwidth, searching in the residual codes for a redundant code that can be carried in the residual bandwidth according to the descending order of the priority; when it is determined that, in the residual redundant codes, there does not exist a redundant code that can be carried in the residual bandwidth, terminating the process.

Preferably, when there are two or more redundant codes with the highest priority, and their respective data amount is less than or equal to the current residual bandwidth, any one of the redundant codes may be selected to be carried in the current residual bandwidth.

Preferably, the method may further comprise:

setting a priority for the data block to be transmitted, wherein the priority of the redundant code is same as that of the data block corresponding to the redundant code.

The present disclosure further provides a device for bandwidth self-adapting data ranking protection, comprising: a redundant code generating unit, a first setting unit, a searching unit and a carrying and transmitting unit, wherein

the redundant code generating unit is configured to perform redundancy protection computation on a data block to be transmitted so as to generate a redundant code of the data block;

the first setting unit is configured to set a priority for the redundant code generated by the redundant code generating unit;

the first determining unit is configured to determine whether bandwidth occupied by data amount of a redundant code with a highest priority is greater than current residual bandwidth; if the bandwidth occupied by the redundant code with the highest priority is not greater than the current residual bandwidth, trigger the carrying and transmitting unit; otherwise, trigger the searching unit;

the searching unit is configured to search, in residual redundant codes, for a redundant code whose data amount is less than or equal to the current residual bandwidth according to a descending order of the priority, and trigger the carrying and transmitting unit; and

the carrying and transmitting unit is configured to carry the redundant code with the highest priority whose data amount is less than or equal to the current residual bandwidth in the current residual bandwidth for transmission.

Preferably, the device may further comprise:

a second determining unit, configured to trigger the first determining unit when determining that there still exists residual bandwidth after the carrying and transmitting unit carries the redundant code in the current residual bandwidth.

Preferably, when there are two or more redundant codes with the highest priority and their respective data amount is less than or equal to the current residual bandwidth, the carrying and transmitting unit may select any one of the redundant codes and make the selected one carried in the current residual bandwidth.

Preferably, the device may further comprise:

a second setting unit, configured to set a priority for the data block to be transmitted, wherein the priority of the redundant code is same as that of the data block corresponding to the redundant code.

In the present disclosure, redundancy protection computation is performed on important data blocks; and the redundant code with the highest priority is carried in the current residual bandwidth according to the condition of the current residual bandwidth. According to the present disclosure, redundancy data of important data blocks can be transmitted by effectively utilizing the residual bandwidth in the bandwidth source, such that the reliability of transmission of important data is improved significantly, and the error tolerance of a system is improved as well.

BRIEF DESCRIPTION OF THE DRAWINGS

<figref idrefs="DRAWINGS">FIG. 1</figref> shows a flowchart of a method for bandwidth self-adapting data ranking protection according to the present disclosure; and

<figref idrefs="DRAWINGS">FIG. 2</figref> shows an organizational structure diagram of a device for bandwidth self-adapting data ranking protection according to the present disclosure.

DETAILED DESCRIPTION

The basic idea of the present disclosure is to perform redundancy protection computation on important data blocks, select a redundant code with the highest priority and make the selected one carried in a current residual bandwidth according to the condition of the current residual bandwidth. According to the present disclosure, redundancy data of important data blocks can be transmitted by effectively utilizing the residual bandwidth in the bandwidth source, such that the reliability of transmission of important data is improved significantly, and the error tolerance of a system is improved as well. The solution of the present disclosure is practical and easy to implement.

In order to make the objective, technical solutions and advantages of the present disclosure more elucidated, the present disclosure will be further described in detail through the embodiments with reference to the accompanying drawings.

<figref idrefs="DRAWINGS">FIG. 1</figref> shows a flowchart of a method for bandwidth self-adapting data ranking protection. As shown in <figref idrefs="DRAWINGS">FIG. 1</figref>, the method for bandwidth self-adapting data ranking protection according to the present disclosure comprises the following steps:

Step <b>101</b>, data blocks to be transmitted are ranked according to their importance. Here, the data blocks in a multiplexing frame of a China Mobile Multimedia Broadcasting (CMMB) broadcast frame is taken as the example. The data blocks in the multiplexing frame of the CMMB broadcast frame are ranked according to the importance of the data. Here, the multiplexing frame header and the multiplexing sub-frame header are granted a higher priority 0; the video and audio data blocks are granted a normal priority 1; the video and audio enhanced data blocks are granted a lower priority 2, wherein the video and audio enhanced data blocks are supervise code elements generated after the video and audio data blocks are subjected to the Forward Error Correction (FEC) process, and the supervise code elements are the data for performing the FEC on the video and audio data blocks.

Step <b>102</b>, the respective redundant codes of data blocks to be transmitted are computed, and the priorities of the redundant codes are determined;

redundant codes of the multiplexing frame and the multiplexing sub-frame header are computed and are granted a higher priority 0; redundant codes of the video and audio data blocks are computed and are granted a normal priority 1; redundant codes of the video and audio enhanced data blocks are computed and are granted a lower priority 2. In other words, redundancy protection computation is performed on each data block of each priority so as to compute the redundant code of each data block.

Step <b>103</b>, a current residual bandwidth of a channel is computed according to transmission bandwidth and the size of data blocks to be transmitted:

The idle bandwidth of the transmission channel is computed according to the size of the data of the data blocks to be transmitted currently and the bandwidth of the transmission channel. In other words, it is determined whether there is residual bandwidth after the transmission channel carries the data blocks to be transmitted currently; if yes, Step <b>104</b> is executed; otherwise, the process is terminated.

Step <b>104</b>, it is determined whether data amount of the redundant code with the highest priority is greater than the current residual bandwidth of the channel. The determination of whether the data amount of the redundant code with the highest priority being less than or equal to the residual bandwidth of the transmission channel means that: determining whether the redundant code with the highest priority can be carried in the transmission channel. If the data amount of the redundant code with the highest priority is less than or equal to the residual bandwidth of the transmission channel, Step <b>106</b> is executed; otherwise, Step <b>105</b> is executed. Generally speaking, for important data, the redundant codes thereof are computed, while for unimportant data, the redundant codes thereof are not computed. If there are important data blocks to be transmitted currently, there exist redundant codes. In the present disclosure, the transmission of the redundant code is performed only when there is residual bandwidth in the transmission channel. This means that not all the redundant codes of the data blocks can be transmitted, in this case, the transmission of the redundancy code of the data block with the highest priority is considered preferably.

Step <b>105</b>, the redundant code with the second highest priority whose data amount is less than or equal to the current residual bandwidth of the channel is searched out. When the redundant code of the data block with the highest priority cannot be carried by the residual bandwidth of the transmission channel, the redundant code with the second highest priority which can be carried in the residual bandwidth of the transmission channel is searched for in the residual redundant codes. If there is an eligible redundant code in the residual redundant codes, Step <b>106</b> is executed; otherwise, the process is terminated.

Step <b>106</b>, the redundant code is carried in the channel, and the current residual bandwidth of the channel is re-computed. The redundant code with the highest priority as determined in Step <b>104</b> is carried in the transmission channel for transmission; or the redundant code with the second highest priority whose data amount is less than or equal to the current residual bandwidth of the transmission channel as determined in Step <b>105</b> is carried in the transmission channel for transmission. Furthermore, the current residual bandwidth of the transmission channel is computed again; if there still exists residual bandwidth, back to Step <b>104</b> to determine whether there is enough residual bandwidth for carrying the current residual redundant code. The entire process is terminated until it is determined that no redundant code in the residual redundant codes can be carried in the residual bandwidth of the transmission channel.

In the present disclosure, when it is determined that redundant codes with the same priority can be carried in the residual bandwidth of the transmission channel, any one of the redundant codes is selected to be carried in the transmission channel, then the residual bandwidth of the transmission channel is computed again; if there still exists residual bandwidth, the selection of the redundant code is continued according to the way of Step <b>104</b>.

Generally speaking, the priority of the data block is the same as that of the corresponding redundant code.

Taking the multiplexing data in the CMMB broadcast frame as an example. First, it is determined whether the length of the redundant code with the priority being 0 is greater than the idle bandwidth; if the length of the redundant code with the priority being 0 is less than or equal to the residual bandwidth of the transmission channel, the redundant code with the priority being 0 is placed into the transmission channel, and the residual bandwidth of the transmission channel is re-computed. Otherwise, Step <b>105</b> is performed to determine whether the length of the redundant code with the priority being 1 is greater than the residual bandwidth of the transmission channel; if the length of the redundant code with the priority being 1 is less than or equal to the residual bandwidth of the transmission channel, the redundant code with the priority being 1 is placed in the transmission channel, and the residual bandwidth of the transmission channel is re-computed. If the redundant code with the priority being 1 is greater than the residual bandwidth of the transmission channel, then it is determined whether the length of the redundant code with the priority being 2 is greater than the residual bandwidth of the transmission channel, until a redundant code whose length is found to be less than or equal to the residual bandwidth of the transmission channel. The process is terminated when no eligible redundant code can be found.

In the present disclosure, the bandwidth for carrying the redundant code generally belongs to the residual bandwidth; the receiving end can monitor the redundant code by receiving the corresponding residual bandwidth, and the receiving end also sets the information about the relationship between a redundant code and a data block, such that the receiving end can determine, when receiving a redundant code, to which data block the redundant code corresponds. Since the details of transmission are not the focus of the present disclosure, it will not be detailed here.

The present disclosure can improve the anti-error-code and anti-packet-loss functions of important data and improve the user experience.

<figref idrefs="DRAWINGS">FIG. 2</figref> shows an organizational structure diagram of a device for bandwidth self-adapting data ranking protection according to the present disclosure. As shown in <figref idrefs="DRAWINGS">FIG. 2</figref>, the device for bandwidth self-adapting data ranking protection according to the present disclosure comprises a redundant code generating unit <b>20</b>, a first setting unit <b>21</b>, a first determining unit <b>22</b>, a searching unit <b>26</b> and a carrying and transmitting unit <b>23</b>, wherein the redundant code generating unit <b>20</b> is configured to perform redundancy protection computation on a data block to be transmitted so as to generate a redundant code of the data block; the first setting unit <b>21</b> is configured to set a priority for the redundant code generated by the redundant code generating unit <b>20</b>; the first determining unit <b>22</b> is configured to determine whether bandwidth occupied by data amount of a redundant code with a highest priority is greater than current residual bandwidth; if the bandwidth occupied by the redundant code with the highest priority is not greater than the current residual bandwidth, trigger the carrying and transmitting unit <b>23</b>; otherwise, trigger the searching unit <b>26</b>; the searching unit <b>26</b> is configured to search, in residual redundant codes, for a redundant code whose data amount is less than or equal to the current residual bandwidth according to a descending order of the priority, and trigger the carrying and transmitting unit <b>23</b>; and the carrying and transmitting unit <b>23</b> is configured to carry the redundant code with the highest priority whose data amount is less than or equal to the current residual bandwidth in the current residual bandwidth for transmission. When there are two or more redundant codes with the highest priority and their respective data amount is less than or equal to the current residual bandwidth, the carrying and transmitting unit <b>23</b> selects any one of the redundant codes and makes the selected one carried in the current residual bandwidth.

As shown in <figref idrefs="DRAWINGS">FIG. 2</figref>, the device for bandwidth self-adapting data ranking protection according to the present disclosure further comprises a second determining unit <b>25</b>, for configured to trigger the first determining unit <b>22</b> when determining that there still exists residual bandwidth after the carrying and transmitting unit <b>23</b> carries the redundant code in the current residual bandwidth.

As shown in <figref idrefs="DRAWINGS">FIG. 2</figref>, the device for bandwidth self-adapting data ranking protection according to the present disclosure further comprises a second setting unit <b>24</b>, configured to set a priority for the data block to be transmitted, wherein the priority of the redundant code is same as that of the data block corresponding to the redundant code.

Those skilled in the art should appreciate that the second setting unit <b>24</b> and the second determining unit <b>25</b> are not essential technical features for implementing the device for bandwidth self-adapting data ranking protection shown in <figref idrefs="DRAWINGS">FIG. 2</figref>, which are only the optimized technical features.

Those skilled in the art should appreciate that the functions performed by respective processing units in the device for bandwidth self-adapting data ranking protection shown in <figref idrefs="DRAWINGS">FIG. 2</figref> can be understood by referring to the relevant description in <figref idrefs="DRAWINGS">FIG. 1</figref>. The functions of respective processing units in the device for bandwidth self-adapting data ranking protection shown in <figref idrefs="DRAWINGS">FIG. 2</figref> can be implemented through programs running on a processor or can be implemented through a specific logic circuit.

The above is only preferred embodiments of the present disclosure and not intended to limit the scope of protection of the present disclosure.