WO2011160369A1 - Method and device for handling data burst error - Google Patents

Method and device for handling data burst error Download PDF

Info

Publication number
WO2011160369A1
WO2011160369A1 PCT/CN2010/077963 CN2010077963W WO2011160369A1 WO 2011160369 A1 WO2011160369 A1 WO 2011160369A1 CN 2010077963 W CN2010077963 W CN 2010077963W WO 2011160369 A1 WO2011160369 A1 WO 2011160369A1
Authority
WO
WIPO (PCT)
Prior art keywords
packet data
bits
cyclic redundancy
data unit
redundancy check
Prior art date
Application number
PCT/CN2010/077963
Other languages
French (fr)
Chinese (zh)
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 中兴通讯股份有限公司
Publication of WO2011160369A1 publication Critical patent/WO2011160369A1/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/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/0061—Error detection codes
    • 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/0072—Error control for data other than payload data, e.g. control data

Definitions

  • a base station refers to a device that provides a service to a terminal, and the base station communicates with the terminal through an uplink and downlink link, where the downlink (also referred to as a forward link) refers to a direction from the base station to the terminal.
  • the uplink also known as the reverse link refers to the direction of the terminal to the base station.
  • Multiple terminals can simultaneously transmit data to the base station through the uplink, or can simultaneously receive data from the base station through the downlink.
  • a base station In a data transmission system in which base station scheduling control is used, a base station generally allocates resources for allocating system resources, etc., and data content transmitted on these resources becomes a data burst.
  • a data burst usually includes a plurality of packet data units (PDUs) of the medium access control layer, and the packet data units may be connected to one service or may be connected to multiple services. of.
  • the packet data unit of each media access layer is usually composed of a media access control header, a payload (whether or not there is content dependent on the media access control header), and a cyclic redundancy check field (whether or not there is an attribute dependent on the service connection).
  • the receiver determines whether the received media access control header and the payload are correct, wherein the media access control header includes a header cyclic redundancy check field of length N bits, The receiving party determines whether the received media access control header is correct; and also includes a length field for indicating the length of the packet data unit; and a service connection identifier field for describing the service connection to which the packet data unit is directed. It should be noted that it is assumed that the media access control header includes M bits after removing the N-bit header cyclic redundancy check field, where M and N are natural numbers greater than zero.
  • a primary object of the present invention is to provide a method and apparatus for processing data burst errors to at least solve the problem of low bandwidth utilization of the above wireless communication system.
  • a data burst error processing method including: a receiver sequentially decoding a plurality of packet data units of a received data burst; and decoding a media access of a current packet data unit
  • the control head fails to pass the cyclic redundancy check, the start position of the next packet data unit is obtained; and the next packet data unit is decoded at the home position.
  • a data burst error processing apparatus including: a first decoding module, configured to sequentially decode a plurality of packet data units of a received data burst;
  • the second decoding module is configured to acquire the start position of the next packet data unit when the media access control header of the decoding module decoding the current packet data unit does not pass the cyclic redundancy check.
  • the starting position decodes the next packet data unit.
  • FIG. 1 is a flowchart of a method for processing a data burst error according to Embodiment 1 of the present invention
  • FIG. 2 is a flowchart of a method for processing a data burst error according to Embodiment 2 of the present invention
  • Figure 4 is a flow chart of a method for processing data burst errors according to Embodiment 3 of the present invention
  • Figure 5 is a schematic diagram of data bursts according to an example of the present invention
  • Figure 6 is a diagram of a data burst according to an embodiment of the present invention.
  • FIG. 7 is a block diagram showing a configuration of a data burst error processing apparatus according to Embodiment 5 of the present invention.
  • the wireless communication system includes a base station and a terminal, and the base station and the terminal comply with relevant wireless communication standards, for example, comply with LTE (Long Term Evolution), 802.16, UMB (Ultra-Mobile Broadband, etc.) standards; The embodiments are described by taking the wireless communication system as an example.
  • FIG. 1 is a flowchart of a method for processing a data burst error according to an embodiment of the present invention.
  • Step S102 The receiver sequentially performs multiple times on the received data burst. Decoding the packet data unit; step S104, acquiring a start position of the next packet data unit when the media access control header of the current packet data unit does not pass the cyclic redundancy check; wherein, the next packet data unit The starting position may be obtained by using the length field included in the media access control header; or matching search may be performed in subsequent data according to the service connection identifier, or searching according to the composition of the cyclic redundancy risk field in the packet data unit. . Step S106, decoding the next packet data unit at the above starting position. The receiving party decodes the received data burst by using the foregoing method.
  • a packet data unit such as the media access control header of the PDU-A
  • the media access control header cannot pass the cyclic redundancy check.
  • the starting position of the unit, such as PDU-B discards the data burst if no matching field is found.
  • the decoded data is highlighted, if the media access control header of one PDU cannot pass the cyclic redundancy check, the subsequent PDU of the PDU is discarded.
  • FIG. 2 is a flowchart of a method for processing a data burst error.
  • Step S202 A receiver decodes a received data burst to decode a packet data unit PDU-A. After the media access control header finds that the media access control header cannot pass the cyclic redundancy check; Step S204, the receiver selects a specified bit from the service connection identifier related to the receiver, after the media access control header And the data belonging to the data burst is searched for a field matching the specified bit; if there is a matching field, step S206 is performed; otherwise, step S208 is performed.
  • the designated bit refers to all or part of the bit of the service connection identifier related to the receiver; in step S206, the receiver determines the starting position of the next packet data unit PDU-B according to the position of the matching field, and decodes the PDU-B. Step S208, the receiver discards the data burst.
  • the service connection identifier includes at least one of the following: a unicast, multicast or broadcast service connection identifier related to the terminal.
  • the service connection is identified as a unicast service connection identifier associated with a designated (or specific) terminal.
  • the service connection identifier may not include the service connection identifier included in the packet data unit that the receiver has successfully obtained in the data burst.
  • the service connection identifier included in the successfully obtained packet data unit does not include the service connection identifier included in the packet data unit that the receiver finally successfully obtains with itself.
  • the media access control head of one PDU cannot pass the cyclic redundancy check, the location of the next PDU is obtained according to the service connection identifier, and the next PDU is decoded, thereby solving the problem that the system bandwidth utilization is low. , thereby improving the spectral efficiency of the wireless communication system.
  • the flow of Embodiment 2 will be further described below with reference to Examples 1 to 5.
  • Example 1 Taking a wireless communication system using the IEEE 802.16 series standard as an example, it is assumed that a base station sends a data burst (Data Burst) to a terminal. As shown in FIG. 3, the data burst includes packet data for five service connections.
  • the terminal MS-1 When the terminal MS-1 decodes the data burst, if the packet data unit including the service connection C1 cannot pass the cyclic redundancy check of the medium access control header (the length is M+N bits), the terminal MS-1 Searching for all the identifiers of the service connections C1, C2, C3 in the bit sequence following the (M+N) bits and belonging to the data burst. If the terminal MS-1 successfully searches for the C2 identifier, the C2 identifier is located. The location obtains the starting location of the packet data unit containing the C2 identifier, and then performs a subsequent decoding analysis process.
  • the medium access control header the length is M+N bits
  • the terminal MS-1 passes the media connection in the packet data unit.
  • the length field included in the incoming control header determines the starting position of the next packet data unit. If the terminal MS-1 can successfully decode the next packet data unit, the above search matching process is not required.
  • Example 2 Taking a wireless communication system using the IEEE 802.16 series of standards as an example, assuming that a base station sends a data burst to a terminal, as shown in FIG.
  • the data burst includes packet data units for five service connections, where the service The connections C l, C 2 , and C3 belong to the terminal MS-1, and the service connections C4 and C5 belong to the terminal MS-2.
  • the terminal MS-1 decodes the data burst, if the packet data unit including the service connection C1 is successfully decoded, the packet data unit including the service connection C2 cannot pass the medium access control header (the length is M+N bits).
  • the terminal MS-1 searches for all the identifiers of the service connections Cl, C2, C3 in the bit sequence belonging to the data burst after the (M+N) bits, if the terminal MS-1 If the identifier of the C3 is successfully searched, the starting position of the packet data unit including the C3 identifier is obtained according to the location of the C3 identifier, and then the subsequent decoding analysis process is performed.
  • the terminal MS-1 passes the media connection in the packet data unit. The length field included in the incoming control header determines the starting position of the next packet data unit.
  • Example 3 Taking a wireless communication system using the IEEE 802.16 series of standards as an example, assuming that a base station sends a data burst to a terminal, as shown in FIG. 3, the data burst includes packet data units for five service connections, where the service The connections C l, C 2 , and C3 belong to the terminal MS-1, and the service connections C4 and C5 belong to the terminal MS-2.
  • the terminal MS-1 decodes the data burst, if the packet data unit including the service connection C1 is successfully decoded, the packet data unit including the service connection C2 cannot pass the medium access control header (the length is M+N bits).
  • the terminal MS-1 searches for all the identifiers of the service connections C2 and C3 in the bit sequence belonging to the data burst after the (M+N) bits, if the terminal MS-1 searches successfully To the identification of C3, the starting position of the packet data unit including the C3 identifier is obtained according to the location of the C3 identifier, and then the subsequent decoding analysis process is performed.
  • the terminal MS-1 passes the media connection in the packet data unit. The length field included in the incoming control header determines the starting position of the next packet data unit.
  • Example 4 Taking a wireless communication system using the IEEE 802.16 series of standards as an example, assuming that a base station sends a data burst to a terminal, as shown in FIG. 3, the data burst includes packet data units for five service connections, where the service The connections C l, C 2 , and C3 belong to the terminal MS-1, and the service connections C4 and C5 belong to the terminal MS-2.
  • the terminal MS-1 When the terminal MS-1 decodes the data burst, if the packet data unit including the service connection C1, C2, C3 is successfully decoded, the packet data unit including the service connection C4 cannot pass the media access control header (the length is M+) Cyclic redundancy check of N bits), the terminal MS-1 searches for all the identifiers of the service connection C3 in the bit sequence belonging to the data burst after the (M+N) bits, If the terminal MS-1 successfully searches for the identifier of the C3, the start position of the packet data unit including the C3 identifier is obtained according to the location where the C3 identifier is located, and then the subsequent decoding analysis process is performed.
  • the terminal MS-1 passes the media connection in the packet data unit.
  • the length field included in the incoming control header determines the starting position of the next packet data unit. If the terminal MS-1 can successfully decode the next packet data unit, the above search matching process is not required.
  • Example 5 Taking a wireless communication system using the IEEE 802.16 series of standards as an example, assuming that a base station sends a data burst to a terminal, as shown in FIG.
  • the data burst includes packet data units for five service connections, where the service Connections C l, C 2, C3 belong to terminal MS-1, and service connections C4 and C5 belong to terminal MS-2.
  • the terminal MS-1 decodes the data burst, if the packet data unit including the service connection Cl, C2, C3, C4 is successfully decoded, the packet data unit including the service connection C5 cannot pass the media access control header (the length is The cyclic redundancy check of M+N bits), the terminal MS-1 can terminate the process of decoding the data burst, and considers that all the data related to itself in the data burst has been obtained.
  • the service connection identifier is X bits, and only Y (Y ⁇ X) bits are searched therein.
  • searching for shift it can be shifted by the step size of X bits, or by the step size of one bit.
  • the matching bit sequence when searching for a bit sequence, when the matching bit sequence is found, the matching bit sequence may be extended to X bits according to the positional relationship of X and the bit, and then matched with the relevant service connection identifier. If - corresponding, it means that the match is successful, if not - corresponding, it means the match failed.
  • FIG. 4 is a flowchart of a method for processing a data burst error, and the method specifically includes the following steps: Step S402, the receiver decodes the received data burst, and decodes the media access control header of a packet data unit PDU-A, and finds that the media access control header cannot pass the cyclic redundancy check; Step S404, the receiver Using the last N bits of the data burst as the first header cyclic redundancy check bit, performing cyclic redundancy check on the M bits before the first header cyclic redundancy check bit; Step S406, if the verification is not passed, go to step S408; Step S406, the receiver acquires the starting position of the next packet data unit according to the information in the M bits, and performs the next packet data unit according to the obtained starting position.
  • Step S402 the receiver decodes the received data burst, and decodes the media access control header of a packet data unit PDU-A, and finds that the media access control header cannot pass the cycl
  • Step S408 the receiver will first The N bits before the cyclic redundancy check bit are used as the second head cyclic redundancy check bit, and the M bits before the second head cyclic redundancy check bit are cyclically redundant, and so on, until the school -risk by. When no M bits pass the cyclic redundancy check, the data burst is discarded.
  • Example 6 Taking a wireless communication system using the IEEE 802.16 series standard as an example, assuming that a base station sends a data burst to a terminal, as shown in FIG.
  • the data burst includes packet data units for four service connections, respectively Packet data unit 1 to packet data unit 4, each packet data unit contains 96 bits including a media access control header (40 useful bits + 8 bit check field) of 48 bits in length.
  • the terminal MS-1 decodes the data burst, if the first packet data unit cannot pass the cyclic redundancy check of the medium access control header (length 40+8 bits), the terminal MS-1 uses the data. The last 8 bits of the burst are used as the head cyclic redundancy check bits, and the previous 40 bits are cyclically checked for redundancy. If the check is not passed, the ninth bit of the data burst is reversed.
  • the 16th bit is used as the head cyclic redundancy check bit, and the 17th bit to the 56th bit (40 bits in total) are checked. If the check is not passed, the above steps are repeated, when the data is bursted.
  • the 49th bit to the 56th bit of the last is used as the head cyclic redundancy check bit, and the 57th bit to the 96th bit of the last number are checked. If the check is passed, the terminal MS-1 knows the last 46th bit. ⁇ 96 bits form a media access control header.
  • the terminal may continue to delay the 97th bit of the data burst to the 104th bit of the data burst as the header cyclic redundancy check bit, and the 105th bit to the 144th bit of the last (40 bits total) ) Check, and so on.
  • the terminal MS-1 may also determine the starting position of the next packet data unit by using the length field included in the media access control header in the first packet data unit, if the terminal MS-1 can successfully decode the next packet data. Unit, you do not need to perform the above matching school-risk process.
  • Step S602 A receiver decodes a received data burst to decode a packet data unit PDU-A After the media access control header finds that the media access control header cannot pass the cyclic redundancy check; in step S604, the receiver uses the N bits after the M bits adjacent to the media access control header as the first head cyclic redundancy. The calibration risk bit performs a cyclic redundancy check on the M bits before the first header cyclic redundancy-risk bit. If the verification passes, the process proceeds to step S606. If the verification fails, the process proceeds to step S608.
  • Step S606 The receiving side uses the information in the M bits to obtain the starting position of the next packet data unit, and decodes the next packet data unit at the starting position; in step S608, the receiver cyclically rectifies the bit after the first header
  • the N bits are used as the next header cyclic redundancy-risk bit, and the M-bits before the next-head cyclic redundancy-risk bit are cyclically redundantly verified, and so on, until the check passes.
  • the subsequent PDUs are checked one by one until the school-risk is successful, indicating that the PDU has no error, the data is available, and the system resources are utilized reasonably and effectively, and the bandwidth is improved. Utilization rate.
  • Example ⁇ Taking a wireless communication system using the IEEE 802.16 series standard as an example, assume that a base station sends a data burst (Data Burst) to a terminal. As shown in FIG. 5, the data burst includes packet data for four service connections. Unit, each packet data unit contains 96 bits, which contains a media access control header (40 useful bits + 8 bit check field) of 48 bits in length. When the terminal MS-1 decodes the data burst, if the first packet data unit cannot pass the cyclic redundancy check of the medium access control header (length 40+8 bits), the terminal MS-1 uses the data.
  • Data Burst data burst
  • the data burst includes packet data for four service connections.
  • each packet data unit contains 96 bits, which contains a media access control header (40 useful bits + 8 bit check field) of 48 bits in length.
  • the terminal MS-1 decodes the data burst, if the first packet data unit cannot pass the cyclic redundancy check of the medium access control header (length 40
  • the 89th to 96th bits of the burst are used as the head cyclic redundancy-risk bits, and the previous 40 bits are cyclically redundantly checked. If the check is not passed, the data burst is 97th.
  • the bits ⁇ 104 bits are used as the head cyclic redundancy check bits, and the previous 40 bits are checked for cyclic redundancy check. If the check is not passed, the above steps are repeated, when the data is bursted.
  • the 137th bit to the 144th bit are sent as the head cyclic redundancy check bit, and the previous 40 bits are checked for cyclic redundancy check. If the check is passed, the terminal MS-1 knows the 97th bit. ⁇ 144 bits form a media access control header.
  • the terminal MS-1 determines a starting position of the next packet data unit by using a length field included in the media access control header in the first packet data unit, and if the terminal MS-1 can successfully decode the next packet data unit, The above matching check process is not required.
  • FIG. 7 shows a processing device for data burst error according to this embodiment.
  • the device may be disposed at a terminal or may be disposed on a base station, and the device includes: a first decoding module 72 for sequentially Decoding a plurality of packet data units of the received data burst; an obtaining module 74, configured to acquire the next one when the decoding module 72 decodes the media access control header of the current packet data unit without passing through the cyclic redundancy check The starting position of the packet data unit; the second decoding module 76 is configured to decode the next packet data unit by using the starting position acquired by the acquiring module 74.
  • the obtaining module 74 includes at least one of the following a first acquiring unit, configured to acquire a starting position of a next packet data unit according to a length field included in the media access control header; and a second acquiring unit, configured to select a specified bit from the service connection identifier related to the receiving party, where Searching for a field matching the specified bit in the data belonging to the data burst after the media access control header; obtaining a starting position of the next packet data unit according to the location of the found field; and a third obtaining unit, configured to Sending the last N bits as the first header cyclic redundancy check bit, performing cyclic redundancy check on the M bits before the first header cyclic redundancy check bit, and verifying, according to the M bits
  • the information obtains the starting position of the next packet data unit; wherein, N and M are both natural numbers greater than 0; when the M bits fail to pass the cyclic redundancy check, the first head cyclic redundancy-risk bit previous
  • N bits are used as the second header cyclic redundancy check bits, and the M bits before the second header cyclic redundancy check bits are cyclically redundant, and so on, until the school passes.
  • a fourth acquiring unit configured to use N bits after the M bits adjacent to the media access control head as the first header cyclic redundancy check bit, perform cyclic redundancy check on the M bits, and verify the pass, according to The information in the M bits acquires the starting position of the next packet data unit; where N and M are both natural numbers greater than zero.
  • the M bits do not pass the cyclic redundancy check, and the N bits after the first header cyclic redundancy check risk bit are used as the next head cyclic redundancy check risk bit, and the next head cyclic redundancy check risk
  • the M bits before the bit are cyclically redundant, and so on, until the school passes.
  • the apparatus of this embodiment recovers the data burst as much as possible by the service connection identifier matching characteristic or the cyclic redundancy check characteristic of the medium access control head of the data burst in the case where an error occurs in the data burst.
  • the subsequent packet data unit solves the problem that the system bandwidth cannot be utilized reasonably and efficiently, thereby improving the performance of the entire wireless communication system.
  • the next packet data unit in the above embodiment is not limited to the packet data unit immediately adjacent to the current packet data unit, and the next packet data unit may be separated from the current packet data unit by a plurality of packet data units.
  • the present invention achieves the following technical effects:
  • the receiver of the above embodiment in the case of an error in the data burst, according to the service connection identifier matching characteristic of the media access control header of the data burst or Cyclic redundancy check characteristics, etc., to recover the data burst as much as possible
  • Subsequent packet data units are used to improve the efficiency of the use of frequency resources, and solve the problem that the system bandwidth cannot be utilized reasonably and efficiently in the prior art, thereby improving the performance of the entire wireless communication system, for example, using LTE, 802.16, UMB, etc.
  • modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein.
  • the steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps are fabricated as a single integrated circuit module.
  • the invention is not limited to any specific combination of hardware and software.

Abstract

The present invention discloses a method and device for handling a data burst error. Wherein, the method includes: a receiving side decodes multiple packet data units of a received data burst in turn, obtains the start position of the next packet data unit when the decoding of a media access control header in the present packet data unit fails in a cyclic redundancy check, and decodes the next packet data unit according to the start position. According to the present invention, the problem that the system bandwidth can not be efficiently used is solved, and therefore the performance of the whole radio communication system is improved.

Description

数据突发错误的处理方法和装置 技术领域 本发明涉及通信领域， 具体而言， 涉及一种数据突发错误的处理方法和 装置。 背景技术 无线通信系统中， 基站是指给终端提供服务的设备， 基站通过上下行链 路与终端进行通信， 其中， 下行链路 （也称作前向链路） 是指基站到终端的 方向， 上行链路（也称作反向链路） 是指终端到基站的方向。 多个终端可同 时通过上行链路向基站发送数据，也可以通过下行链路同时从基站接收数据。 在釆用基站调度控制的数据传输系统中，通常由基站调度分配系统资源， 的资源等， 在这些资源上传输的数据内容成为数据突发。 无线通信系统中， 一个数据突发通常包含多个媒体接入控制层的分组数 据单元（ Packet Data Unit, PDU ), 这些分组数据单元可以是面向一个业务连 接的， 也可以是面向多个业务连接的。 每个媒体接入层的分组数据单元通常 由媒体接入控制头、 净荷（是否存在依赖于媒体接入控制头的内容）、 循环冗 余校验字段 （是否存在依赖于业务连接的属性， 或净荷是否存在， 用于让接 收方判断收到的媒体接入控制头和净荷是否正确） 组成， 其中媒体接入控制 头包含长度为 N个比特的头循环冗余校验字段， 用于让接收方判断收到的媒 体接入控制头是否正确； 也包含长度字段， 用于指示这个分组数据单元的长 度； 也包含业务连接标识字段， 用于描述该分组数据单元面向的业务连接。 需要指出，假设媒体接入控制头除去 N个比特的头循环冗余校验字段后包含 M个比特， 其中 M和 N为大于 0的自然数。 发明人发现一个数据突发通常包含多个分组数据单元， 如果一个分组数 据单元中的媒体接入控制头未能通过循环冗余校验， 则该分组数据单元后面 的若千个分组数据单元将被全部丢弃， 特别是第一个分组数据单元的媒体接 入控制头没有通过校验的情况下， 该数据突发后续的所有分组数据单元将都 被丢弃， 导致无线通信系统的带宽利用率较低。 发明内容 本发明的主要目的在于提供一种数据突发错误的处理方法和装置， 以至 少解决上述无线通信系统的带宽利用率较低的问题。 根据本发明的一个方面， 提供了一种数据突发错误的处理方法， 包括： 接收方依次对接收到的数据突发的多个分组数据单元进行解码； 当解码当前 分组数据单元的媒体接入控制头未通过循环冗余校 -险时， 获取下一个分组数 据单元的起始位置； 居起始位置对下一个分组数据单元进行解码。 根据本发明的另一方面， 提供了一种数据突发错误的处理装置， 包括： 第一解码模块，用于依次对接收到的数据突发的多个分组数据单元进行解码； 获取模块， 用于当解码模块解码当前分组数据单元的媒体接入控制头未通过 循环冗余校-险时， 获取下一个分组数据单元的起始位置； 第二解码模块， 用 于才艮据获取模块获取的起始位置对下一个分组数据单元进行解码。 通过本发明， 釆用在数据突发中部分分组数据单元出现错误后， 获取下 一个分组数据单元的位置 , 居获取的位置对下一个分组数据单元进行解码， 解决了不能高效地利用系统带宽的问题，从而提高整个无线通信系统的性能。 附图说明 此处所说明的附图用来提供对本发明的进一步理解， 构成本申请的一部 分， 本发明的示意性实施例及其说明用于解释本发明， 并不构成对本发明的 不当限定。 在附图中： 图 1是根据本发明实施例 1的数据突发错误的处理方法流程图； 图 2是根据本发明实施例 2的数据突发错误的处理方法流程图； 图 3是根据本发明实例的数据突发示意图； 图 4是根据本发明实施例 3的数据突发错误的处理方法流程图； 图 5是根据本发明实例的数据突发示意图； 图 6是根据本发明实施例 4的数据突发错误的处理方法流程图； 以及 图 7是根据本发明实施例 5的数据突发错误的处理装置的结构框图。 具体实施方式 下文中将参考附图并结合实施例来详细说明本发明。 需要说明的是， 在 不冲突的情况下， 本申请中的实施例及实施例中的特征可以相互组合。 无线通信系统包括基站和终端 ,基站和终端之间遵循相关无线通信标准 , 例如遵循 LTE ( Long Term Evolution,长期演进 ), 802.16、 UMB ( Ultra-Mobile Broadband, 超级移动宽带）等标准； 本发明下述实施例均以该无线通信系统 为例进行说明。 实施例 1 图 1示出了本发明实施例的一种数据突发错误的处理方法流程图， 该方 法包括以下步 4聚： 步骤 S 102,接收方依次对接收到的数据突发的多个分组数据单元进行解 码； 步骤 S 104, 当解码当前分组数据单元的媒体接入控制头未通过循环冗余 校验时， 获取下一个分组数据单元的起始位置； 其中， 下一个分组数据单元的起始位置可以 居上述媒体接入控制头包 含的长度字段获取； 也可以根据业务连接标识在后续数据中进行匹配查找， 或者才艮据分组数据单元中循环冗余校 -险字段的组成进行查找。 步骤 S 106, 居上述起始位置对下一个分组数据单元进行解码。 接收方釆用上述方法对接收到的数据突发进行解码， 当解码一个分组数 据单元例如 PDU-A 的媒体接入控制头后， 发现该媒体接入控制头无法通过 循环冗余校验， 则在该媒体接入控制头后面属于该数据突发的数据中搜索与 所述接收方有关的业务连接标识的全部或部分比特， 如果发现有匹配字段， 则根据匹配字段的位置确定下一个分组数据单元例如 PDU-B 的起始位置， 如果未发现有匹配字段， 则丢弃该数据突发。 相关技术中的接收方在解码数据突出时， 如果有一个 PDU 的媒体接入 控制头不能通过循环冗余校 -险， 则丢弃该 PDU后续的 PDU。 而本实施例在 一个 PDU 的媒体接入控制头不能通过循环冗余校验时， 不釆取直接丢弃后 续的 PDU的处理， 而是获取下一个 PDU的位置， 对下一个 PDU进行解码， 以避免不必要的丢弃操作。 本实施例的接收方在一个 PDU 的媒体接入控制头不能通过循环冗余校 验时，获取下一个 PDU的位置，根据获取到的位置对下一个 PDU进行解码， 解决了系统带宽利用率较低的问题， 进而提高了无线通信系统的频谱效率。 实施例 2 图 2给出了一种数据突发错误的处理方法流程图， 该方法具体包括以下 步骤： 步骤 S202, 接收方对接收到的数据突发进行解码， 解码一个分组数据单 元 PDU-A 的媒体接入控制头后发现该媒体接入控制头无法通过循环冗余校 验； 步骤 S204, 接收方从与该接收方有关的业务连接标识中选择指定比特， 在该媒体接入控制头之后且属于所述数据突发的数据中查找是否有与指定比 特匹配的字段； 如果有匹配字段， 执行步骤 S206; 否则， 执行步骤 S208。 其中， 指定比特指与该接收方有关的业务连接标识的全部或部分比特； 步骤 S206,接收方根据匹配字段的位置确定下一个分组数据单元 PDU-B 的起始位置， 对 PDU-B进行解码； 步骤 S208, 接收方丢弃该数据突发。 优选地， 当接收方为终端时， 业务连接标识至少包括以下之一： 与终端 有关的单播、 组播或广播业务连接标识。 当接收方为基站时， 业务连接标识 为与一个指定 （或特定） 终端有关的单播业务连接标识。 该业务连接标识可以不包括接收方在该数据突发中已成功获得过的分组 数据单元中包含的业务连接标识。 已成功获得过的分组数据单元中包含的业 务连接标识中不包括接收方最后成功获得与自己有关的分组数据单元中包含 的业务连接标识。 本实施例通过在一个 PDU的媒体接入控制头不能通过循环冗余校验时， 根据业务连接标识获取下一个 PDU的位置， 对下一个 PDU进行解码， 解决 了系统带宽利用率较低的问题， 进而提高了无线通信系统的频谱效率。 下面结合实例 1 ~ 5进一步说明实施例 2的流程。 实例 1 以釆用 IEEE 802.16系列标准的无线通信系统为例， 假设基站向终端发 送一个数据突发 （Data Burst ), 如图 3所示， 该数据突发中包含面向 5个业 务连接的分组数据单元， 其中业务连接 C l、 C 2 、 C3属于终端 MS-1 , 业务 连接 C4、 C5属于终端 MS-2。 当终端 MS-1解码该数据突发时，如果对包含业务连接 C1的分组数据单 元无法通过媒体接入控制头 （长度为 M+N个比特） 的循环冗余校验， 则终 端 MS-1在该 （ M+N ) 个比特后面且属于该数据突发的比特序列中搜索业务 连接 Cl、 C2、 C3的全部标识， 如果终端 MS-1成功搜索到 C2的标识， 则根 据 C2标识所在的位置获得包含 C2标识的分组数据单元的起始位置，进而进 行后续的解码分析过程。 可选地， 如果对包含业务连接 C1 的分组数据单元无法通过媒体接入控 制头（长度为 M+N个比特）的循环冗余校验， 则终端 MS-1通过该分组数据 单元中媒体接入控制头包含的长度字段确定下一个分组数据单元的起始位 置， 如果终端 MS-1可成功解码下一个分组数据单元， 则不需要进行上述搜 索匹配过程。 实例 2 以釆用 IEEE 802.16系列标准的无线通信系统为例， 假设基站向终端发 送一个数据突发， 如图 3所示， 该数据突发中包含面向 5个业务连接的分组 数据单元， 其中业务连接 C l、 C 2 、 C3属于终端 MS-1 , 业务连接 C4、 C5 属于终端 MS-2。 当终端 MS-1解码该数据突发时，如果成功解码包含业务连接 C1的分组 数据单元， 而对包含业务连接 C2 的分组数据单元无法通过媒体接入控制头 (长度为 M+N个比特） 的循环冗余校 -险， 则终端 MS-1在该 （M+N ) 个比 特后面的属于该数据突发的比特序列中搜索业务连接 Cl、 C2、 C3的全部标 识， 如果终端 MS-1成功搜索到 C3的标识， 则才艮据 C3标识所在的位置获得 包含 C3标识的分组数据单元的起始位置， 进而进行后续的解码分析过程。 可选地， 如果对包含业务连接 C2 的分组数据单元无法通过媒体接入控 制头（长度为 M+N个比特）的循环冗余校验， 则终端 MS-1通过该分组数据 单元中媒体接入控制头包含的长度字段确定下一个分组数据单元的起始位 置， 如果终端 MS-1可成功解码下一个分组数据单元， 则不需要进行上述搜 索匹配过程。 实例 3 以釆用 IEEE 802.16系列标准的无线通信系统为例， 假设基站向终端发 送一个数据突发， 如图 3所示， 该数据突发中包含面向 5个业务连接的分组 数据单元， 其中业务连接 C l、 C 2 、 C3属于终端 MS-1 , 业务连接 C4、 C5 属于终端 MS-2。 当终端 MS-1解码该数据突发时，如果成功解码包含业务连接 C1的分组 数据单元， 而对包含业务连接 C2 的分组数据单元无法通过媒体接入控制头 (长度为 M+N个比特） 的循环冗余校 -险， 则终端 MS-1在该 （M+N ) 个比 特后面的属于该数据突发的比特序列中搜索业务连接 C2、 C3的全部标识， 如果终端 MS-1成功搜索到 C3的标识， 则才艮据 C3标识所在的位置获得包含 C3标识的分组数据单元的起始位置， 进而进行后续的解码分析过程。 可选地， 如果对包含业务连接 C1 的分组数据单元无法通过媒体接入控 制头（长度为 M+N个比特）的循环冗余校验， 则终端 MS-1通过该分组数据 单元中媒体接入控制头包含的长度字段确定下一个分组数据单元的起始位 置， 如果终端 MS-1可成功解码下一个分组数据单元， 则不需要进行上述搜 索匹配过程。 实例 4 以釆用 IEEE 802.16系列标准的无线通信系统为例， 假设基站向终端发 送一个数据突发， 如图 3所示， 该数据突发中包含面向 5个业务连接的分组 数据单元， 其中业务连接 C l、 C 2 、 C3属于终端 MS-1 , 业务连接 C4、 C5 属于终端 MS-2。 当终端 MS-1解码该数据突发时， 如果成功解码包含业务连接 Cl、 C2、 C3的分组数据单元， 而对包含业务连接 C4的分组数据单元无法通过媒体接 入控制头（长度为 M+N个比特）的循环冗余校验，则终端 MS-1在该（ M+N ) 个比特后面的属于该数据突发的比特序列中搜索业务连接 C3 的全部标识， 如果终端 MS-1成功搜索到 C3的标识， 则根据 C3标识所在的位置获得包含 C3标识的分组数据单元的起始位置， 进而进行后续的解码分析过程。 可选地， 如果对包含业务连接 C4 的分组数据单元无法通过媒体接入控 制头（长度为 M+N个比特）的循环冗余校验， 则终端 MS-1通过该分组数据 单元中媒体接入控制头包含的长度字段确定下一个分组数据单元的起始位 置， 如果终端 MS-1可成功解码下一个分组数据单元， 则不需要进行上述搜 索匹配过程。 实例 5 以釆用 IEEE 802.16系列标准的无线通信系统为例， 假设基站向终端发 送一个数据突发， 如图 3所示， 该数据突发中包含面向 5个业务连接的分组 数据单元， 其中业务连接 C l、 C 2、 C3属于终端 MS-1 , 业务连接 C4、 C5 属于终端 MS-2。 当终端 MS-1解码该数据突发时， 如果成功解码包含业务连接 Cl、 C2、 C3、 C4的分组数据单元， 而对包含业务连接 C5的分组数据单元无法通过媒 体接入控制头（长度为 M+N个比特）的循环冗余校验， 则终端 MS-1可以终 止解码数据突发的过程， 认为已全部获得该数据突发中与自己有关的全部数 据。 需要指出的是， 上述实例 1〜实例 5 中为了加快搜索速度， 可以只搜索 相关业务连接标识的部分比特， 例如， 业务连接标识为 X个比特， 只搜索其 中的 Y ( Y<X ) 个比特， 搜索移位时， 可以按照 X个比特的步长来移位， 也 可以按照 Υ个比特的步长来移位。 可选地， 当按照 Υ个比特来搜索时， 找到 匹配比特序列时，可以将匹配比特序列才艮据 X和 Υ个比特的位置关系扩展到 X个比特， 再与相关业务连接标识进行匹配， 如果——对应， 则表明匹配成 功， 如果未能——对应， 则表明匹配失败。 以上实例均是以业务连接标识为例获取下一个分组数据单元的位置信息 的， 实现方式简单高效， 提高了系统带宽的利用率。 实施例 3 图 4给出了一种数据突发错误的处理方法流程图， 该方法具体包括以下 步骤： 步骤 S402, 接收方对接收到的数据突发进行解码， 解码一个分组数据单 元 PDU-A 的媒体接入控制头后发现该媒体接入控制头无法通过循环冗余校 验； 步骤 S404, 接收方将该数据突发的最后 N个比特作为第一头循环冗余 校验比特， 对第一头循环冗余校验比特之前的 M个比特进行循环冗余校验； 如果通过校验， 转入步骤 S406, 如果未通过校验， 转入步骤 S408; 步骤 S406, 接收方根据 M个比特中的信息获取下一个分组数据单元的 起始位置， 根据获取的起始位置对下一个分组数据单元进行解码； 例如， 以该（N+M )之前的 N个比特为头循环冗余校-险比特， 对它之前 的 M个比特继续进行循环冗余校验； 步骤 S408, 接收方将第一头循环冗余校验比特之前的 N个比特作为第 二头循环冗余校验比特，对第二头循环冗余校验比特之前的 M个比特进行循 环冗余校 -险， 依次类推， 直至校-险通过。 当没有任何 M个比特通过循环冗余校 -险时， 丢弃该数据突发。 本实施例根据循环冗余校验字段的结构逐一对后续 PDU 进行校验， 直 至校-险成功， 则说明该 PDU 未出现错误， 其数据可用， 进而合理有效地利 用了系统资源， 提高了带宽利用率。 下面结合实例 6进一步说明实施例 3的流程。 实例 6 以釆用 IEEE 802.16系列标准的无线通信系统为例， 假设基站向终端发 送一个数据突发， 如图 5所示， 该数据突发中包含面向 4个业务连接的分组 数据单元， 分别为分组数据单元 1〜分组数据单元 4, 每个分组数据单元包含 96个比特， 其中包含长度为 48个比特的媒体接入控制头 （ 40个有用比特 + 8比特校验字段）。 当终端 MS-1解码该数据突发时， 如果第一个分组数据单元无法通过媒 体接入控制头（长度为 40+8个比特）的循环冗余校验， 则终端 MS-1以该数 据突发的最后 8个比特作为头循环冗余校验比特， 对它之前的 40个比特进 行循环冗余校验， 如果没有通过校验， 则将该数据突发的倒数第 9个比特〜 第 16个比特作为头循环冗余校验比特， 对倒数第 17个比特到第 56个比特 (共 40 个比特） 进行校验， 如果没有通过校验， 继续重复上述步骤， 当将 该数据突发的倒数第 49个比特〜第 56个比特作为头循环冗余校验比特， 对 倒数第 57个比特〜第 96个比特进行校验， 如果通过校验， 则终端 MS-1知 道倒数第 46 ~ 96 个比特构成一个媒体接入控制头。 可选地， 终端可继续 4巴 该数据突发的倒数第 97个比特〜倒数第 104个比特作为头循环冗余校验比 特， 对倒数第 105个比特到第 144个比特 （共 40个比特） 进行校验， 以此 类推。 可选地， 终端 MS- 1也可以通过第一个分组数据单元中媒体接入控制头 包含的长度字段确定下一个分组数据单元的起始位置， 如果终端 MS-1可成 功解码下一个分组数据单元， 则不需要进行上述匹配校-险过程。 实施例 4 图 6给出了一种数据突发错误的处理方法流程图，该方法包括以下步骤： 步骤 S602, 接收方对接收到的数据突发进行解码， 解码一个分组数据单 元 PDU-A 的媒体接入控制头后发现该媒体接入控制头无法通过循环冗余校 验； 步骤 S604, 接收方将与该媒体接入控制头邻接的 M个比特后的 N个比 特作为首个头循环冗余校险比特，对首个头循环冗余校-险比特之前的 M个比 特进行循环冗余校验， 如果通过校验， 转入步骤 S606, 如果未通过校验， 转 入步骤 S608; 步骤 S606, 接收方利用该 M个比特中信息获得下一个分组数据单元的 起始位置， 居该起始位置对下一个分组数据单元进行解码； 步骤 S608, 接收方将该首个头循环冗余校验比特后的 N个比特作为下 一个头循环冗余校-险比特，对下一个头循环冗余校-险比特之前的 M个比特进 行循环冗余校验， 依次类推， 直至校验通过。 本实施例根据循环冗余校验字段的结构逐一对后续 PDU 进行校验， 直 至校-险成功， 则说明该 PDU 未出现错误， 其数据可用， 进而合理有效地利 用了系统资源， 提高了带宽利用率。 下面结合实例 7进一步说明实施例 4的流程。 实例 Ί 以釆用 IEEE 802.16系列标准的无线通信系统为例， 假设基站向终端发 送一个数据突发 （Data Burst ), 如图 5所示， 该数据突发中包含面向 4个业 务连接的分组数据单元， 每个分组数据单元包含 96 个比特， 其中包含长度 为 48个比特的媒体接入控制头 （ 40个有用比特 + 8比特校验字段）。 当终端 MS-1解码该数据突发时， 如果第一个分组数据单元无法通过媒 体接入控制头（长度为 40+8个比特）的循环冗余校验， 则终端 MS-1以该数 据突发的第 89个〜第 96 个比特作为头循环冗余校-险比特， 对它之前的 40 个比特进行循环冗余校验， 如果没有通过校验， 则将该数据突发的第 97 个 比特〜第 104个比特作为头循环冗余校-险比特， 对它之前的 40个比特进行 循环冗余校验进行校验， 如果没有通过校验， 继续重复上述步骤， 当将该数 据突发的第 137个比特〜第 144个比特作为头循环冗余校验比特， 对它之前 的 40个比特进行循环冗余校验进行校验， 如果通过校验， 则终端 MS-1知道 第 97 ~ 144个比特构成一个媒体接入控制头。 可选地， 终端 MS- 1通过第一个分组数据单元中媒体接入控制头包含的 长度字段确定下一个分组数据单元的起始位置， 如果终端 MS-1可成功解码 下一个分组数据单元， 则不需要进行上述匹配校验过程。 实施例 5 图 7示出了根据本实施例的一种数据突发错误的处理装置， 该装置可以 设置在终端， 也可以设置在基站上， 该装置包括： 第一解码模块 72 ,用于依次对接收到的数据突发的多个分组数据单元进 行解码； 获取模块 74 , 用于当解码模块 72解码当前分组数据单元的媒体接入控 制头未通过循环冗余校-险时， 获取下一个分组数据单元的起始位置； 第二解码模块 76 , 用于 居获取模块 74获取的起始位置对下一个分组 数据单元进行解码。 其中， 获取模块 74至少包括以下之一 第一获取单元， 用于根据媒体接入控制头包含的长度字段获取下一个分 组数据单元的起始位置； 第二获取单元， 用于从与接收方有关的业务连接标识中选择指定比特， 在媒体接入控制头之后且属于数据突发的数据中查找与指定比特匹配的字 段； 根据查找到的字段所在位置获取下一个分组数据单元的起始位置； 第三获取单元， 用于将数据突发的最后 N个比特作为第一头循环冗余校 验比特， 对第一头循环冗余校验比特之前的该 M个比特进行循环冗余校验， 校验通过， 根据该 M个比特中的信息获取下一个分组数据单元的起始位置； 其中， N和 M均为大于 0的自然数； 当该 M个比特未通过循环冗余校 -险，将第一头循环冗余校-险比特之前的TECHNICAL FIELD The present invention relates to the field of communications, and in particular to a method and apparatus for processing data burst errors. In a wireless communication system, a base station refers to a device that provides a service to a terminal, and the base station communicates with the terminal through an uplink and downlink link, where the downlink (also referred to as a forward link) refers to a direction from the base station to the terminal. The uplink (also known as the reverse link) refers to the direction of the terminal to the base station. Multiple terminals can simultaneously transmit data to the base station through the uplink, or can simultaneously receive data from the base station through the downlink. In a data transmission system in which base station scheduling control is used, a base station generally allocates resources for allocating system resources, etc., and data content transmitted on these resources becomes a data burst. In a wireless communication system, a data burst usually includes a plurality of packet data units (PDUs) of the medium access control layer, and the packet data units may be connected to one service or may be connected to multiple services. of. The packet data unit of each media access layer is usually composed of a media access control header, a payload (whether or not there is content dependent on the media access control header), and a cyclic redundancy check field (whether or not there is an attribute dependent on the service connection). Or whether the payload exists, for the receiver to determine whether the received media access control header and the payload are correct, wherein the media access control header includes a header cyclic redundancy check field of length N bits, The receiving party determines whether the received media access control header is correct; and also includes a length field for indicating the length of the packet data unit; and a service connection identifier field for describing the service connection to which the packet data unit is directed. It should be noted that it is assumed that the media access control header includes M bits after removing the N-bit header cyclic redundancy check field, where M and N are natural numbers greater than zero. The inventor has found that a data burst usually contains a plurality of packet data units, and if the media access control header in one packet data unit fails the cyclic redundancy check, then thousands of packet data units following the packet data unit will If all media packets are discarded, especially if the media access control header of the first packet data unit fails to pass the check, all the packet data units subsequent to the data burst will be discarded, resulting in a bandwidth utilization ratio of the wireless communication system. low. SUMMARY OF THE INVENTION A primary object of the present invention is to provide a method and apparatus for processing data burst errors to at least solve the problem of low bandwidth utilization of the above wireless communication system. According to an aspect of the present invention, a data burst error processing method is provided, including: a receiver sequentially decoding a plurality of packet data units of a received data burst; and decoding a media access of a current packet data unit When the control head fails to pass the cyclic redundancy check, the start position of the next packet data unit is obtained; and the next packet data unit is decoded at the home position. According to another aspect of the present invention, a data burst error processing apparatus is provided, including: a first decoding module, configured to sequentially decode a plurality of packet data units of a received data burst; The second decoding module is configured to acquire the start position of the next packet data unit when the media access control header of the decoding module decoding the current packet data unit does not pass the cyclic redundancy check. The starting position decodes the next packet data unit. Through the invention, after the error occurs in the partial packet data unit in the data burst, the location of the next packet data unit is obtained, and the acquired location decodes the next packet data unit, thereby solving the problem that the system bandwidth cannot be utilized efficiently. Problems that improve the performance of the entire wireless communication system. BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings, which are set to illustrate,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,, 1 is a flowchart of a method for processing a data burst error according to Embodiment 1 of the present invention; FIG. 2 is a flowchart of a method for processing a data burst error according to Embodiment 2 of the present invention; Figure 4 is a flow chart of a method for processing data burst errors according to Embodiment 3 of the present invention; Figure 5 is a schematic diagram of data bursts according to an example of the present invention; Figure 6 is a diagram of a data burst according to an embodiment of the present invention. A flowchart of a method for processing a data burst error; and FIG. 7 is a block diagram showing a configuration of a data burst error processing apparatus according to Embodiment 5 of the present invention. BEST MODE FOR CARRYING OUT THE INVENTION Hereinafter, the present invention will be described in detail with reference to the accompanying drawings. It should be noted that the embodiments in the present application and the features in the embodiments may be combined with each other without conflict. The wireless communication system includes a base station and a terminal, and the base station and the terminal comply with relevant wireless communication standards, for example, comply with LTE (Long Term Evolution), 802.16, UMB (Ultra-Mobile Broadband, etc.) standards; The embodiments are described by taking the wireless communication system as an example. Embodiment 1 FIG. 1 is a flowchart of a method for processing a data burst error according to an embodiment of the present invention. The method includes the following steps: Step S102: The receiver sequentially performs multiple times on the received data burst. Decoding the packet data unit; step S104, acquiring a start position of the next packet data unit when the media access control header of the current packet data unit does not pass the cyclic redundancy check; wherein, the next packet data unit The starting position may be obtained by using the length field included in the media access control header; or matching search may be performed in subsequent data according to the service connection identifier, or searching according to the composition of the cyclic redundancy risk field in the packet data unit. . Step S106, decoding the next packet data unit at the above starting position. The receiving party decodes the received data burst by using the foregoing method. After decoding a packet data unit, such as the media access control header of the PDU-A, it is found that the media access control header cannot pass the cyclic redundancy check. Searching for all or part of the service connection identifier related to the receiver in the data belonging to the data burst after the media access control header, and if a matching field is found, determining the next packet data according to the location of the matching field The starting position of the unit, such as PDU-B, discards the data burst if no matching field is found. In the related art, when the decoded data is highlighted, if the media access control header of one PDU cannot pass the cyclic redundancy check, the subsequent PDU of the PDU is discarded. In this embodiment, when the media access control header of a PDU cannot pass the cyclic redundancy check, the process of directly discarding the subsequent PDU is not taken, but the location of the next PDU is obtained, and the next PDU is decoded. To avoid unnecessary discarding operations. When the media access control head of a PDU cannot pass the cyclic redundancy check, the receiver of the present embodiment acquires the location of the next PDU, and decodes the next PDU according to the obtained location, thereby solving the system bandwidth utilization ratio. The low problem, in turn, increases the spectral efficiency of the wireless communication system. Embodiment 2 FIG. 2 is a flowchart of a method for processing a data burst error. The method specifically includes the following steps: Step S202: A receiver decodes a received data burst to decode a packet data unit PDU-A. After the media access control header finds that the media access control header cannot pass the cyclic redundancy check; Step S204, the receiver selects a specified bit from the service connection identifier related to the receiver, after the media access control header And the data belonging to the data burst is searched for a field matching the specified bit; if there is a matching field, step S206 is performed; otherwise, step S208 is performed. Wherein, the designated bit refers to all or part of the bit of the service connection identifier related to the receiver; in step S206, the receiver determines the starting position of the next packet data unit PDU-B according to the position of the matching field, and decodes the PDU-B. Step S208, the receiver discards the data burst. Preferably, when the receiver is a terminal, the service connection identifier includes at least one of the following: a unicast, multicast or broadcast service connection identifier related to the terminal. When the recipient is a base station, the service connection is identified as a unicast service connection identifier associated with a designated (or specific) terminal. The service connection identifier may not include the service connection identifier included in the packet data unit that the receiver has successfully obtained in the data burst. The service connection identifier included in the successfully obtained packet data unit does not include the service connection identifier included in the packet data unit that the receiver finally successfully obtains with itself. In this embodiment, when the media access control head of one PDU cannot pass the cyclic redundancy check, the location of the next PDU is obtained according to the service connection identifier, and the next PDU is decoded, thereby solving the problem that the system bandwidth utilization is low. , thereby improving the spectral efficiency of the wireless communication system. The flow of Embodiment 2 will be further described below with reference to Examples 1 to 5. Example 1 Taking a wireless communication system using the IEEE 802.16 series standard as an example, it is assumed that a base station sends a data burst (Data Burst) to a terminal. As shown in FIG. 3, the data burst includes packet data for five service connections. The unit, where the service connection C l, C 2 , C3 belongs to the terminal MS-1, and the service connection C4, C5 belongs to the terminal MS-2. When the terminal MS-1 decodes the data burst, if the packet data unit including the service connection C1 cannot pass the cyclic redundancy check of the medium access control header (the length is M+N bits), the terminal MS-1 Searching for all the identifiers of the service connections C1, C2, C3 in the bit sequence following the (M+N) bits and belonging to the data burst. If the terminal MS-1 successfully searches for the C2 identifier, the C2 identifier is located. The location obtains the starting location of the packet data unit containing the C2 identifier, and then performs a subsequent decoding analysis process. Optionally, if the packet data unit including the service connection C1 cannot pass the cyclic redundancy check of the medium access control header (the length is M+N bits), the terminal MS-1 passes the media connection in the packet data unit. The length field included in the incoming control header determines the starting position of the next packet data unit. If the terminal MS-1 can successfully decode the next packet data unit, the above search matching process is not required. Example 2 Taking a wireless communication system using the IEEE 802.16 series of standards as an example, assuming that a base station sends a data burst to a terminal, as shown in FIG. 3, the data burst includes packet data units for five service connections, where the service The connections C l, C 2 , and C3 belong to the terminal MS-1, and the service connections C4 and C5 belong to the terminal MS-2. When the terminal MS-1 decodes the data burst, if the packet data unit including the service connection C1 is successfully decoded, the packet data unit including the service connection C2 cannot pass the medium access control header (the length is M+N bits). The cyclic redundancy check, the terminal MS-1 searches for all the identifiers of the service connections Cl, C2, C3 in the bit sequence belonging to the data burst after the (M+N) bits, if the terminal MS-1 If the identifier of the C3 is successfully searched, the starting position of the packet data unit including the C3 identifier is obtained according to the location of the C3 identifier, and then the subsequent decoding analysis process is performed. Optionally, if the packet data unit including the service connection C2 cannot pass the cyclic redundancy check of the medium access control header (the length is M+N bits), the terminal MS-1 passes the media connection in the packet data unit. The length field included in the incoming control header determines the starting position of the next packet data unit. If the terminal MS-1 can successfully decode the next packet data unit, the above search matching process is not required. Example 3 Taking a wireless communication system using the IEEE 802.16 series of standards as an example, assuming that a base station sends a data burst to a terminal, as shown in FIG. 3, the data burst includes packet data units for five service connections, where the service The connections C l, C 2 , and C3 belong to the terminal MS-1, and the service connections C4 and C5 belong to the terminal MS-2. When the terminal MS-1 decodes the data burst, if the packet data unit including the service connection C1 is successfully decoded, the packet data unit including the service connection C2 cannot pass the medium access control header (the length is M+N bits). The cyclic redundancy check, the terminal MS-1 searches for all the identifiers of the service connections C2 and C3 in the bit sequence belonging to the data burst after the (M+N) bits, if the terminal MS-1 searches successfully To the identification of C3, the starting position of the packet data unit including the C3 identifier is obtained according to the location of the C3 identifier, and then the subsequent decoding analysis process is performed. Optionally, if the packet data unit including the service connection C1 cannot pass the cyclic redundancy check of the medium access control header (the length is M+N bits), the terminal MS-1 passes the media connection in the packet data unit. The length field included in the incoming control header determines the starting position of the next packet data unit. If the terminal MS-1 can successfully decode the next packet data unit, the above search matching process is not required. Example 4 Taking a wireless communication system using the IEEE 802.16 series of standards as an example, assuming that a base station sends a data burst to a terminal, as shown in FIG. 3, the data burst includes packet data units for five service connections, where the service The connections C l, C 2 , and C3 belong to the terminal MS-1, and the service connections C4 and C5 belong to the terminal MS-2. When the terminal MS-1 decodes the data burst, if the packet data unit including the service connection C1, C2, C3 is successfully decoded, the packet data unit including the service connection C4 cannot pass the media access control header (the length is M+) Cyclic redundancy check of N bits), the terminal MS-1 searches for all the identifiers of the service connection C3 in the bit sequence belonging to the data burst after the (M+N) bits, If the terminal MS-1 successfully searches for the identifier of the C3, the start position of the packet data unit including the C3 identifier is obtained according to the location where the C3 identifier is located, and then the subsequent decoding analysis process is performed. Optionally, if the packet data unit including the service connection C4 cannot pass the cyclic redundancy check of the medium access control header (the length is M+N bits), the terminal MS-1 passes the media connection in the packet data unit. The length field included in the incoming control header determines the starting position of the next packet data unit. If the terminal MS-1 can successfully decode the next packet data unit, the above search matching process is not required. Example 5 Taking a wireless communication system using the IEEE 802.16 series of standards as an example, assuming that a base station sends a data burst to a terminal, as shown in FIG. 3, the data burst includes packet data units for five service connections, where the service Connections C l, C 2, C3 belong to terminal MS-1, and service connections C4 and C5 belong to terminal MS-2. When the terminal MS-1 decodes the data burst, if the packet data unit including the service connection Cl, C2, C3, C4 is successfully decoded, the packet data unit including the service connection C5 cannot pass the media access control header (the length is The cyclic redundancy check of M+N bits), the terminal MS-1 can terminate the process of decoding the data burst, and considers that all the data related to itself in the data burst has been obtained. It should be noted that in the above examples 1 to 5, in order to speed up the search, only some bits of the relevant service connection identifier may be searched. For example, the service connection identifier is X bits, and only Y (Y<X) bits are searched therein. When searching for shift, it can be shifted by the step size of X bits, or by the step size of one bit. Optionally, when searching for a bit sequence, when the matching bit sequence is found, the matching bit sequence may be extended to X bits according to the positional relationship of X and the bit, and then matched with the relevant service connection identifier. If - corresponding, it means that the match is successful, if not - corresponding, it means the match failed. The above examples all take the service connection identifier as an example to obtain the location information of the next packet data unit, and the implementation manner is simple and efficient, and the utilization of the system bandwidth is improved. Embodiment 3 FIG. 4 is a flowchart of a method for processing a data burst error, and the method specifically includes the following steps: Step S402, the receiver decodes the received data burst, and decodes the media access control header of a packet data unit PDU-A, and finds that the media access control header cannot pass the cyclic redundancy check; Step S404, the receiver Using the last N bits of the data burst as the first header cyclic redundancy check bit, performing cyclic redundancy check on the M bits before the first header cyclic redundancy check bit; Step S406, if the verification is not passed, go to step S408; Step S406, the receiver acquires the starting position of the next packet data unit according to the information in the M bits, and performs the next packet data unit according to the obtained starting position. Decoding; for example, cyclically restoring the redundancy risk bit with the N bits before the (N+M), and continuing the cyclic redundancy check on the previous M bits; Step S408, the receiver will first The N bits before the cyclic redundancy check bit are used as the second head cyclic redundancy check bit, and the M bits before the second head cyclic redundancy check bit are cyclically redundant, and so on, until the school -risk by. When no M bits pass the cyclic redundancy check, the data burst is discarded. In this embodiment, according to the structure of the cyclic redundancy check field, the subsequent PDUs are checked one by one until the school-risk is successful, indicating that the PDU has no error, the data is available, and the system resources are utilized reasonably and effectively, and the bandwidth is improved. Utilization rate. The flow of Embodiment 3 will be further described below with reference to Example 6. Example 6 Taking a wireless communication system using the IEEE 802.16 series standard as an example, assuming that a base station sends a data burst to a terminal, as shown in FIG. 5, the data burst includes packet data units for four service connections, respectively Packet data unit 1 to packet data unit 4, each packet data unit contains 96 bits including a media access control header (40 useful bits + 8 bit check field) of 48 bits in length. When the terminal MS-1 decodes the data burst, if the first packet data unit cannot pass the cyclic redundancy check of the medium access control header (length 40+8 bits), the terminal MS-1 uses the data. The last 8 bits of the burst are used as the head cyclic redundancy check bits, and the previous 40 bits are cyclically checked for redundancy. If the check is not passed, the ninth bit of the data burst is reversed. The 16th bit is used as the head cyclic redundancy check bit, and the 17th bit to the 56th bit (40 bits in total) are checked. If the check is not passed, the above steps are repeated, when the data is bursted. The 49th bit to the 56th bit of the last is used as the head cyclic redundancy check bit, and the 57th bit to the 96th bit of the last number are checked. If the check is passed, the terminal MS-1 knows the last 46th bit. ~ 96 bits form a media access control header. Optionally, the terminal may continue to delay the 97th bit of the data burst to the 104th bit of the data burst as the header cyclic redundancy check bit, and the 105th bit to the 144th bit of the last (40 bits total) ) Check, and so on. Optionally, the terminal MS-1 may also determine the starting position of the next packet data unit by using the length field included in the media access control header in the first packet data unit, if the terminal MS-1 can successfully decode the next packet data. Unit, you do not need to perform the above matching school-risk process. Embodiment 4 FIG. 6 is a flowchart of a method for processing a data burst error, the method comprising the following steps: Step S602: A receiver decodes a received data burst to decode a packet data unit PDU-A After the media access control header finds that the media access control header cannot pass the cyclic redundancy check; in step S604, the receiver uses the N bits after the M bits adjacent to the media access control header as the first head cyclic redundancy. The calibration risk bit performs a cyclic redundancy check on the M bits before the first header cyclic redundancy-risk bit. If the verification passes, the process proceeds to step S606. If the verification fails, the process proceeds to step S608. Step S606, The receiving side uses the information in the M bits to obtain the starting position of the next packet data unit, and decodes the next packet data unit at the starting position; in step S608, the receiver cyclically rectifies the bit after the first header The N bits are used as the next header cyclic redundancy-risk bit, and the M-bits before the next-head cyclic redundancy-risk bit are cyclically redundantly verified, and so on, until the check passes. . In this embodiment, according to the structure of the cyclic redundancy check field, the subsequent PDUs are checked one by one until the school-risk is successful, indicating that the PDU has no error, the data is available, and the system resources are utilized reasonably and effectively, and the bandwidth is improved. Utilization rate. The flow of Embodiment 4 will be further described below with reference to Example 7. Example Ί Taking a wireless communication system using the IEEE 802.16 series standard as an example, assume that a base station sends a data burst (Data Burst) to a terminal. As shown in FIG. 5, the data burst includes packet data for four service connections. Unit, each packet data unit contains 96 bits, which contains a media access control header (40 useful bits + 8 bit check field) of 48 bits in length. When the terminal MS-1 decodes the data burst, if the first packet data unit cannot pass the cyclic redundancy check of the medium access control header (length 40+8 bits), the terminal MS-1 uses the data. The 89th to 96th bits of the burst are used as the head cyclic redundancy-risk bits, and the previous 40 bits are cyclically redundantly checked. If the check is not passed, the data burst is 97th. The bits ~ 104 bits are used as the head cyclic redundancy check bits, and the previous 40 bits are checked for cyclic redundancy check. If the check is not passed, the above steps are repeated, when the data is bursted. The 137th bit to the 144th bit are sent as the head cyclic redundancy check bit, and the previous 40 bits are checked for cyclic redundancy check. If the check is passed, the terminal MS-1 knows the 97th bit. ~ 144 bits form a media access control header. Optionally, the terminal MS-1 determines a starting position of the next packet data unit by using a length field included in the media access control header in the first packet data unit, and if the terminal MS-1 can successfully decode the next packet data unit, The above matching check process is not required. Embodiment 5 FIG. 7 shows a processing device for data burst error according to this embodiment. The device may be disposed at a terminal or may be disposed on a base station, and the device includes: a first decoding module 72 for sequentially Decoding a plurality of packet data units of the received data burst; an obtaining module 74, configured to acquire the next one when the decoding module 72 decodes the media access control header of the current packet data unit without passing through the cyclic redundancy check The starting position of the packet data unit; the second decoding module 76 is configured to decode the next packet data unit by using the starting position acquired by the acquiring module 74. The obtaining module 74 includes at least one of the following a first acquiring unit, configured to acquire a starting position of a next packet data unit according to a length field included in the media access control header; and a second acquiring unit, configured to select a specified bit from the service connection identifier related to the receiving party, where Searching for a field matching the specified bit in the data belonging to the data burst after the media access control header; obtaining a starting position of the next packet data unit according to the location of the found field; and a third obtaining unit, configured to Sending the last N bits as the first header cyclic redundancy check bit, performing cyclic redundancy check on the M bits before the first header cyclic redundancy check bit, and verifying, according to the M bits The information obtains the starting position of the next packet data unit; wherein, N and M are both natural numbers greater than 0; when the M bits fail to pass the cyclic redundancy check, the first head cyclic redundancy-risk bit previous
N个比特作为第二头循环冗余校验比特， 对第二头循环冗余校验比特之前的 M个比特进行循环冗余校 -险， 依次类推， 直至校-险通过。 第四获取单元， 用于将媒体接入控制头后面邻接的 M个比特后的 N个 比特作为首个头循环冗余校验比特， 对 M个比特进行循环冗余校验， 校验通 过， 根据 M个比特中的信息获取下一个分组数据单元的起始位置； 其中， N 和 M均为大于 0的自然数。 该 M个比特未通过循环冗余校 -险，将首个头循环冗余校-险比特之后的 N 个比特作为下一个头循环冗余校-险比特， 对下一个头循环冗余校-险比特之前 的 M个比特进行循环冗余校 -险， 依次类推， 直至校-险通过。 本实施例的装置通过在在数据突发发生错误的情况下， 根据数据突发的 媒体接入控制头的业务连接标识匹配特性或循环冗余校验特性等尽最大可能 地恢复该数据突发后续的分组数据单元， 解决了不能合理高效地利用系统带 宽的问题， 从而提高整个无线通信系统的性能。 以上实施例中的下一个分组数据单元并不局限于与当前分组数据单元紧 邻的分组数据单元， 下一个分组数据单元可以与当前分组数据单元相隔多个 分组数据单元。 从以上的描述中可以看出， 本发明实现了如下技术效果： 以上实施例的 接收方在数据突发发生错误的情况下， 根据数据突发的媒体接入控制头的业 务连接标识匹配特性或循环冗余校验特性等， 尽最大可能地恢复该数据突发 后续的分组数据单元， 以改善频率资源的使用效率， 解决了现有技术中不能 合理高效地利用系统带宽的问题， 从而提高整个无线通信系统的性能， 例如 釆用 LTE、 802.16、 UMB等标准的无线通信系统的性能。 显然， 本领域的技术人员应该明白， 上述的本发明的各模块或各步骤可 以用通用的计算装置来实现， 它们可以集中在单个的计算装置上， 或者分布 在多个计算装置所组成的网络上， 可选地， 它们可以用计算装置可执行的程 序代码来实现， 从而， 可以将它们存储在存储装置中由计算装置来执行， 并 且在某些情况下， 可以以不同于此处的顺序执行所示出或描述的步骤， 或者 将它们分别制作成各个集成电路模块， 或者将它们中的多个模块或步骤制作 成单个集成电路模块来实现。 这样， 本发明不限制于任何特定的硬件和软件 结合。 以上所述仅为本发明的优选实施例而已， 并不用于限制本发明， 对于本 领域的技术人员来说， 本发明可以有各种更改和变化。 凡在本发明的 ^"神和 原则之内， 所作的任何修改、 等同替换、 改进等， 均应包含在本发明的保护 范围之内。 N bits are used as the second header cyclic redundancy check bits, and the M bits before the second header cyclic redundancy check bits are cyclically redundant, and so on, until the school passes. a fourth acquiring unit, configured to use N bits after the M bits adjacent to the media access control head as the first header cyclic redundancy check bit, perform cyclic redundancy check on the M bits, and verify the pass, according to The information in the M bits acquires the starting position of the next packet data unit; where N and M are both natural numbers greater than zero. The M bits do not pass the cyclic redundancy check, and the N bits after the first header cyclic redundancy check risk bit are used as the next head cyclic redundancy check risk bit, and the next head cyclic redundancy check risk The M bits before the bit are cyclically redundant, and so on, until the school passes. The apparatus of this embodiment recovers the data burst as much as possible by the service connection identifier matching characteristic or the cyclic redundancy check characteristic of the medium access control head of the data burst in the case where an error occurs in the data burst. The subsequent packet data unit solves the problem that the system bandwidth cannot be utilized reasonably and efficiently, thereby improving the performance of the entire wireless communication system. The next packet data unit in the above embodiment is not limited to the packet data unit immediately adjacent to the current packet data unit, and the next packet data unit may be separated from the current packet data unit by a plurality of packet data units. As can be seen from the above description, the present invention achieves the following technical effects: The receiver of the above embodiment, in the case of an error in the data burst, according to the service connection identifier matching characteristic of the media access control header of the data burst or Cyclic redundancy check characteristics, etc., to recover the data burst as much as possible Subsequent packet data units are used to improve the efficiency of the use of frequency resources, and solve the problem that the system bandwidth cannot be utilized reasonably and efficiently in the prior art, thereby improving the performance of the entire wireless communication system, for example, using LTE, 802.16, UMB, etc. The performance of wireless communication systems. Obviously, those skilled in the art should understand that the above modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein. The steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps are fabricated as a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software. The above is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the scope of the present invention are intended to be included within the scope of the present invention.

