EP2507931B1 - Data carrier identification method and system - Google Patents
Data carrier identification method and system Download PDFInfo
- Publication number
- EP2507931B1 EP2507931B1 EP10816318.9A EP10816318A EP2507931B1 EP 2507931 B1 EP2507931 B1 EP 2507931B1 EP 10816318 A EP10816318 A EP 10816318A EP 2507931 B1 EP2507931 B1 EP 2507931B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- carriers
- transmission control
- carrier
- control frame
- list
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims description 67
- 230000005540 biological transmission Effects 0.000 claims description 150
- 239000000969 carrier Substances 0.000 claims description 116
- 230000008569 process Effects 0.000 description 28
- 230000011664 signaling Effects 0.000 description 14
- 230000002776 aggregation Effects 0.000 description 6
- 238000004220 aggregation Methods 0.000 description 6
- 238000012937 correction Methods 0.000 description 5
- 238000001514 detection method Methods 0.000 description 4
- 238000001228 spectrum Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 238000004590 computer program Methods 0.000 description 2
- 238000013507 mapping Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000001174 ascending effect Effects 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
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/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1822—Automatic repetition systems, e.g. Van Duuren systems involving configuration of automatic repeat request [ARQ] with parallel processes
-
- 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/1893—Physical mapping arrangements
-
- 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—Arrangements for allocating sub-channels of the transmission path allocation of payload
-
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/20—Control channels or signalling for resource management
- H04W72/23—Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal
Definitions
- the present invention relates in general to telecommunication network functions and more specifically to telecommunication carrier identification.
- 3GPP LTE Long Term Evolution
- 3GPP Third Generation Partnership Project
- Goals have included so far improving efficiency, lowering costs, improving services, making use of new spectrum opportunities, and better integration with open standards.
- IMT International Mobile Telecommunication
- IMT-Advanced has aimed at providing enhanced peak data rates to support advanced services and applications (100 Mbit/s for high and 1 Gbit/s for low mobility were established as targets for research). Altogether, future 3GPP LTE-Advanced systems will require wider system bandwidth, e.g. up to 100MHz, to achieve such high target peak data rates.
- Carrier aggregation is a natural choice that could either meet the bandwidth extension requirement or ensure sufficient backward compatibility towards LTE Release-8.
- Carrier Aggregation multiple Component Carriers (CCs) are aggregated according to the desired LTE-Advanced system bandwidth. These CCs are either LTE Release-8 compatible or designed specially to support new LTE Advanced features.
- a LTE Release-8 user equipment may receive one of these component carriers, while an LTE-Advanced user equipment may simultaneously access multiple component carriers.
- carrier aggregation does not require extensive changes of LTE physical layer structure, and can reuse the most of the existing implementations.
- Hybrid Automatic Repeat Request is a variation of an Automatic Repeat Request (ARQ) error control method, which performs better ARQ, particularly over wireless channels.
- ARQ Automatic Repeat Request
- An example of HARQ also referred to as Type I HARQ, combines Forward Error Correction (FER) and ARQ by encoding a data block and error-detection information (such as Cyclic Redundancy Check (CRC)) with an error-correction code (such as e.g. Reed-Solomon code or Turbo code) prior to transmission.
- FER Forward Error Correction
- CRC Cyclic Redundancy Check
- error-correction code such as e.g. Reed-Solomon code or Turbo code
- the receiver may derive the correct data block. If the channel quality is good enough, all transmission errors should be correctable, and the receiver may derive the correct data block. If the channel quality is not good enough and not all transmission errors can be corrected, the receiver detects this situation using the error-detection code, then the received coded data block may be discarded or stored and a retransmission is requested by the receiver, similar to ARQ. In practice, incorrectly received coded data blocks (i.e. erroneous data blocks) are often stored at the receiver rather than discarded, and when the retransmitted block is received, the two blocks are combined (chase combining) before being fed to the decoder of the error-correction code. This can increase the probability of successful decoding.
- Type II/III HARQ or incremental redundancy HARQ, where different (re)transmissions are coded differently rather than repeating the same coded bits as in chase combining. Performance is improved, since coding is effectively done across retransmissions.
- the difference between type III HARQ and type II HARQ is that the retransmission packets in Type III HARQ can be decoded by themselves.
- the HARQ method uses at least one HARQ process and some HARQ process entities, here under referred to, respectively, as set of transmission control frames and transmission control frames.
- Each transmission control frame may comprise one or more header and one or more data blocks.
- Each transmission control frames are transmitted between an emitter and a receiver in a telecommunication network. In other words, data blocks are transmitted using transmission control frames.
- the plurality of carriers may be divided into time intervals or time slots, wherein each transmission control frame is transmitted on each carrier at each time interval (as described here under in reference to Figure 3 ).
- CA Carrier Aggregation
- UE User Equipment
- CCs Component Carriers
- re-transmission of data blocks may be allowed across CCs in order to better exploit frequency diversity.
- errors detected in a data block transmitted in a first carrier are less likely to happen in retransmission of the same data block on another carrier at a different frequency.
- HARQ process entities may be grouped into sets, each set being dedicated, for example, to a given user equipment or data stream.
- Multiple stop-and-wait HARQ process entities may be transmitted in parallel on the same or different CC(s) so that while one HARQ process is waiting for an acknowledgement for a given HARQ process entity other HARQ process entities may use the carrier(s) to send additional packets.
- HARQ process or transmission control frame process each comprising a plurality of HARQ process entities or transmission control frames.
- the number of HARQ process entities should be in accordance with the roundtrip time between the emitter and the receiver to allow for continuous transmission, including the respective processing time of the data blocks, HARQ process entities and HARQ process.
- the emitter and the receiver may be a user equipment (UE) and a eNodeB (station or radio controller element of the 3GPP LTE network) or vice-and-versa.
- UE user equipment
- eNodeB station or radio controller element of the 3GPP LTE network
- the number of HARQ process entities may be configurable. For example, a set of eight HARQ process entities or transmission control frames may be used for a given component carrier or user equipment or data stream.
- one HARQ process i.e. a set of HARQ process entities
- the UE To perform operations such as soft combining (cohesion of data streams from multiple base stations or eNodeB that share a common time line and are operated according to it), in-sequence delivery and so on, the UE has to identify the HARQ process entities or transmission control frames of the carrier(s) it transmits on.
- HARQ process sets may be flexibly mapped to carriers up-link and down-link. It allows retransmission across carriers, which may derive higher frequency diversity gain or flexible scheduling gain.
- additional bits are needed in the header (here under called transmission control frame indication) of each transmission control frame are needed to identify the previous carrier the transmission control frame was transmitted onto. This seems to be a large signalling overhead, especially when using many carriers.
- This indication may be used for instance by an emitter to inform a receiver of which HARQ process set has been used in a control channel (such as e.g. a Physical Downlink Shared Channel (PDSCH) or a Physical Uplink Shared Channel (PUSCH)).
- PDSCH Physical Downlink Shared Channel
- PUSCH Physical Uplink Shared Channel
- the invention proposes a method of coding identification of carriers from a list of carriers in a telecommunication network according to claim 1.
- the invention also proposes a method of identifying carriers from a list of carriers in a telecommunication network according to claim 4.
- the invention also proposes an emitter according to claim 7.
- the invention also proposes a receiver according to claim 10.
- the invention also proposes a system according to claim 13.
- the invention also proposes a readable computer program according to claim 14.
- the invention also proposes a readable computer program according to claim 15.
- the CCs are ordered in an ascending/descending way and numbered for identification. Then, several signalling bits are associated to each transmission control frame to transmit, indicating the previous carrier the transmission control frame was transmitted onto. Finally, the receiver determines the corresponding relationship according to the received signalling bits.
- This invention allows reducing the transmission control frame identification bits when transmission control frames are flexibly mapped onto up-link or down-link carriers.
- the number of bits in the transmission control frame indication may be reduced to [log 2 n]+ [log 2 (n-1)]+...+ [log 2 2] bits at each time interval.
- the signalling bits may be transmitted together in a single transmission control frame indication or separately in each transmission control frame indication.
- the method and system according to the invention involve an emitter and a receiver.
- the exemplary embodiment will be described hereafter in its application to a eNodeB and a user equipment of a wireless telecommunication network. Both may be either receiver or emitter.
- the number of transmission control frames may correspond to the number of data blocks that may be sent while waiting for receiving a feed-back or acknowledgement message for the first transmission control block associated with the first sent data block.
- the feed-back message may be sent by the receiver to inform the emitter that a given data block in a given transmission control frame was received either successfully or unsuccessfully.
- a receiver receives a transmission control frame, it analyses the data block(s) comprised in the transmission data block to detect any error that may have occurred during the transmission of the transmission control frame. Error detection may be performed for example using existing error-detection or error-correction codes. When no error is detected, the analyzed received data block may be used to reconstruct the data stream associated with it at the receiver.
- the error in the received data block may be due to quality of the carrier used for transmitting the corresponding control frame.
- the emitter needs therefore the reschedule the transmission of the erroneous data block to the receiver onto a different carrier, using the same transmission control frame.
- the allocation of carriers is performed carrier by carrier. Firstly, each data block to retransmit from the emitter is assigned to the same transmission control frame than the one previously used (i.e. the last transmission control frame used for previously send the data block). A carrier, preferably a different carrier from the one previously used, is allocated for transmitting said transmission control frame. Then, remaining or non-allocated carriers may be allocated to transmission control frame for transmitting data blocks that have never been transmitted yet.
- Figure 3b describes an illustrative embodiment of the method according to the invention performed by the receiver.
- the method allows identifying carriers from a list of carriers in a telecommunication network 105.
- Each of the carriers allows the transmission of a transmission control frame.
- Each of said transmission control frame comprises:
- Transmission control frame c 0 is transmitted over carrier (a) (in other words, carrier (a) is allocated to transmission control frame b 0 ) and comprises an indication that it was transmitted at time interval t 0 on carrier (c).
- Figure 5 describes an illustrative embodiment of the method according to the invention at the emitter (respectively receiver), wherein the signalling bits of the indications of a plurality of transmission control frames at the same time interval are grouped into a single transmission control frame.
- indications may, in an alternative embodiment, be inserted (respectively retrieved) in one, or a plurality of, different transmission control frame(s) rather than in each corresponding transmission control frame.
- Each indication may be easily derived from the sequence(s) of binary bits as long as they remain ordered.
- the indication inserted (respectively retrieved) in the first transmission control frame is '10011' and there are four carriers at the total. Consequently, two bits are needed to first code (respectively identify) a carrier used at the previous corresponding time slot among the four carriers. Bits '10' correspond thus to the indication in the transmission control frame on the first carrier.
- the carrier coded (respectively identified) by '10' is carrier (c) which is removed from the list of carriers. Then, as three carriers remain in the list of carriers, 2 bits are still needed to code (respectively identify) a carrier.
- '01' indicates that the second carrier of the sequence (00, 01, 10, 11) corresponding to the list of remaining carriers (a, b and d), namely carrier (b), will be used (respectively was used) to transmit the same transmission control frame on time interval t 0 .
- carriers for transmission control frames for retransmitted block may be allocated first by the emitter for ensuring frequency diversity.
- carriers (a) and (b) may thus be respectively allocated to transmission control frames d 0 and a 0 .
- Table 1 shows an example of the number of signalling bits that may be saved using the method according to the invention. The greater number of carriers is used, the more signalling bits are saved. Table 1 HARQ process indication bits comparison Number of CC Bits needed with the invention Bits needed in prior art Number of bits saved Proportion of bits saved 1 3 3 0 0 2 7 8 1 12.5% 3 12 15 3 20% 4 17 20 3 15% 5 23 30 7 23.3% 6 29 36 7 19.4%
Description
- The present invention relates in general to telecommunication network functions and more specifically to telecommunication carrier identification.
- On one hand, 3GPP LTE (Long Term Evolution) is the name given to a project within the Third Generation Partnership Project (3GPP) to improve the UMTS mobile phone standard to cope with future requirements. Goals have included so far improving efficiency, lowering costs, improving services, making use of new spectrum opportunities, and better integration with open standards. In another hand, International Mobile Telecommunication (IMT)-Advanced has aimed at providing enhanced peak data rates to support advanced services and applications (100 Mbit/s for high and 1 Gbit/s for low mobility were established as targets for research). Altogether, future 3GPP LTE-Advanced systems will require wider system bandwidth, e.g. up to 100MHz, to achieve such high target peak data rates. However, it may become a challenge to find contiguous spectrum allocations that can accommodate such wide bandwidth, since the spectrum bands are limited. Furthermore, spectrum segments used by operators but not necessarily located contiguously or in the same frequency band may be considered. At the same time, backward compatibility towards LTE Release-8 (prior to LTE-Advanced) should be ensured. Carrier aggregation (CA) is a natural choice that could either meet the bandwidth extension requirement or ensure sufficient backward compatibility towards LTE Release-8. In Carrier Aggregation, multiple Component Carriers (CCs) are aggregated according to the desired LTE-Advanced system bandwidth. These CCs are either LTE Release-8 compatible or designed specially to support new LTE Advanced features. A LTE Release-8 user equipment may receive one of these component carriers, while an LTE-Advanced user equipment may simultaneously access multiple component carriers. Compared to other approaches, carrier aggregation does not require extensive changes of LTE physical layer structure, and can reuse the most of the existing implementations.
- When Carrier Aggregation is implemented, existing Hybrid Automatic Repeat Request method is an important aspect. The Hybrid Automatic Repeat Request (Hybrid ARQ, H-ARQ) is a variation of an Automatic Repeat Request (ARQ) error control method, which performs better ARQ, particularly over wireless channels. An example of HARQ, also referred to as Type I HARQ, combines Forward Error Correction (FER) and ARQ by encoding a data block and error-detection information (such as Cyclic Redundancy Check (CRC)) with an error-correction code (such as e.g. Reed-Solomon code or Turbo code) prior to transmission. When the coded data block is received, the receiver first decodes the error-correction code. If the channel quality is good enough, all transmission errors should be correctable, and the receiver may derive the correct data block. If the channel quality is not good enough and not all transmission errors can be corrected, the receiver detects this situation using the error-detection code, then the received coded data block may be discarded or stored and a retransmission is requested by the receiver, similar to ARQ. In practice, incorrectly received coded data blocks (i.e. erroneous data blocks) are often stored at the receiver rather than discarded, and when the retransmitted block is received, the two blocks are combined (chase combining) before being fed to the decoder of the error-correction code. This can increase the probability of successful decoding. An another existing solution is Type II/III HARQ, or incremental redundancy HARQ, where different (re)transmissions are coded differently rather than repeating the same coded bits as in chase combining. Performance is improved, since coding is effectively done across retransmissions. The difference between type III HARQ and type II HARQ is that the retransmission packets in Type III HARQ can be decoded by themselves. The HARQ method uses at least one HARQ process and some HARQ process entities, here under referred to, respectively, as set of transmission control frames and transmission control frames. Each transmission control frame may comprise one or more header and one or more data blocks. Each transmission control frames are transmitted between an emitter and a receiver in a telecommunication network. In other words, data blocks are transmitted using transmission control frames. Moreover, the plurality of carriers may be divided into time intervals or time slots, wherein each transmission control frame is transmitted on each carrier at each time interval (as described here under in reference to
Figure 3 ). - In wireless Carrier Aggregation (CA) systems, for example, one User Equipment (UE) may be scheduled simultaneously on multiple (i.e. a plurality of) Component Carriers (CCs). Therefore, re-transmission of data blocks may be allowed across CCs in order to better exploit frequency diversity. In other words, errors detected in a data block transmitted in a first carrier are less likely to happen in retransmission of the same data block on another carrier at a different frequency. HARQ process entities may be grouped into sets, each set being dedicated, for example, to a given user equipment or data stream. Multiple stop-and-wait HARQ process entities may be transmitted in parallel on the same or different CC(s) so that while one HARQ process is waiting for an acknowledgement for a given HARQ process entity other HARQ process entities may use the carrier(s) to send additional packets. For each user equipment, there may be one HARQ process or transmission control frame process, each comprising a plurality of HARQ process entities or transmission control frames. The number of HARQ process entities should be in accordance with the roundtrip time between the emitter and the receiver to allow for continuous transmission, including the respective processing time of the data blocks, HARQ process entities and HARQ process. For example, the emitter and the receiver may be a user equipment (UE) and a eNodeB (station or radio controller element of the 3GPP LTE network) or vice-and-versa. Using a larger number of HARQ process entities than required by the roundtrip time does not provide any gain, but rather introduces unnecessary delays between retransmissions. Since processing time of the of the data blocks, HARQ process entities and HARQ process for an eNodeB may differ among different implementations, the number of HARQ process entities may be configurable. For example, a set of eight HARQ process entities or transmission control frames may be used for a given component carrier or user equipment or data stream. When Carrier Aggregation is used, one HARQ process (i.e. a set of HARQ process entities) may be used per component carrier (called here under "carrier" for simplification purposes) to increase the number of HARQ process entities (and therefore the bandwidth) for one user equipment.
- To perform operations such as soft combining (cohesion of data streams from multiple base stations or eNodeB that share a common time line and are operated according to it), in-sequence delivery and so on, the UE has to identify the HARQ process entities or transmission control frames of the carrier(s) it transmits on.
- HARQ process sets may be flexibly mapped to carriers up-link and down-link. It allows retransmission across carriers, which may derive higher frequency diversity gain or flexible scheduling gain. However, additional bits are needed in the header (here under called transmission control frame indication) of each transmission control frame are needed to identify the previous carrier the transmission control frame was transmitted onto. This seems to be a large signalling overhead, especially when using many carriers. This indication may be used for instance by an emitter to inform a receiver of which HARQ process set has been used in a control channel (such as e.g. a Physical Downlink Shared Channel (PDSCH) or a Physical Uplink Shared Channel (PUSCH)). It may also be considered that flexible HARQ process sets mapping to carriers is allowed to a limited range only (e.g. only for retransmissions within carrier pairs, etc...) for signalling efficiency.
- As described in document "3GPP TSG RAN WG1 #56, R1-090652, "HARQ mapping across aggregated component carriers", LG Electronics, 09-13 Feb., 2009" which is considered as the most relevant state of the art document: the simplest way is to list all of the possibilities and inform the destination, requiring thus n.[log2 n] bits of signalling. The major drawback with this method is that there is a need for much control signalling and, in particular, control signalling overheads are too big.
- Today there is no solution to efficiently reduce signalling overhead that allow reducing signalling and thus improving efficiency of such wireless telecommunication systems.
- Today there is a need for a control signalling solution that can be easily implemented on the existing communication infrastructures.
- It is an object of the present system to overcome disadvantages and/or make improvement over the prior art.
- To that extend, the invention proposes a method of coding identification of carriers from a list of carriers in a telecommunication network according to
claim 1. - The invention also proposes a method of identifying carriers from a list of carriers in a telecommunication network according to
claim 4. The invention also proposes an emitter according toclaim 7. The invention also proposes a receiver according toclaim 10. The invention also proposes a system according to claim 13. The invention also proposes a readable computer program according to claim 14. The invention also proposes a readable computer program according to claim 15. When the re-transmitted data blocks are flexibly scheduled in transmission control frames across a plurality of carriers, the receiver needs to know which carrier the re-transmitted data blocks originally locate on, and then performs combining with the corresponding corrupted block in buffer. The method according to the invention allows identifying the permutation of the transport blocks efficiently. - First, the CCs are ordered in an ascending/descending way and numbered for identification. Then, several signalling bits are associated to each transmission control frame to transmit, indicating the previous carrier the transmission control frame was transmitted onto. Finally, the receiver determines the corresponding relationship according to the received signalling bits.
- This invention allows reducing the transmission control frame identification bits when transmission control frames are flexibly mapped onto up-link or down-link carriers. By identifying the previous carrier on which erroneous data blocks were transmitted among the plurality of carriers, the number of bits in the transmission control frame indication may be reduced to [log2 n]+ [log2 (n-1)]+...+ [log2 2] bits at each time interval.
- Furthermore, in an additional embodiment of the present invention, the signalling bits may be transmitted together in a single transmission control frame indication or separately in each transmission control frame indication.
- Embodiments of the present invention will now be described solely by way of example and only with reference to the accompanying drawings, where like parts are provided with corresponding reference numerals, and in which:
-
Figure 1 schematically illustrates a system according to an embodiment of the present invention; -
Figure 2 schematically illustrates a method according to an embodiment of the present invention; -
Figure 3 schematically illustrates transmission control frames distribution across carriers according to an embodiment of the present invention; -
Figure 4 schematically illustrates transmission control frames at a time interval according to an embodiment of the present invention; -
Figure 5 schematically illustrates transmission control frames at a time interval according to an embodiment of the present invention. - The following are descriptions of exemplary embodiments that when taken in conjunction with the drawings will demonstrate the above noted features and advantages, and introduce further ones.
- In the following description, for purposes of explanation rather than limitation, specific details are set forth such as architecture, interfaces, techniques, devices etc..., for illustration. However, it will be apparent to those of ordinary skill in the art that other embodiments that depart from these details would still be understood to be within the scope of the appended claims.
- Moreover, for the purpose of clarity, detailed descriptions of well-known devices, systems, and methods are omitted so as not to obscure the description of the present system. Furthermore, routers, servers, nodes, gateways or other entities in a telecommunication network are not detailed as their implementation is beyond the scope of the present system and method.
- The method and system according to the invention involve an emitter and a receiver. Unless specified otherwise, the exemplary embodiment will be described hereafter in its application to a eNodeB and a user equipment of a wireless telecommunication network. Both may be either receiver or emitter.
- In addition, it should be expressly understood that the drawings are included for illustrative purposes and do not represent the scope of the present system.
-
Figure 1 describes an illustrative embodiment of a system according to the invention. A User Equipment (UE) 100 may exchange data blocks of information with aneNodeB 110 on a communication interface of atelecommunication network 105. Data blocks may correspond to different streams of data to exchange between theUE 100 and theeNodeB 110. Data blocks are transmitted in transmission control frames. A transmission control frame may be for example a HARQ process entity. Transmission control frames allow data blocks to be transmitted on one or more carrier(s) of the communication interface of atelecommunication network 105. Data blocks are embedded in transmission control frames. Therefore, carrier allocation needs to be performed to allocate or select a carrier to transmit each transmission control frame. - Carriers are divided into time intervals or time slots. Carriers are sequenced, named or numbered so that they may be used in the same order on each time slot. Each carrier allows exchanging (in other words, sending and/or receiving) data blocks using transmission control frames. Each transmission control frame comprises at least one data block corresponding to a data stream of data blocks. Transmission control frames are exchanged between an emitter and a receiver.
- Each data stream may be associated with a set of transmission control frames. Data blocks may be associated with the same data stream by being, for example, comprised in transmission control frames of the same set of transmission control frames.
- The number of transmission control frames may correspond to the number of data blocks that may be sent while waiting for receiving a feed-back or acknowledgement message for the first transmission control block associated with the first sent data block. The feed-back message may be sent by the receiver to inform the emitter that a given data block in a given transmission control frame was received either successfully or unsuccessfully. Each time a receiver receives a transmission control frame, it analyses the data block(s) comprised in the transmission data block to detect any error that may have occurred during the transmission of the transmission control frame. Error detection may be performed for example using existing error-detection or error-correction codes. When no error is detected, the analyzed received data block may be used to reconstruct the data stream associated with it at the receiver. When an error is detected, a feedback message is sent by the receiver of the transmission control frame associated with the erroneous data block to the emitter of the transmission control frame for the corresponding data block. Once, it has received an unsuccessful feedback message for a given erroneous data block from the receiver, the emitter needs the reschedule the transmission of the erroneous data block to the receiver. The same transmission control frame (in other words, the same process entity) is used to retransmit the data block. This allows the receiver to identify the retransmitted data block that corresponds to the erroneous data block. Erroneous data blocks are retransmitted using the same transmission control frame so that two successive transmission control frames comprise either two successive new or correct (i.e. successful) data blocks or one erroneous data block in the former transmission control frame and the retransmitted data block in the latter transmission control frame.
- The error in the received data block may be due to quality of the carrier used for transmitting the corresponding control frame. The emitter needs therefore the reschedule the transmission of the erroneous data block to the receiver onto a different carrier, using the same transmission control frame. The allocation of carriers is performed carrier by carrier. Firstly, each data block to retransmit from the emitter is assigned to the same transmission control frame than the one previously used (i.e. the last transmission control frame used for previously send the data block). A carrier, preferably a different carrier from the one previously used, is allocated for transmitting said transmission control frame. Then, remaining or non-allocated carriers may be allocated to transmission control frame for transmitting data blocks that have never been transmitted yet.
- The carrier associated with a transmission control frame at a given time may be identified by an identifier. Said identifier may be for instance coded on a binary number. Carriers are therefore numbered. For example, 2 binary bits are needed to identify four carriers a, b, c, d as respectively 00, 01, 10 and 11, 3 bits are needed for
identify 5 to 8 carriers, etc... -
Figure 2 describes an illustrative embodiment of the invention using four carriers (a) 310, (b) 320, (c) 330 and (d) 340 as an example. The number of carriers does not limit the scope of the present invention. Each set of transmission control frames comprises eight transmission control frames. - For instance, a first set of transmission control frames may be labelled as {a0, a1, ..., a7}, wherein ai is the (i+1)th transmission control frame of the first set of transmission control frames. As described in
Figure 3 , for instance, the set of transmission control frames {a0, a1, ..., a7} on respectively time intervals {t0, t1, ..., t7}. As explained here above, the number of time intervals needed to send, from the emitter, all the transmission control frames in a set to the receiver may correspond to the time needed to receive at the emitter the feedback message from the receiver. For example, onFigure 3 , the data blocks comprised respectively in transmission control frames a0 and d0 are erroneous. In this case, when the emitter receives the corresponding feedback messages by the end of time interval t0+7 (in other words, before eight times the time interval duration from the sending of the first transmission control frame of the set), it needs to reschedule the retransmission of the same original data blocks in the same transmission control frames (respectively in a0 and d0) but on other carriers using the method according to the invention. - In
Figure 3 , the transmission control frame a0 transmitted on carrier (a) 310 at time interval t0 and comprising the data block(s) to retransmit (i.e. the data block(s) received with error at the receiver) is rescheduled on carrier (d) 340 at time interval t0+8. The transmission control frame d0 transmitted on carrier (d) 340 at time interval t0 and comprising the data block(s) to retransmit (i.e. the data block(s) received with error at the receiver) is rescheduled on carrier (c) 330 at time interval t0+8. -
Figure 3a describes an illustrative embodiment of the method according to the invention performed by the emitter. The method allows coding the identification of carriers from a list of carriers in atelecommunication network 105 prior to transmission of the corresponding transmission control frame. Each of the carriers allows the transmission of a transmission control frame. Each of the transmission control frame comprises: - a data block corresponding to a data stream, and
- an indication of the previous carrier allocated to the data stream.
-
Figure 3b describes an illustrative embodiment of the method according to the invention performed by the receiver. - The method allows identifying carriers from a list of carriers in a
telecommunication network 105. Each of the carriers allows the transmission of a transmission control frame. Each of said transmission control frame comprises: - a data block corresponding to a data stream, and
- an indication of the previous carrier allocated to the data stream.
-
Figure 4 describes the indications in transmission control frames at time interval t0+8, in reference toFigure 3 , in the method according to the invention. The emitter allocates a carrier and determines the bits for identifying said carrier then inserts them as indication(s) into the transmission control frame(s). The receiver retrieves the bits for identifying the carriers of the indication from the transmission control frame(s). - Data blocks transmitted in transmission control frames b0 and c0 at time interval t0 were successful (i.e. not erroneous). Data blocks transmitted in transmission control frames a0 and d0 at time interval t0 were unsuccessful (i.e. erroneous).
- At time interval t0+8, new data blocks (i.e. that have never been transmitted yet in the current data stream transmissions) are transmitted in transmission control frames b0 and c0. Transmission control frame c0 is transmitted over carrier (a) (in other words, carrier (a) is allocated to transmission control frame b0) and comprises an indication that it was transmitted at time interval t0 on carrier (c).
- As all four carriers are at first to be allocated, the number of binary bits needed, as explained here above, to identify a carrier among the four carriers is determined as being 2 (carrier (a) may be identified as '00', carrier (b) may be identified as '01', carrier (c) may be identified as '10' and carrier (d) may be identified as '11'). The indication indicating that carrier (c) was used to transmit transmission control frame c0 at time interval t0 is thus coded on 2 bits as described in
Figure 4 (corresponding to bits '10'). Carrier (c) on which the transmission control frame c0 was previously transmitted at time interval t0 is removed from the list of carriers. There are therefore 3 carriers left at this stage on the list of carriers (i.e. carriers that were use to transmit other transmission control frames at time interval t0), namely carriers (a), (b) and (d). - Carrier (b) is then allocated with a new data block(s) as the previous data block(s) transmitted using transmission control frame b0 was not erroneous. The number of binary bits needed to identify the three remaining carriers is 2 (carrier (a) may be identified as '00', carrier (b) may be identified as '01' and carrier (d) may be identified as '10'). The indication corresponding thus to carrier (b) to insert the transmission control frame b0 is 01. Carrier (b) used at time interval t0 is then removed from the list of carriers and there now are two carriers remaining in the list namely carriers (a) and (d). There is a need for only 1 bit to identify the two remaining carriers whose transmission control frame transmitted at time interval t0 have not been allocated yet at time interval t0+8: '0' for carrier (a) and '1' for carrier (d). The indication '1' corresponding to carrier (d) is thus inserted into the transmission control frame d0 on selected carrier (c). For indication the remaining carrier (a), '0' may be inserted as an indication into the transmission control frame a0 or preferably not be inserted as shown in
Figure 4 as there is only one carrier to identify among the list of carriers (i.e. there is no other choice) and it is therefore useless to use a binary bit to indicate it. - Subsequent to transmission at time interval t0+8, the receiver analyzes on each carrier, in each transmission control frame, each indication. As there are four carriers, the receiver may determine that 2 binary bits are needed to identify one carrier among the four. The indication '10' in the first transmission control frame on carrier (a) indicates thus that the third carrier among the four (identified sequentially as '00', '01', '10' and '11') was previously used for the transmission of the same transmission control frame at time interval t0. The receiver may thus remove carrier (c) from the list of carrier. The three remaining carriers (a, b and d) are renumbered as being identified respectively as '00', '01' and '10'. The receiver then analyzes the indication in the transmission control frame of carrier (b): '01', which indicates the second carrier in the list of remaining carriers (a, b, d), namely carrier (b), used by the same transmission control frame at time interval t0. It removes then carrier (b) from the list of carriers. Carriers (a and d) remains thus in the list of carriers, which corresponds to renumbered carriers '0' and '1'. Then, the receiver analyzes the indication '1' in the transmission control frame of carrier (c). There are only two carriers remaining, so only one binary bit is needed to identify one of them. '1' corresponds in the list of carrier (a, d) to carrier (d), which is removed from the list of carriers. The receiver then concludes that the remaining carrier in the list, carrier (a) in this example, is the carrier on which the transmission control frame received on carrier (d) at time interval t0+8 was transmitted at time interval t0.
-
Figure 5 describes an illustrative embodiment of the method according to the invention at the emitter (respectively receiver), wherein the signalling bits of the indications of a plurality of transmission control frames at the same time interval are grouped into a single transmission control frame. - Once the method according to the invention has been carried out at a given time interval at the emitter (respectively receiver), indications may, in an alternative embodiment, be inserted (respectively retrieved) in one, or a plurality of, different transmission control frame(s) rather than in each corresponding transmission control frame.
- Each indication may be easily derived from the sequence(s) of binary bits as long as they remain ordered.
- Taking the example of
Figure 5 , the indication inserted (respectively retrieved) in the first transmission control frame is '10011' and there are four carriers at the total. Consequently, two bits are needed to first code (respectively identify) a carrier used at the previous corresponding time slot among the four carriers. Bits '10' correspond thus to the indication in the transmission control frame on the first carrier. The carrier coded (respectively identified) by '10' is carrier (c) which is removed from the list of carriers. Then, as three carriers remain in the list of carriers, 2 bits are still needed to code (respectively identify) a carrier. The following 2 bits are thus analyzed together: '01' indicates that the second carrier of the sequence (00, 01, 10, 11) corresponding to the list of remaining carriers (a, b and d), namely carrier (b), will be used (respectively was used) to transmit the same transmission control frame on time interval t0. - In an alternative embodiment of the method according to the invention and as explained previously, carriers for transmission control frames for retransmitted block may be allocated first by the emitter for ensuring frequency diversity.
- In reference to
Figure 4 , carriers (a) and (b) may thus be respectively allocated to transmission control frames d0 and a0. - Table 1 shows an example of the number of signalling bits that may be saved using the method according to the invention. The greater number of carriers is used, the more signalling bits are saved.
Table 1 HARQ process indication bits comparison Number of CC Bits needed with the invention Bits needed in prior art Number of bits saved Proportion of bits saved 1 3 3 0 0 2 7 8 1 12.5% 3 12 15 3 20% 4 17 20 3 15% 5 23 30 7 23.3% 6 29 36 7 19.4%
Claims (15)
- A method of coding the identification of carriers from an ordered list of carriers in a telecommunication network, each of said carriers being currently allocated to a transmission control frame in order to allow its transmission, each of said transmission control frame comprising:- a data block corresponding to a data stream, and- an indication of the carrier which was previously allocated to a previous data block corresponding to said data stream,said method being characterized by further comprising, for each of the currently allocated carriers taken in the order of said list of carriers, the acts of:- determining (210) the number of binary bits needed to identify the number of carriers in the list of carriers,- coding (220) the indication, in the transmission control frame to which said carrier is currently allocated, based on the determined number of binary bits,- removing (230) said currently allocated carrier from the list of carriers; and- renumbering (240) the remaining carriers in the list of carriers.
- The method according to claim 1, said method further comprising the act of inserting the indication in each corresponding transmission control frame.
- The method according to claim 1, said method further comprising the act of inserting the indication for each transmission control frame on each carrier at a time interval in one, or a plurality of, different transmission control frames.
- A method of identifying carriers from an ordered list of carriers in a telecommunication network, each of said carriers being currently allocated to a transmission control frame in order to allow its transmission, each of said transmission control frame comprising:- a data block corresponding to a data stream, and- an indication of the carrier which was previously allocated to a previous data block corresponding to said data stream,said method being characterized by comprising, for each of the currently allocated carriers taken in the order of said list of carriers, the acts of:- identifying (260), in the list of carriers, the carrier which was previously allocated to a previous data block corresponding to said data stream, using the indication in said given transmission control frame,- removing (270) the identified carrier from the list of carriers; and- renumbering (280) the remaining carriers in the list of carriers.
- The method according to claim 4, said method further comprising the act of retrieving the indication in each corresponding transmission control frame.
- The method according to claim 4, said method further comprising the act of retrieving the indication of a plurality of transmission control frame in one, or a plurality of, different transmission control frames.
- An emitter for coding the identification of carriers from an ordered list of carriers in a telecommunication network, each of said carriers being currently allocated to a transmission control frame in order to allow its transmission, each of said transmission control frame comprising:- a data block corresponding to a data stream, and- an indication of the carrier which was previously allocated to a previous data block corresponding to said data stream,said emitter being characterized by comprising, for each of the currently allocated carriers taken in the order of said list of carriers:- means for determining the number of binary bits needed to identify the number of carriers in the list of carriers,- means for coding the indication, in the transmission control frame to which said carrier is currently allocated, based on the determined number of binary bits,- means for removing said currently allocated carrier from the list of carriers; and- means for renumbering the remaining carriers in the list of carriers.
- The emitter according to claim 7, said emitter further comprising means for inserting the indication in each corresponding transmission control frame.
- The emitter according to claim 7, said emitter further comprising means for inserting the indication for each transmission control frame on each carrier at a time interval in one, or a plurality of, different transmission control frames.
- A receiver for identifying carriers from an ordered list of carriers in a telecommunication network, each of said carriers being allocated to a transmission control frame in order to allow its transmission, each of said transmission control frame comprising:- a data block corresponding to a data stream, and- an indication of the carrier which was previously allocated to a previous data block corresponding to said data stream,said receiver being characterized by comprising, for each of the currently allocated carriers taken in the order of said list of carriers which is allocated to a given received transmission control frame :- means for identifying, in the list of carriers, a carrier which was previously allocated to a previous data block of the data stream, using the indication in said given transmission control frame,- means for removing the identified carrier from the list of carriers, and- means for renumbering the remaining carriers in the list of carriers.
- The receiver according to claim 10, said method further comprising the act of retrieving the indication in each corresponding transmission control frame.
- The receiver according to claim 10, said receiver further comprising means for retrieving the indication of a plurality of transmission control frame in one, or a plurality of, different transmission control frames.
- A system, said system comprising:- a telecommunication network,- an emitter according to claim 7, said emitter being in said telecommunication network,- a receiver according to claim 10, said receiver being in said telecommunication network.
- A computer-readable medium having computer-executable instructions to enable a computer system to perform the method of any one of claims 1 to 3.
- A computer-readable medium having computer-executable instructions to enable a computer system to perform the method of any one of claims 4 to 6.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN2009075218 | 2009-11-30 | ||
PCT/IB2010/003435 WO2011064676A2 (en) | 2009-11-30 | 2010-11-30 | Data transmission method and system |
Publications (2)
Publication Number | Publication Date |
---|---|
EP2507931A2 EP2507931A2 (en) | 2012-10-10 |
EP2507931B1 true EP2507931B1 (en) | 2018-07-18 |
Family
ID=43857848
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP10816318.9A Active EP2507931B1 (en) | 2009-11-30 | 2010-11-30 | Data carrier identification method and system |
Country Status (3)
Country | Link |
---|---|
US (1) | US9008016B2 (en) |
EP (1) | EP2507931B1 (en) |
WO (1) | WO2011064676A2 (en) |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10892855B2 (en) * | 2015-01-29 | 2021-01-12 | Ntt Docomo, Inc. | Terminal and communication system |
CN106170941B (en) * | 2015-02-17 | 2020-06-26 | 华为技术有限公司 | Data processing method and device |
Family Cites Families (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20070142046A1 (en) * | 2005-12-15 | 2007-06-21 | Welnick William E | Method and system for acquiring a carrier system by a terminal device |
EP2190159B1 (en) * | 2006-07-03 | 2012-10-31 | ST-Ericsson SA | Crest factor reduction in multicarrier transmission systems |
NZ569733A (en) * | 2007-07-10 | 2010-01-29 | Belkin International Inc | Method of selecting and broadcasting over a transmission frequency and device for the same |
US8174959B2 (en) * | 2008-03-11 | 2012-05-08 | Nec Laboratories America, Inc. | Auction based resource allocation in wireless systems |
EP2200208A1 (en) * | 2008-12-19 | 2010-06-23 | Panasonic Corporation | HARQ ACK/NACK for dynamic PDSCH |
US8554225B2 (en) * | 2009-03-12 | 2013-10-08 | Lg Electronics Inc. | Method for switching operating carrier at a user equipment in wireless communication system |
US8934417B2 (en) * | 2009-03-16 | 2015-01-13 | Google Technology Holdings LLC | Resource allocation in wireless communication systems |
WO2010124238A2 (en) * | 2009-04-24 | 2010-10-28 | Interdigital Patent Holdings, Inc. | Method and apparatus for sending hybrid automatic repeat request feedback for component carrier aggregation |
WO2010127710A1 (en) * | 2009-05-08 | 2010-11-11 | Nokia Siemens Networks Oy | Channel quality indication report with granularity dependent of the number of best component carriers |
US9130698B2 (en) * | 2009-05-21 | 2015-09-08 | Qualcomm Incorporated | Failure indication for one or more carriers in a multi-carrier communication environment |
KR101707867B1 (en) * | 2009-07-28 | 2017-02-17 | 엘지전자 주식회사 | Method for performing carrier management procedure in a multi-carrier supported wideband wireless communication system and appartus for the same |
US9351293B2 (en) * | 2009-09-11 | 2016-05-24 | Qualcomm Incorporated | Multiple carrier indication and downlink control information interaction |
CN102577523A (en) * | 2009-09-21 | 2012-07-11 | Lg电子株式会社 | Method for transmitting a sounding reference signal in a wireless communication system, and apparatus for same |
US8433251B2 (en) * | 2009-09-28 | 2013-04-30 | Qualcomm Incorporated | Control information signaling |
WO2011056043A2 (en) * | 2009-11-09 | 2011-05-12 | 엘지전자 주식회사 | Efficient control information transmission method and apparatus for supporting multiple antenna transmission technique |
-
2010
- 2010-11-30 US US13/512,808 patent/US9008016B2/en active Active
- 2010-11-30 WO PCT/IB2010/003435 patent/WO2011064676A2/en active Application Filing
- 2010-11-30 EP EP10816318.9A patent/EP2507931B1/en active Active
Non-Patent Citations (1)
Title |
---|
None * |
Also Published As
Publication number | Publication date |
---|---|
US20120236815A1 (en) | 2012-09-20 |
WO2011064676A2 (en) | 2011-06-03 |
WO2011064676A3 (en) | 2011-08-04 |
EP2507931A2 (en) | 2012-10-10 |
US9008016B2 (en) | 2015-04-14 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP6923660B2 (en) | Methods, equipment and systems | |
EP2474121B1 (en) | Feedback scheme for providing feedback on plural transmissions | |
EP2412118B1 (en) | Retransmission mode signaling in a wireless communication system | |
KR101323032B1 (en) | Method and appaeatus for multicasting with feedback information | |
KR101749346B1 (en) | Method and apparatus for performing harq in multiple carrier system | |
KR101855502B1 (en) | Method and terminal for mapping acknowledge/ non-acknowledge response message | |
US8667357B2 (en) | Method for conducting HARQ with a wireless communications system | |
US7539917B2 (en) | Acknowledgement signaling for automatic repeat request mechanisms in wireless networks | |
CN107888330B (en) | Data transmission method and device | |
KR101265637B1 (en) | method of transmitting data using a plurality of HARQ process channel sequentially | |
KR101409733B1 (en) | Method for transmission of data in a radio communication system, first network node and second network node thereof | |
KR100678156B1 (en) | Apparatus and method for transmitting and receiving wireless packet data | |
US10972228B2 (en) | Base station device, user equipment, wireless communication system, and communication method | |
CN116405165A (en) | Method and equipment for transmitting HARQ-ACK/NACK and downlink transmission method and equipment | |
EP1211840A1 (en) | Hybrid ARQ with parallel packet transmission | |
CN108631960B (en) | Data transmission method and related equipment | |
US20080069055A1 (en) | High rate packet data transmission system | |
RU2531264C2 (en) | Method of encoding harq feedback information with two separate codewords with unequal error protection for dtx and ack/nack | |
CN108886436B (en) | Radio network node, wireless device and methods performed therein | |
EP3386136A1 (en) | Downlink transmission method, base station, and terminal | |
KR20090109042A (en) | Method of allocating Acknowledgement channel | |
WO2009157859A2 (en) | Error control in multi-carrier wireless systems | |
EP2507931B1 (en) | Data carrier identification method and system | |
CN109155706A (en) | Data transmission method, data transmission device and communication system | |
KR20100134024A (en) | Method for performing a harq in a radio communication system |
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: 20120628 |
|
AK | Designated contracting states |
Kind code of ref document: A2 Designated state(s): AL 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 RS SE SI SK SM TR |
|
DAX | Request for extension of the european patent (deleted) | ||
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: ORANGE |
|
17Q | First examination report despatched |
Effective date: 20160621 |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
INTG | Intention to grant announced |
Effective date: 20180220 |
|
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): AL 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 RS SE SI SK SM 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: 1020485 Country of ref document: AT Kind code of ref document: T Effective date: 20180815 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 602010052058 Country of ref document: DE |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 9 |
|
REG | Reference to a national code |
Ref country code: NL Ref legal event code: MP Effective date: 20180718 |
|
REG | Reference to a national code |
Ref country code: LT Ref legal event code: MG4D |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: MK05 Ref document number: 1020485 Country of ref document: AT Kind code of ref document: T Effective date: 20180718 |
|
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: 20180718 |
|
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: 20181019 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: 20181018 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: 20180718 Ref country code: RS 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: 20180718 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: 20181118 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: 20180718 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: 20181018 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: 20180718 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: 20180718 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: 20180718 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: AL 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: 20180718 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: 20180718 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: 20180718 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R097 Ref document number: 602010052058 Country of ref document: DE |
|
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: 20180718 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: 20180718 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: 20180718 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: 20180718 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: 20180718 |
|
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: 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: 20180718 Ref country code: SM 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: 20180718 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: 20180718 |
|
26N | No opposition filed |
Effective date: 20190423 |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
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: 20180718 Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20181130 |
|
REG | Reference to a national code |
Ref country code: BE Ref legal event code: MM Effective date: 20181130 |
|
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: 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: 20180718 Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20181130 Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20181130 |
|
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: 20181130 |
|
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 NON-PAYMENT OF DUE FEES Effective date: 20181130 |
|
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 NON-PAYMENT OF DUE FEES Effective date: 20181130 |
|
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: 20180718 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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: 20180718 |
|
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: 20180718 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: 20101130 Ref country code: MK Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20180718 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20231019 Year of fee payment: 14 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20231020 Year of fee payment: 14 Ref country code: DE Payment date: 20231019 Year of fee payment: 14 |