KR101324143B1 - Method and apparatus for providing acknowledgement bundling - Google Patents

Abstract

An approach to acknowledgment bundling is provided. Dynamic scheduling of one or more of the subframes per bundling is performed by reusing the allocation index field (eg, downlink allocation index (DAI) field). The allocation index field has a value greater than or equal to the number of previously allocated subframes in the bundling window. The bundling window is defined as a group of subframes for a common acknowledgment.

Description

Method and apparatus for providing acknowledgment bundling {METHOD AND APPARATUS FOR PROVIDING ACKNOWLEDGEMENT BUNDLING}

Such as wireless data networks (e.g., 3rd Generation Partnership Project (3GPP) Long Term Evolution (LTE) systems, spread spectrum systems (e.g. code division multiple access (CDMA) networks, Worldwide Interoperability for Microwave) Wireless communication systems such as Access (worldwide interoperability over microwave connections), etc., provide users with the convenience of mobility as well as a rich set of services and features. As the allowed mode is used, the ever-increasing number of consumers has resulted in a significant adoption.To promote greater borrowing, the telecommunications industry, from manufacturers to service providers, is approved at high costs. And communication protocols that highlight various services and features. Strive to develop standards for which: One area of effort includes acknowledgment signaling, whereby transmissions can be implicitly or explicitly identified to convey successful transmission of data. Consume unnecessary.

Therefore, there is a need for an approach to provide efficient signaling that can coexist with already developed standards and protocols.

According to some exemplary embodiments, acknowledgment bundling allows configurations to be configured in various communication links (eg, uplink / downlink (UL / DL) by reusing the downlink allocation index (DAI) field without increasing the length of the DAI field. ) May be provided.

According to one embodiment, the method includes dynamically scheduling one or more of the subframes per bundling window by reusing the allocation index field. The allocation index field has a value greater than or equal to the number of previously allocated subframes in the bundling window. The bundling window is defined as a group of subframes for a common acknowledgment.

According to another embodiment, the apparatus includes logic configured to dynamically schedule one or more of the subframes per bundling window by reusing the allocation index field. The allocation index field has a value greater than or equal to the number of previously allocated subframes in the bundling window. The bundling window is defined as a group of subframes for a common acknowledgment.

According to another embodiment, the apparatus includes means for dynamically scheduling one or more of the subframes per bundling window by reusing the allocation index field. The allocation index field has a value greater than or equal to the number of previously allocated subframes in the bundling window. The bundling window is defined as a group of subframes for a common acknowledgment.

According to another embodiment, the method includes determining the total number of resource grants. The method also includes determining whether one or more resource grants are missing by comparing the value of the allocation index field of the received bundling window with the total number of resource grants. The allocation index field is reused for dynamic scheduling of resources using a bundling window. The bundling window is defined as a group of subframes for a common acknowledgment.

According to another embodiment, the apparatus is configured to determine the total number of resource grants and to determine if one or more resource grants are to be lost by comparing the value of the allocation index field of the received bundling window with the total number of resource grants. Contains logic. The allocation index field is reused for dynamic scheduling of resources using a bundling window. The bundling window is defined as a group of subframes for a common acknowledgment.

According to yet another embodiment, the apparatus includes means for determining the total number of resource grants. The apparatus also includes means for determining whether one or more resource grants are to be lost by comparing the value of the allocation index field of the received bundling window with the total number of resource grants. The allocation index field is reused for dynamic scheduling of resources using a bundling window. The bundling window is defined as a group of subframes for a common acknowledgment.

Still other aspects, features, and advantages of the invention will be readily apparent from the following detailed description, and are simplified by showing a number of specific embodiments and implementations, including the best mode contemplated for carrying out the invention. The invention can also be embodied in different and different embodiments, and some of the details of the invention can be changed in all, various obvious respects without departing from the spirit and scope of the invention. Accordingly, the drawings and description are to be regarded as illustrative in nature, and not as restrictive.

Embodiments of the invention are shown by way of example and not by way of limitation in the figures of the accompanying drawings.
1A and 1B are diagrams of a communication system capable of providing acknowledgment bundling, and a flowchart of an acknowledgment bundling process, respectively, according to an example embodiment.
2A-2C are flowcharts of a process for reusing a downlink allocation index (DAI) field, and correspond to diagrams of example downlink bundle windows, in accordance with various example embodiments.
3A and 3B are a flowchart of a process for reusing a downlink allocation index (DAI) field and diagram of example allocations in a bundle window, respectively, according to various example embodiments.
4A-4D are diagrams of communication systems having exemplary long-term evolution (LTE) and E-UTRA (Evolved Universal Terrestrial Radio Access) architectures, in accordance with various exemplary embodiments of the present invention, wherein FIG. The system of 1 may operate to provide resource allocation.
5 is a diagram of hardware that may be used to implement an embodiment of the present invention.
6 is a diagram of exemplary components of a user terminal configured to operate in the systems of FIGS. 4A-4D in accordance with an embodiment of the invention.

An apparatus, method, and software for acknowledgment bundling are disclosed. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of embodiments of the present invention. However, it will be apparent to one skilled in the art that embodiments of the present invention may be practiced without these specific details or may be practiced using equivalent arrangements. In order to avoid unnecessarily obscuring embodiments of the present invention, well-known structures and devices are shown in block diagram form in the order of examples.

Although embodiments of the present invention are discussed in connection with a wireless network that conforms to the Third Generation Partnership Project (3GPP) Long Term Evolution (LTE) architecture, embodiments of the present invention may be of any type of communication system and equivalent functional possibilities. It is recognized by those skilled in the art that they have applicability.

1A and 1B are diagrams of a communication system capable of providing acknowledgment bundling, and a flowchart of an acknowledgment bundling process, respectively, according to an example embodiment. As shown in FIG. 1A, system 100 is one or more user equipment (UEs) in communication with base station 103, which is part of an access network (not shown) (eg, 3GPP LTE (or E-UTRAN, etc.)). S) 101. Under the 3GPP LTE architecture (as shown in FIGS. 4A-4D), the base station 103 is represented as an enhanced Node B (eNB). The system 100 utilizes an acknowledgment mechanism in certain embodiments to provide accurate and timely exchange of information between the UE 101 and the eNB 103. However, such acknowledgment signaling (ie, using positive acknowledgments (ACKs) and / or negative acknowledgments (NACKs)) is overhead and can lead to degraded network performance if not utilized properly. In order to minimize signaling overhead, the system 100 uses a manner of bundling acknowledgment information. In one embodiment, dynamic scheduling of subframes per bundling window is implemented by, for example, reusing a downlink allocation index (DAI) field. Although the bundled acknowledgment scheme is described in relation to the DAI field and downlink, it is contemplated that this scheme may be applied to other equivalent fields and communication link. As used herein, the downlink refers to communication from the eNB 103 to the direction of the UE 101, and the uplink refers to communication from the UE 101 to the eNB 103.

