[go: up one dir, main page]

EP2250770B1 - Transmission de paquets via plusieurs liaisons dans un système de communication sans fil - Google Patents

Transmission de paquets via plusieurs liaisons dans un système de communication sans fil Download PDF

Info

Publication number
EP2250770B1
EP2250770B1 EP09707554A EP09707554A EP2250770B1 EP 2250770 B1 EP2250770 B1 EP 2250770B1 EP 09707554 A EP09707554 A EP 09707554A EP 09707554 A EP09707554 A EP 09707554A EP 2250770 B1 EP2250770 B1 EP 2250770B1
Authority
EP
European Patent Office
Prior art keywords
packet
available
link
packets
data
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
EP09707554A
Other languages
German (de)
English (en)
Other versions
EP2250770A2 (fr
Inventor
Peter John Black
Ramin Rezaiifar
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.)
Qualcomm Inc
Original Assignee
Qualcomm Inc
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 Qualcomm Inc filed Critical Qualcomm Inc
Priority to EP10015278.4A priority Critical patent/EP2317683B1/fr
Publication of EP2250770A2 publication Critical patent/EP2250770A2/fr
Application granted granted Critical
Publication of EP2250770B1 publication Critical patent/EP2250770B1/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/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/1607—Details of the supervisory signal
    • 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
    • H04L1/1854—Scheduling and prioritising arrangements
    • 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/1867—Arrangements specially adapted for the transmitter end
    • H04L1/1874—Buffer management
    • 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/1867—Arrangements specially adapted for the transmitter end
    • H04L1/1887—Scheduling and prioritising arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/14—Channel dividing arrangements, i.e. in which a single bit stream is divided between several baseband channels and reassembled at the receiver
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • 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/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • 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
    • H04L2001/0092—Error control systems characterised by the topology of the transmission link
    • H04L2001/0096—Channel splitting in point-to-point links
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0001—Arrangements for dividing the transmission path
    • H04L5/0003—Two-dimensional division
    • H04L5/0005—Time-frequency
    • H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A) or DMT
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0044—Allocation of payload; Allocation of data channels, e.g. PDSCH or PUSCH
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0053—Allocation of signalling, i.e. of overhead other than pilot signals

