WO2011000247A1 - 带宽自适应数据分级保护方法与装置 - Google Patents

带宽自适应数据分级保护方法与装置 Download PDF

Info

Publication number
WO2011000247A1
WO2011000247A1 PCT/CN2010/073313 CN2010073313W WO2011000247A1 WO 2011000247 A1 WO2011000247 A1 WO 2011000247A1 CN 2010073313 W CN2010073313 W CN 2010073313W WO 2011000247 A1 WO2011000247 A1 WO 2011000247A1
Authority
WO
WIPO (PCT)
Prior art keywords
priority
bandwidth
code
remaining bandwidth
current
Prior art date
Application number
PCT/CN2010/073313
Other languages
English (en)
French (fr)
Inventor
陈光亮
童登金
张建强
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Priority to JP2012518740A priority Critical patent/JP5324704B2/ja
Priority to US13/381,907 priority patent/US8788902B2/en
Publication of WO2011000247A1 publication Critical patent/WO2011000247A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/35—Unequal or adaptive error protection, e.g. by providing a different level of protection according to significance of source information or by adapting the coding according to the change of transmission channel characteristics
    • H03M13/353—Adaptation to the channel
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/007—Unequal error protection

Definitions

  • the present invention relates to data hierarchical protection techniques, and more particularly to a bandwidth adaptive data hierarchical protection method and apparatus in a system with fixed bandwidth and using one-way communication technology.
  • the main object of the present invention is to provide a bandwidth adaptive data hierarchical protection method and apparatus, which can ensure the reliability of transmission and decoding of important data.
  • a bandwidth adaptive data hierarchical protection method includes:
  • the redundancy code with the highest current priority is carried in the current remaining bandwidth. If the priority is higher than the current remaining bandwidth, the redundant code is searched for the redundant code whose data amount is less than or equal to the current remaining bandwidth, and the found redundant code is carried in the current remaining bandwidth. in.
  • the method further includes: after the redundant code is carried in the current remaining bandwidth, determining whether there is still remaining bandwidth, and if it continues to find whether there is a bearable redundant code in the remaining redundant code, determine When there is no redundant code carried in the remaining bandwidth in the remaining redundant code, the flow ends.
  • the method further includes: when the current redundancy code having the highest priority is two or more, and the data amount is less than or equal to the current remaining bandwidth, optionally one is carried in the current remaining bandwidth.
  • the method further includes:
  • a bandwidth adaptive data hierarchical protection device comprising:
  • a redundancy code generating unit configured to perform redundancy protection calculation on the data block to be transmitted, and generate a redundancy code of the data block
  • a first setting unit configured to set a priority for the redundant code generated by the redundant code generating unit; the first determining unit, configured to determine whether a bandwidth occupied by a data amount of the current highest priority redundant code is greater than a current remaining The bandwidth is not greater than the current remaining bandwidth, and the bearer and the transmission unit are triggered. When the bandwidth is greater than the current remaining bandwidth, the search unit is triggered.
  • a searching unit configured to search, in a sequence of priorities from high to low, whether there is a redundant code whose data amount is less than or equal to a current remaining bandwidth, triggering a bearer and a transmission unit;
  • the bearer and transmission unit is configured to carry the redundant code with the highest current priority and the data volume less than or equal to the current remaining bandwidth in the current remaining bandwidth and transmit.
  • the device further includes:
  • the second determining unit is configured to determine, after the bearer and the transmission unit carries the redundant code in the current remaining bandwidth, whether there is any remaining bandwidth, and sometimes trigger the first determining unit.
  • one of the bearer and transmission units is carried in the current remaining bandwidth.
  • the device further includes:
  • a second setting unit configured to set a priority for the data block to be transmitted, where the priority of the redundant code is the same as the priority of the corresponding data block of the redundant code.
  • redundancy protection calculation is performed on important data blocks, and according to the current remaining bandwidth, the redundancy code with the highest current priority is selected to be carried in the current remaining bandwidth.
  • the invention effectively utilizes the remaining bandwidth in the bandwidth resource to transmit redundant data of important data blocks, so that the transmission reliability of the important data is greatly improved, and the fault tolerance of the system is improved.
  • FIG. 1 is a flowchart of a bandwidth adaptive data hierarchical protection method according to the present invention
  • FIG. 2 is a schematic structural diagram of a bandwidth adaptive data hierarchical protection device according to the present invention. detailed description
  • the basic idea of the present invention is: performing redundancy protection calculation on important data blocks, and selecting the redundancy code with the highest current priority to be carried in the current remaining bandwidth according to the current remaining bandwidth.
  • the invention effectively utilizes the remaining bandwidth in the bandwidth resource to transmit redundant data of important data blocks, thereby greatly improving the transmission reliability of important data and improving the fault tolerance of the system.
  • the solution of the present invention is simple and practical.
  • the bandwidth adaptive data hierarchical protection method of the present invention includes the following steps: Step 101: Classify the transport data block according to the importance.
  • the present invention is described by taking a data block in a multiplex frame of a broadcast frame of a China Mobile Multimedia Broadcasting (CMMB) as an example.
  • the data blocks in the multiplex frame of the CMMB broadcast frame are ranked according to the importance of the data.
  • the multiplexed frame header and the multiplexed subframe header give a higher priority of 0, the video and audio data blocks are given a general priority of 1, and the video and audio enhanced data blocks are given a lower priority.
  • the video and audio enhancement data block is a supervised symbol generated by performing forward error correction (FEC) encoding processing on video and audio data blocks, and the supervised symbol is used for video and audio data blocks. Perform data for forward error correction.
  • FEC forward error correction
  • Step 102 Calculate redundant codes of each data block to be transmitted separately, and determine a priority of the redundant code.
  • Step 103 Calculate the current remaining bandwidth of the channel according to the size of the transport data block and the transmission bandwidth. Calculating the idle bandwidth of the transport channel according to the size of the current data volume to be transmitted and the bandwidth of the transport channel, that is, determining whether the current transport channel carries the remaining bandwidth after the current data block to be transmitted, and if yes, performing step 104, otherwise , the process ends.
  • Step 104 Determine whether the amount of redundant code data with the highest priority is greater than the current remaining bandwidth of the channel. Determining whether the data amount of the current highest priority redundancy code is less than or equal to the remaining bandwidth of the transmission channel, that is, determining whether the current highest priority redundancy code can be carried by the transmission channel, if the current highest priority redundancy code data amount d. After equal to the remaining bandwidth of the transport channel, step 106 is performed, otherwise step 105 is performed. In general, important data is calculated by its redundant code, while non-important data is not calculated. If there is an important data block to be transmitted, there must be a redundant code. In the present invention, the redundant code only The transmission is performed when the transmission channel has remaining bandwidth. This is This means that not all redundant codes of data blocks can be transmitted, in which case it is preferred to ensure that the redundant code of the highest priority data block is transmitted.
  • Step 105 Find a redundant code whose current priority is the highest and the amount of data is less than or equal to the current remaining bandwidth of the channel.
  • the redundant code of the highest priority data block cannot be carried by the remaining bandwidth of the transmission channel, the redundant code that can be carried in the remaining bandwidth of the transmission channel and has the highest priority is found in the remaining redundant code, if remaining If there is a redundant code that satisfies the condition in the redundant code, step 106 is performed; otherwise, the process ends.
  • Step 106 Carry the redundant code on the channel, and recalculate the current remaining bandwidth of the channel.
  • the redundant code with the highest priority determined by step 104 is carried in the transport channel and transmitted; or, the priority determined in the remaining redundant code in step 105 is the highest and the data amount is less than or equal to the current remaining bandwidth of the transport channel.
  • the redundant code is carried in the transmission channel and transmitted; meanwhile, the bandwidth remaining in the transmission channel is continuously calculated, and if there is remaining bandwidth, the process returns to step 104 to continue to calculate whether the remaining redundant code can be carried, until the remaining redundancy is determined. When there is no remaining bandwidth in the residual code that can be carried in the remaining channel, the entire process ends.
  • the redundancy codes of the same priority when it is determined that the redundancy codes of the same priority can be carried in the remaining bandwidth of the transmission channel, one of the optional ones is carried in the transmission channel, and the current remaining bandwidth of the transmission channel is calculated, and the remaining bandwidth is continued.
  • the redundant code selection may be performed in the manner of the foregoing step 104.
  • the priority of a data block is the same as the priority of its corresponding redundant code.
  • step 105 is performed to determine whether the length of the priority redundancy code is greater than the remaining bandwidth of the transmission channel. If the length of the priority redundancy code is less than or equal to the remaining bandwidth of the transmission channel, the priority redundancy code is placed in the transmission channel, Calculate the remaining bandwidth of the transmission channel.
  • the length of the 1 priority redundancy code is greater than the remaining bandwidth of the transmission channel, it is determined whether the length of the 2 priority redundancy code is greater than the transmission signal.
  • the remaining bandwidth of the channel is not until the redundant code whose length of the redundant code is less than or equal to the remaining bandwidth of the transmission channel is found, and the process ends when the redundant code that meets the condition is not found.
  • the bandwidth of the bearer redundant code is generally in the remaining bandwidth, and the receiving end receives the corresponding remaining bandwidth to monitor the redundant code, and also sets the information of the correspondence between the redundant code and the data block, so that the receiving end When the redundant code is received, it can be determined which redundancy code of the data block, and the specific details of the transmission are not the focus of the present invention, and will not be described again.
  • the bandwidth adaptive data hierarchical protection device of the present invention includes a redundancy code generating unit 20, a first setting unit 21, and a first determining unit. 22.
  • the first setting unit 21 is configured to: Setting a priority for the redundancy code generated by the redundancy code generating unit 20; the first determining unit 22 is configured to determine whether the bandwidth occupied by the data amount of the current highest priority redundancy code is greater than the current remaining bandwidth, and trigger the bearer and transmission at the time.
  • the unit 23 triggers the search unit 26; the search unit 26 is configured to search, in the order of priority from high to low, whether there is a redundant code whose data amount is less than or equal to the current remaining bandwidth, triggering bearer and
  • the transmission unit 23; the bearer and transmission unit 23 is configured to use the redundancy code with the highest current priority and the data amount being less than or equal to the current remaining bandwidth. Contained in the current residual bandwidth and transmitted.
  • the bearer and transmission unit 23 is optionally carried in the current remaining bandwidth.
  • the bandwidth adaptive data classification protection apparatus of the present invention further includes a second determining unit 25, configured to determine whether there is still remaining bandwidth after the bearer and transmission unit 23 carries the redundant code in the current remaining bandwidth.
  • the first judging unit 22 is sometimes triggered.
  • the bandwidth adaptive data hierarchical protection apparatus of the present invention further includes a second setting unit 24, configured to set a priority for the data block to be transmitted, and a priority and a location of the redundant code.
  • the redundant code corresponding data blocks have the same priority.
  • the second setting unit 24 and the second determining unit 25 are not necessary technical features of the bandwidth adaptive data hierarchical protection device shown in FIG. 2, but only their optimization technical features.
  • the implementation functions of the processing units in the bandwidth adaptive data hierarchical protection apparatus shown in FIG. 2 can be understood by referring to the related description in FIG. 1 described above.
  • the functions of the processing units in the bandwidth adaptive data hierarchical protection device shown in Fig. 2 can be realized by a program running on the processor, or can be realized by a specific logic circuit.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Multimedia (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Error Detection And Correction (AREA)

Description

带宽自适应数据分级保护方法与装置 技术领域
本发明涉及数据分级保护技术， 尤其涉及固定带宽且采用单向通信技 术的***中的带宽自适应数据分级保护方法与装置。 背景技术
在固定带宽的无线信道上传输实时数据时， 必须解决数据量大、 码流 波动、 误码、 丟包等问题。 传统的方法是给传送的码流预留一定的带宽来 解决数据量大和码流波动的问题， 选择一种合适的纠错编码保护算法对传 输的数据进行保护， 以及采用重传技术等来解决误码和丟包的问题。 但是， 在时延要求严格， 重传受限的环境， 特别是单向通信的环境， 如广播通信， 重传的方法就无能为力了。 纠错编码保护算法虽然能提高数据传输的可靠 性， 并不能完全有效解决误码问题， 特别是对于一些重要的数据而言， 一 旦出现误码， 将会导致错误扩散， 导致整个传输数据不能解码。 发明内容
有鉴于此， 本发明的主要目的在于提供一种带宽自适应数据分级保护 方法与装置， 能保证重要数据的传输及译码的可靠性。
为达到上述目的， 本发明的技术方案是这样实现的：
一种带宽自适应数据分级保护方法， 包括：
对待传输的数据块进行冗余保护计算， 生成所述数据块的冗余码， 为 所述冗余码设置优先级； 以及
判断当前优先级最高的冗余码所占用带宽是否大于当前剩余带宽， 不 大于当前剩余带宽时将当前优先级最高的冗余码承载于当前剩余带宽中， 大于当前剩余带宽时按优先级由高到低的顺序， 在剩余冗余码中查找是否 存在数据量小于或等于当前剩余带宽的冗余码， 并将查找到的冗余码承载 于当前剩余带宽中。
优选地， 所述方法还包括： 将冗余码承载于当前剩余带宽中后， 判断 当前是否还有剩余带宽， 若有时继续在剩余冗余码中查找是否有可承载的 冗余码， 确定所述剩余冗余码中不存在承载于剩余带宽的冗余码时， 结束 流程。
优选地， 所述方法还包括： 当前优先级最高的冗余码为两个以上， 且 其数据量均小于等于当前剩余带宽时， 任选一个承载于当前剩余带宽中。
优选地， 所述方法还包括：
为所述待传输的数据块设置优先级， 所述冗余码的优先级与所述冗余 码对应数据块的优先级相同。
一种带宽自适应数据分级保护装置， 包括：
冗余码生成单元， 用于对待传输的数据块进行冗余保护计算， 生成所 述数据块的冗余码；
第一设置单元， 用于为所述冗余码生成单元生成的冗余码设置优先级； 第一判断单元， 用于判断当前优先级最高的冗余码的数据量所占用带 宽是否大于当前剩余带宽， 不大于当前剩余带宽时触发承载及传输单元， 大于当前剩余带宽时触发查找单元；
查找单元， 用于按优先级由高到低的顺序， 在剩余冗余码中查找是否 存在数据量小于或等于当前剩余带宽的冗余码， 触发承载及传输单元； 以 及
承载及传输单元， 用于将当前优先级最高且数据量小于或等于当前剩 余带宽的冗余码承载于当前剩余带宽中并传输。
优选地， 所述装置还包括： 第二判断单元， 用于在所述承载及传输单元将冗余码承载于当前剩余 带宽中后， 判断当前是否还有剩余带宽， 有时触发所述第一判断单元。
优选地， 当前优先级最高的冗余码为两个以上， 且其数据量均小于等 于当前剩余带宽时， 承载及传输单元任选一个承载于当前剩余带宽中。
优选地， 所述装置还包括：
第二设置单元， 用于为所述待传输的数据块设置优先级， 所述冗余码 的优先级与所述冗余码对应数据块的优先级相同。
本发明中， 对重要数据块进行冗余保护计算， 并根据当前剩余带宽的 情况， 选择当前优先级最高的冗余码承载在当前剩余带宽中。 本发明有效 利用带宽资源中的剩余带宽来传输重要数据块的冗余数据， 使得重要数据 的传输可靠性大大提高， 提升了***的容错性。 附图说明
图 1为本发明带宽自适应数据分级保护方法的流程图；
图 2为本发明带宽自适应数据分级保护装置的组成结构示意图。 具体实施方式
本发明的基本思想是： 对重要数据块进行冗余保护计算， 并根据当前 剩余带宽的情况， 选择当前优先级最高的冗余码承载在当前剩余带宽中。 本发明有效利用带宽资源中的剩余带宽来传输重要数据块的冗余数据， 使 得重要数据的传输可靠性大大提高， 提升了***的容错性。 本发明方案实 现简单且实用。
为使本发明的目的、 技术方案和优点更加清楚明白， 以下举实施例并 参照附图， 对本发明进一步详细说明。
图 1为本发明带宽自适应数据分级保护方法的流程图， 如图 1所示， 本发明带宽自适应数据分级保护方法包括以下步驟： 步驟 101 : 根据重要性对待传输数据块进行分级。本发明以***多 媒体广播（CMMB, China Mobile Multimedia Broadcasting )广播帧的复用 帧中的数据块为例进行说明。根据数据的重要性对 CMMB广播帧的复用帧 中的数据块进行分级。 其中， 复用帧头和复用子帧头给予较高优先级 0, 视 频和音频数据块给予一般优先级 1，视频和音频增强数据块给予较低优先级
2。 其中的视频和音频增强数据块是对视频和音频数据块进行前向纠错 ( FEC, Forward Error Correction )编码处理后所生成的监督码元， 该监督 码元是用于对视频和音频数据块进行前向纠错用的数据。
步驟 102: 分别计算各个待传输数据块的冗余码， 并确定所述冗余码的 优先级。
计算复用帧和复用子帧头的冗余码，给予该冗余码较高优先级 0, 计算 视频和音频数据块的冗余码， 给予该冗余码一般优先级 1 , 计算视频和音频 增强数据块的冗余码， 给予该冗余码较低优先级 2。 即对各优先级的各数据 块进行冗余保护计算， 计算出各数据块的冗余码。
步驟 103 : 根据传输数据块的大小及传输带宽计算信道当前剩余带宽。 根据当前待传输数据块数据量的大小以及传输信道的带宽计算所述传 输信道的空闲带宽， 即确定当前传输信道承载当前待传输数据块后是否存 在剩余带宽， 如果存在， 将执行步驟 104, 否则， 流程结束。
步驟 104:判断当前优先级最高的冗余码数据量是否大于信道当前剩余 带宽。 判断当前优先级最高的冗余码的数据量是否小于等于传输信道的剩 余带宽， 即判断当前优先级最高的冗余码是否能被传输信道承载， 如果当 前优先级最高的冗余码的数据量 d、于等于传输信道的剩余带宽， 则执行步 驟 106, 否则执行步驟 105。 一般而言， 重要数据均计算出其冗余码， 而非 重要数据则不计算其冗余码， 如果当前有重要数据块欲传输， 则一定存在 冗余码， 本发明中， 冗余码仅在传输信道有剩余带宽时才进行传输。 这就 意味着并不是所有数据块的冗余码均能被传输， 在这种情况下， 将优选保 证优先级最高的数据块的冗余码得到传输。
步驟 105:查找出当前优先级最高且数据量小于或等于信道当前剩余带 宽的冗余码。 在优先级最高的数据块的冗余码不能被传输信道剩余的带宽 承载时， 将在剩余冗余码中查找出能承载于传输信道剩余的带宽中且优先 级最高的冗余码， 如果剩余冗余码中存在满足条件的冗余码， 则执行步驟 106, 否则， 流程结束。
步驟 106: 将冗余码承载于信道， 重新计算信道当前剩余带宽。 将步驟 104所确定出的优先级最高的冗余码承载于传输信道中并传输； 或者，将步 驟 105 中在剩余冗余码中所确定的优先级最高且数据量小于等于传输信道 当前剩余带宽的冗余码承载于传输信道中并传输； 同时， 继续计算传输信 道当前所剩余的带宽， 如果存在剩余带宽， 则返回步驟 104, 继续计算是否 有剩余的冗余码可以承载， 直到确定剩余冗余码中不存在能承载在传输信 道的剩余带宽中时， 整个流程结束。
本发明中， 当确定同一优先级的冗余码均能承载于传输信道的剩余带 宽中时， 任选其中一个承载于传输信道中， 并计算传输信道当前的剩余带 宽， 存在剩余带宽时继续按前述步驟 104的方式进行冗余码选择即可。
一般而言， 数据块的优先级与其对应的冗余码的优先级相同。
以前述 CMMB广播帧中的复用数据为例， 首先判断 0优先级冗余码长 度是否大于空闲带宽， 如果 0优先级冗余码长度小于或者等于传输信道剩 余带宽， 将 0优先级冗余码放入传输信道， 重新计算传输信道的剩余带宽。 否则，执行步驟 105 ,判断 1优先级冗余码长度是否大于传输信道剩余带宽， 如果 1优先级冗余码长度小于或者等于传输信道剩余带宽， 将 1优先级冗 余码放入传输信道， 重新计算传输信道剩余带宽。 如果 1 优先级冗余码长 度大于传输信道剩余带宽， 则确定 2优先级冗余码的长度是否大于传输信 道剩余带宽， 直到查找出冗余码的长度小于或者等于传输信道剩余带宽的 冗余码， 查找不出符合条件的冗余码时流程结束。
本发明中， 承载冗余码的带宽一般在剩余带宽中， 接收端接收对应的 剩余带宽即可监听出冗余码， 还设置冗余码与数据块的对应关系的信息， 以使接收端在接收到冗余码时能确定出是哪个数据块的冗余码， 传输的具 体细节不是本发明的重点， 不再赘述。
本发明能够提高重要数据抗误码抗丟包功能， 提高用户体验质量。 图 1为本发明带宽自适应数据分级保护装置的组成结构示意图，如图 1 所示， 本发明带宽自适应数据分级保护装置包括冗余码生成单元 20、 第一 设置单元 21、 第一判断单元 22、 查找单元 26和承载及传输单元 23 , 其中， 冗余码生成单元 20用于对待传输的数据块进行冗余保护计算， 生成所述数 据块的冗余码； 第一设置单元 21用于为冗余码生成单元 20生成的冗余码 设置优先级； 第一判断单元 22用于判断当前优先级最高的冗余码的数据量 所占用带宽是否大于当前剩余带宽， 是时触发承载及传输单元 23 , 否时触 发查找单元 26; 查找单元 26用于按优先级由高到低的顺序， 在剩余冗余码 中查找是否存在数据量小于或等于当前剩余带宽的冗余码， 触发承载及传 输单元 23;承载及传输单元 23用于将当前优先级最高且数据量小于或等于 当前剩余带宽的冗余码承载于当前剩余带宽中并传输。 当前优先级最高的 冗余码为两个以上， 且其数据量均小于等于当前剩余带宽时， 承载及传输 单元 23任选一个承载于当前剩余带宽中。
如图 2所示， 本发明带宽自适应数据分级保护装置还包括第二判断单 元 25 , 用于在承载及传输单元 23将冗余码承载于当前剩余带宽中后， 判断 当前是否还有剩余带宽， 有时触发第一判断单元 22。
如图 1所示， 本发明带宽自适应数据分级保护装置还包括第二设置单 元 24, 用于为所述待传输的数据块设置优先级， 所述冗余码的优先级与所 述冗余码对应数据块的优先级相同。
本领域技术人员应当理解， 第二设置单元 24、 第二判断单元 25并非实 现图 2所示带宽自适应数据分级保护装置的必要技术特征， 仅是其优化技 术特征而已。
本领域技术人员应当理解， 图 2所示的带宽自适应数据分级保护装置 中的各处理单元的实现功能可参照前述图 1 中的相关描述而理解。 图 2所 示的带宽自适应数据分级保护装置中各处理单元的功能可通过运行于处理 器上的程序而实现， 也可通过具体的逻辑电路而实现。
以上所述， 仅为本发明的较佳实施例而已， 并非用于限定本发明的保 护范围。