The UE 101 may be connected to, for example, handsets, terminals, stations, units, devices, multimedia tablets, Internet nodes, communicators, personal digital assistants (PDAs) or a user. It may be any type of mobile stations, such as any type of interface (such as a "wearable" circuit, etc.). UE 101 includes an antenna system 107 that couples to transceiver 105 to receive or transmit signals from transceiver 105 and base station 103. The antenna system 107 includes one or more antennas. For illustration purposes, time division duplex (TDD) mode of 3GPP is described herein; However, it is recognized that other modes, such as frequency division duplex (FDD), may be supported.

As in the UE 101, the base station 103 utilizes a transceiver 109 that transmits information to the UE 101. In addition, the base station 103 may utilize one or more antennas 111 for transmitting and receiving electromagnetic signals. For example, node B 103 may utilize a multiple input multiple output (MIMO) antenna system 111, whereby node B 103 may support multiple antenna transmission and reception possibilities. Such an apparatus may support parallel transmission of independent data streams to achieve high data rates between the UE 101 and the Node B 103. The base station 103 is, in an exemplary embodiment, a downlink (DL) transmission scheme with a cyclic prefix to an uplink (UL) transmission scheme and a single-carrier transmission (eg, SC-FDMA (single carrier-frequency division). Orthogonal frequency division multiplexing (OFDM). SC-FDMA refers to "physical layer aspects for evolved UTRA", incorporated herein by reference in its entirety, which allows multiple users to transmit on different sub-bands simultaneously, May 2006, 1.5. It can also be realized using the SC-FDMA described in 3GPP TR 25.814, which is 0.v, and also the DFT-S-OFDM principle, also referred to as multi-user-SC-FDMA.

In one embodiment, the system of FIG. 1A provides MBMS (Multimedia Broadcast Multicast Services) services in MBSFN (Multimedia Broadcast Single Frequency Network). MBSFNs typically have unicast networks or neighboring MBSFNs operating at the same frequency.

Communication between the UE 101 and the base station 103 (and therefore the network) is partially controlled by control information exchanged between the two entities. This control information is, in one embodiment, transported over a control channel on the downlink, for example, from the base station 103 to the UE 101.

By way of example, multiple communication channels are defined for use in system 100. Channel types include: physical channels, transport channels, and logic channels. The physical channels may include a physical downlink shared channel (PSDCH), a dedicated physical downlink dedicated channel (DPDCH), a dedicated physical control channel (DPCCH), and the like. In addition, a physical uplink control channel (PUCCH) is provided. Transport channels can be defined by the nature of the data and how the transport channels carry data over the air interface. The transport channels include a broadcast channel (BCH), a paging channel (PCH), a dedicated shared channel (DSCH), and the like. Other exemplary transmission channels include uplink (UL) random access channel (RACH), common packet channel (CPCH), forward access channel (FACH), downlink shared channel (DLSCH), uplink shared channel (USCH), broadcast Channel (BCH), and paging channel (PCH). The dedicated transport channel is a UL / DL dedicated channel (DCH). Each transport channel is mapped to one or more physical channels according to their physical characteristics.

Each logical channel may be defined by the required quality of service (QoS) and type of information that the channel carries. Associated logical channels are, for example, broadcast control channel (BCCH), paging control channel (PCCH), dedicated control channel (DCCH), common control channel (CCCH), shared channel control channel (SHCCH), dedicated traffic channel ( DTCH), common traffic channel (CTCH), and the like.

The BCCH (Broadcast Control Channel) may be mapped to both BCH and DSCH. As such, it is mapped to the PDSCH; Time-frequency resources can be dynamically allocated by using an L1 / L2 control channel (PDCCH). In this case, BCCH (Broadcast Control Channel) -RNTI (Wireless Network Temporary Identities) is used to identify the resource allocation information.

As noted, to ensure accurate delivery of information between the eNB 103 and the UE 101, the system 100 utilizes error detection to exchange information, such as hybrid ARQ (HARQ). HARQ is a chain of forward error correction (FEC) coding and automatic repeat request (ARQ) protocols. Automatic repeat request (ARQ) is an error detection mechanism used on the link layer. As such, in addition to this error detection scheme, other schemes (eg, CRC (cyclic redundancy check)) may be performed by the error detection modules 113 and 115 in the respective eNB 103 and the UE 101. have. The HARQ mechanism allows the receiver (eg, UE 101) to indicate to the transmitter (eg, eNB 103) that a packet or sub-packet has been incorrectly received, and therefore to retransmit specific packet (s). Ask the transmitter.

According to one embodiment, downlink hybrid-ARQ acknowledgments in TDD are combined ACK / NACKs from one or several DL subframes into a single ACK / NACK report (by performing an AND operation of all A / Ns). Bundled ") and the physical uplink control channel (PUCCH) formats already defined for LTE may be transmitted as a single ACK / NACK feedback that is reused (PUCCH formats 1a / 1b). This ACK / NACK mode is referred to as "AN-bundling". For example, with regard to AN bundling for UL / DL configurations (except configuration 5), one implementation may include a downlink allocation index (DAI) field (eg, 2) added to DCI formats 1, 1A, 1B, and 2. Bit). For example, ACK or NACK feedback may be provided in scheduled DL subframes in which the DAI value of the previous assignment may be compared to the last assignment to determine any lost assignments.

In some embodiments, the downlink allocation index must be greater than or equal to the number of previously allocated subframes in the bundling window and less than or equal to the maximum number of dynamic allocations in the bundling window. UE 101 checks the CCE index in the number of subframes as well as the last received / detected dynamic DL allocation to (i) check for lost DL allocations and (ii) determine the UL ACK / NACK PUCCH index. It is available. Moreover, it is assumed that semi-persistent allocations are not counted in the downlink allocation index.

Although the DAI field is forced by, for example, two bits, it is recognized that there are up to nine DL subframes during one bundling window that can be dynamically scheduled. Therefore, 2-bits cannot fully cover 1-9 DL subframes per bundling window.

In order to better understand the bundling approach in certain embodiments, it is beneficial to describe the following three existing mechanisms: Options 1-3.

In option 1, the two DAI bits indicate whether the DL subframe is dynamically allocated within the bundling window that is not unique, first, last, or first and not last. The UE may assume that the subframes to be allocated are contiguous. The disadvantage of this option is that it forces only continuous time domain scheduling, which severely limits the flexibility of the packet scheduler in packet-oriented radio access systems. Therefore, performance decreases, and complexity increases. Moreover, this contradicts the manner approved for other UL / DL configurations.

In option 2, partial sub-frame bundling and ACK / NACK multiplexing schemes are used. Nine DL sub-frames (including DwPTS) are assigned to x (x> 1) bundling windows. For each bundling window, up to eight ACK / NACK bits can be bundled together regardless of whether it is a single codeword or not. The ACK / NACK multiplexing scheme is used to transmit multiple ACK / NACK bits corresponding to each bundling window. The disadvantage of this approach is that it is not a true AN-bundling scheme but a multi-bits scheme, which means that it does not provide an AN-bundling solution for the 9DL: 1UL configuration.

In option 3, the eNB may dynamically schedule up to four downlink subframes to the UE within the bundling window. Leaving downlink resources (if there are downlink resources) may be semi-persistent or covered by multi-cast allocation. MBSFN subframes can further reduce unicast downlink subframes within the bundling window. The disadvantage is that the scheduler cannot fully develop the performance gain from dynamic scheduling for all nine DL subframes. In addition, low efficiency and limited / none of resource utilization because resources can be pre-allocated for each user and only reassigned for every rather long time, such as a few seconds or even longer It is expected that performance degradation will occur with semi-permanent scheduling due to frequency selective gain.

As shown in FIG. 1B, the approach of the system 100 is to reuse, for example, the agreed 2-bits for other UL / DL configurations to the scheduler 117 full flexibility, such as in step 131. Allow for dynamically scheduling any one of nine DL subframes per bundling window. In addition, this mechanism from the perspective of the UE 101 should be simple to adapt. Moreover, interleaving is used to decorrelate the time-wise associations associated with the bundling mechanism (step 133). This process is, in one exemplary embodiment, performed by the eNB 103 in association with the UE 101 using the corresponding acknowledgment bundling logic 119, 121. Moreover, each of the acknowledgment bundling logic 119, 121 may utilize interleaver / deinterleaver 123, 125.

Two approaches: As shown in FIGS. 2A-2C and 3A and 3B, respectively, Method 1 and Method 2 are provided. In Method 1 (described in FIGS. 2A-2C), the number of scheduler DL subframes is represented by a 2-bit DAI and this value is updated for every scheduled subframe. In Method 2 (described in FIGS. 3A and 3B), the process uses (Ceil (counter / 2) + K) modulo 4, where K is a subframe in which the at least two subframes are in the bundling window. A boolean to indicate whether to be dynamically assigned to. In other words, if there are zero or one subframes to be dynamically allocated to the following subframes in the bundling window, K = 0; Otherwise, K = 1. The counter is the number of scheduler DL subframes and is updated every subframe.

According to some embodiments, these processes may incorporate an interleaving method that introduces time-way disassociation of consecutive PDCCHs received. When interleaving, the interleaver map will break the regular pattern of potential associated PDCCH errors.

2A-2C are flowcharts of a process for reusing a downlink allocation index (DAI) field, and correspond to diagrams of example downlink bundle windows, in accordance with various example embodiments. In this embodiment of Method 1 (as shown in FIG. 2A), a simple extension from the DAI definition may be implemented for other UL / DL configurations. In step 201, the process initializes the DAI field. Then, as in step 203, the number of scheduler downlink (DL) subframes is represented by a DAI field. The counter 'm' is utilized to count the number of scheduled DL subframes; And 'm' is updated in each subframe. That is, as in step 205, the DAI field is updated in all scheduled subframes.

Therefore, from the eNB side (as shown in FIG. 2B), in step 211, the DAI field is set according to m (modulo) x (where m and x are integers); For example, m MOD 4. From the UE side, the UE 101 receives, every step 213, prior to the last DL assignment received during the bundling window (ie, received last) to detect if some allocation (s) have been lost. The total received number of DL allocations will be compared with the value MOD 4 of the DAI at the last received DL allocation, and if the comparison is the same or not the same, then AN or DTX (data Send) will be sent. If the UE 101 receives at least two of the same (matching) DAI values during the same bundling window, the value of the last received DAI should be added with '4' (step 215).

2C shows an example of a DL bundle window 220, where bundle window # 1 specifies DAI values corresponding to subframes 1, 5, and 8. That is, three assignments are provided. Bundle window # 2 includes subframes 2-6, 7, and 9; That is, DAI values corresponding to seven assignments are provided.

The process provides a relatively simple method for accommodating other UL / DL configurations, according to some embodiments, and can be easily added on top of AN bundling for all other configurations (perspectives of standards and implementations). From). In addition, there are no restrictions on the scheduler 117.