Definitions

  • the present disclosure relates generally to communication, and more specifically to techniques for transmitting data in a wireless communication system.
  • Wireless communication systems are widely deployed to provide various communication services such as voice, video, packet data, messaging, broadcast, etc. These systems may be multiple-access systems capable of supporting multiple users by sharing the available system resources. Examples of such multiple-access systems include Code Division Multiple Access (CDMA) systems, Time Division Multiple Access (TDMA) systems, Frequency Division Multiple Access (FDMA) systems, Orthogonal FDMA (OFDMA) systems, and Single-Carrier FDMA (SC-FDMA) systems.
  • CDMA Code Division Multiple Access
  • TDMA Time Division Multiple Access
  • FDMA Frequency Division Multiple Access
  • OFDMA Orthogonal FDMA
  • SC-FDMA Single-Carrier FDMA
  • a wireless communication system may employ hybrid automatic repeat request (HARQ) to improve reliability of data transmission.
  • HARQ hybrid automatic repeat request
  • a transmitter may generate multiple subpackets for a data packet and may send one or more subpackets until the packet is decoded correctly by a receiver or the maximum number of subpackets has been sent. Different packets may be successfully decoded with different numbers of subpackets depending on channel conditions and other factors.
  • the transmitter may send data to the receiver via one or more links.
  • Each link may be associated with certain radio resources (e.g., a different carrier) usable for data transmission. If there is only one link, then the transmitter may send packets sequentially via this link, one packet at a time. The receiver would then receive the packets in the proper order. If there are multiple links, then the transmitter may send multiple packets in parallel via these links. These multiple packets may terminate at different times depending on the number of subpackets needed for each packet. It may be desirable to send the packets in a manner such that the packets can be received either in order or with as few packets out of order as possible.
  • US 2003/0133452 discloses a multi channel data transmission method in which data segments are arranged sequentially in channel frames.
  • the data to send is partitioned into data units.
  • Each data unit is associated with a sequence number that indicates the position of that data unit among the available data units.
  • Each packet includes any number of data units, which may be dependent on the packet size and the data unit size.
  • a transmitter generates new packets for multiple links based on the likelihood of each link being available at the next transmission opportunity.
  • the transmitter determines the likelihood of each link being available based on whether or not there is a pending packet on that link and, if yes, the number of subpackets sent for the pending packet.
  • the transmitter generates new packets such that packets for links that are progressively less likely to be available contain data units with progressively higher sequence numbers.
  • the transmitter thereafter determines whether each link is available, e.g., based on an acknowledgement (ACK) or a negative acknowledgement (NAK) received for a pending packet on that link.
  • ACK acknowledgement
  • NAK negative acknowledgement
  • FIG. 1 shows a wireless communication system
  • FIG. 2 shows data transmission with HARQ.
  • FIG. 3 shows processing of data for transmission on multiple (K) carriers.
  • FIG. 4 shows data transmission on three carriers.
  • FIG. 5 shows generation of three packets for three carriers.
  • FIG. 6 shows generation of K new packets for K carriers based on priorities.
  • FIG. 7 shows transmission of the K new packets on the K carriers.
  • FIG. 8 shows transmission of three packets on three carriers.
  • FIG. 9A shows generation of three packets for two carriers.
  • FIG. 9B shows generation of seven packets for three carriers.
  • FIG. 10 shows generation of four packets for three carriers.
  • FIG. 11 shows a process for transmitting packets on multiple links.
  • FIG. 12 shows a process for transmitting packets in order on multiple links.
  • FIG. 13 shows data reception and a re-assembly buffer at a receiver.
  • FIG. 14 shows a process for receiving packets via multiple links.
  • FIG. 15 shows a block diagram of an access terminal and an access point.
  • a CDMA system may implement a radio technology such as cdma2000, Universal Terrestrial Radio Access (UTRA), etc.
  • cdma2000 covers IS-2000, IS-95, and IS-856 standards.
  • UTRA includes Wideband CDMA (WCDMA) and other variants of CDMA.
  • a TDMA system may implement a radio technology such as Global System for Mobile Communications (GSM).
  • GSM Global System for Mobile Communications
  • An OFDMA system may implement a radio technology such as Ultra Mobile Broadband (UMB), Evolved UTRA (E-UTRA), IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, Flash-OFDM®, etc.
  • UMB Ultra Mobile Broadband
  • E-UTRA Evolved UTRA
  • IEEE 802.11 Wi-Fi
  • WiMAX IEEE 802.16
  • IEEE 802.20 Flash-OFDM®
  • UMB Ultra Mobile Broadband
  • E-UTRA Evolved UTRA
  • Wi-Fi Wi-Fi
  • WiMAX IEEE 802.16
  • Flash-OFDM® Flash-OFDM®
  • UTRA and E-UTRA are part of Universal Mobile Telecommunication System (UMTS).
  • LTE Long Term Evolution
  • LTE Long Term Evolution
  • cdma2000 and UMB are described in documents from an organization named "3rd Generation Partnership Project 2" (3GPP2).
  • HRPD High Rate Packet Data
  • HRPD is also referred to as CDMA2000 1xEV-DO (Evolution-Data Optimized), 1xEV-DO, 1x-DO, DO, High Data Rate (HDR), etc.
  • HRPD is described in 3GPP2 C.S0024-B, entitled “cdma2000 High Rate Packet Data Air Interface Specification," dated March 2007, which is publicly available.
  • HRPD terminology is used in much of the description below.
  • FIG. 1 shows a wireless communication system 100, which may be an HRPD system.
  • Wireless system 100 may include a number of access points and a number of Base Station Controllers/Packet Control Functions (BSCs/PCFs).
  • BSCs/PCFs Base Station Controllers/Packet Control Functions
  • An access point is generally a fixed station that communicates with the access terminals and may also be referred to as a base station, a Node B, an evolved Node B, etc.
  • BSC/PCF 122 couples to a set of access points, provides coordination and control for the access points under its control, and routes data for these access points.
  • a Packet Data Serving Node (PDSN) 130 supports data services for access terminals.
  • PDSN Packet Data Serving Node
  • PDSN 130 may be responsible for establishment, maintenance, and termination of data sessions for access terminals and may further assign dynamic Internet Protocol (IP) addresses to the access terminals.
  • IP Internet Protocol
  • PDSN 130 may couple to data network(s) 140, which may comprise a core network, private and/or public data networks, the Internet, etc.
  • Wireless system 100 may include other network entities not shown in FIG. 1 .
  • An access terminal (AT) 110 may communicate with wireless system 100 to obtain communication services.
  • Access terminal 110 may also be referred to as a mobile station, a user equipment, a user terminal, a subscriber unit, a station, etc.
  • Access terminal 110 may be a cellular phone, a personal digital assistant (PDA), a wireless modem, a handheld device, a laptop computer, etc.
  • Access terminal 110 may communicate with access point 120 via the forward and reverse links.
  • the forward link (or downlink) refers to the communication link from the access point to the access terminal
  • the reverse link or uplink refers to the communication link from the access terminal to the access point.
  • the data transmission techniques described herein may be used for the forward link as well as the reverse link. For clarity, certain aspects of the techniques are described below for data transmission on the reverse link.
  • System 100 may support multi-carrier operation on the forward and/or reverse link.
  • a transmitter may send packets in parallel on multiple CDMA channels, with each CDMA channel being 1.2288 MHz wide in HRPD.
  • a CDMA channel may also be referred to as a carrier.
  • Multiple links may be available with multi-carrier operation, and each link may correspond to a different CDMA channel or carrier.
  • System 100 may support HARQ on the forward and/or reverse link.
  • a transmitter processes a data packet to generate a coded packet and further partitions the coded packet into multiple (S) subpackets, where S may be four or some other value.
  • SPIDs sequential subpacket identifiers
  • Each subpacket contains sufficient information to allow a receiver to decode and recover the packet under favorable channel conditions.
  • the S subpackets contain different redundancy information for the packet and are transmitted in sequential order. Thus, the first subpacket is transmitted first, followed by the second subpacket if needed, followed by the third subpacket if needed, etc. All or a subset of the S subpackets may
  • FIG. 2 shows an example data transmission with HARQ.
  • the transmission time line is partitioned into subframes, with each subframe including four slots and having a duration of 6.667 milliseconds (ms).
  • Each subpacket may be sent in one subframe.
  • the transmission time line is also partitioned into three HARQ interlaces 1, 2 and 3.
  • Each HARQ interlace includes every third subframe, and the three HARQ interlaces occupy non-overlapping subframes.
  • the subpackets for each packet may be sent in different subframes on one HARQ interlace. For simplicity, much of the description below is for one HARQ interlace.
  • the same processing may be repeated for each HARQ interlace available for data transmission.
  • a receiver (e.g., access point 120) receives the first subpacket, decodes packet 1 in error based on the first subpacket, and sends a NAK on an ACK channel in subframe n+2.
  • the receiver receives the second subpacket, decodes packet 1 in error based on both the first and second subpackets, and sends a NAK on the ACK channel in subframe n+5.
  • the receiver receives the third subpacket, decodes packet 1 correctly based on all three subpackets, and sends an ACK on the ACK channel in subframe n+8.
  • multiple subpackets may be sent for a packet.
  • multiple transmissions, multiple HARQ transmissions, or multiple blocks may be sent for a packet.
  • the terms "subpacket”, “HARQ transmission,” “transmission”, and “block” are synonymous and used interchangeably.
  • a new subpacket may be sent in every three subframes, and there is a delay of two subframes for the ACK/NAK for each subpacket. Since the ACK/NAK spans three slots, there is a delay of one slot from the end of the ACK/NAK to the start of the next transmission opportunity. This one slot delay may provide insufficient amount of time to generate or construct a new packet.
  • the transmitter may fetch data from a data queue and generate a new packet sufficiently early so that the packet is available at the next transmission opportunity. Just before transmission time, the transmitter may determine whether a pending packet has terminated. A pending packet is a packet that is currently being transmitted and may also be referred to as an in-flight packet. If the pending packet has terminated, then the transmitter may send the new packet. Otherwise, the transmitter may dismantle the new packet and return the payload back to the data queue.
  • FIG. 2 shows data transmission via a single carrier.
  • multiple packets may be sent simultaneously via multiple carriers.
  • FIG. 3 shows processing of data by the transmitter for data transmission via multiple (K) carriers.
  • a data queue 310 receives and buffers incoming data and provides the data whenever transmission resources are available.
  • the incoming data may be sent in a first in first out (FIFO) manner, so that earlier arriving data is sent before later arriving data.
  • the incoming data may also be partitioned into data units, with each data unit having a suitable size. For example, a data unit may have a size of one octet or some other size.
  • the data units may be assigned sequentially increasing sequence numbers. The sequence number may start at zero, increment by one for each data unit, and wrap around to zero after reaching a maximum value of 2 B - 1, where B is the number of bits for the sequence number.
  • the earliest data unit in the data queue is deemed to have the lowest sequence number (which may actually be larger than the sequence numbers of later data units because of the wrap around).
  • the sequence number may be assigned by Radio Link Protocol (RLP) or some other protocol and may be used by the receiver for re-assembly of the data units and/or other purposes.
  • RLP Radio Link Protocol
  • data queue 310 provides packets 1 through K to packet processors 320a through 320k, respectively.
  • Each packet processor 320 processes its packet and provides L subpackets for one carrier.
  • One or more subpackets may be sent for each packet via one carrier.
  • the first subpacket of each packet is shown with shading, and the remaining subpackets of each packet are shown without shading.
  • subframe n the first subpackets of packets 1, 2 and 3 are sent on carriers 1, 2 and 3, respectively. Packets 1 and 2 are decoded in error, and packet 3 is decoded correctly.
  • subframe n +3 the second subpackets of packets 1 and 2 and the first subpacket of a new packet 4 are sent on carriers 1, 2 and 3, respectively. Packets 1 and 4 are decoded in error, and packet 2 is decoded correctly.
  • subframe n +6 the third subpacket of packet 1, the first subpacket of a new packet 5, and the second subpacket of packet 4 are sent on carriers 1, 2 and 3, respectively. Packets 1 and 4 are decoded correctly, and packet 5 is decoded in error.
  • subframe n +9 the first subpacket of a new packet 6, the second subpacket of packet 5, and the first subpacket of a new packet 7 are sent on carriers 1, 2 and 3, respectively. Data transmission continues in this manner in each subsequent subframe.
  • multiple transmission opportunities may occur at the same time for multi-carrier operation.
  • the transmitter may generate K new packets for possible transmission in the next available subframe.
  • the transmitter may generate the new packets (e.g., during subframe n +1) without knowing whether any pending packet or which pending packets are decoded correctly by the receiver, since the ACK/NAK for each pending packet may not be received until later (e.g., during subframe n+2).
  • Generating the new packets without knowing the decoding status of the pending packets may result in the new packets being sent out of order.
  • FIG. 5 shows an example of out-of-sequence transmission of new packets due to unknown decoding status of pending packets.
  • the data queue contains data units 15 through 24, with data unit 15 having the lowest sequence number and data unit 24 having the highest sequence number.
  • a packet for carrier 1 can contain two data units
  • a packet for carrier 2 can contain one data unit
  • a packet for carrier 3 can contain three data units.
  • Three new packets 1, 2 and 3 are generated after transmission of three pending packets X, Y and Z on three carriers 1, 2 and 3, respectively.
  • the data units are provided to the new packets in sequential order, so that the first two data units 15 and 16 are provided to packet 1, the next data unit 17 is provided to packet 2, and the next three data units 18, 19 and 20 are provided to packet 6.
  • packet 3 carrying data units 18, 19 and 20 will be sent before packet 1 carrying data units 15 and 16 and packet 2 carrying data unit 17, thus resulting in out-of-order transmission of the data units.
  • Data units 15, 16 and 17 may be returned to the data queue for transmission at the next transmission opportunity.
  • the transmitter In a first transmission scheme, the transmitter generates new packets in a manner to reduce the number of packets sent out of order.
  • the transmitter typically generates and transmits a packet such that the receiver can correctly decode the packet with a certain probability after a target number of subpackets.
  • This target number of subpackets is referred to as a termination target (TT) of the packet.
  • the termination target is typically less than the maximum number of subpackets, or TT ⁇ S , and may be selected based on various factors.
  • the receiver typically decodes the packet based on all received subpackets. The likelihood of correctly decoding the packet may then increase with the number of subpackets transmitted for the packet.
  • the transmitter can determine the likelihood of transmitting a new packet on each carrier based on the likelihood of a pending packet on that carrier being decoded correctly, which may in turn be determined based on the number of subpackets transmitted for the pending packet.
  • the transmitter may generate new packets such that (i) a new packet that is most likely to be transmitted contains data units with the lowest sequence numbers and (ii) a new packet that is least likely to be transmitted contains data units with the highest sequence numbers among all data units used for the new packets.
  • the transmitter generates K new packets for K carriers as follows.
  • carrier k has the maximum priority if there is no pending packet on carrier k or if the maximum number of subpackets has been sent for the pending packet. Either of these two conditions means that a new packet can be sent on carrier k at the next transmission opportunity.
  • the maximum priority may be set to a value that is always higher than SPID( k ) - TT( k ). If neither of the two conditions is met, then the priority of carrier k is determined by the number of subpackets SPID( k ) transmitted for the pending packet and the termination target TT( k ) for the pending packet on carrier k .
  • the priority of each carrier k can range from 1-TT( k ) after transmitting one subpacket to S-TT( k )-1 after transmitting S-1 subpackets. If there is a tie from equation (1) and more than one carrier has the same priority, then the tie may be broken randomly or based on additional information. In general, the K carriers may be assigned priorities such that the carrier with the highest priority is most likely to be available and the carrier with the lowest priority is least likely to be available.
  • FIG. 6 shows a design for generating K new packets for the K carriers based on the priorities of these carriers.
  • the data units with the lowest sequence numbers are provided to a new packet for the carrier with the highest priority, then the data units with the next higher sequence numbers are provided to a new packet for the carrier with the second highest priority, etc, and data units with the highest sequence numbers are provided to a new packet for the carrier with the lowest priority.
  • FIG. 7 shows data transmission on the K carriers in accordance with the first transmission scheme.
  • the transmitter may send subpackets for K pending packets X through Z in subframe n.
  • the transmitter may determine the priorities of the K carriers in subframe n +1.
  • the transmitter may generate K new packets for the K carriers in subframe n +1 based on the priorities of these carriers.
  • the transmitter may receive an ACK or a NAK for each of the K pending packets in subframe n +2.
  • the transmitter may send a new packet generated for that carrier if the pending packet has been decoded correctly and hence terminated and may continue to send the pending packet if it is decoded in error.
  • the transmitter may send zero or more of the K new packets on the K carriers, depending on the decoding status of the K pending packets.
  • the transmitter may send one or more new packets out of order if a pending packet on a lower priority carrier is terminated while another pending packet on a higher priority carrier is not terminated. If a new packet is sent out of order, then one or more unsent new packets would contain data units with lower sequence numbers than those of the data units in the sent new packet. The transmitter may ensure that the unsent data units with lower sequence numbers will be sent at the next transmission opportunity. This may be achieved by transferring the unsent data units with lower sequence numbers to a high priority queue having higher priority than the data queue.
  • FIG. 8 shows an example data transmission on three carriers in accordance with the first transmission scheme.
  • the transmission target is four, and the maximum priority is five.
  • the transmitter generates a new packet 1 containing data units 15, 16 and 17 with the lowest sequence numbers for the highest priority carrier 3, a new packet 2 containing data units 18 and 19 with the next higher sequence numbers for the second highest priority carrier 1, and a new packet 3 containing data unit 20 with the highest sequence number for the lowest priority carrier 2.
  • the transmitter receives a NAK for pending packet X on carrier 1 and an ACK for pending packet Y on carrier 2.
  • the transmitter sends new packet 1 with data units 15, 16 and 17 on carrier 3 and new packet 3 with data unit 20 on carrier 2. Since pending packet X on carrier 1 is not terminated, the transmitter does not send new packet 2 on carrier 1 and stores data units 18 and 19 back in the data queue or the high priority queue for transmission at the next transmission opportunity.
  • the transmitter In a second transmission scheme, which is not claimed, the transmitter generates and sends new packets in a manner to ensure in-order transmission of the packets.
  • the transmitter generates new packets for each possible combination of carriers that might be available at the next transmission opportunity.
  • the number of new packets to generate is greater than the number of carriers and is dependent on the number of carriers as well as the packet size for each carrier.
  • the transmitter sends an appropriate subset of the new packets on the available carriers.
  • FIG. 9A shows an example of packet generation for the second transmission scheme with two carriers 1 and 2.
  • a packet for carrier 1 can contain two data units
  • a packet for carrier 2 can contain one data unit
  • the data queue contains data units 15 through 24.
  • the transmitter generates a new packet 1 containing two data units 15 and 16, a new packet 2 containing one data unit 17, and a new packet 3 containing one data unit 15.
  • the transmitter sends new packet 1 on carrier 1 and new packet 2 on carrier 2. If only the pending packet on carrier 1 is terminated, then the transmitter sends new packet 1 on carrier 1 and returns data unit 17 to the data queue. If only the pending packet on carrier 2 is terminated, then the transmitter sends new packet 3 on carrier 2 and returns data units 16 and 17 to the data queue.
  • FIG. 9B shows an example of packet generation for the second transmission scheme with three carriers 1, 2 and 3.
  • a packet for carrier 1 can contain two data units
  • a packet for carrier 2 can contain one data unit
  • a packet for carrier 3 can contain three data units
  • the data queue contains data units 15 through 24.
  • the transmitter generates seven new packets as follows:
  • the transmitter may send up to three new packets on up to three carriers depending on the decoding status of the pending packets on the three carriers.
  • Table 1 lists eight different transmission scenarios for the three carriers and indicates the packet to send on each available carrier in each scenario. Each scenario corresponds to a different combination of carriers being available for transmission.
  • Table 1 Scenario Carrier 1 Carrier 2 Carrier 3 1 Packet 1 Packet 2 Packet 3 2 Packet 1 Packet 2 none 3 Packet 1 none Packet 4 4 Packet 1 none none 5 none Packet 5 Packet 5 Packet 6 6 none Packet 5 none 7 none Packet 7 8 none none none none none none none
  • scenario 1 the pending packets on all three carriers 1, 2 and 3 are terminated.
  • the transmitter sends new packets 1, 2 and 3 on carriers 1, 2 and 3, respectively.
  • scenario 2 the pending packets on only two carriers 1 and 2 are terminated.
  • the transmitter sends new packets 1 and 2 on carriers 1 and 2, respectively, and returns data units 18, 19 and 20 to the data queue.
  • scenario 3 the pending packets on only two carriers 1 and 3 are terminated.
  • the transmitter sends new packets 1 and 4 on carriers 1 and 3, respectively, and returns data unit 20 to the data queue.
  • Table 1 The packet transmission for each remaining scenario is shown in Table 1.
  • the packets may also be generated in other manners, and different combinations of packets may be sent for each scenario.
  • the new packets for the three carriers have different sizes, and seven new packets are generated for all possible scenarios. If the packets for multiple carriers have the same size, then the number of packets to generate may be reduced since a given packet may be sent on more than one carrier.
  • any number of new packets may be generated for any number of carriers. Multiple new packets containing different data units may be generated for a given carrier, and one packet may be sent on this carrier depending on the termination status of the carrier.
  • the transmitter In the examples shown in FIGS. 9A and 9B , the transmitter generates new packets for all possible combinations of carriers that might be available at the next transmission opportunity. Hence, it is not necessary to know the likelihood of each carrier being available at the next transmission opportunity.
  • the transmitter In a third transmission scheme, the transmitter generates and sends new packets in a manner to reduce the number of packets sent out of order and to reduce the number of new packets to generate.
  • the transmitter first determines the likelihood of each carrier being available at the next transmission opportunity and generates a new packet for each carrier based on the likelihood of availability for the K carriers, as described above for the first transmission scheme.
  • the transmitter further generates one or more additional packets in anticipation of an erroneous prediction due to one or more carriers deemed most likely to be available being unavailable.
  • the third transmission scheme may be considered as a combination of the first and second transmission schemes.
  • FIG. 10 shows an example of packet generation for the third transmission scheme with three carriers 1, 2 and 3.
  • a packet for carrier 1 can contain two data units
  • a packet for carrier 2 can contain one data unit
  • a packet for carrier 3 can contain three data units
  • the data queue contains data units 15 through 24.
  • Carrier 3 is most likely to be available at the next transmission opportunity
  • carrier 1 is the second most likely to be available
  • carrier 2 is the least likely to be available.
  • the transmitter generates a new packet 1 containing three data units 15, 16 and 17 for carrier 3, a new packet 2 containing two data units 18 and 19 for carrier 1, and a new packet 3 containing one data unit 20 for carrier 3.
  • the transmitter also generates an additional new packet 4 containing two data units 15 and 16 for carrier 1.
  • the transmitter sends new packets 2, 3 and 1 on carriers 1, 2 and 3, respectively. If the pending packet on carrier 3 (which is most likely to be available) is not terminated but the pending packet on carrier 1 (which is second most likely to be available) is terminated, then the transmitter sends new packet 4 on carrier 1 and returns data units 17 to 20 to the data queue.
  • the transmitter In one design, which is shown in FIG. 10 for the case of three carriers, the transmitter generates three new packets for the two carriers most likely to be available and have the two highest priorities. For these two carriers, the transmitter would be able to send a new packet in order on each carrier that is available.
  • the transmitter also generates K - 2 new packets for the K - 2 remaining carriers, one new packet for each remaining carrier, based on the priorities of these remaining carriers and assuming that the two highest priority carriers will be available.
  • the transmitter transmits each of the K - 2 new packets on a corresponding one of the K - 2 remaining carriers if that carrier is available.
  • the transmitter may send the K - 2 new packets out of order depending on which one(s) of the K - 2 remaining carriers are available.
  • the transmitter generates a new packet for each carrier with an assumption that only that carrier will be available at the next transmission opportunity.
  • the transmitter would generate a second additional packet containing one data unit 15 for carrier 2.
  • the transmitter determines the likelihood of each possible transmission scenario occurring at the next transmission opportunity. For the case with three carriers, the eight possible transmission scenarios are shown in Table 1. The transmitter generates K new packets for the scenario in which all K carriers will be available. The transmitter also generates one or more additional new packets for one or more other more likely scenarios.
  • the transmitter may generate one or more additional packets for data in the data queue, as shown in FIG. 10 .
  • the transmitter may also generate additional packets to ensure that data in the high priority queue can be sent at the next transmission opportunity. For example, the transmitter may generate a new packet containing data units in the high priority queue for each carrier. This would then ensure that the data units in the high priority queue can be sent on any available carrier.
  • the transmitter In a fourth transmission scheme, the transmitter generates new packets based on the likelihood of the carriers being available and sends the new packets in a manner to ensure in-order transmission of the packets.
  • the transmitter first determines the likelihood of each carrier being available at the next transmission opportunity and generates a new packet for each carrier based on the likelihood of availability for the K carriers, as described above for the first transmission scheme. For each carrier, the transmitter sends a new packet on that carrier only if all carriers with higher priorities are also available.
  • the transmitter traverses through the K carriers, one carrier at a time, starting with the highest priority carrier. For each carrier being considered, the transmitter sends a new packet on that carrier if it is available. Upon encountering a carrier that is unavailable, the transmitter terminates the process and returns all data units in unsent new packets, if any, to the data queue.
  • the fourth transmission scheme may be considered as a variant of the first transmission scheme.
  • FIG. 11 shows a design of a process 1100 for transmitting data on multiple links. Each link may correspond to a carrier or some other transmission resources. Process 1100 may be performed by a transmitter, which may be an access terminal for data transmission on the reverse link or an access point for data transmission on the forward link.
  • a transmitter which may be an access terminal for data transmission on the reverse link or an access point for data transmission on the forward link.
  • the transmitter obtains a plurality of data units to send, with each data unit being associated with a sequence number indicative of the position of that data unit among the plurality of data units (block 1112).
  • the transmitter determines the likelihood of each of multiple links being available for sending data (block 1114).
  • the likelihood of a link being available may be given by a priority number or some other quantity.
  • the transmitter generates multiple packets for the multiple links based on the likelihood of each link being available (block 1116).
  • the multiple packets include a first packet for a first link most likely to be available and a last packet for a last link least likely to be available.
  • the first packet includes a data unit having a lowest sequence number and the last packet includes a data unit having a highest sequence number among all data units in the multiple packets.
  • the transmitter may determine the likelihood of each link being available based on the number of subpackets sent for a pending packet on that link, if any, e.g., as shown in equation (1).
  • the transmitter may also determine that a link will be available if there is no pending packet on the link or if a maximum number of subpackets has been sent for a pending packet on the link.
  • the transmitter may generate one packet for each of the multiple links, with packets for links that are progressively less likely to be available including data units with progressively higher sequence numbers.
  • the transmitter may also generate an additional packet for a second link that is second most likely to be available.
  • the additional packet may include the data unit with the lowest sequence number and may be sent on the second link only if the first link is unavailable.
  • the transmitter determines whether each of the multiple links is available, e.g., based on an ACK or a NAK received for a pending packet on the link (block 1118). In one design, the transmitter sends each of the multiple packets on a respective one of the multiple links if the link is available (block 1120). In another design, for the fourth transmission scheme, the transmitter sends each of the multiple packets on a respective one of the multiple links if the link is available and if all links that are more likely to be available are also available. This design ensures in-order transmission of packets. For both designs, the transmitter may return data units in unsent packets for unavailable links to a queue for transmission in a subsequent time interval.
  • FIG. 12 shows a design of a process 1200 for transmitting data in order on multiple links.
  • Process 1200 may also be performed by a transmitter.
  • the transmitter obtains a plurality of data units to send, with each data unit being associated with a sequence number (block 1212).
  • the transmitter generates multiple packets for multiple links, with each packet including at least one data unit among the plurality of data units (block 1214).
  • the transmitter determines whether each of the multiple links is available, e.g., based on an ACK or a NAK received for a pending packet on the link (block 1216).
  • the transmitter sends at least one packet among the multiple packets on at least one available link among the multiple links, with the at least one packet including data units with sequence numbers lower than sequence numbers of unsent data units, if any, in the multiple packets (block 1218).
  • the transmitter may generate packets for all possible combinations of available links among the multiple links.
  • the transmitter may also generate the multiple packets such that one packet can be sent on each available link and also such that data units in sent packets have lower sequence numbers than the sequence numbers of any unsent data units.
  • the transmitter may generate at least two packets containing different data units for each of at least one link.
  • the transmitter may generate a first packet including a data unit with a lowest sequence number for a first link, generate a second packet including a data unit with a higher sequence number for a second link, and generate a third packet including the data unit with the lowest sequence number for the second link.
  • the transmitter may send the first packet on the first link and the second packet on the second link if the both links are available.
  • the transmitter may send only the first packet on the first link if only the first link is available and may send only the third packet on the second link if only the second link is available.
  • the transmitter may generate up to seven packets for the three links.
  • the transmitter may send up to three packets on up to three available links, with the up to three sent packets including data units with lower sequence numbers than the sequence numbers of unsent data units, if any, in the up to seven packets.
  • multiple packets may be sent starting at the same time but may be decoded out of order.
  • Out-of-order reception can occur when a packet containing data units with lower sequence numbers is decoded later than a packet containing data units with higher sequence numbers.
  • FIG. 13 shows an example of out-of-order reception for multiple packets sent starting at the same time.
  • the transmitter sends packet 1 containing data units 15, 16 and 17 on carrier 3 (which may have the highest priority), packet 2 containing data units 18 and 19 on carrier 1 (which may have the second highest priority), and packet 3 containing data unit 20 on carrier 2 (which may have the lowest priority).
  • the transmitter sends the first subpackets of packets 2, 3 and 1 on carriers 1, 2 and 3, respectively, in subframe n .
  • the receiver decodes each packet in error.
  • the transmitter then sends the second subpackets of packets 2, 3 and 1 on carriers 1, 2 and 3, respectively, in subframe n +3.
  • the receiver decodes packet 3 correctly and recovers data unit 20.
  • the transmitter then sends the third subpackets of packets 2 and 1 on carriers 1 and 3, respectively, in subframe n +6.
  • the receiver decodes packet 2 correctly and recovers data units 18 and 19.
  • the transmitter then sends the fourth subpacket of packet 1 on carrier 3 in subframe n+9.
  • the receiver decodes packet 1 correctly and recovers data units 15, 16 and 17. In this example, even though the three packets are sent starting at the same time, the receiver obtains the data units out of order because more subpackets are needed to correctly decode the packets containing the data units with lower sequence numbers.
  • the sequence numbers may be assigned by RLP, and an RLP hole may be created when a packet containing data units with higher sequence numbers is decoded before a packet containing data units with lower sequence numbers.
  • an RLP hole covering data units 15 through 19 is created in subframe n +3 when packet 3 containing data unit 20 is decoded correctly.
  • a packet causing an RLP hole may be referred to as an earlier arrived packet.
  • the receiver may send an RLP NAK for the RLP hole to trigger retransmission of the missing data units.
  • the receiver may delay sending the RLP NAK by a predetermined amount of time of T ms, where T may be a suitable value.
  • T is the maximum termination time for all packets sent starting at the same time as the earlier arrived packet.
  • the maximum termination time may be four subpackets, and the RLP NAK may be sent after receiving the fourth subpacket in subframe n +9. This design ensures that each packet has sufficient time to terminate before sending an RLP NAK.
  • the transmitter may send multiple packets in order in different subframes. However, the receiver may decode a later sent packet prior to an earlier sent packet and would then detect an RLP hole. In one design, the receiver may delay sending an RLP NAK by an amount of time determined by the maximum termination time of the earlier sent packet. For example, the maximum termination time may be four subpackets, packet 1 may be sent starting in subframe n , and packet 2 may be sent starting in subframe n +3 and may be decoded prior to packet 1. The receiver may delay sending an RLP NAK until after four subpackets have been received for packet 1, which is after subframe n +9.
  • packets may be sent out of order due to pending packets not terminating as predicted on the K carriers.
  • the receiver may detect an RLP hole due to out-of-order transmission of packets.
  • the receiver may delay sending an RLP NAK for the RLP hole by an amount of time determined based on (i) the maximum termination time for unsent out-of-order data units and (ii) an assumption that these data units will be sent at the next transmission opportunity.
  • the receiver may delay sending an RLP NAK for a detected RLP hole by an amount of time to allow the transmitter to send the missing data units at the earliest transmission opportunity. This may then avoid or reduce spurious RLP NAKs due to early termination of packets sent on different carriers.
  • FIG. 14 shows a design of a process 1400 for receiving data via multiple links.
  • Process 1400 may be performed by a receiver, which may be an access point for data transmission on the reverse link or an access terminal for data transmission on the forward link.
  • the receiver receives multiple packets from multiple links, with each packet including at least one data unit, each data unit being associated with a sequence number indicative of the position of that data unit among a plurality of data units (block 1412).
  • the multiple packets may be (i) generated by a transmitter based on the likelihood of each of the multiple links being available for sending data or (ii) sent by the transmitter to ensure in-order transmission of the multiple packets.
  • the receiver decodes the multiple packets to obtain decoded packets (block 1414).
  • the receiver may detect a hole due to successful decoding of a packet including a data unit with a sequence number higher than sequence numbers of missing data units not yet decoded (block 1416).
  • the receiver may delay transmission of a NAK for the detected hole for a predetermined amount of time to allow for transmission and decoding of at least one packet including the missing data units (block 1418).
  • the at least one packet with the missing data units may be transmitted starting at same time or earlier than the packet successfully decoded.
  • the receiver may then delay transmission of the NAK until a maximum transmission time for the at least one packet has elapsed.
  • the at least one packet with the missing data units may also be transmitted starting later than the packet successfully decoded.
  • the receiver may then delay transmission of the NAK until an expected maximum transmission time for the at least one packet has elapsed.
  • the receiver may determine the expected maximum transmission time based on (i) an assumption that the at least one packet will be sent at the next transmission opportunity and (ii) the maximum transmission time for the at least one packet.
  • FIG. 15 shows a block diagram of a design of access terminal 110 and access point 120 in FIG. 1 .
  • an encoder 1512 receives data from a data queue 1510, generates one or more packets, encodes each packet to obtain a coded packet, and partitions each coded packet into multiple subpackets.
  • a modulator (Mod) 1514 receives subpackets for pending packets and processes each subpacket for transmission. The processing by modulator 1514 may include symbol mapping, channelization, spectral spreading, etc.
  • a transmitter (TMTR) 1516 processes the output from modulator 1514 and generates a reverse link signal, which is transmitted via an antenna 1518.
  • the reverse link signal is received by an antenna 1552 and processed by a receiver (RCVR) 1554 to obtain samples.
  • a demodulator (Demod) 1556 processes (e.g., despreads, dechannelizes, and data demodulates) the samples and provides demodulated symbols.
  • a decoder 1558 decodes the demodulated symbols for each pending packet and checks each decoded packet. Decoder 1558 provides the status of each decoded packet to a controller/processor 1570 and provides the packet (if decoded correctly) to a data store 1560.
  • the processing by demodulator 1556 and decoder 1558 at access point 120 is complementary to the processing by modulator 1514 and encoder 1512, respectively, at access terminal 110.
  • ACKs/NAKs for pending packets are encoded by an encoder 1582, further processed by a modulator 1584, and conditioned by a transmitter 1586 to generate a forward link signal, which is transmitted via antenna 1552.
  • the forward link signal is received by antenna 1518 and processed by a receiver 1530 to obtain samples.
  • a demodulator 1532 processes the samples and provides demodulated symbols.
  • a decoder 1534 further processes the demodulated symbols and provides the ACK/NAK feedback.
  • a controller/processor 1520 directs transmission of subpackets for pending and new packets based on the ACK/NAK feedback. Data transmission on the forward link may occur in a manner analogous to the data transmission on the reverse link.
  • Controllers/processors 1520 and 1570 may direct the operation at access terminal 110 and access point 120, respectively. Controller/processor 1520 and/or 1570 may implement or direct process 1100 in FIG. 11 , process 1200 in FIG. 12 , process 1400 in FIG. 14 , and/or other processes for the techniques described herein. Memories 1522 and 1572 store program codes and data for access terminal 110 and access point 120, respectively.
  • DSP digital signal processor
  • ASIC application specific integrated circuit
  • FPGA field programmable gate array
  • a general-purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine.
  • a processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
  • a software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
  • An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium.
  • the storage medium may be integral to the processor.
  • the processor and the storage medium may reside in an ASIC.
  • the ASIC may reside in a user terminal.
  • the processor and the storage medium may reside as discrete components in a user terminal.
  • the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium.
  • Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another.
  • a storage media may be any available media that can be accessed by a general purpose or special purpose computer.
  • such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code means in the form of instructions or data structures and that can be accessed by a general-purpose or special-purpose computer, or a general-purpose or special-purpose processor. Also, any connection is properly termed a computer-readable medium.
  • Disk and disc includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and blu-ray disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.