Claims

权利要求书
1、 一种带宽自适应数据分级保护方法， 其特征在于， 所述方法包括： 对待传输的数据块进行冗余保护计算， 生成所述数据块的冗余码， 为 所述冗余码设置优先级；
判断当前优先级最高的冗余码所占用带宽是否大于当前剩余带宽， 不 大于当前剩余带宽时将当前优先级最高的冗余码承载于当前剩余带宽中， 大于当前剩余带宽时按优先级由高到低的顺序， 在剩余冗余码中查找是否 存在数据量小于或等于当前剩余带宽的冗余码， 并将查找到的冗余码承载 于当前剩余带宽中。
2、 根据权利要求 1所述的方法， 其特征在于， 将冗余码承载于当前剩 余带宽中后， 所述方法还包括：
判断当前还有剩余带宽时， 按优先级由高到低的顺序继续在剩余冗余 码中查找是否有可承载的冗余码， 确定所述剩余冗余码中不存在承载于剩 余带宽的冗余码时， 结束流程。
3、 根据权利要求 1所述的方法， 其特征在于， 所述方法还包括： 当前优先级最高的冗余码为两个以上， 且所述两个以上冗余码的数据 量均小于等于当前剩余带宽时， 任选一个承载于当前剩余带宽中。
4、 根据权利要求 1至 3任一项所述的方法， 其特征在于， 所述方法还 包括：
为所述待传输的数据块设置优先级， 所述冗余码的优先级与所述冗余 码对应数据块的优先级相同。
5、 一种带宽自适应数据分级保护装置， 其特征在于， 所述装置包括冗 余码生成单元、 第一设置单元、 查找单元和承载及传输单元； 其中，
冗余码生成单元， 用于对待传输的数据块进行冗余保护计算， 生成所 述数据块的冗余码； 第一设置单元， 用于为所述冗余码生成单元生成的冗余码设置优先级； 第一判断单元， 用于判断当前优先级最高的冗余码的数据量所占用带 宽是否大于当前剩余带宽， 不大于当前剩余带宽时触发承载及传输单元， 大于当前剩余带宽时触发查找单元；
查找单元， 用于按优先级由高到低的顺序， 在剩余冗余码中查找是否 存在数据量小于或等于当前剩余带宽的冗余码， 触发承载及传输单元； 承载及传输单元， 用于将当前优先级最高且数据量小于或等于当前剩 余带宽的冗余码承载于当前剩余带宽中并传输。
6、 根据权利要求 5所述的装置， 其特征在于， 所述装置还包括： 第二判断单元， 用于在所述承载及传输单元将冗余码承载于当前剩余 带宽中后， 判断当前还有剩余带宽时触发所述第一判断单元。
7、 根据权利要求 6所述的装置， 其特征在于， 当前优先级最高的冗余 码为两个以上， 且所述两个以上冗余码的数据量均小于等于当前剩余带宽 时， 承载及传输单元任选一个承载于当前剩余带宽中。
8、 根据权利要求 5至 7任一项所述的装置， 其特征在于， 所述装置还 包括：
第二设置单元， 用于为所述待传输的数据块设置优先级， 所述冗余码 的优先级与所述冗余码对应数据块的优先级相同。
PCT/CN2010/073313 2009-07-03 2010-05-27 带宽自适应数据分级保护方法与装置 WO2011000247A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
JP2012518740A JP5324704B2 (ja) 2009-07-03 2010-05-27 帯域幅自己適応型ランク付けデータ保護方法及び装置
US13/381,907 US8788902B2 (en) 2009-07-03 2010-05-27 Method and device for bandwidth self-adapting data ranking protection

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200910088505.7 2009-07-03
CN2009100885057A CN101938322B (zh) 2009-07-03 2009-07-03 带宽自适应数据分级保护方法与装置