It is noted that the DTX-> ACK problem can occur, for example, if the UE loses four consecutive DL assignments. Although the probability of such a case is actually very low, the eNB 103 is free to completely prevent this case of error if the eNB 103 foresee that such an error may occur and the performance loss is “unacceptable”. You can dynamically "fall-back" to the existing option-3 (as described above). In other words, this approach provides a "free & dynamic switch" between method-1 and option-3.

3A and 3B are a flowchart of a process for reusing a downlink allocation index (DAI) field and diagram of example allocations in a bundle window, respectively, according to various example embodiments. In this embodiment, the eNB 103 labels the DAI for each assignment as in step 301 as follows: (Ceil (n / 2) + K) modulo 4, where n is the bundling window Is the number of previously scheduled assignments in which K is the 0/1 subframe (K = 0) or at least two subframes (K) to be scheduled to the following subframes in the bundling window (as mentioned above). = 1) A Boolean value to indicate.

In step 303, UE 101 compares two values: sum_DAI_2 last_received assignments mod 4 and last_received assignment_number of previous assignments mod 4. If the two values are the same (as determined in step 305), the UE 101 will send an AN (step 307). If not, the UE 101 sends a DTX every step 309.

3B shows an example of various assignments 320 within a single bundle. In this example, nine downlink subframes may be provided in one bundle.