Landscapes

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

Abstract

L’invention concerne des techniques permettant de générer et de transmettre des paquets sur plusieurs liaisons dans un système de communication sans fil. Dans un aspect de l’invention, un émetteur génère de nouveaux paquets pour les multiples liaisons en se basant sur la probabilité que chaque liaison soit disponible. L’émetteur détermine la probabilité que chaque porteuse soit disponible en se basant sur le fait qu’un paquet en instance est présent ou non sur cette porteuse et, si un paquet est en instance, il détermine le nombre de sous-paquets envoyés pour le paquet en instance. L’émetteur génère de nouveaux paquets afin que des paquets pour des liaisons progressivement moins susceptibles d’être disponibles contiennent des unités de données avec des nombres d’ordre progressivement plus élevés. L’émetteur détermine si chaque liaison est disponible et envoie un paquet sur chaque liaison qui est disponible. Dans un autre aspect de l’invention, l’émetteur génère et envoie de nouveaux paquets de manière à assurer une transmission en ordre. Dans un mode de réalisation, l’émetteur génère de nouveaux paquets pour chaque combinaison possible de liaisons qui pourrait être disponible.

Claims (15)

  1. Procédé de transmission de données sur des liaisons multiples dans un système de communication sans fil, comprenant :
    obtenir (1112) une pluralité d'unités de données à envoyer, chaque unité de données étant associée à un numéro de séquence indicatif d'une position de l'unité de données parmi la pluralité d'unités de données, caractérisé en :
    déterminant (1114) la probabilité que chacune des liaisons multiples soit disponible pour envoyer des données; et en
    générant (1116) des paquets multiples pour les liaisons multiples en incluant des unités de données dans les paquets de données selon leur numéro de séquence associé, en se basant sur la probabilité que chaque liaison soit disponible, les paquets multiples comprenant un premier paquet pour une première liaison qui est la plus vraisemblablement disponible et un dernier paquet pour une dernière liaison qui est la moins vraisemblablement disponible, le premier paquet comprenant l'unité de données ayant le numéro de séquence le plus bas et le dernier paquet comprenant l'unité de données ayant le numéro de séquence le plus haut parmi toutes les unités de données dans les paquets multiples.
  2. Procédé selon la revendication 1, dans lequel déterminer la probabilité que chacune des liaisons multiples soit disponible comprend déterminer la probabilité que chaque liaison avec un paquet en attente soit disponible sur la base du nombre de sous-paquets envoyé pour le paquet en attente.
  3. Procédé selon la revendication 1, dans lequel déterminer la probabilité que chacune des liaisons multiples soit disponible comprend déterminer qu'une liaison sera disponible s'il n'y a pas de paquet en attente sur la liaison ou si un nombre maximal de sous-paquets a été envoyé pour un paquet en attente sur la liaison.
  4. Procédé selon la revendication 1, dans lequel générer les paquets multiples pour les liaisons multiples comprend générer un paquet pour chacune des liaisons multiples, avec des paquets pour des liaisons qui sont progressivement moins vraisemblablement disponibles comprenant des unités de données avec des numéros de séquence progressivement plus hauts.
  5. Procédé selon la revendication 4, dans lequel générer les paquets multiples pour les liaisons multiples comprend en outre générer un paquet supplémentaire pour une deuxième liaison qui est la deuxième la plus vraisemblablement disponible, le paquet supplémentaire comprenant l'unité de données ayant le numéro de séquence le plus bas et étant envoyée sur la deuxième liaison seulement si la première liaison n'est pas disponible.
  6. Procédé selon la revendication 1, comprenant en outre :
    déterminer si chacune des liaisons multiples est disponible; et
    envoyer chacun des paquets multiples sur une liaison respective des liaisons multiples si la liaison est disponible.
  7. Procédé selon la revendication 1, comprenant en outre :
    déterminer si chacune des liaisons multiples est disponible; et
    envoyer chacun des paquets multiples sur une liaison respective des liaisons multiples si la liaison est disponible et si toutes les liaisons qui sont plus vraisemblablement disponibles sont aussi disponibles.
  8. Procédé selon la revendication 1, comprenant en outre :
    renvoyer les unités de données dans chaque paquet non envoyé sur une liaison non disponible à une file d'attente pour transmission dans un intervalle de temps subséquent.
  9. Procédé selon la revendication 1, dans lequel les liaisons multiples correspondent à des porteuses multiples, une liaison pour chaque porteuse.
  10. Appareil de transmission de données sur des liaisons multiples dans un système de communication sans fil, comprenant :
    un moyen (1512) pour obtenir une pluralité d'unités de données à envoyer, chaque unité de données étant associée à un numéro de séquence indicatif d'une position de l'unité de données parmi la pluralité d'unités de données, caractérisé par :
    un moyen (1520) pour déterminer la probabilité que chacune des liaisons multiples soit disponible pour envoyer des données; et ,
    un moyen (1520) pour générer des paquets multiples pour les liaisons multiples en incluant des unités de données dans les paquets de données selon leur numéro de séquence associé, en se basant sur la probabilité que chaque liaison soit disponible, les paquets multiples comprenant un premier paquet pour une première liaison qui est la plus vraisemblablement disponible et un dernier paquet pour une dernière liaison qui est la moins vraisemblablement disponible, le premier paquet comprenant l'unité de données ayant le numéro de séquence le plus bas et le dernier paquet comprenant l'unité de données ayant le numéro de séquence le plus haut parmi toutes les unités de données dans les paquets multiples.
  11. Appareil selon la revendication 10, dans lequel le moyen pour déterminer la probabilité que chacune des liaisons multiples soit disponible, comprend :
    un moyen pour déterminer la probabilité que chaque liaison avec un paquet en attente soit disponible sur la base du nombre de sous-paquets envoyé pour le paquet en attente, et
    un moyen pour déterminer si une liaison sera disponible s'il n'y a pas de paquet en attente sur la liaison ou si un nombre maximal de sous-paquets a été envoyé pour un paquet en attente sur la liaison.
  12. Appareil selon la revendication 10, dans lequel le moyen pour générer les paquets multiples pour les liaisons multiples, comprend un moyen pour générer un paquet pour chacune des liaisons multiples, avec des paquets pour des liaisons qui sont progressivement moins vraisemblablement disponibles comprenant des unités de données avec des numéros de séquence progressivement plus hauts.
  13. Appareil selon la revendication 10, comprenant en outre :
    un moyen pour déterminer si chacune des liaisons multiples est disponible; et
    un moyen pour envoyeur les paquets multiples sur une liaison respective des liaisons multiples si la liaison est disponible.
  14. Appareil selon l'une quelconque des revendications 10 à 13, comprenant :
    au moins un processeur configuré pour fournir les moyens pour obtenir, déterminer et générer.
  15. Produit de programme informatique, comprenant :
    un support lisible par ordinateur comprenant :
    du code pour faire qu'un ordinateur au moins exécute le procédé selon l'une quelconque des revendications 1 à 9.