Publications (1)

Publication Number Publication Date
WO2011000247A1 true WO2011000247A1 (zh) 2011-01-06

Family

ID=43391475

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/073313 WO2011000247A1 (zh) 2009-07-03 2010-05-27 带宽自适应数据分级保护方法与装置

Country Status (5)

Country Link
US (1) US8788902B2 (zh)
JP (1) JP5324704B2 (zh)
KR (1) KR20120048594A (zh)
CN (1) CN101938322B (zh)
WO (1) WO2011000247A1 (zh)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR102047495B1 (ko) * 2013-02-22 2019-11-21 삼성전자주식회사 클라이언트에서 캐시를 이용하여 서버의 멀티 미디어 컨텐트를 스트리밍 재생하는 방법 및 이를 위한 장치
US9501353B2 (en) * 2015-01-28 2016-11-22 Quantum Corporation Erasure code prioritization
CN106330845A (zh) 2015-07-02 2017-01-11 中兴通讯股份有限公司 一种传输流媒体数据的方法和装置
CN114884617B (zh) * 2022-05-07 2023-12-26 深圳北宸博裕科技有限公司 区块传输方法、计算机设备和存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1283376A (zh) * 1997-08-22 2001-02-07 自适应宽带有限公司 无线电通信***
WO2003021832A1 (en) * 2001-08-28 2003-03-13 Syscor Research & Development Inc. Routing packets in frame-based data communication networks
CN1808979A (zh) * 2005-01-18 2006-07-26 创新科技有限公司 共享通信信道上的实时优化