The process does not enforce constraints on the scheduler 117, in accordance with certain embodiments. In addition, there is no possibility of error or false error. It is noted that the eNB 103 must only “pre-estimate” the scheduling decision before at least two subframes. Therefore, compared to the existing Option-3, semi-permanent scheduling for five subframes actually indicates that the eNB 103 should “pre-estimate” a much longer scheduling decision than before two subframes. This is a less restrictive requirement, as it means.

As mentioned, the interleaving process can be used in conjunction with the processes of FIGS. 2A-2C and 3A and 3B. Specifically, the interleaving map provides disassociation of time-way associations. In one example, a block interleaver with five columns and two rows may be utilized (eg, for interleavers 123, 125). When inserting data into interleaver 125, the data is written row-by-row, while the output is read column-by-column. The first element of the interleaver matrix is filled with a "dummy" value to ensure maximum disconnection, the dummy value being ignored when reading from the matrix. This is because there are typically nine PDCCHs to be transmitted for this TDD configuration. Basically, using this interleaver map, the sequence is: {1,2,3,4,5,6,7,8,9} The sequence {5,1,6,2,7,3,8,4, 9}, it is confirmed that the distance between successive PDCCH "counters" will be 4 or 5 depending on the observation time. It is noted that introducing such an interleaver element yields a need to perform scheduling decisions before five subframes (the DAI signaling value of subframe 5 is required to be transmitted in subframe 1 due to the interleaver). do). Using time-based dissociation, the probability of false-positive will be lower. Using interleaving, there will be a need for pre-estimation up to five subframes, thereby requiring some scheduling previously (the exact value in subframe 5 requires signaling, and therefore subframes Decisions in 1-4 are also required).