EP09707554A 2008-02-01 2009-01-30 Transmission de paquets via plusieurs liaisons dans un système de communication sans fil Not-in-force EP2250770B1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP10015278.4A EP2317683B1 (fr) 2008-02-01 2009-01-30 Transmission de paquets via des liens multiples dans un système de communication sans fil

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US2565108P 2008-02-01 2008-02-01
US12/114,427 US8483223B2 (en) 2008-02-01 2008-05-02 Packet transmission via multiple links in a wireless communication system
PCT/US2009/032554 WO2009099921A2 (fr) 2008-02-01 2009-01-30 Transmission de paquets via plusieurs liaisons dans un système de communication sans fil

Related Child Applications (2)

Application Number Title Priority Date Filing Date
EP10015278.4A Division EP2317683B1 (fr) 2008-02-01 2009-01-30 Transmission de paquets via des liens multiples dans un système de communication sans fil
EP10015278.4 Division-Into 2010-12-03

Publications (2)

Publication Number Publication Date
EP2250770A2 EP2250770A2 (fr) 2010-11-17
EP2250770B1 true EP2250770B1 (fr) 2012-06-27

Family

ID=40931641

Family Applications (2)

Application Number Title Priority Date Filing Date
EP09707554A Not-in-force EP2250770B1 (fr) 2008-02-01 2009-01-30 Transmission de paquets via plusieurs liaisons dans un système de communication sans fil
EP10015278.4A Not-in-force EP2317683B1 (fr) 2008-02-01 2009-01-30 Transmission de paquets via des liens multiples dans un système de communication sans fil

