EP2191601B1 - Extraction de valeurs à partir de paquets de données partiellement corrompus - Google Patents

Extraction de valeurs à partir de paquets de données partiellement corrompus Download PDF

Info

Publication number
EP2191601B1
EP2191601B1 EP07854448.3A EP07854448A EP2191601B1 EP 2191601 B1 EP2191601 B1 EP 2191601B1 EP 07854448 A EP07854448 A EP 07854448A EP 2191601 B1 EP2191601 B1 EP 2191601B1
Authority
EP
European Patent Office
Prior art keywords
current
valid
relationship
data packet
counter
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Not-in-force
Application number
EP07854448.3A
Other languages
German (de)
English (en)
Other versions
EP2191601A1 (fr
Inventor
Assaf Landschaft
Ronen Shevach
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Avago Technologies International Sales Pte Ltd
Original Assignee
Agere Systems LLC
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 Agere Systems LLC filed Critical Agere Systems LLC
Publication of EP2191601A1 publication Critical patent/EP2191601A1/fr
Application granted granted Critical
Publication of EP2191601B1 publication Critical patent/EP2191601B1/fr
Not-in-force legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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/0045—Arrangements at the receiver end
    • 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/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1829—Arrangements specially adapted for the receiver end

Definitions

  • the present invention relates to digital communication systems, and more particularly to packet-based digital communication systems.
  • a communication system has a transmitter that sends data to a receiver.
  • the transmitter encapsulates the digital data for transmission in data packets.
  • a typical data packet comprises (i) a payload section that contains payload data, i.e., data for transmission to the receiver and (ii) a header section that contains routing and other useful information regarding the payload data.
  • payload data i.e., data for transmission to the receiver
  • header section a header section that contains routing and other useful information regarding the payload data.
  • the term “header” refers to data in a data packet that is not the payload data, wherein the header data may be located before and/or after the payload data in the data packet.
  • the term “header” also encompasses footers.
  • the payload data may itself comprise smaller data packets, each with its own payload section and header.
  • CRC cyclic redundancy check
  • CRC generation by the transmitter, involves calculating a number, called a checksum, also known as parity bits, based on a payload section, and appending that checksum to the payload section for transmission to the receiver.
  • CRC checking by a receiver, involves calculating a checksum based on the received payload section and comparing that receiver-calculated checksum to the appended checksum, and if the two checksums do not match, then determining that a transmission error has occurred. Numerous algorithms for generating a checksum for a data packet exist.
  • the receiver can request the transmitter to retransmit the affected data packet.
  • Retransmissions reduce the overall throughput of the communication system, and systems and methods that reduce the number of retransmissions necessitated by corrupted data packets are useful.
  • Jiang teaches several methods of error correction in packet-based communication networks using data consistency checks.
  • Jiang teaches the following error-correction process.
  • a technique that, for example, performs a cyclic redundancy check (CRC), is used to detect whether there is data corruption.
  • CRC cyclic redundancy check
  • a consistency check is performed.
  • One example provided by Jiang of a consistency check uses the incremental sequence numbers and retry parameters of two consecutive packets.
  • An inconsistency is detected if either (1) the identification parameters are identical for current and previous packets, and the retry parameter for the current packet indicates it is not a retransmission or (2) the identification parameters for the current and previous packets are not the same, and the retry parameter for the current packet indicates it is a retransmission. If either set of conditions exists, then either the retry parameter in the current packet or the identification parameter in either the current or previous packets has been corrupted. A correction should then be made. Jiang then goes on to discuss which parameter is most likely to be the source of corruption and in need of correction.
  • the invention provides a method for processing data packets in a receiver in a communication network according to claim 1.
  • the invention provides a receiver for processing data packets in a communication network according to claim 11.
  • 3G mobile telephony communication devices also known as 3G mobile phones.
  • Third-generation mobile phones use digital radio signals for communication with cell towers, also known as base stations.
  • a mobile phone is also known as a user equipment (UE), while a base station is also known as a Node-B.
  • a Node-B is part of the Universal Mobile Telecommunications System (UMTS) Terrestrial Radio Access Network (UTRAN).
  • UMTS Universal Mobile Telecommunications System
  • UTRAN Universal Mobile Telecommunications System
  • Third-generation mobile phones are able to simultaneously transfer multiple data streams, such as voice, e-mail, instant messages, and streaming audio or video.
  • Third-generation mobile phones additionally allow for high rates of data transfers and broadband capabilities.
  • the high rates of data transfers rely on efficient organization and transmission of data to and from the applications running on a mobile phone.
  • the organization and transmission of data is defined by protocols and standards.
  • Third-generation mobile phone standards are set by the Third Generation Partnership Project (3GPP) and are based on UMTS network technology, which evolved from Global System for Mobile Communication (GSM) network technology.
  • the 3GPP organization comprises several Technical Specification Groups (TSGs), each responsible for a particular area of third-generation technology.
  • TSGs Technical Specification Groups
  • One way to categorize 3G technology is by communication layers and protocols.
  • the 3G protocol stack includes at least three layers: (i) layer 1, also known as the physical layer, (ii) layer 2, also known as the data link layer, and (iii) layer 3, also known as the network layer.
  • the physical layer handles communication between the mobile phone and a base station, the data link layer interfaces between the physical and network layers, and the network layer handles communication with applications on the mobile phone.
  • Layer 1 architecture and design is specified by Working Group 1 (WG1) of the Radio Access Network (RAN) TSG.
  • WG1 Working Group 1
  • RAN Radio Access Network
  • the technical specifications (TS) provided by the RAN TSG working groups are periodically updated and multiple releases are published, including in conjunction with new releases of the 3GPP standard.
  • Layer 2 and layer 3 architecture and design are regulated by Working Group 2 (WG2) of the RAN TSG, which is in charge of the radio interface architecture and protocols (Media Access Control (MAC), Radio Link Control (RLC), Packet Data Convergence Protocol (PDCP)), the specification of the Radio Resource Control (RRC) protocol, the strategies of radio resource management, and the services provided by the physical layer to the upper layers.
  • the MAC protocol specifies, among other things, (i) communication channels and (ii) protocol data units (PDUs), formats, and parameters, for communication between the physical layer and the RLC layer of a mobile phone.
  • PDUs protocol data units
  • FIG. 1 shows a simplified partial block diagram of the 3G protocol stack in an exemplary UE.
  • the various communication paths shown can be direct or indirect and can include intermediary elements that are not shown in the figure or described herein.
  • Layer 1 comprises physical layer 101 , which communicates with an antenna (not shown) via path 101a and with layer 2 via path 102b .
  • Path 102b comprises signaling and transport channels.
  • Transport channels are data flows between the data link layer and the physical layer. Data in the transport channels is organized into packets.
  • Outgoing transport channels can be combined onto composite transport channels for radio transmission between a mobile phone and a base station using physical layer 101 .
  • Layer 2 comprises Media Access Control (MAC) layer 102 and Radio Link Control (RLC) layer 103 , which communicate via path 102a , wherein path 102a comprises logical channels.
  • Logical channels are data flows within layer 2 associated with applications running on the mobile phone. The data flows are organized into packets in the logic channels.
  • Layer 3 includes Radio Resource Controller (RRC) entity 104 , which controls and communicates with physical layer 101 , MAC layer 102 , and RLC layer 103 via paths 104b , 104c , and 104d , respectively.
  • RRC 104 communicates with applications running on the mobile phone via path 104a.
  • RLC layer 103 can also communicate with applications running on the mobile phone via path 103a , either directly or through intermediary entities (not shown) in layer 3.
  • Control channels are used for the transfer of control-plane information.
  • Control channels include the broadcast control channel (BCCH), paging control channel (PCCH), dedicated control channel (DCCH), and common control channel (CCCH).
  • the BCCH is used by a Node-B to broadcast system control information to UEs in the Node-B's cell.
  • the system control information includes parameters that allow a UE to identify and access the Node-B.
  • the BCCH logical channel is mapped onto the broadcast channel (BCH) transport channel (TCH).
  • BCH is a downlink broadcast channel used to transmit system and cell information over the entire cell.
  • the BCH is in turn mapped onto the primary common control physical channel (P-CCPCH).
  • a BCCH communication frame, or data packet comprises approximately 244 data bits and 16 CRC bits, and is broadcast every two frames, i.e. , every 20ms.
  • the BCCH data packet includes a cell system frame number (SFN), which is a 12-bit counter used as a timing reference for devices within a cell.
  • SFN cell system frame number
  • the SFN increases by two with every consecutive BCCH data packet.
  • the SFN is important for frame identification, which is used in operations such as those occurring in handover situations, wherein communication with the UE is handed over from one Node-B to another, e.g ., where the UE moves from one cell to another.
  • Frame identification is also useful for operations involving sleep mode. For certain applications on the UE, such as an application involved with handover, only the SFN portion of a BCCH data packet is necessary. If the UE receives, for the handover application, a BCCH data packet that fails a CRC check, then rather than discarding the entire data packet and requesting a retransmission, the UE performs a procedure to determine, with a high degree of certainty, the SFN of the BCCH data packet.
  • the procedure uses the fact that, as described above, the relationship between the SFN of a current data packet and the SFN of the preceding data packet is defined and known. Thus, if a correct SFN is determined for a data packet, then the correct SFNs for previous and subsequent data packets can be determined using the defined and known relationship.
  • FIG. 2 shows flow chart 201 for a procedure in accordance with one embodiment of the present invention.
  • the procedure starts with setting, initializing, and/or receiving variables and constant values needed for the procedure (step 202 ).
  • Variables include an iterations counter, a valid-relationship counter, and a previous first-portion value. These variables are initialized to nil or zero, as appropriate.
  • Constant values include a maximum iterations number and correct-relationship threshold. The maximum iterations number determines the maximum number of data packets the procedure will go through before effectively giving up and determining that a correct SFN value cannot be recovered with sufficient confidence.
  • the constant values may be predetermined, or may be determined dynamically by the procedure, such as by receipt from another entity.
  • step 203 it is determined whether the maximum number of iterations has been reached. For normal operation, the maximum number of iterations should be set to a positive integer. If the maximum number of iterations has been reached, which should not be the case on the first iteration, then the procedure provides an indication that a correct SFN value was not found (step 204 ). Otherwise, the iterations counter is incremented by one (step 205 ).
  • a new data packet is then received, wherein the data packet comprises a first portion, a second portion, and a checksum (step 206 ).
  • the first portion is the SFN section
  • the second portion is the rest of the user-data portion of the data packet.
  • a CRC check is performed on the data packet (step 207 ), and it is determined whether the data packet passes the CRC check (step 208 ), i . e ., whether the receiver-calculated checksum matches the received checksum. If the data packet passes the CRC check, then it is determined that the data packet contains no transmission errors, and the first portion, i.e. , the SFN, is returned as the result of the procedure (step 209 ).
  • step 210 it is determined whether this is the first iteration of the procedure. If it is the first iteration of the procedure, then the previous first-portion variable is set to the current data packet's first portion (step 211 ), so that it can be used in the next iteration, and the procedure returns to step 203 . If it is not the first iteration, i . e ., if this data packet and one or more consecutive preceding data packet failed their corresponding CRC checks, then it is determined whether the current first portion is related to the previous first portion in the manner specified by the known and defined relationship, i . e ., whether their relationship is valid (step 212 ).
  • step 213 If the relationship between the current first portion and the previous first portion is not valid, then the valid-relationship counter is set to zero (step 213 ), the previous first-portion variable is set to the current data packet's first portion (step 211 ), and the procedure returns to step 203 .
  • the verb "set" and its variants refer to ensuring a particular result and not a process, and thus, do not require a specific active step, therefore, e.g ., if the valid-relationship counter is already at zero, then step 213 can comprise doing nothing more than moving the procedure to step 211 .
  • the valid-relationship counter is incremented by one (step 214 ). Then, it is determined whether the valid-relationship counter threshold has been reached (step 215 ). If the valid-relationship counter threshold has been reached, then the procedure returns the current first portion as the procedure result (step 216 ). If the valid-relationship counter threshold has not yet been reached, then the previous first-portion variable is set to the current data packet's first portion (step 211 ), and the procedure returns to step 203 .
  • the probability that a 12-bit SFN has one or more erroneous bits is 1 - (0.99) ⁇ 12, or approximately 11%.
  • the probability that a 244-bit data packet has one or more erroneous bits is 1 - (0.99) ⁇ 244, or approximately 91%.
  • FIG. 3 shows receiver 300 comprising memory 301 and processor 302 , which are connected via path 301a .
  • Memory 301 is adapted to contain at least a current data packet and a first portion of a previous data packet.
  • Processor 302 is adapted to perform CRC checks on data packets, determine whether a valid relationship exists between a current first portion and a previous first portion, and perform other processing and control functions as necessary.
  • Receiver 300 comprises additional components and connections (not shown) that perform additional functions.
  • steps in the procedure can be re-arranged, combined, and/or otherwise modified while remaining within the scope of the present invention.
  • the steps of (i) receiving a new data packet, (ii) performing a CRC check, (iii) determining if the data packet passes, and (iv) if so, then returning the SFN are performed first, before the steps of (i) determining whether the maximum number of iterations has been reached, and (ii) if not, then increasing the iterations counter by one.
  • a 260-bit data packet including (i) a 244-bit user-data payload section including a 12-bit SFN as the first portion and (ii) a 16-bit checksum.
  • Alternative embodiments comprise data packets, first portions, second portions, and checksums of different sizes.
  • Alternative embodiments comprise data packets that do not include an SFN field.
  • first-portion value and a previous first-portion value is an increase by two.
  • relationship between the first portions of two consecutive data packets is defined differently.
  • relationship between the first portions of two consecutive data packets is that the first portions are substantially the same.
  • One embodiment of the present invention has been described wherein it is determined whether a valid relationship exists between a current first portion and a previous first portion. It should be noted that if a valid relationship exists between the current first portion and a previous first portion and a valid relationship exists between the previous first portion and one or more additional previous first portions, then a valid one-to-many relationship also exists between the current first portion and the set of (i) the previous first portion and (ii) the one or more additional first portions. For example, if the valid-relationship counter is at three, indicating that the current first portion is the fourth in a series of first portions that have valid relationships between them, then there is a valid relationship between the current first portion and all three of those first portions.
  • a set number of first portions are cached and it is determined whether there is a valid relationship between the current first portion and those first portions. With every new iteration of the method, the cache is updated to include last current first portion and remove the oldest first portion.
  • the relationship between a current data packet and the preceding data packet is dynamically determined rather than being preset.
  • the entity executing a procedure in accordance with an embodiment of the present invention receives one or more parameters that define the correct relationship between a first portion of a first data packet and a first portion of a subsequent data packet.
  • no maximum number of iterations is set for the procedure.
  • the procedure could be terminated by other means, such as an interrupt from another entity or a time limit.
  • Exemplary embodiments have been described with data flows between entities in particular directions. Such data flows do not preclude data flows in the reverse direction on the same path or on alternative paths that have not been shown or described. Paths that have been drawn as bidirectional do not have to be used to pass data in both directions.
  • mobile phones refers generically to mobile wireless telephony communication devices, and includes mobile communication devices that function as telephones, as well as mobile communication devices that do not necessarily function as telephones, e.g ., a mobile device that transmits instant messages and downloads streaming audio, but is not adapted to be held up to a user's head for telephonic conversation.
  • the term "compatible" means that the element communicates with other elements in a manner wholly or partially specified by the standard, and would be recognized by other elements as sufficiently capable of communicating with the other elements in the manner specified by the standard.
  • the compatible element does not need to operate internally in a manner specified by the standard.
  • the terms "receive" and its variants can refer to receipt of the actual data, or the receipt of one or more pointers to the actual data, wherein the receiving entity can access the actual data using the one or more pointers.
  • the present invention may be implemented as circuit-based processes, including possible implementation as a single integrated circuit (such as an ASIC or an FPGA), a multi-chip module, a single card, or a multi-card circuit pack.
  • a single integrated circuit such as an ASIC or an FPGA
  • a multi-chip module such as a single card, or a multi-card circuit pack.
  • various functions of circuit elements may also be implemented as processing steps in a software program.
  • Such software may be employed in, for example, a digital signal processor, micro-controller, or general-purpose computer.

Claims (14)

  1. Procédé de traitement de paquets de données dans un récepteur au sein d'un réseau de communications, le procédé comportant :
    a) de recevoir un paquet de données actuel (206) comportant une somme de contrôle actuelle, une première partie actuelle et une seconde partie actuelle qui est séparée de la première partie ; et
    b) de déterminer si le paquet de données actuel passe ou échoue à une vérification (207) par contrôle de redondance cyclique CRC utilisant la première partie actuelle, la seconde partie actuelle et la somme de contrôle actuelle ;
    c) s'il est déterminé que le paquet de données actuel a échoué à la vérification CRC, alors :
    c1) de déterminer si la première partie actuelle présente une relation valable avec une ou plusieurs premières parties précédentes d'un ou plusieurs paquets de données précédents (212) ; et
    c2) s'il est déterminé que la première partie actuelle présente la relation valable, d'émettre en sortie la première partie actuelle et de ne pas émettre en sortie la seconde partie actuelle (216).
  2. Procédé selon la revendication 1, comportant en outre :
    d) s'il est déterminé que le paquet de données actuel a passé la vérification CRC, d'émettre en sortie la première partie actuelle (209).
  3. Procédé selon la revendication 1, dans lequel le procédé est utilisé lors du transfert entre cellules d'un dispositif de communications mobile d'une première station de base vers une seconde station de base du réseau de communications mobile.
  4. Procédé selon la revendication 1, dans lequel l'étape c1) détermine que la première partie actuelle présente la relation valable avec deux ou plus premières parties précédentes.
  5. Procédé selon la revendication 1, dans lequel :
    le réseau de communications est un réseau 3G et le récepteur fait partie d'un réseau 3G compatible UE.
  6. Procédé selon la revendication 5, dans lequel :
    le paquet de données est un paquet de données de canal de contrôle de diffusion (BCCH) ; et la première partie est un numéro de trame de système SFN, qui est un compteur utilisé en tant que référence de calage pour des dispositifs au sein d'une cellule.
  7. Procédé selon la revendication 1, dans lequel l'étape c1) comporte en outre de mettre à jour un compteur de relations-valables, dans lequel :
    s'il est déterminé que la première partie actuelle présente la relation valable, l'on incrémente le compteur de relations-valables (214) ; et
    s'il est déterminé que la première partie actuelle ne présente pas la relation valable, l'on réinitialise le compteur de relations-valables (213).
  8. Procédé selon la revendication 7, dans lequel l'étape c2) comporte :
    s'il est déterminé que le compteur de relations-valables a atteint un seuil du compteur de relations-valables, d'émettre en sortie la première partie actuelle ; et
    s'il est déterminé que le compteur de relations-valables n'a pas atteint le seuil du compteur de relations-valables, de mettre à jour une cache d'un ou plusieurs premières parties précédentes pour comporter la première partie actuelle et de répéter les étapes de a) à c) pour un nouveau paquet de données.
  9. Procédé selon la revendication 1, comportant en outre :
    d'incrémenter un compteur d'itérations à réception du paquet de données actuel ; et de terminer le procédé sans émettre en sortie la première partie actuelle (204), s'il est déterminé que le compteur d'itérations a atteint un nombre maximum-itérations.
  10. Procédé selon la revendication 9, comportant en outre de mettre à jour une cache d'une ou plusieurs premières parties précédentes pour comporter la première partie actuelle et de répéter les étapes de a) à c) pour un nouveau paquet de données, si le compteur d'itérations n'a pas atteint le nombre maximum-itérations.
  11. Récepteur (300) pour le traitement de paquets de données au sein d'un réseau de communications, le récepteur comportant :
    a) une mémoire (301) apte à stocker une première partie précédente d'un paquet de données précédent et d'un paquet de données actuel, dans lequel le paquet de données actuel comporte une somme de contrôle actuelle, une première partie actuelle et une seconde partie actuelle qui est séparée de la première partie ; et
    b) un processeur (302) apte à :
    déterminer si le paquet de données actuel passe ou échoue à une vérification CRC utilisant la première partie actuelle, la seconde partie actuelle et la somme de contrôle actuelle ;
    le processeur étant en outre apte à émettre en sortie la première partie actuelle et à ne pas émettre en sortie la seconde partie, s'il est déterminé que le paquet de données actuel échoue à la vérification CRC
    et s'il est déterminé que la première partie actuelle présente une relation valable avec une ou plusieurs premières parties précédentes.
  12. Récepteur selon la revendication 11, dans lequel le processeur est en outre apte à émettre en sortie la première partie actuelle s'il est déterminé que le paquet de données actuel passe la vérification CRC.
  13. Récepteur selon la revendication 11, dans lequel le processeur est apte à déterminer si la première partie actuelle présente la relation valable avec deux ou plus premières parties précédentes.
  14. Récepteur selon la revendication 11, dans lequel :
    le récepteur comporte en outre un compteur de relations-valables ;
    le processeur est apte en outre à mettre à jour le compteur de relations-valables, dans lequel :
    s'il est déterminé que la première partie actuelle présente la relation valable, l'on incrémente le compteur de relations-valables ; et
    s'il est déterminé que la première partie actuelle ne présente pas la relation valable, l'on réinitialise le compteur de relations-valables.