In some embodiments, the processes described above may be performed within an evolved UTRAN (E-UTRAN) or UMTS terrestrial radio access network (UTRAN) in 3GPP, as described below.

4A-4D are diagrams of communication systems having exemplary long-term evolution (LTE) architectures in which the user equipment (UE) and the base station of FIG. 1A may operate, in accordance with various exemplary embodiments of the present invention. admit. By way of example (shown in FIG. 4A), a base station (e.g., an arrival node) and a user equipment (UE) (e.g., a source node), such as time division multiple access (TDMA), code division multiple access (CDMA), wideband code Communicate in system 400 using any connection scheme, such as Division Multiple Access (WCDMA), Orthogonal Frequency Division Multiple Access (OFDMA), or Single Carrier Frequency Division Multiple Access (FDMA) (SC-FDAM), or a combination thereof. Can be. In one exemplary embodiment, both uplink and downlink may utilize WCDMA. In another exemplary embodiment, the uplink utilizes SC-FDMA, while the downlink utilizes OFDMA.

Communication system 400 conforms to 3GPP LTE, the title of which is incorporated herein by reference “Long Term Evolution of 3GPP Radio Technology”. (As fully shown in FIG. 4A, one or more user equipments (UEs) may be part of an access network, such as WiMAX (worldwide interoperability for microwave connections), 3GPP LTE (or E-UTRAN), etc. Communicates with network equipment such as base station 103. Under 3GPP LTE architecture, base station 103 is represented as an enhanced Node B (eNB).

The MME (mobile management entity) / serving gateways 401 utilize an eNB 103 in a full or partial mesh configuration using tunneling across a packet transport network (eg, an Internet Protocol (IP) network) 403. Are connected to the Exemplary functions of the MME / serving GW 401 include distribution of paging messages to eNBs 103, termination of U-plane packets for paging reasons, and switching of U-plane to support UE mobility. Since the GWs 401 serve as a gateway to external networks, such as the Internet or private networks 403, the GWs 401 access to securely determine the identity and privileges of the user and track the activities of each user. , Authority and accounting system (AAA). That is, the MME Serving Gateway 401 is responsible for an idle mode UE that is an important control-node for the LTE access-network and tracks and pages procedures that include retransmissions. In addition, the MME 401 is responsible for selecting a SGW (Serving Gateway) for the UE at bearer activation / deactivation process and at inter-LTE handover including initial network attachment and core network (CN) node reallocation. Responsible.

A more detailed description of the LTE interface is provided in 3GPP TR 25.813, entitled “E-UTRA and E-UTRAN: Air Interface Protocol Aspects detaroprocni si hcihw”, which is hereby incorporated by reference in its entirety.

At 4b, communication system 402 supports GERAN (GSM / EDGE radio access) 404, UTRAN 406 based access networks, E-UTRAN 412 and non-3GPP (not shown) based access networks and And more fully described in TR 23.882, which is hereby incorporated by reference in its entirety. An important feature of such a system is that a network that performs control-plane functionality (MME 408) from a network entity that performs bearer-plane functionality (serving gateway 410) with a well-defined open interface between them (S11). The separation of entities. Since the E-UTRAN 412 not only enables new services but also provides higher bandwidths to improve existing services, the separation of the MME 408 from the serving gateway 410 causes the serving gateway 410 to be separated. Forces to be based on a platform optimized for signaling transactions. This approach not only allows the selection of more cost-effective platforms for each of these two elements, but also enables independent scaling of each of these two elements. Service providers may also select optimized topological locations of serving gateways 410 within the network independent of the locations of MMEs 408 to reduce optimized bandwidth latency and avoid concentrated failure points.

As shown in FIG. 4B, the E-UTRAN (eg, eNB) 412 interfaces with the UE 101 via LTE-Uu. E-UTRAN 412 includes functions for radio resource control (RRC) functionality that supports the LTE air interface and corresponds to control plane MME 408. E-UTRAN 412 includes radio resource management, admission control, scheduling, enhancement of negotiated uplink (UL) QoS (quality of service), broadcast cell information, user encryption / decryption, downlink and uplink user planes. It also performs various functions including compression / decompression of packet headers and Packet Data Convergence Protocol (PDCP).

As the key control node, the MME 408 is responsible for managing the paging procedure including the mobility and security parameters and retransmissions that the UE identifies. The MME 408 is involved in the bearer activation / deactivation process and is also responsible for selecting the serving gateway 410 for the UE 101. MME 408 functions include non-access stratum (NAS) signaling and associated security. The MME 408 forces the UE 101 to check the authorization of the UE 101 and roam the constraints to temporarily camp on the service provider's Public Land Mobile Network (PLMN). . The MME 408 also provides control plane functionality for mobility between 2G / 3G and LTE access networks with an S3 interface terminating at the MME 408 from the SGSN (Serving GPRS Support Node) 414.

SGSN 414 is responsible for the delivery of data packets to and from mobile stations in its geographic service area. The tasks of the SGSN 414 include packet routing and transmission, mobility management, logic link management, authentication and billing functions. The S6a interface enables the transfer of subscription and authentication data to authenticate / authorize user access to an evolved system (AAA interface) between the MME 408 and the HSS (Home Subscriber Server) 416. The S10 interface between the MME 408 provides MME reallocation and MME 408 with MME 408 information transfer. The serving gateway 410 is a node that terminates the interface towards the E-UTRAN 412 via S1-U.

The S1-U interface provides per-bearer user plane tunneling between the E-UTRAN 412 and the serving gateway 410. support for path switching during handover between eNBs 43. The S4 interface provides a user plane with association control and mobility support between the 3GPP anchor function of the serving gateway 410 and the SGSN 414.

S12 is the interface between the UTRAN 406 and the serving gateway 410. The packet data network (PDN) gateway 418 provides connectivity to the UE 101 with external packet data networks by providing points of entry and exit of traffic to the UE 101. PDN gateway 418 performs policy enforcement, packet filtering, billing support, legal interception and packet screening for each user. Another role of the PDN gateway 418 is to act as an anchor for mobility between 3GPP technologies and non-3GPP technologies such as WiMAX and 3GPP2 (CDMA 1X and Evolution Data Only (EvDO)). For sake.

The S7 interface provides for the transfer of QoS policy and billing roles from the PCRF (Policy and Charging Role Function) to the Policy and Billing Enforcement Function (PCEF) at the PDN Gateway 418. The SGi interface is the interface between the PDN gateway and the operator's IP services, including the packet data network 422. The packet data network 422 may be a public or private packet data network external to the operator or an intra operator packet data network for provision of, for example, IMS (IP Multimedia Subsystem) services. Rx + is the interface between the PCRF and the packet data network 422.

As shown in FIG. 4C, the eNB 43 may include E-UTRA (Evolved Universal Terrestrial Radio Access) (user plane, such as RLC (Radio Link Control) 415, MAC (Media Access Control) 417), and It utilizes a control plane (eg, RRC 421) as well as a PHY (physical) 419. The eNB 43 also includes the following functions: inter-cell RRM (Radio Resource Management) 423, access mobility control 425, radio bearer (RB) control 427, radio admission control 429, eNB measurement configuration and provisioning 4310, and dynamic resource allocation (scheduler) 433.

The eNB 43 communicates with an aGW 401 (access gateway) via the S1 interface. The aGW 401 includes a user plane 401a and a control plane 401b. Control plane 401b provides the following components: SAE (system architecture evolution) bearer control 435 and MM (mobile management) entity 437. User plane 401a includes PDCP (Packet Data Convergence Protocol) 439 and user plane functions 441. It is noted that the functionality of aGW 401 may also be provided by a combination of Serving Gateway (SGW) and Packet Data Network (PDN) GW. The aGW 401 may also be interfaced with a packet network, such as the Internet 443.

In an alternative embodiment, as shown in FIG. 4D, PDCP (Packet Data Convergence Protocol) functionality may be present at eNB 43 rather than GW 401. Apart from this PDCP capability, the eNB functions of FIG. 4C are also provided for this architecture.

In the system of FIG. 4D, a functional partition between E-UTRAN and EPC (Evolved Packet Core) is provided. In this example, the radio protocol architecture of the E-UTRAN is provided for the user plane and the control plane. A more detailed description of the architecture is provided in 3GPP TS 86.300.

The eNB 43 interfaces via the S1 to the serving gateway 445 that includes the mobility anchor function 447. In accordance with this architecture, the MME (Mobility Management Entity) 449 provides SAE (System Architecture Evolution) bearer control 451, idle mobility handling 453, and NAS (non-access layer) security 455. do.

 Those skilled in the art will appreciate that processes for acknowledgment bundling may include software, hardware (eg, general purpose processor, digital signal processing (DSP) chip, application specific integrated circuit (ASIC), field programmable gate arrays (FPGAs), etc.), firmware, or these. It will be appreciated that it can be implemented through the combination of. Such exemplary hardware for performing the functions is detailed below.

5 illustrates example hardware that may be implemented in various embodiments of the invention. Computing system 500 includes a bus 501 or other communication mechanism for communicating information, and a processor 503 coupled to bus 501 for processing information. Coupling system 500 may be coupled to a bus 501 for storing information and instructions to be executed by processor 503 such as main memory (such as random access memory (RAM) or other dynamic storage device). 505) also. Main memory 505 may also be used to store temporary variables or other intermediate information during execution of instructions by processor 503. Computing system 500 may further include read-only memory (ROM) 507 or another static storage device coupled to bus 501 for storing static information and instructions to processor 503. . For example, the storage device 509, such as a magnetic disk or an optical disk, is coupled to a bus 501 for permanently storing information and instructions.