Family Applications After (1)

Application Number Title Priority Date Filing Date
EP10015278.4A Not-in-force EP2317683B1 (fr) 2008-02-01 2009-01-30 Transmission de paquets via des liens multiples dans un système de communication sans fil

Country Status (10)

Country Link
US (1) US8483223B2 (fr)
EP (2) EP2250770B1 (fr)
JP (1) JP5437274B2 (fr)
KR (1) KR101154679B1 (fr)
CN (1) CN101933298B (fr)
BR (1) BRPI0906680A2 (fr)
CA (1) CA2710875A1 (fr)
RU (1) RU2475972C2 (fr)
TW (1) TWI389499B (fr)
WO (1) WO2009099921A2 (fr)

Families Citing this family (60)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8819512B1 (en) * 2008-01-19 2014-08-26 Appex Networks Holding Limited Method for detecting TCP packet losses and expediting packet retransmission
JP5814253B2 (ja) * 2009-12-04 2015-11-17 ナパテック アクティーゼルスカブ 装置、アセンブリ及びデータパケットの読み出し及び順番付けをする複数の解析手段を操作する方法
US8774190B2 (en) * 2010-02-08 2014-07-08 Qualcomm Incorporated Enhanced resequencing of data received over a wireless communication system
US20110299442A1 (en) * 2010-06-04 2011-12-08 Sairamesh Nammi Methods and apparatus for controlling location for starting decoding of sub-packets of a communication packet
US8731814B2 (en) 2010-07-02 2014-05-20 Ford Global Technologies, Llc Multi-modal navigation system and method
JP5393603B2 (ja) * 2010-07-07 2014-01-22 株式会社日立製作所 無線通信システム
US9846046B2 (en) 2010-07-30 2017-12-19 Ford Global Technologies, Llc Vehicle navigation method and system
US20120029806A1 (en) * 2010-07-30 2012-02-02 Ford Global Technologies, Llc Efficient Navigation Data Downloading
US8335643B2 (en) 2010-08-10 2012-12-18 Ford Global Technologies, Llc Point of interest search, identification, and navigation
US8521424B2 (en) 2010-09-29 2013-08-27 Ford Global Technologies, Llc Advanced map information delivery, processing and updating
US8849552B2 (en) 2010-09-29 2014-09-30 Ford Global Technologies, Llc Advanced map information delivery, processing and updating
US8483958B2 (en) 2010-12-20 2013-07-09 Ford Global Technologies, Llc User configurable onboard navigation system crossroad presentation
JP5614302B2 (ja) * 2011-01-20 2014-10-29 富士通株式会社 通信システムおよび通信方法
US8688321B2 (en) 2011-07-11 2014-04-01 Ford Global Technologies, Llc Traffic density estimation
US8824477B2 (en) * 2011-11-03 2014-09-02 Qualcomm Incorporated Multiple delivery route packet ordering
US8838385B2 (en) 2011-12-20 2014-09-16 Ford Global Technologies, Llc Method and apparatus for vehicle routing
US9713963B2 (en) 2013-02-18 2017-07-25 Ford Global Technologies, Llc Method and apparatus for route completion likelihood display
US9863777B2 (en) 2013-02-25 2018-01-09 Ford Global Technologies, Llc Method and apparatus for automatic estimated time of arrival calculation and provision
US8977479B2 (en) 2013-03-12 2015-03-10 Ford Global Technologies, Llc Method and apparatus for determining traffic conditions
US9047774B2 (en) 2013-03-12 2015-06-02 Ford Global Technologies, Llc Method and apparatus for crowd-sourced traffic reporting
US9843950B2 (en) * 2013-03-14 2017-12-12 Lg Electronics Inc. Method and apparatus for performing data transmission in wireless communication system
US9874452B2 (en) 2013-03-14 2018-01-23 Ford Global Technologies, Llc Method and apparatus for enhanced driving experience including dynamic POI identification
US10326577B2 (en) * 2013-08-13 2019-06-18 Qualcomm Incorporated Harq design for LTE in unlicensed spectrum utilizing individual ACK/NACK
US9992088B1 (en) 2014-11-07 2018-06-05 Speedy Packets, Inc. Packet coding based network communication
US10999012B2 (en) 2014-11-07 2021-05-04 Strong Force Iot Portfolio 2016, Llc Packet coding based network communication
US10320526B1 (en) 2014-11-07 2019-06-11 Strong Force Iot Portfolio 2016, Llc Packet coding based network communication
US10135746B2 (en) 2015-07-07 2018-11-20 Strong Force Iot Portfolio 2016, Llc Cross-session network communication configuration
US9992126B1 (en) 2014-11-07 2018-06-05 Speedy Packets, Inc. Packet coding based network communication
US9825733B1 (en) 2014-11-07 2017-11-21 Speedy Packets, Inc. Packet coding based network communication
US20160197669A1 (en) * 2014-12-11 2016-07-07 Tesla Wireless Company LLC Communication method and system that uses low latency/low data bandwidth and high latency/high data bandwidth pathways
US10712738B2 (en) 2016-05-09 2020-07-14 Strong Force Iot Portfolio 2016, Llc Methods and systems for industrial internet of things data collection for vibration sensitive equipment
CN107436876A (zh) * 2016-05-25 2017-12-05 富泰华工业（深圳）有限公司 文件分割系统及方法
US10856203B2 (en) 2017-01-19 2020-12-01 Qualcomm Incorporated Signaling for link aggregation setup and reconfiguration
US11337263B2 (en) 2017-01-19 2022-05-17 Qualcomm Incorporated Packet based link aggregation architectures
US10812216B2 (en) 2018-11-05 2020-10-20 XCOM Labs, Inc. Cooperative multiple-input multiple-output downlink scheduling
US10756860B2 (en) 2018-11-05 2020-08-25 XCOM Labs, Inc. Distributed multiple-input multiple-output downlink configuration
US10432272B1 (en) 2018-11-05 2019-10-01 XCOM Labs, Inc. Variable multiple-input multiple-output downlink user equipment
US10659112B1 (en) 2018-11-05 2020-05-19 XCOM Labs, Inc. User equipment assisted multiple-input multiple-output downlink configuration
US11290172B2 (en) 2018-11-27 2022-03-29 XCOM Labs, Inc. Non-coherent cooperative multiple-input multiple-output communications
US10756795B2 (en) 2018-12-18 2020-08-25 XCOM Labs, Inc. User equipment with cellular link and peer-to-peer link
US11063645B2 (en) 2018-12-18 2021-07-13 XCOM Labs, Inc. Methods of wirelessly communicating with a group of devices
US11330649B2 (en) 2019-01-25 2022-05-10 XCOM Labs, Inc. Methods and systems of multi-link peer-to-peer communications
US10756767B1 (en) 2019-02-05 2020-08-25 XCOM Labs, Inc. User equipment for wirelessly communicating cellular signal with another user equipment
US10686502B1 (en) 2019-04-29 2020-06-16 XCOM Labs, Inc. Downlink user equipment selection
US10735057B1 (en) 2019-04-29 2020-08-04 XCOM Labs, Inc. Uplink user equipment selection
US12464581B2 (en) 2019-07-12 2025-11-04 Lg Electronics Inc. Capability negotiation in multilink
US11411778B2 (en) 2019-07-12 2022-08-09 XCOM Labs, Inc. Time-division duplex multiple input multiple output calibration
WO2021031052A1 (fr) * 2019-08-18 2021-02-25 Qualcomm Incorporated Conception de codage de réseau
WO2021051380A1 (fr) 2019-09-20 2021-03-25 Qualcomm Incorporated Communication à faible latence avec des codes fontaine basés sur l'agrégation de porteuses
US12058750B2 (en) * 2020-03-11 2024-08-06 Qualcomm Incorporated Transmission opportunity handling for multi-link communications
US11411779B2 (en) 2020-03-31 2022-08-09 XCOM Labs, Inc. Reference signal channel estimation
CN115428513A (zh) 2020-04-15 2022-12-02 艾斯康实验室公司 无线网络多点关联性和多路径
KR102547010B1 (ko) * 2020-04-21 2023-06-23 한국전자통신연구원 무선 통신 시스템에서의 다중 연결 제어 방법 및 장치
US12028924B2 (en) 2020-04-21 2024-07-02 Electronics And Telecommunications Research Institute Method and apparatus for controlling multi-connectivity in wireless communication system
CN115226161A (zh) * 2021-04-15 2022-10-21 伊姆西Ip控股有限责任公司 用于数据传输的方法、电子设备和计算机程序产品
WO2022241436A1 (fr) 2021-05-14 2022-11-17 XCOM Labs, Inc. Identifiants de brouillage pour systèmes de communication sans fil
EP4327460A1 (fr) * 2021-06-30 2024-02-28 NEC Laboratories Europe GmbH Point d'accès radio virtualisé (vrap) et son procédé de fonctionnement
US20250008573A1 (en) * 2021-09-26 2025-01-02 Nokia Technologies Oy Dynamic reservation of links for supporting low-latency in unlicensed spectrum
US12489698B2 (en) * 2021-12-17 2025-12-02 Intel Corporation Packet encoding and allocation in multi-link systems
CN121077963A (zh) * 2022-03-11 2025-12-05 华为技术有限公司 发送数据的方法和相关设备