Claims

权 利 要 求 书 Claim
1. 一种数据突发错误的处理方法， 其特征在于， 包括： A method for processing a data burst error, comprising:
接收方依次对接收到的数据突发的多个分组数据单元进行解码； 当解码当前分组数据单元的媒体接入控制头未通过循环冗余校-险 时， 获取下一个分组数据单元的起始位置；  The receiver sequentially decodes the plurality of packet data units of the received data burst; when the media access control header that decodes the current packet data unit fails the cyclic redundancy check, acquires the start of the next packet data unit Location
才艮据所述起始位置对所述下一个分组数据单元进行解码。  The next packet data unit is decoded according to the starting position.
2. 居权利要求 1所述的方法， 其特征在于， 所述获取下一个分组数据单 元的起始位置包括： 2. The method of claim 1, wherein the obtaining a starting location of the next packet data unit comprises:
所述接收方根据所述媒体接入控制头包含的长度字段获取所述下一 个分组数据单元的起始位置。  And the receiving end acquires a starting position of the next packet data unit according to a length field included in the media access control header.
3. 居权利要求 1所述的方法， 其特征在于， 所述获取下一个分组数据单 元的起始位置包括： 3. The method of claim 1, wherein the obtaining a starting location of the next packet data unit comprises:
所述接收方从与所述接收方有关的业务连接标识中选择指定比特， 在所述媒体接入控制头之后且属于所述数据突发的数据中查找与所述指 定比特匹配的字段； 所述接收方 居查找到的字段所在位置获取所述下一个分组数据单 元的起始位置。  The receiving party selects a designated bit from the service connection identifiers related to the receiver, and searches for data matching the specified bit in the data belonging to the data burst after the media access control header; The starting position of the next packet data unit is obtained by the location of the field found by the receiving party.
4. 根据权利要求 3所述的方法， 其特征在于， 所述接收方为终端， 所述业 务连接标识至少包括以下之一： The method according to claim 3, wherein the receiver is a terminal, and the service connection identifier includes at least one of the following:
单播业务连接标识、 组播业务连接标识或广播业务连接标识。  Unicast service connection identifier, multicast service connection identifier, or broadcast service connection identifier.
5. 根据权利要求 3所述的方法， 其特征在于， 所述接收方为基站， 所述业 务连接标识为与指定终端有关的单播业务连接标识。 The method according to claim 3, wherein the receiving party is a base station, and the service connection identifier is a unicast service connection identifier related to the designated terminal.
6. 居权利要求 1所述的方法， 其特征在于， 所述获取下一个分组数据单 元的起始位置包括： 6. The method of claim 1, wherein the obtaining a starting location of the next packet data unit comprises:
所述接收方将所述数据突发的最后 N个比特作为第一头循环冗余校 验比特，对所述第一头循环冗余校验比特之前的 M个比特进行循环冗余 校验； 所述 M个比特通过循环冗余校 -险， 所述接收方 居所述 M个比特 中的信息获取所述下一个分组数据单元的起始位置； The receiving end uses the last N bits of the data burst as a first header cyclic redundancy check bit, and performs cyclic redundancy check on the M bits before the first header cyclic redundancy check bit; The M bits are cyclically redundant, and the receiving party acquires a starting position of the next packet data unit by using information in the M bits;
其中， N和 M均为大于 0的自然数。  Where N and M are both natural numbers greater than zero.
7. 根据权利要求 6所述的方法， 其特征在于， 所述 M个比特未通过循环冗 余校验， 所述方法还包括： 所述接收方将所述第一头循环冗余校验比特 之前的 N个比特作为第二头循环冗余校验比特， 对所述第二头循环冗余 校验比特之前的 M个比特进行循环冗余校验，依次类推，直至校验通过。 The method according to claim 6, wherein the M bits do not pass the cyclic redundancy check, the method further includes: the receiving end of the first header cyclic redundancy check bit The previous N bits are used as the second header cyclic redundancy check bit, and the M bits before the second header cyclic redundancy check bit are subjected to cyclic redundancy check, and so on, until the check passes.
8. 居权利要求 1所述的方法， 其特征在于， 所述获取下一个分组数据单 元的起始位置包括： 8. The method of claim 1, wherein the obtaining a starting location of the next packet data unit comprises:
所述接收方将所述媒体接入控制头后面邻接的 M个比特后的 N个 比特作为首个头循环冗余校-险比特， 对所述 M 个比特进行循环冗余校 验；  The receiving end uses the N bits after the M bits adjacent to the media access control head as the first header cyclic redundancy risk bit, and performs cyclic redundancy check on the M bits;
所述 M个比特通过循环冗余校 -险， 所述接收方 居所述 M个比特 中的信息获取所述下一个分组数据单元的起始位置；  And the M bits are obtained by cyclic redundancy, and the receiving information of the M bits acquires a starting position of the next packet data unit;
其中， N和 M均为大于 0的自然数。  Where N and M are both natural numbers greater than zero.
9. 根据权利要求 8所述的方法， 其特征在于， 所述 M个比特未通过循环冗 余校验， 所述方法还包括： 所述接收方将所述首个头循环冗余校验比特 之后的 N个比特作为下一个头循环冗余校-险比特， 对所述下一个头循环 冗余校验比特之前的 M个比特进行循环冗余校验， 依次类推， 直至校验 通过。 The method according to claim 8, wherein the M bits do not pass the cyclic redundancy check, the method further includes: the receiving end, after the first header cyclically repeats the parity check bit The N bits are used as the next header cyclic redundancy risk bit, and the M bits before the next header cyclic redundancy check bit are subjected to cyclic redundancy check, and so on, until the check passes.
10. —种数据突发错误的处理装置， 其特征在于， 包括： 10. A processing device for data burst error, comprising:
第一解码模块， 用于依次对接收到的数据突发的多个分组数据单元 进行解码；  a first decoding module, configured to sequentially decode a plurality of packet data units of the received data burst;
获取模块， 用于当所述解码模块解码当前分组数据单元的媒体接入 控制头未通过循环冗余校验时， 获取下一个分组数据单元的起始位置； 第二解码模块， 用于 -据所述获取模块获取的起始位置对所述下一 个分组数据单元进行解码。 An acquiring module, configured to: when the decoding module that the decoding module decodes the current packet data unit fails the cyclic redundancy check, acquire a starting position of the next packet data unit; and the second decoding module is configured to: The starting position acquired by the acquiring module decodes the next packet data unit.
11. 根据权利要求 10所述的装置， 其特征在于， 所述获取模块包括： 第一获取单元， 用于根据所述媒体接入控制头包含的长度字段获取 所述下一个分组数据单元的起始位置。 The device according to claim 10, wherein the acquiring module comprises: a first acquiring unit, configured to acquire, according to a length field included in the media access control header, the next packet data unit Starting position.
12. 根据权利要求 10所述的装置， 其特征在于， 所述获取模块包括： The device according to claim 10, wherein the acquiring module comprises:
第二获取单元， 用于从与所述接收方有关的业务连接标识中选择指 定比特， 在所述媒体接入控制头之后且属于所述数据突发的数据中查找 与所述指定比特匹配的字段； 根据查找到的字段所在位置获取所述下一 个分组数据单元的起始位置。  a second acquiring unit, configured to select a specified bit from a service connection identifier related to the receiver, and search for data that matches the specified bit in the data that belongs to the data burst after the media access control header Field; obtain the starting position of the next packet data unit according to the location of the found field.
13. 根据权利要求 10所述的装置， 其特征在于， 所述获取模块包括： The device according to claim 10, wherein the acquiring module comprises:
第三获取单元， 用于将所述数据突发的最后 N个比特作为第一头循 环冗余校验比特，对所述第一头循环冗余校验比特之前的 M个比特进行 循环冗余校验， 校验通过， 根据所述 M个比特中的信息获取所述下一个 分组数据单元的起始位置； 其中， N和 M均为大于 0的自然数。  a third acquiring unit, configured to use a last N bits of the data burst as a first header cyclic redundancy check bit, and perform cyclic redundancy on M bits before the first header cyclic redundancy check bit Checking, verifying, obtaining a starting position of the next packet data unit according to information in the M bits; wherein, N and M are both natural numbers greater than zero.
14. 根据权利要求 10所述的装置， 其特征在于， 所述获取模块包括： The device according to claim 10, wherein the acquiring module comprises:
第四获取单元，用于将所述媒体接入控制头后面邻接的 M个比特后 的 N个比特作为首个头循环冗余校-险比特， 对所述 M个比特进行循环 冗余校验， 校验通过， 根据所述 M个比特中的信息获取所述下一个分组 数据单元的起始位置； 其中， N和 M均为大于 0的自然数。  a fourth acquiring unit, configured to use, as the first header cyclic redundancy-risk bit, the N bits after the M bits adjacent to the media access control head, and perform cyclic redundancy check on the M bits, And verifying, obtaining a starting position of the next packet data unit according to information in the M bits; wherein, N and M are both natural numbers greater than 0.
PCT/CN2010/077963 2010-06-23 2010-10-21 Method and device for handling data burst error WO2011160369A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2010102068161A CN102299758A (en) 2010-06-23 2010-06-23 Method and device for processing data burst error
CN201010206816.1 2010-06-23