Computing system 500 may be coupled to display 511, such as a liquid crystal display, or an active matrix display, for displaying information to a user via bus 501. For example, an input device 513, such as a keyboard that includes letter and number combinations and other keys, can be coupled to a bus 501 for communicating information and command selections to the processor 503. Input device 513 may include cursor control, such as a mouse, trackball, or cursor direction keys to convey direction information and command selections to processor 503 and to control cursor movement on display 511. have.

In accordance with various embodiments of the present invention, the processes described herein may be provided by computing system 500 in response to processor 503 executing an array of instructions contained in main memory 505. Such instructions may be read in main memory 505 from another computer-readable medium, such as storage device 509. Execution of the arrangement of instructions contained in main memory 505 causes processor 503 to perform the processes described herein. One or more processors in a multi-processing arrangement may also be used to execute instructions contained in main memory 505. In alternative embodiments, hard-wired circuitry may be used in combination with software instructions or in a batch of software instructions to implement an embodiment of the invention. In another example, reconfigurable hardware such as field programmable gate arrays (FPGAs) may be used, and the connection topology and functionality of its logic gates is customizable at run-time, typically memory Customizable by programming the lookup tables. Therefore, embodiments of the present invention are not limited to any particular combination of hardware circuitry and software.

Computing system 500 also includes at least one communication interface 515 coupled with bus 501. The communication interface 515 provides two-way data communication that couples to a network link (not shown). Communication interface 515 transmits and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information. Moreover, communication interface 515 may include peripheral interface devices such as a universal serial bus (USB) interface, a PCMCIA (Personal Computer Memory Card International Association) interface, and the like.