Family Cites Families (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0716370A3 (fr) * 1994-12-06 2005-02-16 International Business Machines Corporation Méthode d'accès de disque pour délivrer une information de type multimédia et vidéo à la demande sur des réseaux étendus
RU2189072C2 (ru) 1996-01-31 2002-09-10 Ипсилон Нетуоркс, Инк. Усовершенствованный способ и устройство для динамического смещения между пакетами маршрутизации и коммутации в сети передачи данных
US6236647B1 (en) * 1998-02-24 2001-05-22 Tantivy Communications, Inc. Dynamic frame size adjustment and selective reject on a multi-link channel to improve effective throughput and bit error rate
US6333929B1 (en) * 1997-08-29 2001-12-25 Intel Corporation Packet format for a distributed system
US6574211B2 (en) 1997-11-03 2003-06-03 Qualcomm Incorporated Method and apparatus for high rate packet data transmission
FI106591B (fi) * 1999-01-15 2001-02-28 Nokia Mobile Phones Ltd Menetelmä tiedonsiirtovirtausten välittämiseksi
JP3540183B2 (ja) 1999-01-21 2004-07-07 株式会社東芝 マルチリンク通信装置
JP4231593B2 (ja) 1999-07-21 2009-03-04 株式会社日立コミュニケーションテクノロジー 通信システム及びその通信方法
US7453878B1 (en) * 2000-07-21 2008-11-18 Silicon Graphics, Inc. System and method for ordering of data transferred over multiple channels
US20020087716A1 (en) * 2000-07-25 2002-07-04 Shakeel Mustafa System and method for transmitting customized multi priority services on a single or multiple links over data link layer frames
JP2002051001A (ja) 2000-08-03 2002-02-15 Ntt Docomo Inc 移動通信システムにおける通信方法、移動無線端末及び通信制御装置
US6721569B1 (en) * 2000-09-29 2004-04-13 Nortel Networks Limited Dynamic sub-carrier assignment in OFDM systems
US7027443B2 (en) * 2001-08-23 2006-04-11 Pmc-Sierra Ltd. Reassembly engines for multilink applications
TW589815B (en) * 2002-01-16 2004-06-01 Winbond Electronics Corp Control method for multi-channel data transmission
US6693910B2 (en) * 2002-06-28 2004-02-17 Interdigital Technology Corporation System and method for avoiding stall of an H-ARQ reordering buffer in a receiver
SE0303590D0 (sv) * 2003-12-29 2003-12-29 Ericsson Telefon Ab L M Method and arrangement for ARQ in packet data transmission
US7944992B2 (en) * 2005-06-17 2011-05-17 Telefonaktiebolaget Lm Ericsson (Publ) Multicarrier CDMA system
US7757028B2 (en) * 2005-12-22 2010-07-13 Intuitive Surgical Operations, Inc. Multi-priority messaging
US7664085B2 (en) * 2005-12-30 2010-02-16 Intel Corporation Wireless communication device and method for coordinating communications among wireless local area networks (WLANs) and broadband wireless access (BWA) networks
US8630239B2 (en) * 2006-09-20 2014-01-14 Lg Electronics Inc. Station and access point for EDCA communication, system thereof and communication method thereof
US8077658B2 (en) * 2007-10-01 2011-12-13 Microsoft Corporation Packet forwarding in multi-radio multi-hop wireless networks

Also Published As

Publication number Publication date
KR101154679B1 (ko) 2012-06-13
EP2317683A2 (fr) 2011-05-04
US8483223B2 (en) 2013-07-09
KR20100112187A (ko) 2010-10-18
TW200943798A (en) 2009-10-16
RU2010136729A (ru) 2012-03-10
JP2011514722A (ja) 2011-05-06
US20090196294A1 (en) 2009-08-06
CN101933298A (zh) 2010-12-29
CA2710875A1 (fr) 2009-08-13
EP2317683B1 (fr) 2016-08-24
TWI389499B (zh) 2013-03-11
RU2475972C2 (ru) 2013-02-20
EP2317683A3 (fr) 2011-08-03
EP2250770A2 (fr) 2010-11-17
WO2009099921A3 (fr) 2009-10-01
BRPI0906680A2 (pt) 2018-01-16
CN101933298B (zh) 2013-11-27
JP5437274B2 (ja) 2014-03-12
WO2009099921A2 (fr) 2009-08-13

Similar Documents

Publication Publication Date Title
EP2250770B1 (fr) Transmission de paquets via plusieurs liaisons dans un système de communication sans fil
US11403193B2 (en) Transmission control method for HARQ in mobile communication system
CN101578805B (zh) 无线通信系统中的无冲突组跳变
CN101953106B (zh) 在通信系统中发送组ack/nack的方法
JP4422620B2 (ja) フレーム受信の否定応答の早期送信のためのアイドルフレームの使用
US9049017B2 (en) Efficient TCP ACK prioritization in wireless networks
CN101981857B (zh) 用于harq缓冲器大小减小的装置和方法
EP3881469B1 (fr) Harq de liaison montante dans des réseaux cellulaires de communication sans fil
EP2241126A1 (fr) Procédé d'échange de données entre une station de base et une station mobile
US8625505B2 (en) Method and device for controlling transmission resources for automatic repeat request processes
CN112272964B (zh) 蜂窝网络中的传输技术

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

AK Designated contracting states

Kind code of ref document: A2

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

AX Request for extension of the european patent

Extension state: AL BA RS

DAX Request for extension of the european patent (deleted)
17Q First examination report despatched

Effective date: 20110630

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602009007890

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: H04L0012560000

Ipc: H04L0001180000

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 12/56 20060101ALI20111006BHEP

Ipc: H04L 1/18 20060101AFI20111006BHEP

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

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 HR HU IE IS IT LI LT LU LV MC MK MT NL NO 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: AT

Ref legal event code: REF

Ref document number: 564668

Country of ref document: AT

Kind code of ref document: T

Effective date: 20120715

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602009007890

Country of ref document: DE

Effective date: 20120823

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

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

Ref country code: NO

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

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

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

REG Reference to a national code

Ref country code: NL

Ref legal event code: VDEP

Effective date: 20120627

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 564668

Country of ref document: AT

Kind code of ref document: T

Effective date: 20120627

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

Effective date: 20120627

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

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

Ref country code: HR

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

26N No opposition filed

Effective date: 20130328

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602009007890

Country of ref document: DE

Effective date: 20130328

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

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 NON-PAYMENT OF DUE FEES

Effective date: 20130131

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20130930

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

Ref country code: LI

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

Effective date: 20130131

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

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

Ref country code: IE

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

Effective date: 20130130

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

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

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

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

Ref country code: LU

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

Effective date: 20130130

Ref country code: MK

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

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

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20191231

Year of fee payment: 12

Ref country code: DE

Payment date: 20191218

Year of fee payment: 12

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602009007890

Country of ref document: DE

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

Effective date: 20210130

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

Ref country code: DE

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

Effective date: 20210803

Ref country code: GB

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

Effective date: 20210130