EP2223456A1 - Retransmission pré-planifiée pour établissement initial - Google Patents

Retransmission pré-planifiée pour établissement initial

Info

Publication number
EP2223456A1
EP2223456A1 EP07861158A EP07861158A EP2223456A1 EP 2223456 A1 EP2223456 A1 EP 2223456A1 EP 07861158 A EP07861158 A EP 07861158A EP 07861158 A EP07861158 A EP 07861158A EP 2223456 A1 EP2223456 A1 EP 2223456A1
Authority
EP
European Patent Office
Prior art keywords
message
user equipment
sub frame
random access
preamble
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.)
Granted
Application number
EP07861158A
Other languages
German (de)
English (en)
Other versions
EP2223456A4 (fr
EP2223456B1 (fr
Inventor
Gunnar Bergquist
Tobias Tynderfeldt
Magnus Lindström
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.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Telefonaktiebolaget LM Ericsson AB
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 Telefonaktiebolaget LM Ericsson AB filed Critical Telefonaktiebolaget LM Ericsson AB
Publication of EP2223456A1 publication Critical patent/EP2223456A1/fr
Publication of EP2223456A4 publication Critical patent/EP2223456A4/fr
Application granted granted Critical
Publication of EP2223456B1 publication Critical patent/EP2223456B1/fr
Not-in-force legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/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/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
    • 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/1887—Scheduling and prioritising arrangements
    • 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/21—Control channels or signalling for resource management in the uplink direction of a wireless link, i.e. towards the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W76/00—Connection management
    • H04W76/10—Connection setup
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/08—Access point devices

Definitions

  • the present invention relates to a method for a wireless communications network for data packet communication.
  • the communications network comprises a user equipment and a transceiver node.
  • the user equipment and the node inter communicates over an air interface communication link.
  • the user equipment transmits a first message in a first scheduled transmission in a random access procedure during setup of the communication link.
  • the invention also relates to a wireless communications network for data packet communication.
  • the present invention refers to a system described in the project Long Term Evolution, LTE, which is a further development of 3GPP and is introduced in 3GPP Release 8.
  • LTE uses Orthogonal Frequency Division Multiplexing, OFD;, together with advanced antenna technologies.
  • OFD Orthogonal Frequency Division Multiplexing
  • Existing 3GPP (GSM and WCDMA/HSDPA) and 3GPP2 (CDMA2000 IxRTT, EV-DO) systems are integrated to the LTE through standardized interfaces providing optimized mobility with LTE.
  • LTE is a data packet wireless communication systems for mobile user equipments such as computers and telephones or the like. Communication between the mobile user equipment and a second party in the system is done by routing data packets between nodes over data links in the system.
  • uplink refers to communication from the user equipment to the second party
  • downlink refers to communication from the second party to the user equipment.
  • a message intended to be transmitted is broken down in the transmitting unit into a number of data packets being routed to and assembled by the receiving unit.
  • the mobile user equipment communicates over an air interface with a node in the form of a base transceiver station, eNodeB.
  • the data packets are queued or buffered in the eNodeB for downlink communication and in the user equipment for uplink communication.
  • a so called HARQ (Hybrid Automatic Repeat-reQuest) process starts a timer with a set time interval.
  • the recipient i.e. the user equipment or the eNodeB
  • receives the data packet it transmits an acknowledgement signal, ACK, back to the sender that transmitted the data packet and when the ACK is received the HARQ process stops and a new packet can be sent using the same HARQ process.
  • ACK acknowledgement signal
  • the HARQ .process considers the data packet to have not been received and therefore signals to the sender to retransmit the data packet.
  • the method of synchronous HARQ has been chosen against asynchronous HARQ. The motivation has been that since asynchronous HARQ implies that (re)transmissions for a certain HARQ process may occur at any time, the explicit signaling of the HARQ process number is required. With synchronous HARQ, that number can be derived from e.g. the sub-frame number.
  • Stop-and-Wait synchronous HARQ for uplink HARQ. This means that (re)transmissions for a certain HARQ process are restricted to occur at known time instants, in between which the sender stops and waits for ACK/NACK feedback from the receiver.
  • Latency in a packet-switched network is normally referred to as a round-trip latency and is measured as the time for a one-way latency from source to destination plus a one-way latency from the destination back to the source, i.e. from the moment a packet is transmitted until the ACK has been received by the sender.
  • the present invention refers to a non-trivial network, where a typical packet will be forwarded over many links via many nodes/gateways, each of which will not begin to forward the packet until it has been completely received.
  • the minimal latency is the sum of the minimum latency of each link, plus the transmission delay of each link except the final one, plus the forwarding latency of each gateway.
  • the eNodeB controls all active user equipments in a geographical area called a cell.
  • a user equipment When a user equipment is in an idle state, or is new in the cell, the eNodeB is not aware of the user equipment.
  • the first step is to become active, i.e. to become known to the eNodeB.
  • the eNodeB always broadcasts system information comprising information about preambles.
  • the user equipment becomes active by use of a Contention Based Random Access, CBRA, process or a Contention Free Random Access, CBRA, and the process starts with the user equipment transmitting to the eNodeB a Random Access Preamble comprising information about the user equipment.
  • the eNodeB transmits a response in the form of a Random Access Response.
  • MSG3 uses N-channel Stop-and-Wait synchronous HARQ as described above.
  • Each HARQ (re)transmission adds incremental redundancy which the receiving side can use for soft combining to secure reception.
  • MSG3 is the very first L3 message, i.e. request to setup Radio Resource Control, RRC, it can not rely on Radio Link Control, RLC for segmentation since it must inevitably be sent on a logic Common Control CHannel CCCH which uses Radio Link Control Transparent Mode, RLC-TM.
  • RRC Radio Resource Control
  • RLC-TM Radio Link Control Transparent Mode
  • MSG3 needs to be of varying size because the CBRA procedure is a multi-purpose procedure and the required MSG3 size really depends on the purpose of each procedure that has triggered CBRA to occur, i.e. which content needs be transferred by each separate initial user equipment message. It is a waste of resources to have one fixed size.
  • the latency must be optimized for certain scenarios while for other scenarios it does not need to.
  • MSG3 which is not required for the proper user equipment identification, but rather that can follow after the CBRA procedure has been completed. Again, it is a waste of resources to have one fixed size.
  • MSG3 must not be restricted so that messages that apply to time-critical scenarios would not fit.
  • the connection establishment as described above is the main example of such a time-critical scenario.
  • MSG3 must, for the optimal latency, house as Initial UE message one RRC Connection Request (which is terminated in the RAN layer) and one NAS: Service Request (which is terminated in layers above RAN).
  • Stop-and-Wait Synchronous HARQ serves its purpose as an efficient method to secure uplink transmission whenever a connection has been established, it fails as an efficient method for the most swift and secure establishment of such a connection.
  • the Stop-and-Wait method ensures that incremental redundancy is added to the transmission, but at the cost of an approximate order of one round-trip delay alongside each retransmission. This in turn limits the maximum size of MSG3. It is the current 3GPP assumption that the secure transmission of MSG3 requires in average an approximate total of 3-4 transmissions which in turn limits the MSG3 size to some 72-96 bits.
  • 3GPP has for a lengthier time been and is still in a lengthy deadlock debate, involving complex inter- work between several RAN groups, as well as towards CT and SA groups, how to squeeze the content of MSG3, with the risk of loosing functional content.
  • the invention intends to remedy the above mentioned deficiencies in order to find a faster setup of a communication link in a wireless communications network for data packet communication.
  • the communications network comprises a user equipment and a transceiver node.
  • the user equipment and the node inter-communicate over an air interface communication link.
  • the user equipment transmits a first message in a first scheduled transmission in a random access procedure during setup of the communication link, wherein resources for the transmission has been indicated in a random access preamble previously sent in the same random access procedure.
  • the invention is characterized in that, based on a prescheduled scenario indicated by the preamble.
  • the first message is transmitted in a first sub frame and retransmitted in at least a second sub frame within a first roundtrip time in a first HARQ-process triggered by the transmission of the first message in the first sub frame.
  • the step of transmitting the first message in the first sub frame and in at least the second sub frame within the first roundtrip time will hereinafter be referred to as prescheduled retransmission.
  • the basic concept of this invention is bi-fold. Firstly, it aims to add a few distinctive details to a method that joined with known technology distinguish time-critical scenarios and based on that decides how MSG3 shall be transmitted. And secondly it aims to introduce the method of prescheduled retransmissions as a method for MSG3 transmission and propose it to be used for time-critical scenarios or for that purpose any scenario which involves the transmission of MSG3.
  • a time critical scenario could occur during a handover, i.e. when the user equipment performs moves from one transceiver node to another. Another example is when the user equipment transitions from idle to active state.
  • the prescheduled retransmission according to the present invention enables a quick transmission of incremental redundancy without the latency cost inherent in the prior art method, since it has no need to stop-and-wait for feedback. As such the method has the potential to more swiftly add incremental redundancy for the secure transmission of MSG3 and by that shorten the lead-time for time-critical MSG3 transmissions.
  • MSG3 is a fictitious name denoting a collective of all possible messages sent in this first scheduled transmission.
  • the first message "MSG3" refers to a message that is defined on a higher layer, for example RRC or MAC, than the physical transmission layer.
  • the prescheduled retransmission of the first message is essential to achieve the flexibility required to handle time-critical scenarios alongside less time- critical.
  • the invention also introduces the idea that random access preambles shall be split into groups in such a way that a method to transmit is associated to each such group.
  • the preambles are divided into at least a first group and a second group, where the first group is associated to the inventive prescheduled scenario for transmitting the first message at least twice within the first round trip time.
  • the second group can be dedicated to a different scenario or to the scenario known in prior art allowing only stop-and- wait scenarios for the HARQ process.
  • the trunking efficiency of one common pool of resources is known to be greater than that of a fragmented pool.
  • the random access preamble pool of LTE may already fragment for other purposes.
  • a fully commercial LTE system will also support Contention Free Random Access (a method named Non- contention based RA in E-UTRAN; Overall description; Stage 2 (Release 8) 3GPP TR 36.300 V8.2.0 (2007-10) in which a dedicated preamble is reserved for one user equipment).
  • the user equipment transmits a random access preamble to the node before the first message is transmitted.
  • the random access preambles are divided into groups. Each group is associated to selected transmission occasions. Each group may also be associated with a selected size of the first message associated to each group.
  • a certain high priority preamble allows for the user equipment t o transmit larger first messages compared to first messages associated to preambles with lower priority.
  • priority advantageously refers to time critical scenarios or other scenarios where the inventive prescheduled scenario can be used.
  • the transceiver node comprises a scheduler for handling at least the first group of preambles associated with the prescheduled scenario instructing the user equipment to transmit the first message in the first sub frame and to retransmit the first message in the second sub frame within the first roundtrip time in the first HARQ-process triggered by the transmission of the first message in the first sub frame, i.e. to use the prescheduled retransmission scenario.
  • the scheduler can also be arranged for handling all types of groups of preambles.
  • all scheduled transmission of the first message MSG3 occurs within the first RTT for at least one of the groups.
  • the scheduled transmission of the first message MSG3 may extend beyond the time range of the first RTT.
  • the preambles can be use both for contention based random access, CBRA, and for contention-free random access, CFRA, or as 3GPP standard says, non-contention based random access.
  • CBRA contention based random access
  • CFRA contention-free random access
  • the preambles can be divided into two categories, one for CBRA and one for CFRA.
  • the transceiver node for example eNodeB
  • information on the group of preambles available for CBRA are launched (broadcasted) by the transceiver node, for example eNodeB, in such a way that the full community of UEs is addressed at the same time.
  • the user equipment selects a preamble from the group and participates in a contention in a CBRA.
  • the user equipment selects the preamble in a randomized way with the aim to distribute the selections so that not all contenders use one and the same preamble.
  • This is different from the CFRA preamble because in CFRA the user equipment does not select the CFRA preambles but the transceiver node, (for example eNodeB) selects and dedicates the preamble to the user equipment.
  • the preambles used for CFRA are assigned explicitly by the transceiver node, for example eNodeB, dedicated for one user equipment to use for the contention-free random access process.
  • the user equipment selects a preamble for contention-based random access and the user equipment is assigned by the node to use a preamble for contention-free random access.
  • the user equipment then transmits the selected or assigned preamble to the node and receives a Random Access Response from the node.
  • the preamble is used by the user equipment when transmitting the first scheduled message for distinguishing the size and the selected transmission occasions associated to the preamble group.
  • the user equipment selects or is being assigned the preamble and transmits the preamble from one of the groups according to its associated transmission occasions and size based on the type of message it has to transmit in the first scheduled transmission.
  • the size and selected transmission occasions are advantageously associated to time-critical scenarios.
  • the first sub frame is prior in time to the second sub frame.
  • the first sub frame and the second sub frame may advantageously be arranged in a consecutive order or may be arranged in a non-consecutive order. Both alternatives give the advantage with shortened latency.
  • “consecutive” refers to directly following each other.
  • the sub-frames in a consecutive transmission scheme refer to sub-frames being arranged immediately next to each other.
  • “non-consecutive” refers to one sub-frame used for transmitting the first message being separated by a sub-frame from a second sub-frame being used for retransmission of the first message. It should be noted that a combination of consecutive and non-consecutive is allowed.
  • the first message is transmitted in a first sub-frame and in a second sub- frame being separated from the first sub-frame by at least one sub-frame and then the first message is transmitted in at least a third sub-frame following directly after the second sub-frame, within the first round trip time.
  • the transmission of the first message triggers a corresponding HARQ-process, advantageously comprising a stop-and-wait function according to prior art.
  • the HARQ process may be synchronous or asynchronous which gives different calculations for the round trip time. It should be noted that a corresponding HARQ process starts in the transceiver node.
  • the node creates a sum of energy levels from the received first messages for data processing of further data packets transmitted from the user equipment.
  • the prescheduled retransmission gives the advantage that the sum of energy levels increases faster than for prior art methods since the first message is transmitted at least a second time within the first round trip time.
  • the node Upon reception of the random access preamble, the node transmits a random access response to the user equipment before the first message is transmitted.
  • the random access response comprises scheduling information to the user equipment based on the type of preamble selected by the user equipment.
  • the scheduling information triggers the user equipment to transmit the first message in the first scheduled transmission at least twice within the first roundtrip time in the first HARQ process.
  • the scheduling information decides how many times the user equipment shall transmit the first message within the first roundtrip time in the first HARQ process.
  • Figure 1 schematically shows Connection Establishment Idle-to-Active procedure according to the invention
  • Figure 2a schematically shows a signalling sequence for a contention based random access procedure according to the invention according to the invention
  • Figure 2b schematically shows a signalling sequence for a contention free random access procedure according to the invention according to the invention
  • Figure 3 schematically shows a Stop-and-Wait Synchronous HARQ process according to prior art
  • Figure 4 schematically shows a prescheduled retransmission according to the invention involving a Stop-and-Wait HARQ-process
  • Figure 5 schematically shows examples 1 and 2 according to prior art of a Transmission scheme involving a HARQ-process
  • Figure 6 schematically shows examples 3 and 4 according to the invention of a Transmission scheme involving a HARQ-process, and in which;
  • Figure 7 schematically shows examples 5 and 6 according to the invention of a Transmission scheme involving a HARQ-process.
  • Figure 1 schematically shows a process scheme for connection establishment of a user equipment (hereinafter called UE) to a transceiver node (hereinafter called eNodeB or eNB) when the UE switches from an idle state to an active state according to prior art.
  • UE user equipment
  • eNodeB transceiver node
  • Figure 1 shows that certain NAS messages may be either concatenated with RRC messages or carried within RRC due to its speedy transportation.
  • Figure 1 shows that after the eNodeB has received an RRC Connection
  • MME Mobility Management Entity
  • S1-AP Initial UE message
  • IDentity UE signalling connection ID
  • Modern cellular packet-switched communication systems such as HSPA (High Speed Packet Access) and LTE (Long Term Evolution), both specified in the 3GPP, employ a Hybrid ARQ (Automatic Repeat ReQuest) protocol in their respective MAC (Medium Access Control) layer.
  • Hybrid ARQ Automatic Repeat ReQuest
  • the basic functionality of the HARQ protocol is to correct block errors that occur over the air interface.
  • the HARQ protocols specified in LTE and HSPA utilize so-called HARQ processes to transfer the data.
  • the HARQ processes are used to associate a potential retransmission to its original transmission in order to enable soft combining at the HARQ receiver. Only when the HARQ receiver has reported correct reception of the data sent on a HARQ process may it be used to transmit new data. Consequently, before the reception of a HARQ status report from the receiver, the HARQ sender can not know whether it should send new data or a retransmission of the "old data". In the meantime, it therefore, "stops and waits" (hence the name) until it knows the result of the transmission. In order to still be able to utilize the link during these waiting periods, it is customary to use multiple parallel such HARQ processes.
  • N-channel Stop-and-Wait synchronous HARQ is used for uplink HARQ.
  • (re)transmissions for a certain HARQ process are restricted to occur at known time instants, in between which the sender stops and waits for ACK/NACK feedback from the receiver.
  • Each HARQ process is associated with a HARQ buffer.
  • Each HARQ process shall maintain a state variable CURRENT_TX_NB, which indicates the number of transmissions that have taken place for the MAC PDU currently in the buffer.
  • CURRENT TX NB shall be initialized to 0.
  • the UE is configured with a maximum number of transmissions that is identical across all HARQ Processes and all Logical Channels.
  • the HARQ process shall:
  • the HARQ process shall:
  • the HARQ process shall:
  • the HARQ process shall:
  • the HARQ process shall also:
  • FIG 2a schematically shows a signalling sequence for a contention based random access, CBRA, procedure according to the invention.
  • the procedure is marked in figure 1 with a square having dotted lines.
  • MSG3 the first scheduled transmission
  • MSG3 uses such N-channel Stop-and-Wait synchronous HARQ as described above.
  • Each HARQ (re)transmission adds incremental redundancy which the receiving side can use for soft combining to secure reception.
  • the prescheduled retransmission according to the invention can be applied also on an asynchronous HARQ process.
  • MSG3 is the very first L3 message, i.e. request to setup RRC, it can not rely on RLC for segmentation, because it must inevitably be sent on a logical CCCH which uses RLC-TM.
  • RLC-TM the only segmentation offered to the transmission of MSG3 is the one achieved by HARQ and therefore within MAC alone.
  • MSG3 size must be fixed.
  • the current estimation is that MSG3 must be restricted to some 72 or alternatively 96 bits to achieve worst case coverage for cell border UEs.
  • the Initial NAS UL message is larger than what such a MSG3 can provide, it needs be split in two parts where the latter part is sent after CBRA has been successfully completed.
  • FIG 2b schematically shows a signalling sequence for a contention free random access, CFRA, procedure according to the invention.
  • the process associated to CBRA comprises the step of broadcasting information on a group of preambles from which one is to be randomly selected by the user equipment UE but that the process associated to CFRA comprises the step of the node eNodeB assigning a preamble to the user equipment UE.
  • Another difference is that in CFRA there is no contention resolution as in step 4 in figure 2b.
  • Both figures 2a and 2b shows steps 0 to 3 but in figure 2a the transceiver node eNodeB broadcasts system information to the user equipment comprising information on available RA Preambles that the user equipment UE can use when selecting the preamble and in figure 2b the transceiver node eNodeB transmits a RA Preamble assigned to the user equipment UE.
  • the random access preambles are divided into groups. Each group is associated to selected transmission occasions. Each group may also be associated with a fixed size of the first message MSG3. It is to be understood that a certain (high priority) preamble allows for the UE to transmit larger first messages compared to other (lower priority) preambles.
  • the eNodeB controls all active user equipments in a geographical area called a cell.
  • a user equipment is in an idle state, or is new in the cell (for example handover), the eNodeB is not aware of the user equipment.
  • the first step is to become active, i.e. to become known to the eNodeB.
  • the user equipment becomes active by use of a Contention Based Random Access, CBRA, process or a Contention Free Random Access, CFRA and the process starts with the user equipment transmitting to the eNodeB a Random Access Preamble, step 1 , comprising information about the user equipment.
  • the eNodeB transmits a response in the form of a Random Access Response, step 2.
  • MSG3 uses N-channel Stop-and-Wait HARQ as described above, step 3.
  • Each HARQ (re)transmission adds incremental redundancy which the receiving side can use for soft combining to secure reception.
  • Figure 2a shows step 4 which comprises a contention based resolution for the CBRA. Step 4 is evidently not necessary in a CFRA.
  • the UE provides the eNodeB with information the UE unique identity.
  • the eNodeB uses the information to resolve the contention in case several UEs have randomly selected and transmitted the same CBRA preamble during the same time period.
  • CFRA the eNodeB already possesses information about the identity of the UE that is assigned a CFRA preamble. Therefore, the MSG3 with its content is not strictly needed in CFRA random access procedure.
  • the first scheduled transmission could be other types of data.
  • MSG3 may still be wanted, in order to avoid any mistakes, e.g. due to the CFRA preamble being incorrectly detected.
  • the future standard may stipulate whether MSG3 shall be transmitted in the CFRA procedure or not.
  • the random access response instructs the UE whether to provide its unique identity in MSG3 or whether to start scheduled transmission of other data immediately.lt should be noted that the numbers 0-4 in the sequence is not important for the invention. Hence, the steps could be numbered 1-5 or any other suitable denotation.
  • Figure 3 schematically shows a Stop-and-Wait Synchronous HARQ process according to prior art.
  • the UE receives an initial UL grant in the Random Access Response (step 2 in figure 2a and 2b).
  • the sub-frames are disjunctive when using the method of Stop-and-Wait Synchronous HARQ, since each sub-frame in prior art must be spaced more than the rough Round Trip Time RTT apart from the next.
  • FIG. 4 schematically shows a prescheduled retransmission in a HARQ- process according to the invention.
  • prescheduled retransmission refer to the transmission of several first messages MSG3 within a Round Trip Time RTT being triggered by the first transmission of the first message in a sub frame TTN03.
  • the prescheduled retransmission with incremental redundancy is used to transmit the first message, MSG3.
  • the same amount of sub-frame space S can be bundled to occur in any set of sub-frames, the fastest one being that which uses subsequent sub-frames that occur immediately next to each other.
  • bundled means that the sub-frames are arranged in a consecutive order i.e. follow directly after each other.
  • the sub-frames are arranged in a non-consecutive order, i.e. the sub-frames do not follow directly after each other. The latter embodiment will be explained further below.
  • Each cell provides 64 different random access preambles per RACH.
  • the transmission/reception of one of these 64 different preambles is the same as the transmission/reception of one bit pattern among the 64 different ones. This is equivalent to an identification using 6 bits. It says that five (5) of these bits constitutes a random ID while the remaining 1 bit does not. This shall be interpreted as if the 64 preambles are split in two groups.
  • the broadcasted system information of each cell defines which are the preamble sequences and also in which two groups they are divided. Each UE must read this information in order to access the system.
  • the UE in its random access preamble may implicitly indicate a purpose by selecting from either of these two sets. It has been and is debated in 3GPP what this purpose shall be, i.e. which information shall be carried by the 1 bit 'set-selector'. With the current wording of E-UTRAN; Overall description; Stage 2 (Release 8) 3GPP TR 36.300 V8.2.0 (2007-10), one FFS purpose shall be the size of MSG3 and another FFS purpose is to identify the radio conditions. The bit is occasionally referred to as the size/quality bit, indicating the desire to indicate both of purposes, e.g.
  • the 1-bit it has been suggested to use the 1-bit to implicitly signal either of size, quality, size-quality and urgency. If size, the 1-bit is plainly used to signal which is the desired MSG3 size. If quality, the 1-bit is used to signal the radio conditions as experienced by the UE. If urgency, the 1-bit is rather used to indicate the urgency associated to the content to MSG3. It should be noted that the CBRA procedure as depicted in figure 2a is a procedure that terminates in the lower layers (MAC and below) of the RAN network. Size and quality is indeed something within scope, control and grasp of those
  • Urgency on the other hand is far beyond the comprehension of those RAN layers. Since they do not terminate neither of RRC and NAS, they can not distinguish what RRC and NAS one MSG3 transports from another.
  • the 1-bit (or more generally log2(N) bits if all available preamble sequences are split in even N groups) should be used to signal which among the available methods UE desires to physically transmit MSG3.
  • the method by which the physical channel transmits is within the grasp and scope of the involved RAN layers to understand.
  • the available transmission methods are categorized in such a way that each Nth group is attributed one method, uniquely defined by: A) Prescheduled Retransmission or Stop-and-Wait Retransmission
  • N 1 groups. All preambles in group N are associated to the Method N.
  • B Maximum 3 transmission opportunities
  • C [+3, +11 , +19], i.e. bundled 8 sub-frames apart (evenly and sufficiently spaced to cater for one round-trip delay)
  • D 2 RBs/TTI
  • the UE must adopt the size of MSG3 payload to fit into the fixed size associated to method N. It selects a preamble from Group N. What does not fit into MSG3 must wait until a later and separate transmission occasion (urgent and no urgent makes no difference).
  • This example corresponds to the current assumption in E-UTRAN; Overall description; Stage 2 (Release 8) 3GPP TR 36.300 V8.2.0 (2007-10) with the difference that preamble sequences are not split into two groups, and hence that the 1-bit indication is not used
  • B Maximum 3 transmission opportunities
  • C [+3, +11 , +19], i.e. bundled 8 sub-frames apart (evenly and sufficiently spaced to cater for one round-trip delay)
  • D 4 RBs/TT
  • the UE must adopt the size of MSG3 payload to fit into either of the fixed sizes associated to methods N1 or N2. What does not fit into such a MSG3 must wait until later and separate transmission (urgent and no urgent makes no difference).
  • the UE1 that has a MSG3 payload P1 that fits into the fixed size associated to method N1 selects a preamble from group N1.
  • the UE2 that has a larger MSG3 payload P2 selects one from N2. Given that admission is granted and depending on if the radio conditions of UE2 are sufficiently good, its MSG3 payload P2 may be twice the size of P1 , with no additional delay.
  • Preambles in group N1/N2 are associated to Method N1/N2 respectively.
  • B Maximum 3 transmission opportunities
  • C [+3, +11 , +19], i.e. bundled 8 sub-frames apart (evenly and sufficiently spaced to cater for one round-trip delay)
  • D 2 RBs/TTI.
  • B Maximum 6 transmission opportunities
  • C [+3, +11 , +19, +27, +35, +43], i.e. bundled 8 sub-frames apart (evenly and sufficiently spaced to cater for one round-trip delay)
  • D 2 RBs/TTI
  • a UE can transmit twice the amount of data with method N2 compared to method N1 , regardless of whether the radio channel quality is good or bad.
  • the UE2 with large MSG3 payload selects a preamble from group N2. If its radio channel quality is good, the UE2 will only need to transmit the message a few times, whereas if its radio channel quality is poor, it will need to use all 6 occasions. This means that UEs with good radio channel quality will experience low latency, whereas UEs with poor radio channel quality will experience larger latency.
  • a UE can transmit twice the amount of data with method N2 compared to method N1 , regardless of whether the radio channel quality is good or bad.
  • the UE2 with large MSG3 payload selects a preamble from group N2. If its radio channel quality is good, the UE2 will only need to transmit the message a few times, whereas if its radio channel quality is poor, it will need to use all 6 occasions.
  • method N2 employs prescheduled retransmission, the number of retransmissions does not scale with a rough RTT, and thus the latency is not increased compared to method N1.
  • the cost associated to this configuration is less efficient UL transmissions since the UE does not stop and wait for HARQ feedback before a re-transmission.
  • B Maximum 3 transmission opportunities
  • C [+3, +11 , +19], i.e. bundled 8 sub-frames apart (evenly and sufficiently spaced to cater for one round-trip delay)
  • D 2 RBs/TTI.
  • the UE1 that has a MSG3 payload P1 which fits into the fixed size associated to method N1 selects a preamble from group N1.
  • the UE2 that has a larger MSG3 payload P2 (as in case of UE1 , higher layers of UE2 has decided no part of MSG3 payload can wait until after CBRA) selects one from N2. By doing that, UE2 will adopt dynamically and decide which of the allowed transmission opportunities it will need to use. If UE2 shares the exact radio conditions of UE1 , its MSG3 payload P2 may be four times the size of P1 , with no additional delay (twice the size of the larger grant in Example 2 above)
  • UE adopts dynamically the flexible size of MSG3 payload to fit into the fixed size associated to method N.
  • the UE will adopt dynamically and decide which of the allowed transmission opportunities it will need to use, depending on the size of MSG3.
  • the 1-bit indication (generally worded the log 2 (N)-bits indication would not be required).
  • the invention is not limited to the shown examples, but any combination of consecutive or non-consecutive transmissions of the first message is allowed within the first roundtrip time.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente invention concerne un procédé destiné à un réseau de communication sans fil pour une communication de paquets de données, le réseau comprenant un équipement utilisateur (UE) et un nœud émetteur-récepteur (eNodeB). L'équipement utilisateur (UE) et le nœud (eNodeB) communiquent entre eux sur une liaison de communication par interface hertzienne. L'équipement utilisateur (UE) transmet un premier message (MSG3) dans une première transmission planifiée lors d'une procédure d'accès aléatoire pendant l'établissement de la liaison de communication. L'invention est caractérisée en ce que le premier message est transmis dans une première sous-trame (TTI=3) et dans une seconde sous-trame (TTI=4 ; TTI=5) lors d'une première propagation (RTT) dans un premier procédé HARQ déclenché par la transmission du premier message dans la première sous-trame (TTI=3). L'invention concerne également un réseau de communication sans fil destiné à une communication de paquets de données.
EP07861158A 2007-12-20 2007-12-20 Retransmission pré-planifiée pour établissement initial Not-in-force EP2223456B1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/SE2007/051063 WO2009082303A1 (fr) 2007-12-20 2007-12-20 Retransmission pré-planifiée pour établissement initial

Publications (3)

Publication Number Publication Date
EP2223456A1 true EP2223456A1 (fr) 2010-09-01
EP2223456A4 EP2223456A4 (fr) 2011-02-16
EP2223456B1 EP2223456B1 (fr) 2012-09-12

Family

ID=40801434

Family Applications (1)

Application Number Title Priority Date Filing Date
EP07861158A Not-in-force EP2223456B1 (fr) 2007-12-20 2007-12-20 Retransmission pré-planifiée pour établissement initial

Country Status (4)

Country Link
US (1) US8448037B2 (fr)
EP (1) EP2223456B1 (fr)
CN (1) CN101904130B (fr)
WO (1) WO2009082303A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3440889A4 (fr) * 2016-05-12 2019-05-01 Samsung Electronics Co., Ltd. Procédé et appareil de connexion lumineuse à utiliser dans un système de communication sans fil
US10887057B2 (en) 2016-05-12 2021-01-05 Samsung Electronics Co., Ltd. Method and apparatus for performing light connection in wireless communication system

Families Citing this family (53)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
RU2411660C2 (ru) 2005-10-31 2011-02-10 Эл Джи Электроникс Инк. Способ передачи и приема информации о радиодоступе в системе беспроводной подвижной связи
DE202006021313U1 (de) 2005-11-28 2015-10-15 Evolved Wireless Llc (N. D. Gesetzen D. Staates Delaware) Vorrichtung zur Übertragung und Vorrichtung zum Empfang einer Codesequenz in einem drahtlosen Kommunikationssystem
TWI690179B (zh) 2006-06-09 2020-04-01 美商進化無線責任有限公司 行動通訊系統中傳送資料之方法和裝置
CN104601215A (zh) 2008-01-02 2015-05-06 交互数字技术公司 中继节点、网络节点及在中继节点中使用的方法
WO2009126902A2 (fr) * 2008-04-11 2009-10-15 Interdigital Patent Holdings, Inc. Procédés pour un regroupement d'intervalles de temps de transmission dans la liaison montante
US20100315989A1 (en) * 2008-07-07 2010-12-16 Interdigital Patent Holdings, Inc. Method and apparatus for cooperative relaying in wireless communications
KR100939722B1 (ko) 2008-08-11 2010-02-01 엘지전자 주식회사 데이터 전송 방법 및 이를 위한 사용자 기기
US8830884B2 (en) * 2008-08-18 2014-09-09 Qualcomm Incorporated TTI bundling in a random access procedure
BRPI0917856B1 (pt) * 2008-08-19 2020-10-13 Telefonaktiebolaget Lm Ericsson (Publ) método para controlar retransmissões de pedido de repetição automática híbrido síncrono em um dispositivo de comunicações sem fio, e, dispositivo de comunicação sem fio
US8411626B2 (en) * 2008-10-22 2013-04-02 Innovative Sonic Limited Method and apparatus for handling UL-SCH transmission
GB2464994A (en) * 2008-11-04 2010-05-05 Nec Corp Communication system in which access control is dependent on mode of base station
CN101841404B (zh) * 2009-03-16 2013-08-07 上海贝尔股份有限公司 中继通信方法及其系统和装置
US10893556B2 (en) * 2009-04-30 2021-01-12 Samsung Electronics Co., Ltd Method and apparatus for supporting local IP access in a femto cell of a wireless communication system
KR101618172B1 (ko) * 2009-04-30 2016-05-04 삼성전자주식회사 이동통신시스템의 ｒａｃｈ 채널 정보 전송 방법
EP2306665A1 (fr) * 2009-10-02 2011-04-06 Panasonic Corporation Protocole HARQ en liaison montante de retour de relais
CN102740403B (zh) * 2011-04-02 2015-03-11 上海贝尔股份有限公司 一种在通信网络的终端中用于接入的方法及装置
WO2012150883A1 (fr) * 2011-05-05 2012-11-08 Telefonaktiebolaget L M Ericsson (Publ) Procédés et agencements pour adapter une attribution de ressources d'accès aléatoire à des équipements utilisateurs
CN102883316B (zh) 2011-07-15 2015-07-08 华为终端有限公司 建立连接的方法、终端和接入点
CN102523626A (zh) * 2011-12-02 2012-06-27 电信科学技术研究院 message3的传输方法和设备
KR101284828B1 (ko) * 2011-12-07 2013-07-10 주식회사 케이티 사용자 채널 상태에 따른 반-지속 스케줄링 방법 및 그 방법을 수행하는 기지국 장치
US9432851B2 (en) * 2011-12-20 2016-08-30 Tejas Networks Limited Bearer signalling management
US9480082B2 (en) * 2012-02-16 2016-10-25 Telefonaktiebolaget Lm Ericsson (Publ) Methods of transmitting access requests using reduced response intervals and related mobile stations and base station subsystems
US9295056B2 (en) * 2012-03-23 2016-03-22 Qualcomm Incorporated Systems and methods for signaling and determining transmission time interval bundling parameters
CN104170445B (zh) 2012-06-06 2018-06-15 华为技术有限公司 一种消息的重传方法及终端、基站
US20130343273A1 (en) * 2012-06-26 2013-12-26 Qualcomm Incorporated Enhanced tti bundling with flexible harq merging
GB2507528A (en) * 2012-11-02 2014-05-07 Sony Corp Telecommunications apparatus and methods
GB2507529A (en) * 2012-11-02 2014-05-07 Sony Corp Telecommunications apparatus and methods
US9620955B2 (en) 2013-03-15 2017-04-11 Schweitzer Engineering Laboratories, Inc. Systems and methods for communicating data state change information between devices in an electrical power system
US9270109B2 (en) * 2013-03-15 2016-02-23 Schweitzer Engineering Laboratories, Inc. Exchange of messages between devices in an electrical power system
US9065763B2 (en) 2013-03-15 2015-06-23 Schweitzer Engineering Laboratories, Inc. Transmission of data over a low-bandwidth communication channel
US9516634B2 (en) * 2013-05-03 2016-12-06 Qualcomm Incorporated Systems and methods for downlink frequency domain multiplexing transmissions
KR20160045820A (ko) * 2013-08-23 2016-04-27 후아웨이 테크놀러지 컴퍼니 리미티드 서비스 데이터 전송 방법, 단말기 및 기지국
EP3048750B1 (fr) * 2013-10-16 2019-12-04 Huawei Technologies Co., Ltd. Procédé, appareil et dispositif d'émission de données
BR112016017767B1 (pt) * 2014-02-10 2022-11-29 Telefonaktiebolaget Lm Ericsson (Publ) Método e equipamento de usuário para realizar transmissões de preâmbulo e método e nó de rede para receber transmissões de preâmbulo em um canal de acesso aleatório
CN113543361A (zh) * 2014-04-30 2021-10-22 株式会社Ntt都科摩 终端、基站、系统以及通信方法
WO2016023201A1 (fr) * 2014-08-14 2016-02-18 华为技术有限公司 Procédé et terminal de traitement de services simultanés
US11057921B2 (en) 2014-10-01 2021-07-06 Samsung Electronics Co., Ltd. System and method for improving spectral efficiency and coverage for user equipments
US10342012B2 (en) 2015-03-15 2019-07-02 Qualcomm Incorporated Self-contained time division duplex (TDD) subframe structure
US9936519B2 (en) 2015-03-15 2018-04-03 Qualcomm Incorporated Self-contained time division duplex (TDD) subframe structure for wireless communications
US10075970B2 (en) 2015-03-15 2018-09-11 Qualcomm Incorporated Mission critical data support in self-contained time division duplex (TDD) subframe structure
US9814058B2 (en) 2015-05-15 2017-11-07 Qualcomm Incorporated Scaled symbols for a self-contained time division duplex (TDD) subframe structure
US9992790B2 (en) 2015-07-20 2018-06-05 Qualcomm Incorporated Time division duplex (TDD) subframe structure supporting single and multiple interlace modes
US10455611B2 (en) 2015-09-16 2019-10-22 Lg Electronics Inc. Method for transceiving data in wireless communication system and apparatus for same
US20180279340A1 (en) * 2015-11-06 2018-09-27 Telefonaktiebolaget Lm Ericsson (Publ) Scheduling and Accessing of Uplink Resources
US10873422B2 (en) * 2016-02-26 2020-12-22 Lg Electronics Inc. Method for executing HARQ in wireless communication system and device therefor
US20170302421A1 (en) * 2016-04-13 2017-10-19 Mediatek Inc. Signaling Enhancement for Fast Network Entry
CN107343322B (zh) * 2016-04-29 2023-05-16 中兴通讯股份有限公司 竞争接入方法及装置
US10397947B2 (en) * 2016-08-12 2019-08-27 Qualcomm Incorporated Adaptive waveform selection in wireless communications
TWI618437B (zh) * 2016-11-01 2018-03-11 財團法人資訊工業策進會 無線裝置、基地台、用於無線裝置之隨機存取方法及用於基地台之前置碼配置方法
US10484151B2 (en) * 2017-03-02 2019-11-19 Qualcomm Incorporated Controlling random-access channel (RACH) retransmissions for wireless communication
US11723063B2 (en) * 2017-08-11 2023-08-08 Qualcomm Incorporated Different configurations for message content and transmission in a random access procedure
EP3756417B1 (fr) * 2018-02-21 2022-09-21 Fg Innovation Company Limited Priorisation d'accès et de services dans des réseaux de prochaine génération
US10819727B2 (en) 2018-10-15 2020-10-27 Schweitzer Engineering Laboratories, Inc. Detecting and deterring network attacks

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005109729A1 (fr) * 2004-05-10 2005-11-17 Telefonaktiebolaget Lm Ericsson (Publ) Procede et systeme pour assurer des retransmissions autonomes dans un systeme de communication sans fil

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020064167A1 (en) * 2000-11-29 2002-05-30 Khan Farooq Ullah Hybrid ARQ with parallel packet transmission
EP1286491B1 (fr) * 2001-08-22 2004-06-30 Matsushita Electric Industrial Co., Ltd. Procédé et dispositif en utilisant des techniques multicanaux de demande de répétition automatique ARQ
EP1545040B1 (fr) * 2003-12-19 2009-04-22 Panasonic Corporation Protocole HARQ avec retransmissions synchrones
US7181170B2 (en) * 2003-12-22 2007-02-20 Motorola Inc. Apparatus and method for adaptive broadcast transmission
US7007218B2 (en) * 2004-02-03 2006-02-28 Harris Corporation Adaptive rate code combining automatic repeat request (ARQ) communications method and system
US8098745B2 (en) * 2006-03-27 2012-01-17 Texas Instruments Incorporated Random access structure for wireless networks
US8176376B2 (en) * 2006-10-02 2012-05-08 Telefonaktiebolaget Lm Ericsson (Publ) Optimal error protection coding for MIMO ACK/NACK/POST information

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005109729A1 (fr) * 2004-05-10 2005-11-17 Telefonaktiebolaget Lm Ericsson (Publ) Procede et systeme pour assurer des retransmissions autonomes dans un systeme de communication sans fil

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
LG ELECTRONICS: "HARQ and Node B controlled scheduling", 3GPP DRAFT; R1-040480, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. RAN WG1, no. Montreal, Canada; 20040505, 5 May 2004 (2004-05-05), XP050098848, [retrieved on 2004-05-05] *
See also references of WO2009082303A1 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3440889A4 (fr) * 2016-05-12 2019-05-01 Samsung Electronics Co., Ltd. Procédé et appareil de connexion lumineuse à utiliser dans un système de communication sans fil
US10887057B2 (en) 2016-05-12 2021-01-05 Samsung Electronics Co., Ltd. Method and apparatus for performing light connection in wireless communication system
US11943062B2 (en) 2016-05-12 2024-03-26 Samsung Electronics Co., Ltd. Method and apparatus for performing light connection in wireless communication system

Also Published As

Publication number Publication date
EP2223456A4 (fr) 2011-02-16
EP2223456B1 (fr) 2012-09-12
CN101904130A (zh) 2010-12-01
US8448037B2 (en) 2013-05-21
CN101904130B (zh) 2014-03-05
WO2009082303A1 (fr) 2009-07-02
US20100275086A1 (en) 2010-10-28

Similar Documents

Publication Publication Date Title
EP2223456B1 (fr) Retransmission pré-planifiée pour établissement initial
EP2141852B1 (fr) Procédé de traitement de NDI dans une procédure d'accès aléatoire et procédé de transmission et de réception d'un signal l'utilisant
EP2665306B1 (fr) Procédé d'un fonctionnement HARQ de liaison montante lors de l'éxpiration d'un délai d'alignement temporaire
KR101188489B1 (ko) 이동통신 시스템에서의 무선자원 요청방법
JP5482900B2 (ja) 多地点協調伝送を用いて受信されるパケットに対するｎａｃｋ送信への遅延導入
EP2101530B1 (fr) Procédé de traitement de HARQ en considérant un écart de mesure
EP2866373B1 (fr) Procédé de conduite d'une opération harq sens descendant à l'expiration d'un délai d'horloge d'alignement temporel
US8594029B2 (en) (H)ARQ for semi-persistent scheduling
JP5793695B2 (ja) 移動通信における改良されたランダムアクセス手順
US20210167897A1 (en) Low latency harq protocol for urllc services
EP3358773A1 (fr) Mécanisme arq hybride pour liaison montante de stations de base coopératives
KR101430472B1 (ko) 무선 통신 시스템에서의 데이터 재전송 제어 방법
EP2209248B1 (fr) Procédé de traitement de NDI dans une procédure d'accès aléatoire et procédé de transmission et de réception d'un signal l'utilisant
US20110019568A1 (en) Method and apparatus for transmitting and receiving data in mobile communication system
EP2166692A1 (fr) Procédé de traitement du HARQ basé sur un nombre maximal de transmissions
EP2836007B1 (fr) Procédé d'un fonctionnement HARQ de liaison montante à expiration d'un délai d'alignement temporaire
GB2461378A (en) Processing a new data indicator during a random access procedure of a mobile 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: 20100708

AK Designated contracting states

Kind code of ref document: A1

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

AX Request for extension of the european patent

Extension state: AL BA HR MK RS

RIC1 Information provided on ipc code assigned before grant

Ipc: H04B 7/26 20060101ALI20101006BHEP

Ipc: H04L 1/18 20060101AFI20101006BHEP

Ipc: H04W 84/00 20090101ALI20101006BHEP

A4 Supplementary search report drawn up and despatched

Effective date: 20110119

RIC1 Information provided on ipc code assigned before grant

Ipc: H04W 74/08 20090101ALI20110113BHEP

Ipc: H04L 1/18 20060101AFI20101006BHEP

Ipc: H04B 7/26 20060101ALI20110113BHEP

Ipc: H04W 84/00 20090101ALI20110113BHEP

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

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

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

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 575453

Country of ref document: AT

Kind code of ref document: T

Effective date: 20120915

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

Country of ref document: DE

Effective date: 20121108

REG Reference to a national code

Ref country code: NL

Ref legal event code: T3

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

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

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

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

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 575453

Country of ref document: AT

Kind code of ref document: T

Effective date: 20120912

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

Effective date: 20120912

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

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

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

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

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

Ref country code: BE

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

Effective date: 20120912

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

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

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

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

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

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

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

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

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

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

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

Ref country code: MC

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

Effective date: 20121231

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

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

26N No opposition filed

Effective date: 20130613

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

Ref country code: IT

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

Effective date: 20120912

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

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602007025503

Country of ref document: DE

Effective date: 20130613

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

Ref country code: LI

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

Effective date: 20121231

Ref country code: IE

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

Effective date: 20121220

Ref country code: CH

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

Effective date: 20121231

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

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

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

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

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

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

Effective date: 20071220

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 602007025503

Country of ref document: DE

Representative=s name: HOFFMANN - EITLE, DE

Effective date: 20140430

Ref country code: DE

Ref legal event code: R082

Ref document number: 602007025503

Country of ref document: DE

Representative=s name: HOFFMANN - EITLE, DE

Effective date: 20140618

Ref country code: DE

Ref legal event code: R081

Ref document number: 602007025503

Country of ref document: DE

Owner name: OPTIS WIRELESS TECHNOLOGY, LLC, PLANO, US

Free format text: FORMER OWNER: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL), STOCKHOLM, SE