Family Cites Families (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000228676A (ja) * 1998-11-30 2000-08-15 Matsushita Electric Ind Co Ltd データ送信方法
JP3709730B2 (ja) * 1999-02-03 2005-10-26 三菱電機株式会社 データ中継装置及びデータ中継方法
KR100580158B1 (ko) * 1999-06-12 2006-05-15 삼성전자주식회사 화상 패킷 전송을 위한 무선통신 시스템
EP1172958A1 (fr) * 2000-07-11 2002-01-16 Koninklijke Philips Electronics N.V. Système de communication, émetteur, mèthode de protection contre des erreurs de transmission
JP2002290974A (ja) 2000-12-07 2002-10-04 Matsushita Electric Ind Co Ltd 伝送レート制御方法
JP2002325095A (ja) 2001-04-24 2002-11-08 Mitsubishi Electric Corp データ通信システム、データ送信装置及びデータ通信方法
US20030007724A1 (en) * 2001-07-05 2003-01-09 Broadcom Corporation System, method, and computer program product for optimizing video service in ethernet-based fiber optic TDMA networks
US20040252688A1 (en) 2001-08-28 2004-12-16 May George Anthony Routing packets in frame-based data communication networks
JP4250036B2 (ja) * 2003-08-08 2009-04-08 富士通株式会社 メディア伝送方法及びメディア伝送装置
JP4454320B2 (ja) * 2004-01-09 2010-04-21 富士通株式会社 伝送装置、伝送制御プログラム、及び伝送方法
US8713295B2 (en) * 2004-07-12 2014-04-29 Oracle International Corporation Fabric-backplane enterprise servers with pluggable I/O sub-system
JP2006262288A (ja) * 2005-03-18 2006-09-28 Nec Corp 映像データの配信サーバおよび映像データ配信方法
CN101031074B (zh) * 2006-02-28 2010-05-12 展讯通信（上海）有限公司 一种基于码流优先级的手机电视链路层视频传输方法
WO2007100184A1 (en) * 2006-02-28 2007-09-07 Lg Electronics Inc. Digital broadcasting system and method of processing data
KR101428034B1 (ko) 2006-09-05 2014-09-26 경희대학교 산학협력단 패킷 손실에 대한 강인성을 향상시킬 수 있는 데이터 전송시스템 및 방법
JP2008172465A (ja) * 2007-01-11 2008-07-24 Toshiba Corp データ送信装置
EP2009828B1 (en) * 2007-06-28 2016-01-27 Alcatel Lucent Method for providing unequal error protection to data packets in a burst transmission system
JP2009225025A (ja) * 2008-03-14 2009-10-01 Fujitsu Ltd 受信装置および受信方法
US9312989B2 (en) * 2008-07-07 2016-04-12 Cisco Technology, Inc. Importance-based FEC-aware error-repair scheduling

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1283376A (zh) * 1997-08-22 2001-02-07 自适应宽带有限公司 无线电通信***
WO2003021832A1 (en) * 2001-08-28 2003-03-13 Syscor Research & Development Inc. Routing packets in frame-based data communication networks
CN1808979A (zh) * 2005-01-18 2006-07-26 创新科技有限公司 共享通信信道上的实时优化

Also Published As

Publication number Publication date
US20120272116A1 (en) 2012-10-25
JP5324704B2 (ja) 2013-10-23
JP2012531872A (ja) 2012-12-10
US8788902B2 (en) 2014-07-22
CN101938322A (zh) 2011-01-05
CN101938322B (zh) 2012-11-28
KR20120048594A (ko) 2012-05-15

Similar Documents

Publication Publication Date Title
CN107276722B (zh) 一种基于udp的数据传输方法和***
WO2017157303A1 (zh) 实时通信中的抗丢包方法、装置和***
CN111800218B (zh) 一种数据流的传输方法和设备
US9246630B2 (en) Method, device, and system for forward error correction
WO2018006861A1 (zh) 一种视频数据处理方法及装置
US20120005549A1 (en) Transfer apparatus, transfer program, and transfer method
CN110224793B (zh) 一种基于媒体内容的自适应fec方法
AU2014290953B2 (en) Apparatus and method for sending/receiving packet in multimedia communication system
US10630426B2 (en) Redundancy information for a packet data portion
CN106571893B (zh) 一种语音数据的编解码方法
KR20150045346A (ko) 이동 통신 시스템에서 멀티미디어 데이터 송수신 방법 및 장치
WO2011000247A1 (zh) 带宽自适应数据分级保护方法与装置
JP2006345523A (ja) 誤り訂正パケットを用いた伝送率制御方法およびそれを用いた通信装置
CN115037416A (zh) 数据前向纠错处理方法、装置、电子设备和存储介质
JP2009545238A (ja) データパケット数を削減して誤り訂正パケット数を増加させること
JP4604851B2 (ja) 送信装置、受信装置、送信処理方法、受信処理方法、それらのプログラム
JP6328844B2 (ja) 誤り訂正データのためのオフセット選択
CA2909801C (en) Apparatus and method for transmitting and receiving forward error correction packet
KR102081467B1 (ko) 송신기에 관련된 정보를 이용하는 오류 복구 방법 및 장치
CN116634187A (zh) 基于合流发送机制的视频流处理方法、装置、设备和介质
CN101931492A (zh) 数据块前向纠错算法的确定方法与装置
WO2019170065A1 (zh) 数据传输方法、装置、网络接入设备和存储介质
CN113541853A (zh) 数据传输方法、终端及计算机可读存储介质
WO2016203870A1 (ja) 送信装置、送信方法、及び通信システム
JP2008092213A (ja) 受信機、パケット再送方法及びプログラム

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 10793542

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2012518740

Country of ref document: JP

ENP Entry into the national phase

Ref document number: 20127002957

Country of ref document: KR

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: 13381907

Country of ref document: US

122 Ep: pct application non-entry in european phase

Ref document number: 10793542

Country of ref document: EP

Kind code of ref document: A1