The processor 503 may execute the transmitted code while receiving and / or storing code in the storage device 509, or other non-volatile storage medium for later execution. In this way, computing system 500 may obtain application code in the form of a carrier wave.

As used herein, the term “computer-readable medium” refers to any medium that provides instructions to the processor 503 for execution. Such a medium may take many forms, including but not limited to, non-volatile media, volatile media, and transmission media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 509. Volatile media includes, for example, dynamic memory, such as main memory 505. The transmission medium includes coaxial cables, copper wire and fiber optics, including the wires comprising bus 501. The transmission medium may also take the form of acoustic, optical, or electromagnetic waves, such as those generated during radio frequency (RF) and infrared (IR) data communications. Common forms of computer-readable media include, for example, floppy disks, flexible disks, hard disks, magnetic tapes, any other magnetic media, CD-ROM, CDRW, DVD, any other optical media, punch Cards, paper tape, optical mark sheets, any other physical medium having patterns of other optically recognizable marks or holes, RAM, PROM, and EPROM, flash-EPROM, any other memory chip or cartridge, carrier wave, Or any other medium that can be read by a computer.

Various forms of computer-readable media include providing instructions to a processor for execution. For example, instructions for executing in at least part of the invention may be initially beared on a magnetic disk of a remote computer. In this scenario, the remote computer loads the instructions into main memory and sends the instructions over a telephone line using a modem. The modem of the local system receives the data on a telephone line and uses an infrared transmitter to convert the data into an infrared signal, which transmits the infrared signal to a portable computing device such as a personal digital assistant (PDA) or laptop. . An infrared detector on the portable computing device receives the information and instructions provided by the infrared signal and places the data on the bus. The bus transfers data to main memory, and the processor retrieves and executes instructions from main memory. Instructions received by the main memory may optionally be stored on the storage device before or after execution by the processor.

6 is a diagram of exemplary components of a user terminal configured to operate in the systems of FIGS. 4A-4D, in accordance with an embodiment of the invention. User terminal 600 includes an antenna system 601 (which may utilize multiple antennas) to receive and transmit signals. Antenna system 601 is coupled to a wireless circuit 603 that includes a number of transmitters 605 and receivers 607. Wireless circuitry encompasses not only base-band processing circuitry but also all radio frequency (RF) circuitry. As shown, layer-1 (L1) and layer-2 (L2) processing are provided by units 609 and 611, respectively. Optionally, layer-3 functions may be provided (not shown). Module 613 executes all media access control (MAC) layer functions. Timing and calibration module 615 maintains proper timing, for example by interfacing external timing references (not shown). In addition, a processor 617 is included. Under this scenario, user terminal 600 communicates with computing device 619, which may be a personal computer, workstation, personal digital assistant (PDA), web appliance, cellular phone, or the like.

Although the invention has been described in connection with a number of embodiments and implementations, the invention is not limited thereto, but covers various obvious changes and equivalent arrangements falling within the scope of the claims. )do. Although features of the invention are represented by specific combinations between the claims, it is contemplated that such features may be arranged in any combination and order.

Claims (20)