Publications (1)

Publication Number Publication Date
WO2011160369A1 true WO2011160369A1 (en) 2011-12-29

Family

ID=45359951

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/077963 WO2011160369A1 (en) 2010-06-23 2010-10-21 Method and device for handling data burst error

Country Status (2)

Country Link
CN (1) CN102299758A (en)
WO (1) WO2011160369A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106850135A (en) * 2016-12-31 2017-06-13 华为技术有限公司 A kind of transmission method of interface data, data transmission interface and interface system

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109379084B (en) * 2018-09-08 2021-09-17 天津大学 Decoding method for burst errors

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7280478B2 (en) * 2001-11-27 2007-10-09 Information And Communications University Educational Foundation Control packet structure and method for generating a data burst in optical burst switching networks
CN101742557A (en) * 2009-10-30 2010-06-16 中兴通讯股份有限公司 Device and method for parsing protocol data unit

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7280478B2 (en) * 2001-11-27 2007-10-09 Information And Communications University Educational Foundation Control packet structure and method for generating a data burst in optical burst switching networks
CN101742557A (en) * 2009-10-30 2010-06-16 中兴通讯股份有限公司 Device and method for parsing protocol data unit

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106850135A (en) * 2016-12-31 2017-06-13 华为技术有限公司 A kind of transmission method of interface data, data transmission interface and interface system
CN106850135B (en) * 2016-12-31 2020-04-14 华为技术有限公司 Interface data transmission method, data transmission interface and interface system

