WO2011160369A1 - Procédé et dispositif de traitement d'erreur de paquet de données - Google Patents

Procédé et dispositif de traitement d'erreur de paquet de données 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
English (en)
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/fr

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.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

La présente invention porte sur un procédé et un dispositif de traitement d'une erreur de paquet de données. Le procédé comprend les opérations suivantes : un côté réception décode de multiples unités de données de paquet d'un paquet de données reçu tour à tour, obtient la position de début de l'unité de données de paquet suivante lorsque le décodage d'un en-tête de commande d'accès au support dans l'unité de données de paquet présente échoue dans un contrôle de redondance cyclique, et décode l'unité de données de paquet suivante conformément à la position de début. Selon la présente invention, le problème selon lequel la bande passante du système ne peut pas être efficacement utilisée est résolu, et en conséquence les performances du système de radiocommunication entier sont améliorées.
PCT/CN2010/077963 2010-06-23 2010-10-21 Procédé et dispositif de traitement d'erreur de paquet de données WO2011160369A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2010102068161A CN102299758A (zh) 2010-06-23 2010-06-23 数据突发错误的处理方法和装置
CN201010206816.1 2010-06-23

Publications (1)

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

Family

ID=45359951

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/077963 WO2011160369A1 (fr) 2010-06-23 2010-10-21 Procédé et dispositif de traitement d'erreur de paquet de données

Country Status (2)

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

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106850135A (zh) * 2016-12-31 2017-06-13 华为技术有限公司 一种接口数据的传输方法、数据传输接口和接口系统

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109379084B (zh) * 2018-09-08 2021-09-17 天津大学 一种针对突发错误的译码方法

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 (zh) * 2009-10-30 2010-06-16 中兴通讯股份有限公司 一种解析协议数据单元的装置及方法

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 (zh) * 2009-10-30 2010-06-16 中兴通讯股份有限公司 一种解析协议数据单元的装置及方法

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106850135A (zh) * 2016-12-31 2017-06-13 华为技术有限公司 一种接口数据的传输方法、数据传输接口和接口系统
CN106850135B (zh) * 2016-12-31 2020-04-14 华为技术有限公司 一种接口数据的传输方法、数据传输接口和接口系统

Also Published As

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

Similar Documents

Publication Publication Date Title
CN106301710B (zh) 无线局域网的混合自动重传请求（h-arq）
RU2549518C2 (ru) Устройство для передачи блока протокольных данных уровня управления доступом к среде "mac pdu" с расширенным заголовком фрагментации и объединения и соответствующий способ
US8004992B2 (en) Adding hybrid ARQ to WLAN protocols with MAC based feedback
CN102144369B (zh) 在无线通信系统中产生媒体访问控制协议数据单元的装置及方法
US8730878B2 (en) Power and resource efficient APPDU based approach with scheduled block ACKS for WLAN
JP2012517780A (ja) 無線通信システムにおける多元接続互換性のためのデータ送信の受信成功を通知する方法および装置
KR20110079619A (ko) 집합 프레임들에서 에러 교정을 위한 헤더 공간의 효과적 활용
CN100576820C (zh) 与帧集合一起使用的mac报头压缩
WO2012151976A1 (fr) Procédé et dispositif permettant de déterminer une détection d'erreur
US20220368494A1 (en) Uplink re-transmission with compact memory usage
WO2008127164A1 (fr) Reconnaissance d'une source de paquets multiples
CN103607264A (zh) 基于3g网络的带内数据传输方法
US11271686B2 (en) Hybrid automatic repeat request acknowledgement and upload multiuser operation
CN109756307A (zh) 数据重传方法及装置
WO2011160369A1 (fr) Procédé et dispositif de traitement d'erreur de paquet de données
WO2022228467A1 (fr) Procédé et appareil de transmission de données, et support de stockage lisible
KR101605323B1 (ko) 랜덤선형부호화를 사용한 데이터 송수신 방법
US11671214B2 (en) Wireless communication apparatus, method, and wireless communication system
Bhatia et al. Review on variants of network coding in wireless ad-hoc networks
JP7318033B2 (ja) 無線通信装置および無線通信方法
WO2015077960A1 (fr) Procédé et dispositif de transmission de paquet de données
WO2022050019A1 (fr) Dispositif de traitement d'informations et procédé de décodage
WO2023046029A1 (fr) Procédé et appareil de transmission de données et support de stockage lisible
KR20100083747A (ko) 효율적인 ｍａｃ 헤더 설계 및 이를 이용한 통신
WO2019001517A1 (fr) Procédé de transmission répétée et dispositif terminal

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