Effective date: 20140618

Ref country code: DE

Ref legal event code: R082

Ref document number: 602007025503

Country of ref document: DE

Representative=s name: GRUENECKER, KINKELDEY, STOCKMAIR & SCHWANHAEUS, DE

Effective date: 20140618

Ref country code: DE

Ref legal event code: R082

Ref document number: 602007025503

Country of ref document: DE

Representative=s name: GRUENECKER, KINKELDEY, STOCKMAIR & SCHWANHAEUS, DE

Effective date: 20140430

Ref country code: DE

Ref legal event code: R082

Ref document number: 602007025503

Country of ref document: DE

Representative=s name: GRUENECKER PATENT- UND RECHTSANWAELTE PARTG MB, DE

Effective date: 20140618

Ref country code: DE

Ref legal event code: R082

Ref document number: 602007025503

Country of ref document: DE

Representative=s name: GRUENECKER PATENT- UND RECHTSANWAELTE PARTG MB, DE

Effective date: 20140430

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 602007025503

Country of ref document: DE

Representative=s name: GRUENECKER, KINKELDEY, STOCKMAIR & SCHWANHAEUS, DE

Ref country code: DE

Ref legal event code: R082

Ref document number: 602007025503

Country of ref document: DE

Representative=s name: GRUENECKER PATENT- UND RECHTSANWAELTE PARTG MB, DE

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 602007025503

Country of ref document: DE

Representative=s name: GRUENECKER, KINKELDEY, STOCKMAIR & SCHWANHAEUS, DE

Ref country code: DE

Ref legal event code: R082

Ref document number: 602007025503

Country of ref document: DE

Representative=s name: GRUENECKER PATENT- UND RECHTSANWAELTE PARTG MB, DE

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20150528 AND 20150603

REG Reference to a national code

Ref country code: NL

Ref legal event code: SD

Effective date: 20150629

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

Ref country code: DE

Payment date: 20171120

Year of fee payment: 11

Ref country code: NL

Payment date: 20171124

Year of fee payment: 11

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

Ref country code: GB

Payment date: 20171121

Year of fee payment: 11

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602007025503

Country of ref document: DE

REG Reference to a national code

Ref country code: NL

Ref legal event code: MM

Effective date: 20190101

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

Effective date: 20181220

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

Effective date: 20190101

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

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

Ref country code: GB

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

Effective date: 20181220

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230523