Also Published As

Publication number Publication date
CN102299758A (en) 2011-12-28

Similar Documents

Publication Publication Date Title
CN106301710B (en) Hybrid automatic repeat request (H-ARQ) for wireless local area network
RU2549518C2 (en) Apparatus for transmitting medium access control protocol data unit (mac pdu) with fragmentation and packing extended header and method thereof
US8004992B2 (en) Adding hybrid ARQ to WLAN protocols with MAC based feedback
CN102144369B (en) Apparatus and method for generating MAC protocol data unit in wireless communication system
US8730878B2 (en) Power and resource efficient APPDU based approach with scheduled block ACKS for WLAN
JP2012517780A (en) Method and apparatus for notifying successful reception of data transmission for multiple access compatibility in a wireless communication system
KR20110079619A (en) Effective utilization of header space for error correction in aggregate frames
CN100576820C (en) The mac header that uses with the frame set compresses
WO2012151976A1 (en) Method and device for judging error detection
US20220368494A1 (en) Uplink re-transmission with compact memory usage
EP2137863A1 (en) Multiple packet source acknowledgement
CN103607264A (en) 3G network-based in-band data transmission method
US11271686B2 (en) Hybrid automatic repeat request acknowledgement and upload multiuser operation
CN109756307A (en) Data repeating method and device
WO2011160369A1 (en) Method and device for handling data burst error
WO2022228467A1 (en) Data transmission method and apparatus, and readable storage medium
KR101605323B1 (en) Method for transmitting and receiving Data using Random Linear Coding
US11671214B2 (en) Wireless communication apparatus, method, and wireless communication system
Bhatia et al. Review on variants of network coding in wireless ad-hoc networks
WO2015077960A1 (en) Transmission method and device for data packet
JP7318033B2 (en) Wireless communication device and wireless communication method
WO2022050019A1 (en) Information processing device and decoding method
WO2023046029A1 (en) Data transmission method and apparatus, and readable storage medium
KR20100083747A (en) Efficient mac header design and communication using the same
WO2019001517A1 (en) Method for repeated transmission and terminal device

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: 10853508

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 10853508

Country of ref document: EP

Kind code of ref document: A1