EP07854448.3A 2007-10-26 2007-10-26 Extraction de valeurs à partir de paquets de données partiellement corrompus Not-in-force EP2191601B1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/US2007/082682 WO2009054856A1 (fr) 2007-10-26 2007-10-26 Extraction de valeurs à partir de paquets de données partiellement corrompus

Publications (2)

Publication Number Publication Date
EP2191601A1 EP2191601A1 (fr) 2010-06-02
EP2191601B1 true EP2191601B1 (fr) 2015-08-19

Family

ID=39673476

Family Applications (1)

Application Number Title Priority Date Filing Date
EP07854448.3A Not-in-force EP2191601B1 (fr) 2007-10-26 2007-10-26 Extraction de valeurs à partir de paquets de données partiellement corrompus

Country Status (5)

Country Link
US (1) US8352830B2 (fr)
EP (1) EP2191601B1 (fr)
JP (1) JP5461414B2 (fr)
KR (1) KR101297065B1 (fr)
WO (1) WO2009054856A1 (fr)

Families Citing this family (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8467480B2 (en) * 2009-09-14 2013-06-18 Qualcomm Incorporated Combining decision metrics for decoding based on payload difference
GB2478759A (en) 2010-03-17 2011-09-21 3M Innovative Properties Co A powered air purifying respirator
US8660063B2 (en) * 2010-07-23 2014-02-25 Intel Corporation Method and apparatus for cell detection in a wireless communication system
US9075736B2 (en) * 2013-01-07 2015-07-07 Qualcomm Incorporated Additional error protection for wireless transmission
US9787434B2 (en) * 2014-12-11 2017-10-10 Mediatek Inc. Cyclic redundancy check device and method
US10530523B2 (en) 2017-11-20 2020-01-07 International Business Machines Corporation Dynamically adjustable cyclic redundancy code rates
US10541782B2 (en) 2017-11-20 2020-01-21 International Business Machines Corporation Use of a cyclic redundancy code multiple-input shift register to provide early warning and fail detection
US10530396B2 (en) 2017-11-20 2020-01-07 International Business Machines Corporation Dynamically adjustable cyclic redundancy code types
US10409680B1 (en) 2018-05-24 2019-09-10 Micron Technology, Inc. Progressive length error control code
US11088784B1 (en) 2020-12-24 2021-08-10 Aira Technologies, Inc. Systems and methods for utilizing dynamic codes with neural networks
US11483109B2 (en) 2020-12-28 2022-10-25 Aira Technologies, Inc. Systems and methods for multi-device communication
US11368250B1 (en) 2020-12-28 2022-06-21 Aira Technologies, Inc. Adaptive payload extraction and retransmission in wireless data communications with error aggregations
US11575469B2 (en) 2020-12-28 2023-02-07 Aira Technologies, Inc. Multi-bit feedback protocol systems and methods
US20220291955A1 (en) 2021-03-09 2022-09-15 Intel Corporation Asynchronous input dependency resolution mechanism
US11489623B2 (en) 2021-03-15 2022-11-01 Aira Technologies, Inc. Error correction in network packets
US11496242B2 (en) 2021-03-15 2022-11-08 Aira Technologies, Inc. Fast cyclic redundancy check: utilizing linearity of cyclic redundancy check for accelerating correction of corrupted network packets

Family Cites Families (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH11186994A (ja) * 1997-12-18 1999-07-09 Matsushita Electric Ind Co Ltd Ａｒｑ通信方法およびａｒｑ通信装置
JP3864326B2 (ja) * 1998-08-19 2006-12-27 富士通株式会社 ハンドオーバ方法，基地局，移動局及び移動通信システム
US6446235B1 (en) * 1999-08-31 2002-09-03 Intel Corporation Cumulative error detecting code
US6964008B1 (en) * 1999-11-12 2005-11-08 Maxtor Corporation Data checksum method and apparatus
KR20020019334A (ko) * 2000-09-05 2002-03-12 박종섭 비동기식 무선통신 시스템에서의 하이브리드 자동재전송요구 2/3 방식 적용 방법과 그의 성능 향상을 위한에러 처리 방법
FI112995B (fi) * 2001-01-16 2004-02-13 Nokia Corp Virheellisen datan käsittely pakettivälitteistä tiedonsiirtoa tarjoavassa tietoliikennejärjestelmässä
US6950977B2 (en) * 2001-03-15 2005-09-27 3G.Com, Inc. Mechanism for turbo decoding when CRC for partial blocks is provided
JP3512177B2 (ja) * 2001-05-16 2004-03-29 松下電器産業株式会社 パケット受信装置及びパケット伝送方法
US6874113B2 (en) * 2001-09-17 2005-03-29 Interdigital Technology Corporation Radio resource control-service data unit reception
EP1337065A1 (fr) 2002-02-13 2003-08-20 Telefonaktiebolaget L M Ericsson (Publ) Procédé ARQ semi-fiable et dispositif correspondant
FI20030477A0 (fi) * 2003-03-31 2003-03-31 Nokia Corp Kehyssynkronointitiedon jakelu tukiasemassa
US7219294B2 (en) * 2003-11-14 2007-05-15 Intel Corporation Early CRC delivery for partial frame
JP2006211632A (ja) 2005-01-26 2006-08-10 Asustek Computer Inc Ｃｒｃ検査範囲外エラーを検出する方法
KR100708190B1 (ko) 2005-11-03 2007-04-16 삼성전자주식회사 무선 네트워크를 통하여 데이터를 효율적으로 송/수신하는방법 및 그 방법을 이용한 무선 디바이스
US7805656B2 (en) * 2005-09-29 2010-09-28 Dolby Laboratories Licensing Corporation Error correction in packet-based communication networks using data consistency checks
US7765317B1 (en) * 2008-06-30 2010-07-27 Qlogic, Corporation System and methods for locating FPDU headers when markers are disabled
JP5587642B2 (ja) 2010-03-11 2014-09-10 株式会社メガチップス 通信デバイスおよび通信システム

Also Published As

Publication number Publication date
JP2011504314A (ja) 2011-02-03
JP5461414B2 (ja) 2014-04-02
EP2191601A1 (fr) 2010-06-02
KR101297065B1 (ko) 2013-08-19
KR20100085925A (ko) 2010-07-29
WO2009054856A1 (fr) 2009-04-30
US20100174973A1 (en) 2010-07-08
US8352830B2 (en) 2013-01-08

Similar Documents

Publication Publication Date Title
EP2191601B1 (fr) Extraction de valeurs à partir de paquets de données partiellement corrompus
US7639645B2 (en) Method for receiving and managing a downlink radio link control data block in an EGPRS mobile electronic communication device
JP6054354B2 (ja) ＲＲＣ（ｒａｄｉｏｒｅｓｏｕｒｃｅｃｏｎｔｒｏｌ）−サービスデータユニットの受信
EP2009833B1 (fr) Procédé et appareil associé de configuration d'un ensemble d'en-têtes "Header Extension type field (HE)" dans un système de communication sans fil fonctionnant en RLC "acknowledged mode"
US7571358B2 (en) Error processing apparatus and method for wireless communication system
US8331386B2 (en) CRC checking and MAC-HS processing in an HSDPA-compatible receiver in a 3G wireless network
KR20050059065A (ko) 무선통신에서 방송 메시지의 세그먼트화
EP3592101B1 (fr) Procédé et dispositif de traitement de données
US20060221965A1 (en) Method of transferring data packets in a communications network
EP1719365A2 (fr) Procede et appareil pour effectuer un controle de la fiabilite d'un tfci dans un canal a donnees ameliorees
US6937564B2 (en) Management of downlink TBF in an EGPRS and in a GPRS mobile station using final block indicator and relative reserved block period field
US11451331B2 (en) Bit error correction for Bluetooth low energy
CN113038531A (zh) 基于增强型rlc数据pdu的容错方法和系统

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20100329

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC MT NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA HR MK RS

17Q First examination report despatched

Effective date: 20101223

DAX Request for extension of the european patent (deleted)
GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

INTG Intention to grant announced

Effective date: 20150304

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC MT NL PL PT RO SE SI SK TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 744447

Country of ref document: AT

Kind code of ref document: T

Effective date: 20150915

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602007042713

Country of ref document: DE

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 744447

Country of ref document: AT

Kind code of ref document: T

Effective date: 20150819

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20150819

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151120

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

RAP2 Party data changed (patent owner data changed or rights of a patent transferred)

Owner name: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151219

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151221

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602007042713

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

Ref country code: LU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20151026

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

26N No opposition filed

Effective date: 20160520

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20151119

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20151031

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20160503

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20151031

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20160630

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20151102

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20151119

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20151026

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20071026

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150819