HK1137595B - Mapping uplink acknowledgement transmission based on downlink virtual resource blocks - Google Patents
Mapping uplink acknowledgement transmission based on downlink virtual resource blocks Download PDFInfo
- Publication number
- HK1137595B HK1137595B HK10105256.6A HK10105256A HK1137595B HK 1137595 B HK1137595 B HK 1137595B HK 10105256 A HK10105256 A HK 10105256A HK 1137595 B HK1137595 B HK 1137595B
- Authority
- HK
- Hong Kong
- Prior art keywords
- ack
- uplink
- pdcch
- scheduling
- acknowledgement
- Prior art date
Links
Description
Priority requirements according to 35U.S.C. § 119
This patent application claims priority from provisional application No. 60/886,889 entitled "Reduced ACKOverhead for organic Systems" filed on 26.1.2007, and provisional application No. 60/888,233 entitled "Mapping of UL ACK Transmission Based uplink DLVRBS" filed on 5.2.2007. Both of these applications are assigned to the assignee of the present invention. All of which are expressly incorporated herein by reference in their entirety.
Technical Field
Exemplary, non-limiting aspects described herein relate to wireless communication systems, methods, computer program products, and apparatuses. And more particularly, to techniques for achieving uplink frequency, time, and code synchronization for user equipment.
Background
Wireless communication systems are widely deployed to provide various types of communication content such as voice, data, and so on. These systems may be multiple-access systems capable of supporting communication with multiple users by sharing the available system resources (e.g., bandwidth and transmit power). Examples of such multiple-access systems include Code Division Multiple Access (CDMA) systems, Time Division Multiple Access (TDMA) systems, Frequency Division Multiple Access (FDMA) systems, and Orthogonal Frequency Division Multiple Access (OFDMA) systems.
Generally, a wireless multiple-access communication system is capable of supporting communication for multiple wireless terminals simultaneously. Each terminal communicates with one or more base stations via transmissions on the forward and reverse links. The forward link (or downlink) refers to the communication link from the base stations to the terminals, and the reverse link (or uplink) refers to the communication link from the terminals to the base stations. This communication link may be established by a single-in single-out, multiple-in single-out, or multiple-in multiple-out (MIMO) system.
Universal Mobile Telecommunications System (UMTS) is one of the third generation (3G) cellular telephone technologies. UTRAN is an abbreviation of UMTS terrestrial radio access network and is a collective term for node bs and radio network controllers constituting the UMTS radio access network. This communication network is capable of carrying many types of communication traffic, from real-time circuit-switched to IP-based packet-switched. The UTRAN supports a connection between a UE (user equipment) and a core network. The UTRAN contains base stations, referred to as node bs, and Radio Network Controllers (RNCs). The RNC provides control functions for one or more node bs. The node B and RNC may be the same device, although in a typical implementation the RNC is located separately at a central office, serving multiple node bs. Although they are not necessarily physically separate, there is a logical interface between them called Iub. The RNC and its corresponding node bs are referred to as Radio Network Subsystems (RNS). There is more than one RNS present in the UTRAN.
The 3GPP LTE (long term evolution) is the name given to a program within the third generation partnership project (3 GPP) to improve the UMTS mobile phone standard to meet future requirements. Its objectives include increased efficiency, reduced cost, improved service, utilization of new spectrum opportunities, and better integration with other open standards. The LTE project is not a standard, but it may lead to a new evolved version 8 of the UMTS standard, largely or wholly including extensions and improvements to the UMTS system.
In most orthogonal systems for automatic repeat request (ARQ), an Uplink (UL) Acknowledgement (ACK) is implicitly mapped on corresponding time, frequency, code resources based on the position of the Downlink (DL) packet in time, frequency, code. Such a one-to-one mapping is typically associated with each minimum allocation of Virtual Resource Blocks (VRBs), where each group contains multiple VRBs. This means that for each packet, the User Equipment (UE) has several ACK instances available for transmission (reserved resources), one for each VRB contained in this packet. This can result in significant overhead, especially if the packets span multiple VRBs. For example, each DL VRB is pre-assigned one cyclic shift in the UL Physical Resource Block (PRB). Considering six ACKs per UL PRB, the overhead on DL can reach 16.66%.
It has been suggested that one cyclic shift and resource block combination may be implicitly mapped according to the Physical Downlink Control Channel (PDCCH). Thus, the UL overhead will depend on the number of DL assignments. Assuming (5, 10, 20) MHz (4, 8, 16) DL PDCCHs, this would be 16.66% for 1.25MHz and 4% for larger bandwidths. However, this approach means that each packet must be scheduled, shifting the overhead from UL to DL. For uncontrolled operation, this method is not suitable. Each voice over IP (VoIP) packet will be scheduled by the PDCCH in a unicast fashion. If the PDCCH is used for multiple users through a VoIP bitmap (i.e., a group PDCCH), this method will not work properly. For persistent assignments, this approach does not work, at least not without cumbersome improvements.
Disclosure of Invention
The following presents a simplified summary of the disclosure in order to facilitate an understanding of some of the various aspects disclosed. This summary is not an extensive overview, is not intended to identify key or critical elements or to delineate the scope of such aspects. Its purpose is to present some concepts of the features described herein in a simplified form as a prelude to the more detailed description that is presented later.
In accordance with one or more aspects and corresponding disclosure thereof, various aspects are described in connection with mapping Downlink (DL) allocations to Uplink (UL) Acknowledgement (ACK) locations. In particular, this approach can reduce overhead while being applicable to situations where certain user equipment (i.e., access terminals) are persistently scheduled in a packet-switched system, while other user equipment are dynamically scheduled.
In one aspect, a method of mapping a User Equipment (UE) Uplink (UL) Acknowledgement (ACK) location based on a Downlink (DL) resource allocation in a wireless data packet communication system is provided. This UE is dynamically scheduled by a resource allocation of at least one DL Virtual Resource Block (VRB). In response, a UL ACK Identifier (ID) implicitly mapped to the corresponding cyclically shifted sequence is received for the dynamically scheduled UE.
In another aspect, at least one processor configured to map a User Equipment (UE) Uplink (UL) Acknowledgement (ACK) location based on a Downlink (DL) resource allocation in a wireless data packet communication system. A first module dynamically schedules a UE through resource allocation of at least one DL Virtual Resource Block (VRB). A second module receives a UL ACK Identifier (ID) implicitly mapped to a corresponding cyclically shifted sequence for a dynamically scheduled UE.
In another aspect, a computer program product, comprising a computer-readable medium, maps a User Equipment (UE) Uplink (UL) Acknowledgement (ACK) location based on a Downlink (DL) resource allocation in a wireless data packet communication system. A first set of codes causes a computer to dynamically schedule a UE with a resource allocation of at least one DL Virtual Resource Block (VRB). The second set of codes causes the computer to receive a UL ACK Identifier (ID) for the dynamically scheduled UE that is implicitly mapped to a corresponding cyclically shifted sequence.
In another aspect, an apparatus maps a User Equipment (UE) Uplink (UL) Acknowledgement (ACK) location based on a Downlink (DL) resource allocation in a wireless data packet communication system. The scheduling module dynamically schedules the UE through resource allocation of at least one DL Virtual Resource Block (VRB). The receiving module receives a ul ack Identifier (ID) implicitly mapped to a corresponding cyclically shifted sequence for a dynamically scheduled UE.
In another aspect, an apparatus maps a User Equipment (UE) Uplink (UL) Acknowledgement (ACK) location based on a Downlink (DL) resource allocation in a wireless data packet communication system. The scheduling component dynamically schedules the UE through resource allocation of at least one DL Virtual Resource Block (VRB). A receiving component receives a ul ack Identifier (ID) implicitly mapped to a corresponding cyclically shifted sequence for a dynamically scheduled UE.
In another aspect, a method of a User Equipment (UE) interpreting a mapping of Uplink (UL) Acknowledgement (ACK) positions based on a Downlink (DL) resource allocation from an access node in a wireless data packet communication system. The user equipment receives dynamic scheduling through resource allocation of at least one DL Virtual Resource Block (VRB) from the access node. In response, the dynamically scheduled UE transmits a UL ACK Identifier (ID) that is implicitly mapped to the corresponding cyclically shifted sequence.
In another aspect, at least one processor in a wireless data packet communication system for a User Equipment (UE) to interpret a mapping of Uplink (UL) Acknowledgement (ACK) locations based on a Downlink (DL) resource allocation from an access node. A first module receives dynamic scheduling with resource allocation of at least one DL Virtual Resource Block (VRB) from an access node. A second module transmits a UL ACK Identifier (ID) implicitly mapped to a corresponding cyclically shifted sequence for a dynamically scheduled UE.
In another aspect, a computer program product for a User Equipment (UE) to interpret a mapping of Uplink (UL) Acknowledgement (ACK) locations based on a Downlink (DL) resource allocation from an access node in a wireless data packet communication system includes a computer-readable medium. A first set of codes causes a computer to receive dynamic scheduling of a UE through resource allocation of at least one DL Virtual Resource Block (VRB) from an access node. The second set of codes causes the computer to transmit a UL ACK Identifier (ID) for the dynamically scheduled UE that is implicitly mapped to a corresponding cyclically shifted sequence.
In another aspect, an apparatus for a User Equipment (UE) to interpret a mapping of Uplink (UL) Acknowledgement (ACK) locations based on a Downlink (DL) resource allocation from an access node in a wireless data packet communication system. The receiving module receives dynamic scheduling through resource allocation of at least one DL Virtual Resource Block (VRB) from an access node. The transmitting module transmits a UL ACK Identifier (ID) implicitly mapped to a corresponding cyclically shifted sequence for a dynamically scheduled UE.
In another aspect, an apparatus for a User Equipment (UE) to interpret a mapping of Uplink (UL) Acknowledgement (ACK) locations based on a Downlink (DL) resource allocation from an access node in a wireless data packet communication system. The mapping component receives the dynamic scheduling with resource allocation of at least one DL Virtual Resource Block (VRB) from the access node. The transmitting component sends a UL ACK Identifier (ID) implicitly mapped to a corresponding cyclically shifted sequence for a dynamically scheduled UE.
For the purposes of the foregoing and related ends, one or more aspects include the features hereinafter described in detail and particularly pointed out in the claims. The following description and the annexed drawings set forth in detail certain illustrative aspects and are indicative of but a part of the various ways in which the principles of various aspects of the invention may be employed. Other advantages and novel features may become apparent from the following detailed description when considered in conjunction with the drawings. The scope of the disclosure includes all such aspects and their equivalents.
Drawings
The features, nature, and advantages of the present invention will become more apparent from the detailed description set forth below when taken in conjunction with the drawings. In the drawings, like reference numerals designate corresponding parts throughout the several views. Wherein:
FIG. 1 is a block diagram of a communication system that employs reduced overhead for mapping Downlink (DL) resource allocations to Uplink (UL) Acknowledgement (ACK) locations for dynamically and persistently scheduled User Equipments (UEs);
FIG. 2 is a flow diagram of a method for implicit mapping for dynamically scheduled UEs based on DL Virtual Resource Blocks (VRBs);
fig. 3 is a flow diagram of a method of implicitly mapping a ul ack ID for dynamically scheduled UEs and explicitly mapping for persistently scheduled UEs;
FIG. 4 is a block diagram of an access node having means for dynamic and persistent scheduling of access terminals to implicitly and explicitly map corresponding UL ACK ID responses;
fig. 5 is a block diagram of an access terminal having means to receive dynamic and persistent scheduling from an access node and respond by implicitly or explicitly mapping a corresponding UL ACK ID response;
FIG. 6 is a block diagram of a communication system incorporating a legacy General Packet Radio Service (GPRS) core and an evolved packet core supporting reduced overhead for UL ACK ID mapping;
FIG. 7 is a block diagram of a multiple access wireless communication system in one aspect of UL ACK ID mapping; and
fig. 8 is a functional block diagram of a communication system that supports UL ACK ID mapping.
Detailed Description
An Acknowledgement (ACK) mapping automation can reduce overhead for a wireless communication system by providing a mapping of Uplink (UL) locations (i.e., modulation locations in time, frequency, and code) based on Downlink (DL) allocations. Such as UTRAN-LTE, global system for Mobile communications (GSM: initially from group specific Mobile), High Speed Downlink Packet Access (HSDPA) or any packet switched system. The various aspects utilize selected combinations of implicit and explicit mappings for dynamic and persistent scheduling of User Equipment (UE).
Various aspects are now described with reference to the drawings. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of one or more aspects. It may be evident, however, that such aspect(s) may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing these aspects.
As used in this application, the terms "component," "module," "system," and the like are intended to refer to a computer-related entity, either hardware, a combination of hardware and software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a server and the server can be a component. One or more components can reside within a process and/or thread of execution and a component can be localized on one computer and/or distributed between two or more computers.
The term "exemplary" is used herein to mean serving as an example, instance, or illustration. Any aspect or design described herein as "exemplary" is not necessarily to be construed as preferred or advantageous over other aspects or designs.
Furthermore, one or more versions herein may be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering methods to produce software, firmware, hardware, or any combination thereof to control a computer to implement various aspects disclosed herein. As used herein, the term "article of manufacture" (or alternatively, hereinafter, "computer program product") is intended to encompass a computer program accessible from a computer-readable device, carrier, or media. For example, computer-readable media include, but are not limited to, magnetic storage devices (e.g., hard disk, floppy disk, magnetic strips … …), optical disks (e.g., Compact Disk (CD), Digital Versatile Disk (DVD) … …), smart cards, and flash memory devices (e.g., card, stick). Additionally, it should be further appreciated that a carrier wave can be employed to carry computer-readable electronic data such as those used in transmitting and receiving electronic mail or in accessing a network such as the Internet or a Local Area Network (LAN). Of course, those skilled in the art will recognize many modifications may be made to these configurations without departing from the scope disclosed herein.
Various aspects will be presented in terms of systems that may include a number of components, modules, and the like. It is to be understood that the various systems herein may include additional components, modules, etc. and/or may not include all of the components, modules etc. discussed in connection with the figures. Combinations of these approaches may also be used. Various aspects disclosed herein may be implemented on electronic devices, including devices using touch screen display technology and/or mouse-keyboard type interfaces. Examples of such devices include computers (desktop and mobile), smart phones, Personal Digital Assistants (PDAs), and other wired and wireless electronic devices.
Referring initially to fig. 1, in one aspect, a communication system 10 includes an evolved Universal Mobile Telecommunications System (UMTS) terrestrial radio access network (E-UTRAN) 12 that incorporates an ACK mapping automation 14 between at least one radio access network, depicted as an evolved base node (eNode B) 16, and a User Equipment (UE) device 18. In the illustrated version, the UE device 18 is dynamically scheduled for communication on the Uplink (UL) 22 by the Downlink (DL) 20. eNode B16 also communicates with UE devices 24 that are being persistently scheduled. The E-UTRAN12 also includes eNode B26, 28.
The eNode bs 16, 26, 28 provide a UMTS terrestrial radio access (E-UTRA) user plane and control plane (RRC) protocol termination towards the user equipment 18, 24. This user plane may include 3GPP (third generation partnership project) Packet Data Convergence Protocol (PDCP), Radio Link Control (RLC), Medium Access Control (MAC), and physical layer control (PHY). The eNode bs 16, 26, 28 are interconnected by an X2 interface (X2). The eNode bs 16, 26, 28 are also connected to the EPC (evolved packet core) through an S1 interface (S1). More specifically, they are connected to mobility management entities/serving gateways (MME/S-GW) 30, 32 connected to a data packet network 34. The S1 interface supports a many-to-many relationship between MME/S-GW30, 32 and eNode B16, 26, 28.
eNode bs 16, 26, 28 implement the following functions: radio resource management: radio bearer control, radio admission control, connection mobility control, dynamic allocation (scheduling) of resources to user equipment in uplink and downlink; IP header compression and encryption of user data streams; selection of an MME at a user equipment; routing of user plane data towards a serving gateway; scheduling and transmission of paging messages (originating from the MME); scheduling and transmission of broadcast information; and mobility and scheduled measurements and measurement reporting configurations.
The MME realizes the following functions: distribution of paging messages to eNode bs 16, 26, 28; safety control; idle state mobility control; system Architecture Evolution (SAE) bearer control; ciphering and integrity protection of Non-Access Stratum (NAS) signaling. The service gateway implements the following functions: termination of U-plane packets for paging reasons and handover of the U-plane for supporting mobility of user equipment.
The downlink 20 from eNode B16 includes a number of communication channels related to download allocations that should be mapped to uplink locations for ACKs discussed below, including a Physical Downlink Shared Channel (PDSCH) 38, a Physical Downlink Control Channel (PDCCH) 40, Virtual Resource Blocks (VRBs) 42, and a physical broadcast channel (P-BCH) 44.
Three different types of Physical (PHY) channels are defined for the LTE downlink 20. A common feature of physical channels is that they all carry information from higher layers in the LTE stack. This is in contrast to physical signals, which convey information only for the interior of the physical layer.
The LTE DL physical channels are a Physical Downlink Shared Channel (PDSCH) 38, a Physical Downlink Control Channel (PDCCH) 40, and a Common Control Physical Channel (CCPCH) (not shown). The physical channels 38, 40 map to transport channels, which are Service Access Points (SAPs) of the L2/L3 layer. Each physical channel has defined algorithms for bit scrambling, modulation, layer mapping, Cyclic Delay Diversity (CDD) precoding, resource element assignment; both layer mapping and precoding are relevant for MIMO applications. The layers correspond to spatially multiplexed channels.
The Broadcast Channel (BCH) 44 has a fixed format and is broadcast throughout the coverage area of the cell. The downlink shared channel (DL-SCH) supports hybrid arq (harq), supports dynamic link adaptation by varying modulation, coding and transmit power, is suitable for transmission throughout the cell coverage area, is suitable for use with beamforming, supports dynamic and semi-static resource allocation, and supports Discontinuous Reception (DRX) for power saving. The Paging Channel (PCH) supports user equipment DRX, requires broadcasting throughout the cell coverage area, and is mapped to dynamically allocated physical resources. A Multicast Channel (MCH) is needed to broadcast throughout the cell coverage area, which supports multicast/broadcast-single frequency network (MB-SFN) and semi-static resource allocation. The supported transport channels are the Broadcast Channel (BCH), the Paging Channel (PCH), the downlink shared channel (DL-SCH) and the Multicast Channel (MCH). The transport channel provides the following functions: structure for exchanging data with higher layers, higher layers can be configured with mechanisms for PHY status indicators (packet errors, CQI, etc.) for higher layers and support higher layer peer-to-peer signaling. The transport channels are mapped to the physical channels as follows: the BCH is mapped to the CCPCH, although mapping to the PDSCH is also contemplated. The PCH and DL-SCH are mapped to the PDSCH. MCH may be mapped to PDSCH.
The resource allocation indicated on the downlink 20 is mapped to the uplink 22, which is depicted as a certain UL ACK ID46 of the available cyclic shift 48. In this exemplary implementation, using 6 of the 12 frequency resources and 3 time resources, 18 UL ACK IDs 46 are provided. In this exemplary implementation, a Zadoff-chu (zc) sequence is employed, although it will be appreciated that other sequences can be employed with the present disclosure.
In the process of selecting a multiple access method for ACK in an orthogonal ARQ system, firstly, a ZC sequence with the natural length of N and the base sequence parameter of lambda is considered:
wherein (λ, N) =1
We define the following cyclic shift sequences:
xλ(k,a)=xλ((k+a)modN) 0≤a≤N-1
the input signal from each user equipment to the IFFT is:
yi(n,k)=s(n)·xλ(k,ai(n))
wherein: n = LFDM symbol index;
k = tone index;
ai(n) = time varying cyclic shift of user i;
s (n) = confirming a modulation symbol.
Thus, for each Localized Frequency Division Multiplexing (LFDM) symbol index, user i modulates a different cyclic shift of the base ZC sequence. Such a ZC sequence hopping scheme ensures that adjacent cell interference is randomized on the control channel.
With the benefit of this disclosure, it should be appreciated that there are several ways to map the uplink acknowledgement ID to the downlink assignment.
(1) Implicit mapping from DL VRBs. In this structure, there is an implicit one-to-one mapping from the downlink virtual resource block index (i.e., downlink assignment) to the uplink acknowledgement position in a frequency and time varying cyclic shift. Consider an illustrative example in which m cyclic shifts of a ZC sequence are defined in terms of uplink Resource Blocks (RBs).
i=b·m+k
k={0,1,...,m-1}
i = DL VRB index
={0,1,...,NVRB-1}
b = UL ACK RB index
={0,1,...,(NVRB/m)-1}
Then, we define:
DL VRB index iUL ACK RB index b (FDM)
Cyclically shift a on LFDM symbol index n (CDM)i(n)
ai(n)=yj((i+n)modm)
j = cell index
yj(n) = cell-specific hopping pattern
If more than one virtual resource block is allocated to the user equipment, the user equipment uses an ACK ID corresponding to the first virtual resource block index. This can scale the ACK overhead appropriately if the minimum allocation in the system is more than 1 virtual resource block.
Thus, the general structure is:
Nmin= minimum allocation
b={0,1,...,(NVRB/(Nmin·m))-1}
DL VRB index iUL ACK RB index b (FDM)
Cyclically shift a on LFDM symbol index n (CDM)i(n)
The minimum allocation is accounted for by the network and applies to all user equipments. By increasing or decreasing the minimum allocation, the network is able to control the uplink acknowledgement overhead.
(2) Implicit mapping from DL PDCCH. In this structure, there is an implicit one-to-one mapping from downlink PDCCH indices to uplink acknowledgment positions in frequency and time varying cyclic shifts. This structure attempts to minimize UL ACK overhead, but increases DL PDCCH overhead because it is theoretically necessary to schedule each packet. Furthermore, when these scheduling modes are proposed for real-time services, there are some serious drawbacks: (a) and (3) continuous scheduling: with persistent scheduling or scheduling without PDCCH, the UL ACK position is undefined; and (b) grouped PDCCH: if the DL PDCCH is used for a group of user equipments, the UL ACKs are no longer orthogonal.
(3) Implicit mapping from DL VRBs and DL PDCCHs is a hybrid mode of implicit mapping operation with semi-static partitioning of UL ACK resources. Resource a is used for grouped PDCCHs or no PDCCH is allocated (i.e., persistent scheduling). In addition, the UL ACK ID is a implicit function of the DL VRB ID, as discussed above in (1). Resource B is used for the allocated unicast PDCCH (i.e. dynamic scheduling). The UL ACK ID is a implicit function of DL PDCCH ID, as also discussed in (2) above. Because of the semi-static partitioning of resources, this approach does not fully address these issues, especially in a hybrid service scenario.
(4) The explicit mapping from the DL PDSCH is transmitted in-band with the DL PDSCH in the UL ACK position. The UL ACK ID needs 3-7 bits, which depends on the system bandwidth. Thus, the signaling overhead is small. This structure implies that OOK signaling should be used on UL ACKs. Specifically, ACK is mapped to +1 and NAK to 0. This configuration provides full flexibility. However, it does not support the eNode B to distinguish between PDCCH errors and PDSCH errors. In this case, it is more suitable for PDCCH-less operation or persistent scheduling.
(5) Explicit and implicit mapping from DL PDSCH and PDCCH is a hybrid mode with explicit and implicit operation of dynamic partitioning of UL ACK resources. Resource a is used for grouped PDCCHs and no PDCCH is allocated (i.e., persistent scheduling). The UL ACK ID is explicitly notified in the DL PDSCH, as discussed in (4) above. Resource B is used for the allocated unicast PDCCH (i.e. dynamic scheduling). The UL ACK ID is a implicit function of DL PDCCH ID, as discussed above in (2).
In fig. 2, one method 100 for mapping DL allocations to UL locations implicitly maps from a first DL VRB index to a UL ACK location (index) in a cyclic shift that varies in frequency and time in blocks (block 102). If more than one resource block is allocated, the eNode B can reassign these resources, e.g., by explicit scheduling to persistently scheduled user equipment if the communication system supports such multiple communication types. The user equipment may then transmit the assigned time-varying set of cyclically shifted ZC sequences in a Transmission Time Interval (TTI) (block 104). The UL ACKID is multiplexed with the user equipment under a hybrid Frequency Division Multiplexing (FDM) -Code Division Multiplexing (CDM) structure (block 106). The ZC sequence is modulated according to the ACK modulation symbols (block 108).
With the benefit of this disclosure, it should be appreciated that implicit mapping from a DL VRB is the simplest structure. ACK overhead reduction is achieved by appropriately signaling the minimum allocation. Mixed explicit and implicit operations are the most flexible, supporting dynamic reuse of ACK resources.
Implicit mapping based on DL VRBs and having a UL throughput difference between hybrid explicit and implicit operation in a hybrid service scenario (i.e., UL ACK resource reuse) has certain advantages that are desirable in certain situations.
In summary, an implicit mapping between DL VRB assignments and UL ACK IDs may serve as a desirable baseline in exemplary implementations. Multiple access between different ACKs may be achieved with a hybrid frequency division multiplexing and code division multiplexing structure for UE multiplexing. Each UE is assigned a set of cyclically shifted ZC sequences that change over time within a TTI and are equivalent to ZC sequence hopping. The time variation of these ZC sequences is modulated by ACK modulation symbols.
In fig. 3, a method 120 of mapping UL ACK IDs based on a scheduling mode of an access node. If it is determined that persistent scheduling is to be performed that is neither a PDCCH allocation nor an allocation belonging to a grouped PDCCH (block 122), mapping of the ul ack ID is explicitly performed in-band within the DL PDSCH using on-critical control (block 124). Because there are other access nodes/communication paths in this sector or cell, the access terminal may request that a non-sequential portion of the ZC sequence be available for cyclic shift in order to improve orthogonality (block 126). If the determination in block 122 is negative, dynamic scheduling (i.e., unicast PDCCH allocation) is performed (block 128), and the mapping is implicitly done for the UL ACK IDs based on the resource allocation made by the PDCCH (block 130).
In fig. 4, in another aspect, by having a module 152 for dynamic scheduling over virtual resource blocks, the access node 150 can reduce the overhead involved in determining the location of UL ACKID in response to DL resource allocation. Module 154 supports unicast scheduling on physical downlink control channels. Module 156 supports persistent scheduling over a physical downlink shared channel. Module 158 supports receiving the multiplexed UL ACK ID. Module 160 supports a cyclically shifted ZC sequence with reservation requests for enhanced cell/sector orthogonality. Module 162 supports access terminal reception of on-off keying in response to in-band coded persistent scheduling.
In fig. 5, in another aspect, by having a module 172 for receiving dynamic scheduling over virtual resource blocks, an access terminal 170 can participate in reducing the overhead involved in mapping UL ACK IDs in response to DL resource allocations. Module 174 supports receiving unicast scheduling over PDCCH. Module 176 supports receiving persistent scheduling over PDSCH. Module 178 supports sending UL ACKID per mapping. Module 180 supports requesting a cyclic shift of a ZC sequence for enhanced cell/sector orthogonality. Module 182 supports transmitting on-off keying by an access terminal in response to persistent scheduling with inband decoding.
In fig. 6, in another aspect, a communication system 200 capable of incorporating the communication system 10 of fig. 1 supports interfacing an evolved packet core 202 with a legacy GPRS core 204 via interface S4, and a Serving GPRS Support Node (SGSN) 206 of the legacy GPRS core 204 interfaces with a global system for mobile communications (GSM)/EDGE radio access network (GERAN) 208 via a Gb interface and with a UTRAN210 via an lu interface. S4 provides the user plane with relevant control and mobility support between the GPRS core 204 and the 3GPP Anchor 212 of the Inter Access Stratum Anchor (IASA) 214, and is based on the Gn reference point defined between the SGSN206 and the gateway GPRS service/support node (GGSN) (not shown). The IASA214 also includes a System Architecture Evolved (SAE) anchor 216 interfacing with the 3GPP anchor 212 over an S5b interface, the S5b providing the user plane with related control and mobility support. The 3GPP anchor 212 communicates with the MME UPE218 via interface S5 a. The Mobility Management Entity (MME) belongs to the distribution of paging messages to the eNodeB, the User Plane Entity (UPE) belongs to the IP header compression and encryption of user data flows, the termination of U-plane packets for paging reasons, and the handover of the U-plane to support UE mobility. The MME UPE218 communicates with the evolved RAN220 over interface S1 for wireless communication with the UE device 222.
An S2b interface provides the user plane with related control and mobility support between the SAE anchor 216 and an evolved packet data gateway (ePDG) 224 of a Wireless Local Area Network (WLAN) 3GPP IP access component 226, wherein the WLAN3GPP IP access component 226 further includes a WLAN access Network (NW) 228. The SGi interface is the reference point between inter-AS anchor 216 and packet data network 230. Packet data network 230 may be an operator external public or private packet data network or an intra-operator packet data network, e.g. for providing IP Multimedia Subsystem (IMS) services. This SGi reference point corresponds to Gi and Wi functions and supports any 3GPP and non-3 GPP access systems. The Rx + interface supports communication between the packet data network 230 and a Policy and Charging Rules Function (PCRF) 232, which communicates with the evolved packet core 202 over the S7 interface. The S7 interface supports the transport of (QoS) Policy and Charging rules from PCRF232 to Policy and Charging Enforcement Point (PCEP) (not shown). By interfacing the evolved packet core 202 with the Home Subscriber Service (HSS) 234, the S6 interface (i.e., AAA interface) conveys subscription and authentication data for authenticating/authorizing user access. The S2a interface provides the user plane with related control and mobility support between the trusted non-3 GPP IP access 236 and the SAE anchor 216.
It should be appreciated that wireless communication systems are widely deployed to provide various types of communication content such as voice, data, and so on. These systems may be multiple-access systems capable of supporting communication with multiple users by sharing the available system resources (e.g., bandwidth and transmit power). Examples of such multiple-access systems include Code Division Multiple Access (CDMA) systems, Time Division Multiple Access (TDMA) systems, Frequency Division Multiple Access (FDMA) systems, 3GPP LTE systems, and Orthogonal Frequency Division Multiple Access (OFDMA) systems.
Generally, a wireless multiple-access communication system is capable of supporting communication for multiple wireless terminals simultaneously. Each terminal communicates with one or more base stations via transmissions on the forward and reverse links. The forward link (or downlink) refers to the communication link from the base stations to the terminals, and the reverse link (or uplink) refers to the communication link from the terminals to the base stations. This communication link may be established by a single-in single-out, multiple-in single-out, or multiple-in multiple-out (MIMO) system.
MIMO systems employing multiple (N)T) A transmitting antenna and a plurality of (N)R) And a receiving antenna for data transmission. Can be substituted by NTA transmitting antenna and NRThe MIMO channel formed by the multiple receive antennas is decomposed into N, also called spatial channelsSA separate channel of which NS≤min{NT,NR}。NSEach of the individual channels corresponds to a dimension. MIMO systems can improve performance (e.g., higher throughput and/or higher reliability) if the additional dimensionalities created by the multiple transmit and receive antennas are utilized.
MIMO systems support Time Division Duplex (TDD) and Frequency Division Duplex (FDD) systems. In a TDD system, the forward and reverse link transmissions are in the same frequency range, so the reciprocity principle can be used to estimate the forward link channel from the reverse link channel. This enables the access point to obtain transmit beamforming gain on the forward link when multiple antennas are available at the access point.
Referring to fig. 7, a multiple access wireless communication system in one aspect is illustrated. An access point 300 (AP) includes multiple sets of antennas, one set including 304 and 306, another set including 308 and 310, and an additional set including 312 and 314. In fig. 7, only two antennas are shown for each group of antennas, but there may be more or fewer antennas for each group of antennas. Access terminal 316 is in communication with antennas 312 and 314, where antennas 312 and 314 transmit information to access terminal 316 over forward link 320 and receive information from access terminal 316 over reverse link 318. Access terminal 322 is in communication with antennas 306 and 308, where antennas 306 and 308 transmit information to access terminal 322 over forward link 326 and receive information from access terminal 322 over reverse link 324. In a FDD system, communication links 318, 320, 324 and 326 may use different frequency for communication. For example, forward link 320 may use a different frequency than that used by reverse link 318.
Each group of antennas and/or the area in which they are designed to communicate is often referred to as a sector of the access point. In this aspect, each set of antennas is designed to communicate to access terminals in a sector, of the areas covered by access point 300.
In communication over forward links 320 and 326, the transmitting antennas of access point 300 use beamforming to improve the signal-to-noise ratio of the forward links for the different access terminals 316 and 322. Also, an access point using beamforming to transmit to access terminals scattered randomly through its coverage causes less interference to access terminals in neighboring cells than an access point transmitting through a single antenna to all its access terminals.
An access point may be a fixed station used for communicating with the terminals and may also be referred to as an access point, a node B, etc. An access terminal may also be referred to as an access terminal, user equipment, wireless communication device, terminal, access terminal, etc.
Fig. 8 is a block diagram of an aspect of a transmitter system 410 (also referred to as an access point) and a receiver system 450 (also referred to as an access terminal) in a MIMO system 400. In the transmitter system 410, traffic data for a plurality of data streams is provided from a data source 412 to a transmit data processor 414.
In one aspect, each data stream is transmitted over a respective transmit antenna. Transmit data processor 414 formats, codes, and interleaves the traffic data for each data stream based on a particular coding scheme selected for that data stream to provide coded data.
The coded data for each data stream may be multiplexed with pilot data using OFDM techniques. The pilot data is typically a known data pattern that is processed in a known manner and may be used at the receiver system to estimate the channel response. The multiplexed pilot and coded data for each data stream is then modulated (i.e., symbol mapped) based on a particular modulation scheme (e.g., BPSK, QPSK, M-PSK, or M-QAM) selected for that data stream. The data rate, coding, and modulation for each data stream may be determined by instructions performed by processor 430.
The modulation symbols for all data streams are then provided to a transmit MIMO processor 420, which may further process the modulation symbols (e.g., for OFDM). Transmit MIMO processor 420 then provides NTOne modulation symbol stream to NTAnd transmitters 422 a-422 t. In particular embodiments, transmit MIMO processor 42 applies beamforming weights to the symbols of the data streams and to the antenna from which the symbol is being transmitted.
Each transmitter 422 receives and processes a respective symbol stream to provide one or more analog signals, which are further conditioned (e.g., amplified, filtered, and upconverted) to provide a modulated signal suitable for transmission in the MIMO channel. Then respectively pass through NTN transmitted from transmitters 422a through 422t by antennas 424a through 424tTA modulated signal.
In the receiver system 450, NRThe antennas 452a through 452r receive the transmitted modulated signals and provide the received signal for each antenna 452 to a respective receiver 454a through 454 r. Each receiver 454 conditions (e.g., filters, amplifies, and downconverts) a respective received signal, digitizes the conditioned signal to provide samples, and further processes the samples to provide a corresponding received symbol stream.
Rx data processor 460 then receives and processes data from N based on a particular receiver processing techniqueRN of receiver 454RA stream of received symbols providing NTThe detected symbol stream. The rx data processor 460 then demodulates, deinterleaves, and decodes each detected symbol stream to recover the traffic data for the data stream. The processing by rx data processor 460 is complementary to that performed by tx MIMO processor 420 and tx data processor 414 at transmitter system 410.
A processor 470 periodically determines which pre-coding matrix to use (discussed below). Processor 470 constructs a reverse link message that includes a matrix index portion and a rank value portion.
The reverse link message may comprise various information regarding the communication link and/or the received data stream. The reverse link message is then processed by a tx data processor 438, which also receives traffic data for a number of data streams from a data source 436, modulated by a modulator 480, conditioned by transmitters 454a through 454r, and transmitted back to transmitter system 410.
At transmitter system 410, an antenna 424 receives the modulated signal from a receiver system 450, conditions it for demodulation at receiver 422, demodulates it for demodulation at demodulator 440, and processes it with a rx data processor 442 to extract the reverse link message transmitted by receiver system 450. Processor 430 then determines which pre-coding matrix to use for determining the beamforming weights then processes the extracted message.
In one aspect, a logical channel is divided into a control channel and a traffic channel. Logical control channels include a Broadcast Control Channel (BCCH), which is a downlink channel used to broadcast system control information. The Paging Control Channel (PCCH) is a downlink channel that conveys paging information. A Multicast Control Channel (MCCH) is a point-to-multipoint downlink channel used for transmitting Multimedia Broadcast and Multicast Service (MBMS) scheduling and control information for one or several MTCHs. In general, this channel is only used by UEs receiving MBMS (note: old MCCH + MSCH) after the Radio Resource Control (RRC) connection is established. A Dedicated Control Channel (DCCH) is a point-to-point bi-directional channel in which dedicated control information is transmitted and used by UEs having an RRC connection. In one aspect, the logical traffic channels include a Dedicated Traffic Channel (DTCH), which is a point-to-point bi-directional channel dedicated to one UE for the transfer of user information. Also, a Multicast Traffic Channel (MTCH) is a point-to-multipoint downlink channel for transmitting traffic data.
In one aspect, a transport channel is divided into a downlink and an uplink. The downlink transport channels include a Broadcast Channel (BCH), a downlink shared data channel (DL-SDCH) and a Paging Channel (PCH). The PCH is used to support UE power saving (DRX cycle is indicated to the UE by the network), is broadcast throughout the cell, and is mapped to PHY resources that may be used for other control/traffic channels. The uplink transport channels include a Random Access Channel (RACH), a request channel (REQCH), an uplink shared data channel (UL-SDCH), and a plurality of PHY channels. The PHY channels include a set of downlink channels and uplink channels.
The downlink PHY channels include: common pilot channel (CPICH), Synchronization Channel (SCH), Common Control Channel (CCCH), Shared Downlink Control Channel (SDCCH), Multicast Control Channel (MCCH), Shared Uplink Assignment Channel (SUACH), acknowledgement channel (ACKCH), downlink physical shared data channel (DL-PSDCH), Uplink Power Control Channel (UPCCH), Paging Indicator Channel (PICH), Load Indicator Channel (LICH). The uplink PHY channels include: physical Random Access Channel (PRACH), Channel Quality Indicator Channel (CQICH), acknowledgement channel (ACKCH), Antenna Subset Indicator Channel (ASICH), shared request channel (SREQCH), uplink physical shared data channel (UL-PSDCH), broadcast pilot channel (BPICH).
What has been described above includes examples of the various aspects. It is, of course, not possible to describe every conceivable combination of components or methodologies for purposes of describing the aforementioned aspects, but one of ordinary skill in the art may recognize that many further combinations and permutations of various aspects are possible. Accordingly, the various aspects described herein include all such changes, modifications and variations that fall within the scope of the claims.
In particular regard to the various functions performed by the above described components, devices, circuitry, etc., the terms (including a reference to a "means") used to describe such components are intended to correspond, unless otherwise indicated, to all components which perform the function described herein, even though not structurally equivalent to the disclosed components. Thus, it is to be appreciated that the various aspects include the system also including a computer-readable medium having computer-executable instructions for implementing the methods.
In addition, while a particular feature may have been disclosed with respect to only one of several implementations, such feature may be combined with one or more other features of the other implementations as may be desired and advantageous for any given or particular application. In the claims or specification, the terms "comprise", "comprises" and "comprising" are intended to be inclusive. In addition, "or" in the specification or claims denotes "a non-exclusive or".
Moreover, it is to be appreciated that portions of the disclosed systems and methods can include artificial intelligence, machine learning, or knowledge or rule based components, sub-components, processes, modules, methods, or mechanisms (e.g., support vector machines, neural networks, expert systems, bayesian belief networks, fuzzy logic, data fusion engines, classifiers … …). These components may automate certain mechanisms or processes to make portions of the systems and methods more adaptive, efficient, and intelligent. For example, and without limitation, an evolved RAN (e.g., access point, eNode B) may implicitly or predictively predict data traffic conditions and opportunities for flexible DTX-DRX, with an implicit relinquishing of CQI resources determined by a user equipment device based on previous interactions with the same or similar machines under the same conditions.
In view of the described exemplary systems, methodologies that are consistent with the disclosed subject matter are described with reference to several flow diagrams. Although, for purposes of simplicity of explanation, the methodologies are described as a series of blocks, it is to be understood and appreciated that the subject matter is not limited by the order of the blocks, as some blocks may occur in different orders and/or concurrently. Moreover, not all illustrated blocks may be required to implement the methodologies described herein. Additionally, it should be further appreciated that the methodologies disclosed herein may be stored on an article of manufacture to support transporting and delivering such methodologies to computers. An article of manufacture includes a computer program accessible from any computer-readable device, carrier, or media.
It should be understood that any patent, publication, or other material, in whole or in part, that is said to be incorporated by reference herein is not to be incorporated in a manner that would conflict with definitions, statements, or material set forth in this disclosure. Thus, where necessary, the explicit disclosure herein covers conflicting disclosure in the cited documents. Any patent, publication, or other disclosure material, in whole or in part, that is said to be incorporated by reference herein is not to be construed as an admission that the incorporated material does not conflict with existing definitions, statements, or other disclosure material set forth in this disclosure.
Claims (16)
1. A method of wireless communication, comprising:
dynamically scheduling a user equipment, UE, with a resource allocation of at least one downlink DL virtual resource block, VRB, transmitted on a physical downlink control channel, PDCCH, wherein said dynamically scheduling comprises implicitly mapping a plurality of DL VRB indices to one uplink UL acknowledgement, ACK, identifier, ID, and said mapping is associated with a time varying cyclic shift of a base sequence.
2. A method of wireless communication, comprising:
persistently scheduling a user equipment, UE, without sending a resource allocation on a physical downlink control channel, PDCCH, for each data transmission covered by the persistent scheduling; and
the UE is explicitly informed of an uplink UL acknowledgement, ACK, identifier, ID, on a physical downlink shared channel, PDSCH, which UL ACK ID is associated with a time varying cyclic shift of a base sequence.
3. The method of claim 2, further comprising:
receiving ACK information sent by the UE based on resources associated with the UL ACK ID.
4. A method of wireless communication, comprising:
dynamically scheduling a user equipment, UE, with a resource allocation sent on a physical downlink control channel, PDCCH, the resource allocation dynamically scheduling the UE for data transmission on a downlink; and
an uplink UL acknowledgement, ACK, resource implicitly mapped to a PDCCH index is determined, the UL ACK resource being associated with a time-varying cyclic shift of a base sequence used by the UE to send ACK information on the uplink for data transmission on the downlink.
5. A wireless communications apparatus, comprising:
means for dynamically scheduling a user equipment, UE, with resource allocation of at least one downlink DL virtual resource block, VRB, transmitted on a physical downlink control channel, PDCCH, wherein the dynamic scheduling comprises implicitly mapping a plurality of DL VRB indices to one uplink UL acknowledgement, ACK, identifier, ID, and the mapping is associated with a time varying cyclic shift of a base sequence.
6. A wireless communications apparatus, comprising:
a scheduling component for persistently scheduling a user equipment, UE, without sending a resource allocation on a physical downlink control channel, PDCCH, for each data transmission covered by the persistent scheduling; and
a transmitting component for explicitly informing the UE of an uplink UL acknowledgement ACK identifier ID on a physical downlink shared channel, PDSCH, the UL ACK ID associated with a time varying cyclic shift of a base sequence.
7. The apparatus of claim 6, further comprising:
a receiving component for receiving ACK information sent by the UE based on resources associated with the UL ACK ID.
8. A wireless communications apparatus, comprising:
a scheduling component for dynamically scheduling a user equipment, UE, with a resource allocation sent on a physical Downlink control channel, PDCCH, that dynamically schedules the UE for data transmission on a downlink; and
a determination component that determines an uplink UL Acknowledgement (ACK) resource implicitly mapped to a PDCCH index, the UL ACK resource associated with a time-varying cyclic shift of a base sequence used by a UE to send ACK information on an uplink for data transmission on a downlink.
9. A method of wireless communication, comprising:
receiving a resource allocation of at least one downlink, DL, virtual resource block, VRB, transmitted from an access node on a physical downlink control channel, PDCCH, for dynamically scheduling user equipments, UEs, for data transmission, wherein the dynamic scheduling comprises implicitly mapping a plurality of DL VRB indices to one uplink, UL, acknowledgement, ACK, identifier, ID, and the mapping is associated with a time varying cyclic shift of a base sequence.
10. A method of wireless communication, comprising:
receiving a persistent scheduling for a user equipment, UE, without receiving a resource allocation on a physical downlink control channel, PDCCH, for each data transmission covered by the persistent scheduling; and
receiving an explicit notification of an uplink UL Acknowledgement (ACK) Identifier (ID) for the UE on a Physical Downlink Shared Channel (PDSCH), the UL ACK ID associated with a time varying cyclic shift of a base sequence.
11. The method of claim 10, further comprising:
sending, by the UE, ACK information based on resources associated with the UL ACK ID.
12. A method of wireless communication, comprising:
receiving a resource allocation sent on a physical downlink control channel, PDCCH, to dynamically schedule a user equipment, UE, for data transmission on the downlink; and
an uplink UL acknowledgement, ACK, resource implicitly mapped to a PDCCH index is determined, the UL ACK resource being associated with a time-varying cyclic shift of a base sequence used by the UE to send ACK information on the uplink for data transmission on the downlink.
13. A wireless communications apparatus, comprising:
means for receiving a resource allocation of at least one downlink DL virtual resource block, VRB, transmitted from an access node on a physical downlink control channel, PDCCH, for dynamically scheduling user equipment, UE, for data transmission, wherein the dynamic scheduling comprises implicitly mapping a plurality of DL VRB indices to one uplink UL acknowledgement, ACK, identifier, ID, and the mapping is associated with a time varying cyclic shift of a base sequence.
14. A wireless communications apparatus, comprising:
a first component for receiving a persistent scheduling for a user equipment, UE, without receiving a resource allocation on a physical downlink control channel, PDCCH, for each data transmission covered by the persistent scheduling; and
a second component for receiving explicit notification of an uplink UL Acknowledgement (ACK) Identifier (ID) for the UE on a Physical Downlink Shared Channel (PDSCH), the UL ACK ID associated with a time varying cyclic shift of a base sequence.
15. The apparatus of claim 14, further comprising:
a third component for transmitting ACK information by the UE based on resources associated with the UL ACK ID.
16. A wireless communications apparatus, comprising:
a first component for receiving a resource allocation sent on a physical downlink control channel, PDCCH, for dynamically scheduling user equipments, UEs, for data transmission on the downlink; and
a second component for determining an uplink UL Acknowledgement (ACK) resource implicitly mapped to a PDCCH index, the UL ACK resource associated with a time-varying cyclic shift of a base sequence used by the UE to send ACK information on an uplink for data transmission on a downlink.
Applications Claiming Priority (7)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US88688907P | 2007-01-26 | 2007-01-26 | |
| US60/886,889 | 2007-01-26 | ||
| US88823307P | 2007-02-05 | 2007-02-05 | |
| US60/888,233 | 2007-02-05 | ||
| US12/019,909 | 2008-01-25 | ||
| US12/019,909 US8169956B2 (en) | 2007-01-26 | 2008-01-25 | Mapping uplink acknowledgement transmission based on downlink virtual resource blocks |
| PCT/US2008/052218 WO2008092160A2 (en) | 2007-01-26 | 2008-01-28 | Mapping uplink acknowledgement transmission based on downlink virtual resource blocks |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| HK1137595A1 HK1137595A1 (en) | 2010-07-30 |
| HK1137595B true HK1137595B (en) | 2015-10-02 |
Family
ID=
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2674724C (en) | Mapping uplink acknowledgement transmission based on downlink virtual resource blocks | |
| JP6745841B2 (en) | Method and system for multiplexing acknowledgment and sounding reference signals | |
| CN109039562B (en) | Method for transmitting and receiving EPDCCH and apparatus therefor | |
| CN102197615A (en) | Scope of channel quality reporting region in a multi-carrier system | |
| AU2009225522A1 (en) | Filtering semi-persistent scheduling false alarms | |
| RU2434336C2 (en) | Mapping uplink acknowledgement transmission based on downlink virtual resource blocks | |
| HK1137595B (en) | Mapping uplink acknowledgement transmission based on downlink virtual resource blocks | |
| HK1207497B (en) | Mapping uplink acknowledgement transmission based on downlink virtual resource blocks | |
| HK1165145B (en) | Mapping uplink acknowledgement transmission based on downlink resource blocks | |
| HK1156448B (en) | Mapping uplink acknowledgement transmission based on downlink virtual resource blocks |