A method for providing acknowledgment bundling in a communication link between a base station and user equipment, the method being performed by the base station,
Dynamically reserving one or more of the subframes per bundling window by reusing the allocation index field,
The allocation index field has a value greater than or equal to the number of previously allocated subframes in the bundling window, the bundling window defining a group of subframes for a common acknowledgment,
A method for providing acknowledgment bundling in a communication link between a base station and user equipment. The method of claim 1,
Initializing the allocation index field;
Representing a plurality of subframes with the allocation index field; And
Updating the allocation index field for each all scheduled subframe
≪ / RTI >
A method for providing acknowledgment bundling in a communication link between a base station and user equipment. The method of claim 1,
labeling the allocation index field for a current allocation according to m modulo x, where m is the number of previously scheduled allocations within the bundling window and x is an integer; And
Interleaving the data of the subframes to provide decorrelation
≪ / RTI >
A method for providing acknowledgment bundling in a communication link between a base station and user equipment. The method of claim 3, wherein
The value modulo x of the allocation index field associated with the last received downlink assignment is compared with the modulo x of the total number of downlink assignments prior to the last received downlink assignment, and
If there are at least two matching allocation index field values in the bundling window, the value of the allocation index field associated with the last received downlink allocation is added by x, where x is an integer,
A method for providing acknowledgment bundling in a communication link between a base station and user equipment. 5. The method of claim 4,
(Ceil (n / 2) + K) further comprising labeling the allocation index field for the current allocation according to modulo x,
Where n is the number of previously scheduled allocations within the bundling window, x is an integer, and K is whether at least two subframes will be dynamically allocated in the subframes within the bundling window. A boolean value to display,
A method for providing acknowledgment bundling in a communication link between a base station and user equipment. The method of claim 5, wherein
The allocation index field is a downlink allocation index field, and x is equal to 4,
A method for providing acknowledgment bundling in a communication link between a base station and user equipment. The method of claim 5, wherein
The value of the allocation index field associated with the last received downlink assignment is compared with the total number of downlink assignments,
A method for providing acknowledgment bundling in a communication link between a base station and user equipment. The method of claim 7, wherein
A predetermined number of downlink allocations has been missed, and the dynamic scheduling is performed according to the maximum number of subframes associated with the bundling window.
A method for providing acknowledgment bundling in a communication link between a base station and user equipment. An apparatus for providing acknowledgment bundling in a communication link between a base station and user equipment, the apparatus comprising:
Logic configured to dynamically schedule one or more of the subframes per bundling window by reusing an allocation index field,
The allocation index field has a value greater than or equal to the number of previously allocated subframes in the bundling window, the bundling window defining a group of subframes for a common acknowledgment,
Apparatus for providing acknowledgment bundling over a communication link between a base station and user equipment. The method of claim 9,
The logic comprises:
Initialize the allocation index field,
Represent a plurality of subframes with the allocation index field; And
Update the allocation index field for each and every scheduled subframe
Lt; / RTI >
Apparatus for providing acknowledgment bundling over a communication link between a base station and user equipment. The method of claim 9,
The logic is further configured to label the allocation index field for a current assignment according to m modulo x, where m is the number of previously scheduled assignments within the bundling window and x is an integer;
The apparatus comprises:
Further comprising an interleaver configured to interleave the data of the subframes to provide uncorrelation;
Apparatus for providing acknowledgment bundling over a communication link between a base station and user equipment. The method of claim 11,
The value modulo x of the allocation index field associated with the last received downlink assignment is compared with the modulo x of the total number of downlink assignments prior to the last received downlink assignment, and
If there are at least two matching allocation index field values in the bundling window, the value of the allocation index field associated with the last received downlink allocation is added by x, where x is an integer,
Apparatus for providing acknowledgment bundling over a communication link between a base station and user equipment. 13. The method of claim 12,
The logic is further configured to label the allocation index field for the current allocation according to (Ceil (n / 2) + K) modulo x,
Where n is the number of previously scheduled allocations within the bundling window and x is an integer, and K is for indicating whether at least two subframes will be dynamically allocated in the subframes within the bundling window. Is a boolean value for
Apparatus for providing acknowledgment bundling over a communication link between a base station and user equipment. The method of claim 13,
The allocation index field is a downlink allocation index field, and x is equal to 4,
Apparatus for providing acknowledgment bundling over a communication link between a base station and user equipment. The method of claim 13,
The value of the allocation index field associated with the last received downlink assignment is compared with the total number of downlink assignments,
Apparatus for providing acknowledgment bundling over a communication link between a base station and user equipment. The method of claim 15,
A predetermined number of downlink allocations have been lost, and the dynamic scheduling is performed according to the maximum number of subframes associated with the bundling window.
Apparatus for providing acknowledgment bundling over a communication link between a base station and user equipment. A method for providing acknowledgment bundling in a communication link between a base station and a user equipment, the method being performed by the user equipment,
Determining a total number of resource grants; And
Determining whether one or more resource grants have been lost by comparing the value of the allocation index field of the received bundling window with the total number of resource grants.
Lt; / RTI >
The allocation index field is reused for dynamic scheduling of resources using a bundling window, the bundling window defining a group of subframes for a common acknowledgment,
A method for providing acknowledgment bundling in a communication link between a base station and user equipment. The method of claim 17,
Generating an acknowledgment message based on the comparison;
A method for providing acknowledgment bundling in a communication link between a base station and user equipment. An apparatus for providing acknowledgment bundling in a communication link between a base station and user equipment, the apparatus comprising:
Logic configured to determine the total number of resource grants and determine whether one or more resource grants have been lost by comparing the value of the allocation index field of the received bundling window with the total number of resource grants,
The allocation index field is reused for dynamic scheduling of resources using a bundling window, the bundling window defining a group of subframes for a common acknowledgment,
Apparatus for providing acknowledgment bundling over a communication link between a base station and user equipment. The method of claim 19,
The logic is further configured to generate an acknowledgment message based on the comparison,
Apparatus for providing acknowledgment bundling over a communication link between a base station and user equipment.

Images