User specific load balancing
12 claims: 5 independent, 7 dependent
- 1A method, characterized in that the method comprises:detecting, by a base station (12) in a communication scenario applying voice over IP services with semi-persistent scheduling and time division duplexing, that a semi-persistently scheduled new uplink packet transmission (3A) for one packet (P2) and, according to a synchronous hybrid automatic repeat request process, an uplink packet re-transmission (3B) for another packet (P1 2 ) from one user equipment (10) are both scheduled to occur at a certain sub-frame of a first hybrid automatic repeat request process, wherein the semi-persistently scheduled new uplink packet transmissions occur only once in every scheduling interval of a predetermined duration;transmitting a negative acknowledgement (3C) to the user equipment (10), wherein the uplink packet re-transmission (3B) from the UE (10) takes place during the certain sub-frame;in response to the detection, a hybrid automatic repeat request function dynamically allocating (3D) resources to the user equipment (10) for transmitting the new uplink packet transmission (3A,3E) in a sub-frame of a next hybrid automatic repeat request process taking place within the ongoing scheduling interval of the predetermined duration and which does not collide with the uplink packet re-transmission (3B);and transmitting indication of the dynamic allocation (3D) to the user equipment (10).
- 4An apparatus, characterized in that the apparatus comprises:means for detecting, in a communication scenario applying voice over IP services with semi-persistent scheduling and time division duplexing, that a semi-persistently scheduled new uplink packet transmission (3A) for one packet (P2) and, according to a synchronous hybrid automatic repeat request process, an uplink packet re-transmission (3B) for another packet (P1 2 ) from one user equipment (10) are both scheduled to occur at a certain sub-frame of a first hybrid automatic repeat request process, wherein the semi-persistently scheduled new uplink packet transmissions occur only once in every scheduling interval of a predetermined duration;means for transmitting a negative acknowledgement (3C) to the user equipment (10), wherein the uplink packet re-transmission (3B) from the UE (10) takes place during the certain sub-frame;in response to the detection, means for dynamically allocating resources (3D) to the user equipment (10) for transmitting the new uplink packet transmission (3A, 3E) in a sub-frame of a next hybrid automatic repeat request process taking place within the ongoing scheduling interval of the predetermined duration and which does not collide with the uplink packet re-transmission (3B);and means for transmitting indication of the dynamic allocation (3D) to the user equipment (10).
- 6A method, characterized in that the method comprises:receiving, by a user equipment in a communication scenario applying voice over IP services with semi-persistent scheduling and time division duplexing, a negative acknowledgement (3C) from a base station (12);transmitting an uplink packet re-transmission (P1 2, 3B) of a packet (P1 2 ) in a certain sub-frame of a first hybrid automatic repeat request process, wherein the certain sub-frame is allocated to a semi-persistently scheduled new uplink packet transmission (3A) of another packet (P2) and, according to a synchronous hybrid automatic repeat request process, also to the uplink packet re-transmission (3B), wherein the semi-persistently scheduled new uplink packet transmissions occur only once in every scheduling interval of a predetermined duration;receiving a dynamic allocation (3D) of a sub-frame of a next hybrid automatic repeat request process taking place within the ongoing scheduling interval of the predetermined duration, wherein the dynamic allocation is for transmitting the new uplink packet (3A);and transmitting the new uplink packet (P2 0 . P2 1 , 3E) using the dynamically allocated sub-frame of the next hybrid automatic repeat request process in order to avoid a collision between the uplink packet re-transmission (P1 2 , 3B) and the new uplink packet transmission (P2).
- 9An apparatus, characterized in that the apparatus comprises:means for receiving, in a communication scenario applying voice over IP services with semi-persistent scheduling and time division duplexing, a negative acknowledgement (3C) from a base station (12);means for transmitting an uplink packet re-transmission (P1 1 , P1 2 , 3B) of a packet (P1 2 ) in a certain sub-frame of a first hybrid automatic repeat request process, wherein the certain sub-frame is allocated to a semi-persistently scheduled new uplink packet transmission (3A) of another packet (P2) and, according to a synchronous hybrid automatic repeat request process, also to the uplink packet re-transmission (3B), wherein the semi-persistently scheduled new uplink packet transmissions occur only once in every scheduling interval of a predetermined duration;means for receiving a dynamic allocation (3D) of a sub-frame of a next hybrid automatic repeat request process taking place within the ongoing scheduling interval of the predetermined duration, wherein the dynamic allocation is for transmitting the new uplink packet (3A);and means for transmitting the new uplink packet (P2 0 . P2 1 , 3E) using the dynamically allocated sub-frame of the next hybrid automatic repeat request process in order to avoid a collision between the uplink packet re-transmission (P1 2 , 3B) and the new uplink packet transmission (P2).
Independent claims5
67 paragraphs in 5 sections, as filed
TECHNICAL FIELD:
0001The exemplary and non-limiting embodiments of this invention relate generally to wireless communication systems, methods, devices and computer program products and, more specifically, relate to techniques for providing automatic repeat request functionality between a base station and a user equipment.
BACKGROUND:
0002Various abbreviations that appear in the specification and/or in the drawing figures are expanded as follows: <dl id="dl0001" compact="compact"><dt>3GPP</dt><dd>third generation partnership project</dd><dt>ACK</dt><dd>acknowledge</dd><dt>aGW</dt><dd>access gateway</dd><dt>ARQ</dt><dd>automatic repeat request</dd><dt>DL</dt><dd>downlink</dd><dt>EUTRAN</dt><dd>evolved UTRAN</dd><dt>eNB</dt><dd>EUTRAN Node B (evolved Node B)</dd><dt>FDD</dt><dd>frequency division duplex</dd><dt>FDMA</dt><dd>frequency division multiple access</dd><dt>FS</dt><dd>frame structure</dd><dt>HARQ</dt><dd>hybrid automatic repeat request</dd><dt>HSPA</dt><dd>high speed packet access</dd><dt>LTE</dt><dd>long term evolution</dd><dt>MAC</dt><dd>medium access control (layer 2, L2)</dd><dt>MCS</dt><dd>modulation and coding scheme</dd><dt>NACK</dt><dd>negative acknowledge</dd><dt>NDI</dt><dd>new data indicator</dd><dt>Node B</dt><dd>base station</dd><dt>OFDMA</dt><dd>orthogonal frequency division multiple access</dd><dt>PDCCH</dt><dd>physical downlink control channel</dd><dt>PDU</dt><dd>protocol data unit</dd><dt>PHICH</dt><dd>physical hybrid-ARQ indicator channel</dd><dt>RTT</dt><dd>round trip time</dd><dt>RU</dt><dd>resource unit</dd><dt>SAW</dt><dd>stop and wait</dd><dt>SC-FDMA</dt><dd>single carrier, frequency division multiple access</dd><dt>TDD</dt><dd>time division duplex</dd><dt>TTI</dt><dd>transmission time interval</dd><dt>UE</dt><dd>user equipment</dd><dt>UL</dt><dd>uplink</dd><dt>UTRAN</dt><dd>universal terrestrial radio access network</dd><dt>VoIP</dt><dd>voice over internet protocol</dd></dl>
0003A proposed communication system known as evolved UTRAN (E-UTRAN, also referred to as UTRAN-LTE or as E-UTRA) is currently under development within the 3GPP. The agreement at the time of this invention is that the DL access technique is OFDMA, and the UL access technique is SC-FDMA.
0004One specification of interest to these and other issues related to the invention is <nplcit id="ncit0001" npl-type="s"><text>3GPP TS 36.300, V8.1.0 (2007-06), 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA) and Evolved Universal Terrestrial Access Network (E-UTRAN</text></nplcit>); Overall description; Stage 2 (Release 8). Further, a document <nplcit id="ncit0002" npl-type="s"><text>NOKIA ET AL: "Implicit ACK/NAK for LTE DL". 3RD GENERATION PARTNER-SHIP PROJECT (3GPP), [Online] 19 June 2007 (2007-06-19</text></nplcit>), XP050106660 discloses a method employing implicit ACK/NACK signaling. Further, a document <nplcit id="ncit0003" npl-type="s"><text>LG electronics: "considerations on UL HARQ", 3RD GENERATION PARTNERSHIP PROJECT (3GPP),vol. RAN WG2, no. Orlando, USA; 20070622</text></nplcit>, 22 June 2007 (2007-06-22), XP050135522 discloses a method on how to act when a pre-allocated resource blocks the transmission by a user terminal. A document <nplcit id="ncit0004" npl-type="s"><text>Ericsson: " Semi-persistent scheduling", 3GPP Draft; R1-062863, 3rd generation partnership project (3GPP), vol. RAN WG1, no. Seoul, Korea; 20061004</text></nplcit>, 4 October 2006, discusses collision between synchronous retransmission of data and the persistently allocated resources.
0005There has been discussed several HARQ issues related to LTE.
0006For example, for LTE a hybrid ARQ (HARQ) protocol that is proposed for use is similar to that of HSPA, namely N parallel hybrid ARQ processes, each implementing a SAW protocol. Each hybrid ARQ process has a certain amount of soft buffer memory in order to implement soft combining.
0007Further, the number of hybrid ARQ processes should be selected to be as small as possible to minimize the delays associated with HARQ re-transmissions. For FDD the number of processes mainly depends on processing delays. However, for the case of TDD the number of processes required also depends on how sub-frames are allocated to the UL and DL. Considering the processing delays and DL/UL sub-frame configuration, one example of UL HARQ mapping in TDD is shown in <figref idref="f0001">Figure 1</figref>. In this context "DSUUU" means 1 DL sub-frames, 1 special sub-frame and 3 UL frames in 5ms, and the other cases are similar.
0008It can be further noted that synchronous HARQ has been selected for the LTE UL, so the HARQ process identifications (IDs) in the timeslots numbered as 1, 2, 3, or 4 are shown in darker greyin <figref idref="f0001">Figure 1</figref> are rigorously in order (sequential), and re-transmission must take place within the same HARQ process as its initial/new/first transmission.
0009Semi-persistent scheduling has also been agreed to for use in LTE, in particular for VoIP service, wherein initial/new transmissions of voice packets are persistently allocated (a set of resources in every 20ms are predefined) and re-transmissions of packets are dynamically scheduled by Layer 1/Layer 2 signaling.
0010In semi-persistent scheduling, an initial transmission of voice packets is assumed to always have a higher priority than a re-transmission. Reference in this regard can be made to R2-070476,<nplcit id="ncit0005" npl-type="s"><text> 3GPP TSG-RAN WG2 Meeting #57, 12-16 February 2007, St. Louis, Missouri, USA, "Uplink Scheduling for VoIP</text></nplcit>", Nokia.
0011In some cases of TDD (especially for the cases "DSUUD", "DSUDD", "DSUUUDDDDD" and DSUUDDDDDD")), and due to the characteristic of HARQ process mapping, for one user the re-transmission of some packets can collide with initial transmissions of later packets, that is to say, the re-transmission of some packets and initial transmissions of other packets for one user are all located into the same HARQ process.
0012For example, and considering the "DSUDD" case in. <figref idref="f0001">Figure 1</figref> where there is only one UL sub-frame in the 5ms interval, and there are a total of two HARQ processes, all of the (re)transmissions of one users' voice packets are in process #1 if the initial/new transmissions are allocated in process #1 (see <figref idref="f0002">Figure 2</figref> in this regard). In <figref idref="f0002">Figure 2</figref>, PX<sub>Y</sub> implies the Yth retransmission of Packet X. Due to the number of (re)transmissions ongoing in process #1, in some timeslots it is difficult to determine which packet(new transmission or retransmission) is to be transmitted (indicated as '?' in <figref idref="f0002">Fig 2</figref>). Further still, and even if process #2 of this user is empty and free, this user cannot transfer its high traffic load (some number of packets) to process #2 due to restrictions imposed by synchronous HARQ and semi-persistent scheduling. As a result the resource efficiency of this particular user is low. Furthermore, some packet delay is inevitable.
SUMMARY:
0013In an exemplary aspect of the invention, there is a method as described in claim 1.
0014In another exemplary aspect of the invention, there is a computer readable medium encoded with a computer program executable by a processor as described in claim 3.
0015In another exemplary aspect of the invention, there is an apparatus as described in claim 4.
0016In still another exemplary aspect of the invention, there is a method as described in claim 6.
0017In another exemplary aspect of the invention, there is a computer readable medium encoded with a computer program executable by a processor as described in claim 8.
0018In still another exemplary aspect of the invention, there is an apparatus as described in claim 9.
BRIEF DESCRIPTION OF THE DRAWINGS:
0019The foregoing and other aspects of embodiments of this invention are made more evident in the following Detailed Description, when read in conjunction with the attached Drawing Figures, wherein:
0020<figref idref="f0001">Figure 1</figref> depicts an example of TDD UL HARQ mapping;
0021<figref idref="f0002">Figure 2</figref> illustrates a problem that can arise if all (re)transmissions take place in process # 1;
0022<figref idref="f0002">Figure 3</figref> shows a non-limiting example of user-specific load balancing among HARQ processes;
0023<figref idref="f0003">Figure 4</figref> shows a first table (Table 1) of system simulation parameters;
0024<figref idref="f0004">Figure 5</figref> shows a second table (Table 2) of HARQ distribution;
0025<figref idref="f0004">Figure 6</figref> shows a simplified block diagram of various electronic devices that are suitable for use in practicing the exemplary embodiments of this invention; and
0026<figref idref="f0005">Figures 7 and 8</figref> are each a logic flow diagram illustrative of a method, and the execution of computer program instructions, in accordance with the exemplary embodiments of this invention.
DETAILED DESCRIPTION:
0027Reference is made first to <figref idref="f0004">Figure 6</figref> for illustrating a simplified block diagram of various electronic devices that are suitable for use in practicing the exemplary embodiments of this invention. In <figref idref="f0004">Figure 6</figref> a wireless network 1 is adapted for communication with a UE 10 via a Node B (base station) 12. The network 1 may include a network control element (NCE) 14, such as an aGW. The UE 10 includes a data processor (DP) 10A, a memory (MEM) 10B that stores a program (PROG) 10C, and a suitable radio frequency (RF) transceiver 10D for bidirectional wireless communications with the Node B 12, which also includes a DP 12A, a MEM 12B that stores a PROG 12C, and a suitable RF transceiver 12D. The Node B 12 is coupled via a data path 13 to the NCE 14 that also includes a DP 14A and a MEM 14B storing an associated PROG 14C. At least one of the PROGs 10C and 12C is assumed to include program instructions that, when executed by the associated DP, enable the electronic device to operate in accordance with the exemplary embodiments of this invention, as will be discussed below in greater detail.
0028Reference with regard to the teachings of this invention can be made to <nplcit id="ncit0006" npl-type="s"><text>3GPP TS 36.321 v8.2.0 (2008-05), 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA) and Evolved Universal Terrestrial Access Network (E-UTRAN)</text></nplcit>; Medium Access Control (MAC) protocol specification (Release 8). In addition, reference can be made to <nplcit id="ncit0007" npl-type="s"><text>3GPP TS 36.213 v8.3.0 (2008-05), 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA) and Evolved Universal Terrestrial Access Network (E-UTRAN); Physical layer procedures (Release 8)</text></nplcit>.
0029As supported in <nplcit id="ncit0008" npl-type="s"><text>3GPP TS 36.321 v8.2.0 (2008-05</text></nplcit>) there is one HARQ entity at the UE. A number of parallel HARQ processes are used in the UE to support the HARQ entity, allowing transmissions to take place continuously while waiting for the feedback on the successful or unsuccessful reception of previous transmissions. At a given TTI, if an uplink grant is indicated for the TTI, the HARQ entity identifies the HARQ process for which a transmission should take place. It also routes the receiver feedback (ACK/NACK information), MCS and resource, relayed by the physical layer, to the appropriate HARQ process.
0030At the given TTI, the HARQ entity shall: <ul id="ul0001" list-style="dash" compact="compact"><li>if an uplink grant indicating that the NDI has been incremented compared to the value in the previous transmission of this HARQ process is indicated for this TTI or if this is the very first transmission for this HARQ process (i.e. a new transmission takes place for this HARQ process):</li><li>if there is an ongoing Random Access procedure and there is a MAC PDU in the [Message3] buffer:</li><li>obtain the MAC PDU to transmit from the [Message3] buffer.</li><li>else, if the "uplink prioritisation" entity indicates the need for a new transmission:</li><li>obtain the MAC PDU to transmit from the "Multiplexing and assembly" entity;</li><li>instruct the HARQ process corresponding to this TTI to trigger a new transmission using the identified parameters.</li><li>else:</li><li>flush the HARQ buffer.</li><li>else, if an uplink grant, indicating that the NDI is identical to the value in the previous transmission of this HARQ process (i.e. a retransmission takes place for this HARQ process), is indicated for this TTI:</li><li>instruct the HARQ process to generate an adaptive retransmission.</li><li>else, if the HARQ buffer of the HARQ process corresponding to this TTI is not empty:</li><li>instruct the HARQ process to generate a non-adaptive retransmission. NOTE:A retransmission triggered by the HARQ entity should be cancelled by the corresponding HARQ process if it collides with a measurement gap or if a non-adaptive retransmission is not allowed.</li></ul>
0031In addition, as supported in <nplcit id="ncit0009" npl-type="s"><text>3GPP TS 36.213 v8.3.0 (2008-05</text></nplcit>), for a downlink subframe i, if a transport block was transmitted in the associated PUSCH subframe then: <ul id="ul0002" list-style="dash" compact="compact"><li>if an Uplink Scheduling Assignment is received in subframe i with NDI toggled since the previous subframe corresponding to the same HARQ process, a new transmission shall be indicated to the higher layers;</li><li>else if an Uplink Scheduling Assignment is received in subframe i with NDI not toggled since the previous subframe corresponding to the same HARQ process, a re-transmission shall be indicated to the higher layers.</li><li>else if no Uplink Scheduling Assignment is received in subframe i, then:</li><li>if ACK is decoded on the PHICH, ACK shall be delivered to the higher layers;</li><li>else NACK shall be delivered to the higher layers.</li></ul>
0032In accordance with an exemplary embodiment of the invention, the UE 10 and the eNB 12 are each assumed to include a HARQ process or function 10E, 12E that operates in accordance with the exemplary embodiments of this invention, as discussed below and illustrated at least in <figref idref="f0002">Figure 3</figref>.
0033In general, the exemplary embodiments of this invention may be implemented at least in part by computer software executable by the DP 10A of the UE 10 and by the DP 12A of the Node B 12, or by hardware, or by a combination of software and hardware. The processor implementing embodiments of the invention may be a main processor or another processor in a slave relation to the master main processor (e.g. baseband processor). The HARQ functional unit may be within the main processor or a slaved processor.
0034In general, the various embodiments of the UE 10 can include, but are not limited to, cellular telephones, personal digital assistants (PDAs) having wireless communication capabilities, portable computers having wireless communication capabilities, image capture devices such as digital cameras having wireless communication capabilities, gaming devices having wireless communication capabilities, music storage and playback appliances having wireless communication capabilities, Internet appliances permitting wireless Internet access and browsing, as well as portable units or terminals that incorporate combinations of such functions.
0035The MEMs 10B, 12B and 14B may be of any type of computer-readable medium suitable to the local technical environment and may be implemented using any suitable data storage technology, such as semiconductor-based memory devices, flash memory, magnetic memory devices and systems, optical memory devices and systems, fixed memory and removable memory. The DPs 10A, 12A and 14A may be of any type suitable to the local technical environment, and may include one or more of general purpose computers, special purpose computers, microprocessors, digital signal processors (DSPs) and processors based on a multi-core processor architecture, as non-limiting examples.
0036In accordance with certain exemplary embodiments of this invention the problems that were discussed above, and shown in <figref idref="f0002">Figure 2</figref>, are overcome, and resource utilization is maximized, by performing UE 10 specific load balancing among HARQ processes, in particular for the case of semi-persistent scheduling in the LTE TDD UL. This load balancing procedure makes full use of available resources, thereby decreasing packet delay and enhancing system performance.
0037More specifically, when a new transmission packet and re-transmission packet from one UE 10 occur within one HARQ process, the re-transmission packet is transmitted during the time at which a collision would occur, and the new transmission packet is dynamically scheduled to a new resource in another, different HARQ process.
0038An example of an implementation of user-specific (UE-specific) load balancing among HARQ processes is shown in <figref idref="f0002">Figure 3</figref>. This non-limiting example assumes the case of VoIP service and semi-persistent scheduling, as well as the "DUDDD" TDD case (PX<sub>Y</sub> means the Yth retransmission of Packet X).
0039Assume that the persistent allocation for the first transmission is in HARQ process #1 and occurs every 20ms (the blocks labeled 3A). The blocks labeled 3B indicate re-transmissions made in response to receipt of a NACK (arrows labeled 3C). In this example it is assumed that there are three re-transmissions (P1<sub>1</sub>, P1<sub>2</sub>, P1<sub>3</sub>) needed for new packet P1<sub>0</sub>, and that one re-transmission (P2<sub>1</sub>) is used for new packet P2<sub>0</sub>.
0040At the end of the 20th ms, it can be observed that the second retransmission of P1 (P1<sub>2</sub>) will collide with the predefined timeslot for P2.
0041In response to the detected collision, a NACK is sent to the UE 10 on the DL L1/L2 control, and the second re-transmission (P1<sub>2</sub>) takes place using the predefined (persistently allocated) resources for the new transmissions (3A).
0042In accordance with an aspect of this invention, a delayed new transmission (P2<sub>0</sub>) is dynamically scheduled in the UL allocation 3D by the eNB 12 to be transmitted later during the different HARQ process #2. It should be noted that the delayed new transmission (P2<sub>0</sub>) can be freely allocated to occur in any HARQ process, since it is new transmission and not a re-transmission and thus is not constrained by the synchronous HARQ. Note as well that the re-transmission of P2<sub>0</sub> (i.e., P2<sub>1</sub>) then also occurs in the second (different) HARQ process.
0043It can be further noted that only a new transmission that has collided with a re-transmission need be dynamically scheduled to another HARQ process, as other new transmissions can occur in the persistent fashion in process #1 if the loading in HARQ process # 1 is reasonable.
0044By the use of this technique the UE 10 is enabled to distribute its UL packet load into all available HARQ processes, and can make full use of the HARQ processes and the physical resources. An additional advantage is that the use of this technique enables more re-transmissions to occur for, as an example, VoIP packets. Furthermore, no change is needed to be proposed or made to the synchronous HARQ in the LTE UL.
0045Simulation analysis:
0046To avoid a collision between initial transmission and retransmission, one prior approach/method (new transmission over retransmission) is to delete the old packet (flush its HARQ process buffer) when it meets the next new packet and to let the new packet be ongoing in the HARQ process buffer. This approach may be suitable for a FDD case since there are five transmission chances before the re-transmission meets the next initial transmission (assuming the use of eight HARQ processes in FDD), particularly in view of the fact that very few packets ever require more than five transmissions. However, in the TDD case there is only one re-transmission available before a collision occurs (1 or 2 UL TTI in 5ms and 2 or 3 ULTTI in 10ms , i.e., the "DSDDUUD" case, "DSUDD" case, "DSUUDDDDDD" and "DSUUUDDDDD" shown in <figref idref="f0001">Figure 1</figref>).
0047Based on a simulation using VoIP TDD UL, and using the exemplary parameters listed at Table 1/<figref idref="f0003">Figure 4</figref>, when there are many VoIP UEs per sector, 5.77% of the packets need more than two transmissions (Table 2/<figref idref="f0004">Figure 5</figref>). That is to say, 5.77% of the VoIP packets are not correctly received using the conventional approach. However, the goal should be a re-transmission percentage of about 2% or less to achieve a non-objectionable user experience. Thus, the use of the conventional method is expected to not be adequate. From the simulation results, by the use of the exemplary embodiments of this invention the capacity per sector is much higher than the capacity whereas the use of the conventional method.
0048Based on the foregoing it should be apparent that the exemplary embodiments of this invention provide a method, apparatus and computer program product(s) to enable UL load balancing between available HARQ processes, with the technical effect of enhancing wireless link resource usage.
0049Referring to <figref idref="f0005">Figure 7</figref> there is shown a method where a HARQ function executing at a network element or a component for such a network element detects a collision between an UL packet re-transmission and a new UL packet transmission within a HARQ process (Block 7A); and in response the HARQ function dynamically schedules resources for transmitting the new UL packet transmission in a different HARQ process (Block 7B). In accordance with the exemplary embodiments of the invention the dynamically scheduled resource can be allocated by transmitting the allocation to a network device such as a UE.
0050In the method of the previous paragraph, resources may be persistently allocated for transmitting the new packet transmission in the different HARQ process.
0051The method of the preceding paragraphs may be executed in an eNB.
0052The method of the preceding paragraphs may be performed as a result of the execution of program instructions stored in a memory medium of an eNB.
0053It can be further appreciated that an aspect of this invention pertains to a HARQ functional unit embodied in an eNB that is configurable to detect a collision between an UL packet re-transmission and a new UL packet transmission within a HARQ process and, in response, the HARQ functional unit is further configurable to dynamically schedule resources to a UE for transmitting the new UL packet transmission in a different HARQ process.
0054In a particular aspect for the HARQ functional unit of the previous paragraph, resources are persistently allocated for transmitting the new packet transmission in the different HARQ process.
0055It can be further appreciated that an aspect of this invention pertains to an apparatus that comprises means for detecting a collision between an UL packet re-transmission and a new UL packet transmission within a HARQ process; and that further comprises means for dynamically allocating resources for transmitting the new UL packet transmission in a different HARQ process.
0056Referring to <figref idref="f0005">Figure 8</figref>, also disclosed herein is a method executable by a UE or by a component for a UE, for transmitting a packet re-transmission in a HARQ process using a semi-persistently scheduled UL resource (Block 8A); and responsive to receiving a dynamic allocation of a different HARQ process from an eNB, transmitting a new packet using the dynamically assigned different HARQ process (Block 8B).
0057In an embodiment for the method and the UE of the previous paragraph, resources are persistently scheduled for the UE for transmitting the new packet transmission in the different HARQ process.
0058Also disclosed is a UE that comprises a HARQ functional unit operable to transmit a packet re-transmission in a HARQ process using a semi-persistently scheduled UL resource; and that is responsive to receiving a dynamic allocation of a different HARQ process from an eNB, to transmit a new packet using the dynamically assigned different HARQ process.
0059In an embodiment of the UE of the previous paragraph, resources are persistently scheduled for the UE for transmitting the new packet transmission in the different HARQ process.
0060Also disclosed is an apparatus comprising means for transmitting a packet re-transmission in a HARQ process using a semi-persistently scheduled UL resource; and means, responsive to receiving a dynamic allocation of a different HARQ process, for transmitting a new packet using the dynamically assigned different HARQ process.
0061The various blocks shown in <figref idref="f0005">Figures 7 and 8</figref> may be viewed as method steps, and/or as operations that result from operation of computer program code, and/or as a plurality of coupled logic circuit elements of an integrated circuit constructed to carry out the associated function(s).
0062In general, the various exemplary embodiments may be implemented in hardware or special purpose circuits, software, logic or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software which may be executed by a controller, microprocessor or other computing device, although the invention is not limited thereto. While various aspects of the exemplary embodiments of this invention may be illustrated and described as signaling diagrams, block diagrams, flow charts, or using some other pictorial representation, it is well understood that these blocks, apparatus, systems, techniques or methods described herein may be implemented in, as non-limiting examples, hardware, software, firmware, special purpose circuits or logic, general purpose hardware or controller or other computing devices, or some combination thereof.
0063As such, it should be appreciated that at least some aspects of the exemplary embodiments of the inventions may be practiced in various components such as integrated circuit chips and modules. The design of integrated circuits is by and large a highly automated process and the resultant design may be transmitted in a standardized electronic format (e.g., Opus, GDSII, or the like) to a semiconductor fabrication facility for fabrication as one or more integrated circuit devices.
0064Various modifications and adaptations to the foregoing exemplary embodiments of this invention may become apparent to those skilled in the relevant arts in view of the foregoing description, when read in conjunction with the accompanying drawings. However, any and all modifications will still fall within the scope of the non-limiting and exemplary embodiments of this invention.
0065For example, while the exemplary embodiments have been described above in the context of the E-UTRAN (UTRAN-LTE) system, it should be appreciated that the exemplary embodiments of this invention are not limited for use with only this one particular type of wireless communication system, and that they may be used to advantage in other wireless communication systems. Process steps may be taken concurrently or out of the order explicitly described in the text description where one step does not require completion of another.
0066It should be noted that the terms "connected," "coupled," or any variant thereof, mean any connection or coupling, either direct or indirect, between two or more elements, and may encompass the presence of one or more intermediate elements between two elements that are "connected" or "coupled" together. The coupling or connection between the elements can be physical, logical, or a combination thereof. As employed herein two elements may be considered to be "connected" or "coupled" together by the use of one or more wires, cables and/or printed electrical connections, as well as by the use of electromagnetic energy, such as electromagnetic energy having wavelengths in the radio frequency region, the microwave region and the optical (both visible and invisible) region, as several non-limiting and non-exhaustive examples.
0067Furthermore, some of the features of the various non-limiting and exemplary embodiments of this invention may be used to advantage without the corresponding use of other features. As such, the foregoing description should be considered as merely illustrative of the principles, teachings and exemplary embodiments of this invention, and not in limitation thereof.
Contents5
5 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US2003191844A1 | Cites | United States of America | Examiner |
| US2006023659A1 | Cites | United States of America | Examiner |
| US2003191844A1 | Cites | United States of America | – |
| US2006023659A1 | Cites | United States of America | – |
| NOKIA ET AL: "Implicit ACK/NAK for LTE DL" 3RD GENERATION PARTNERSHIP PROJECT (3GPP), [Online] 19 June 2007 (2007-06-19), XP050106660 Retrieved from the Internet: URL:ftp://ftp.3gpp.org/tsg_ran/WG1_RL1/TSG R1_49b/Docs/R1-072996.zip> | Non-patent | – | – |
| NOKIA: "Uplink Scheduling for VoIP" 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, [Online] 22 March 2007 (2007-03-22), XP050134396 Retrieved from the Internet: URL:ftp://ftp.3gpp.org/tsg_ran/WG2_RL2/TSG R2_57bis/Documents/R2-071460.zip> | Non-patent | – | – |
| LG ELECTRONICS: "Considerations on UL HARQ", 3RD GENERATION PARTNERSHIP PROJECT (3GPP), vol. RAN WG2, no. Orlando, USA; 20070622, 22 June 2007 (2007-06-22), XP050135522, [retrieved on 2007-06-22] | Non-patent | – | – |
| ERICSSON: "Semi-persistent scheduling", 3GPP DRAFT; R1-062863, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. RAN WG1, no. Seoul, Korea; 20061004, 4 October 2006 (2006-10-04), XP050103348, [retrieved on 2006-10-04] | Non-patent | – | – |
| LG ELECTRONICS: "Considerations on UL HARQ", 3RD GENERATION PARTNERSHIP PROJECT (3GPP), vol. RAN WG2, no. Orlando, USA; 20070622, 22 June 2007 (2007-06-22), XP050135522 | Non-patent | – | Examiner |
| ERICSSON: "Semi-persistent scheduling", 3GPP DRAFT; R1-062863, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. RAN WG1, no. Seoul, Korea; 20061004, 4 October 2006 (2006-10-04), XP050103348 | Non-patent | – | Examiner |
8 members in 4 offices
Priority claims3
| Document | Office | Kind | Date |
|---|---|---|---|
| 997765P | United States of America | – | |
| 99776507 | United States of America | P | |
| 2008053983 | International Bureau of the World Intellectual Property Organization (WIPO) | W |
Members8
| Document | Office | Kind | |
|---|---|---|---|
| WO2009044344A2 | World Intellectual Property Organization (WIPO) | A2 | |
| WO2009044344A3 | World Intellectual Property Organization (WIPO) | A3 | |
| EP2201717A2 | European Patent Office (EPO) | A2 | |
| CN101868933A | China | A | |
| US2011010598A1 | United States of America | A1 | |
| US8429480B2 | United States of America | B2 | |
| EP2201717B1This record | European Patent Office (EPO) | B1 | |
| CN101868933B | China | B |
68 legal events, as 9 offices reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | Office | |
|---|---|---|---|
| Change of applicant/patenteeR081 | R081 | DE | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Application deemed withdrawn, or ip right lapsed, due to non-payment of renewal feeWithdrawnR119 | R119 | DE | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Change of applicant/patenteeR081 | R081 | DE | |
| Change of applicant/patenteeR081 | R081 | DE | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| No opposition filed against granted patent, or epo opposition proceedings concluded without decisionGrantedR097 | R097 | DE | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| No opposition filedOpposition26N | 26N | EP | |
| Gb: european patent ceased through non-payment of renewal feeCeasedGBPC | GBPC | EP | |
| Patent lapsedLapsedMM4A | MM4A | IE | |
| Notification of lapseLapsedST | ST | FR | |
| No opposition filed within time limitOppositionORIGINAL CODE: 0009261PLBE | PLBE | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: NO OPPOSITION FILED WITHIN TIME LIMITSTAA | STAA | EP | |
| Party data changed (patent owner data changed or rights of a patent transferred)RAP2 | RAP2 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Patent ceasedCeasedPL | PL | CH | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Invalidated european patentMG4D | MG4D | LT | |
| Deletion acc. to par. 5 (withdrawal of the translation of the ep patent)MK05 | MK05 | AT | |
| Discontinued in the netherlands as no translation has been filedVDEP | VDEP | NL | |
| Dpma publication of mentioned ep patent grantGrantedR096 | R096 | DE | |
| European patents granted designating irelandGrantedFG4D | FG4D | IE | |
| European patent takes effect as a national patent in ch/liEP | EP | CH | |
| Reference to at number (ep patent enters austrian national phase)REF | REF | AT | |
| Designated contracting statesAK | AK | EP | |
| European patent grantedGrantedFG4D | FG4D | GB | |
| (expected) grantORIGINAL CODE: 0009210GRAA | GRAA | EP | |
| Grant fee paidORIGINAL CODE: EPIDOSNIGR3GRAS | GRAS | EP | |
| Intention to grant announcedINTG | INTG | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOSNIGR1GRAP | GRAP | EP | |
| Request for extension of the european patent (deleted)DAX | DAX | EP | |
| First examination report despatched17Q | 17Q | EP | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | EP | |
| Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI | PUAI | EP |
Numbers
- Publication
- 2201717
- Application
- 88353834
Titles3
- German
- BENUTZERSPEZIFISCHER LASTAUSGLEICH
- English
- USER SPECIFIC LOAD BALANCING
- French
- ÉQUILIBRAGE DE CHARGE SPÉCIFIQUE À UN UTILISATEUR
Classification
- CPC, 5
- H04W72/1268
- H04L1/1812
- H04L1/1822
- H04L1/1887
- H04W72/04
- IPC, 2
- H04L1 18
- H04W72 12
Designated states34
- Contracting states, 34
- Austria
- Belgium
- Bulgaria
- Switzerland
- Cyprus
- Czechia
- Germany
- Denmark
- Estonia
- Spain
- Finland
- France
- United Kingdom
- Greece
- Croatia
- Hungary
- Ireland
- Iceland
- Italy
- Liechtenstein
- Lithuania
- Luxembourg
- Latvia
- Monaco
and 10 moreShow fewer
- Malta
- Netherlands (Kingdom of the)
- Norway
- Poland
- Portugal
- Romania
- Sweden
- Slovenia
- Slovakia
- Türkiye
