WO2011082539A1 - Entrelacement d'espace de recherche pour programmation croisée dans une agrégation de porteuses - Google Patents

Entrelacement d'espace de recherche pour programmation croisée dans une agrégation de porteuses Download PDF

Info

Publication number
WO2011082539A1
WO2011082539A1 PCT/CN2010/070082 CN2010070082W WO2011082539A1 WO 2011082539 A1 WO2011082539 A1 WO 2011082539A1 CN 2010070082 W CN2010070082 W CN 2010070082W WO 2011082539 A1 WO2011082539 A1 WO 2011082539A1
Authority
WO
WIPO (PCT)
Prior art keywords
search space
user equipment
component carriers
pdcch
component carrier
Prior art date
Application number
PCT/CN2010/070082
Other languages
English (en)
Inventor
Peng Chen
Chunyan Gao
Tommi Koivisto
Original Assignee
Nokia Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nokia Corporation filed Critical Nokia Corporation
Priority to PCT/CN2010/070082 priority Critical patent/WO2011082539A1/fr
Publication of WO2011082539A1 publication Critical patent/WO2011082539A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0001—Arrangements for dividing the transmission path
    • H04L5/0003—Two-dimensional division
    • H04L5/0005—Time-frequency
    • H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
    • H04L5/001—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT the frequencies being arranged in component carriers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/23—Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal

Definitions

  • the exemplary and non-limiting embodiments of this invention relate generally to wireless communication systems, methods, devices and computer programs and, more specifically, relate to scheduling of radio resources in a multi-carrier or carrier aggregation system.
  • eNB EUTRAN Node B evolved Node B/base station
  • LTE E-UTRAN evolved UTRAN
  • E-UTRAN also referred to as UTRAN-LTE, E-UTRA or 3.9G
  • LTE Release 8 is completed, the LTE Release 9 is being standardized, and the LTE Release 10 is currently under development within the 3GPP.
  • the downlink access technique is OFDMA, and the uplink access technique is SC-FDMA, and these access techniques are expected to continue in LTE Release 10.
  • FIG. 1 reproduces Figure 4.1 of 3GPP TS 36.300, V8.6.0 (2008-09), and shows the overall architecture of the E-UTRAN system.
  • the EUTRAN system includes eNBs, providing the EUTRA user plane and control plane (RRC) protocol terminations towards the UE.
  • the eNBs are interconnected with each other by means of an X2 interface.
  • the eNBs are also connected by means of an S1 interface to an EPC, more specifically to a MME and to a Serving Gateway.
  • the S1 interface supports a many to many relationship between MMEs/Serving Gateways and the eNBs.
  • LTE-A LTE-Advanced
  • LTE-A is directed toward extending and optimizing the 3GPP LTE Release 8 radio access technologies to provide higher data rates at very low cost.
  • LTE-A will most likely be part of LTE Release 10.
  • LTE-A is expected to use a mix of local area and wide area optimization techniques to fulfill the ITU-R requirements for IMT-Advanced while keeping the backward compatibility with LTE Release 8.
  • Topics that are included within the ongoing study item includes bandwidth extensions beyond 20 MHz, relays, cooperative MIMO, uplink multiple access schemes and MIMO enhancements such as advanced multi-user MIMO (MU-M!MO).
  • the bandwidth extension beyond 20 MHz in LTE-Advanced is to be done via carrier aggregation (CA), in which several Release 8 compatible carriers are aggregated together to form a larger bandwidth. This is shown by example at Figure 1B in which there are 5 Release 8 compatible CCs aggregated to form one larger LTE-Advanced bandwidth.
  • CA carrier aggregation
  • CCs 20 MHz Release 8 compatible component carriers
  • the PDCCH could only be used to indicate a PDSCH/PUSCH sent on its own DL CC or its paired UL CC.
  • cross-scheduling it is anticipated that so-called "cross-scheduling" can be available, which means the PDCCH could be used to indicate PDSCH/PUSCH resources sent on other CCs other than its own DL CC/or its paired UL CC. From the perspective of the transmitted PDCCH this cross-scheduling is useful for distributing the loads among the multiple carriers.
  • One problem arises in how an LTE-Advanced UE is to find the PDCCH which carries its allocation of UL resources (PUSCH) or downlink resources (PDSCH).
  • the LTE-Advances UE must search among all the PDCCH candidates in each of the plurality of CCs in order to find the one with the allocation for it.
  • the scheduling flexibility which cross-scheduling offers to eNBs is a high processing burden on the LTE-Advanced UEs, which are of course mobile devices operating with limited (galvanic) power supply and limited processing capacity. It is therefore advantageous to limit the UE's search space in which the eNB might dispose a PDCCH bearing a PDSCH or PUSCH allocation for that UE.
  • One reason for the blind decoding effort to be so high in the aggregated bandwidth scenario is that the payload size of the DCI (the PDCCH which schedules the UEs) can vary. To reduce possible blind decoding efforts in a cross-scheduling case, the following approaches have been proposed to the 3GPP:
  • the PDCCH could only schedule CCs with similar bandwidth as that of the CC used to carry PDCCH(s).
  • the inventors deem that as compared to the other two 3GPP proposals noted above, these would result in significant constraints for the scheduled CC bandwidth. Also with this approach the per-CC transmission mode may still lead to additional blind decoding efforts.
  • the per-CC transmission mode can be forbidden in order to reduce
  • the scheduling candidates are PDCCH candidates which schedule PDSCH/PUSCH radio resources for a UE
  • the logical search space has PDCCH candidates on more than one but less than all of the component carriers in the aggregated carrier bandwidth.
  • the scheduling candidates are PDCCH candidates which schedule PDSCH/PUSCH radio resources for a UE, and the logical search space has PDCCH candidates on more than one but less than all of the component carriers in the aggregated carrier bandwidth.
  • the exemplary embodiments of this invention provide an apparatus, comprising at least one processor and at least one memory including computer program code.
  • the scheduling candidates are PDCCH candidates which schedule PDSCH/PUSCH radio resources for a UE
  • the logical search space has PDCCH candidates on more than one but less than all of the component carriers in the aggregated carrier bandwidth.
  • the exemplary embodiments of this invention provide a method, executed in a system which aggregates a plurality of component carriers, comprising: receiving a parameter N that is a total number of component carriers which have scheduling candidates; receiving a parameter offsetin) that is specific to an n th component carrier; and determining from a stored algorithm and the parameters a logical search space for a user equipment.
  • the scheduling candidates are PDCCH candidates which schedule PDSCH/PUSCH radio resources for a UE
  • the logical search space has PDCCH candidates on more than one but less than all of the aggregated plurality of component carriers which cross schedule to PDSCH/PUSCH radio resources on the N component carriers.
  • the exemplary embodiments of this invention provide a memory storing a program of computer readable instructions that when executed by a processor result in actions executed in a system which aggregates a plurality of component carriers, the action comprising: receiving a parameter N that is a total number of component carriers which have scheduling candidates; receiving a parameter offset ⁇ that is specific to an n th component carrier; and determining from a stored algorithm and the parameters a logical search space for a user equipment.
  • the scheduling candidates are PDCCH candidates which schedule PDSCH/PUSCH radio resources for a UE, and the logical search space has PDCCH candidates on more than one but less than all of the aggregated plurality of component carriers which cross schedule to PDSCH/PUSCH radio resources on the N component carriers.
  • the exemplary embodiments of this invention provide an apparatus, comprising at least one processor and at least one memory including computer program code.
  • the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus to perform: receiving a parameter N that is a total number of component carriers which have scheduling candidates; receiving a parameter that is specific to an n th component carrier; and determining from a stored algorithm and the parameters a logical search space for a user equipment.
  • the scheduling candidates are PDCCH candidates which schedule PDSCH/PUSCH radio resources for a UE, and the logical search space has PDCCH candidates on more than one but less than all of the aggregated plurality of component carriers which cross schedule to PDSCH/PUSCH radio resources on the N component carriers.
  • Figure 1A reproduces Figure 4 of 3GPP TS 36.300, and shows the overall architecture of the E-UTRAN system.
  • Figure 1 B is a schematic diagram of a radio spectrum in which cross-scheduling can be employed, in which five component carrier bandwidths are aggregated into a single LTE-Advanced bandwidth.
  • Figure 2A illustrates three aggregated CCs with full flexibility cross-scheduling, and a high blind detect effort on the part of the UE.
  • Figure 2B is similar to Figure 2A but showing less than full flexibility where cross-scheduling is not allowed in CC#3.
  • Figure 2C is similar to Figure 2A but showing cross-scheduling with a one-to-one mapping between the CC which carries the PDCCH and the CC which carries the PDSCH/PUSCH that is allocated to a particular UE by the PDCCH.
  • Figure 3 is similar to Figure 2A but showing cross scheduling with search space interleaving according to an exemplary embodiment of the invention.
  • Figure 4A illustrates two CCs in a PDCCH monitor set similar to Figure 2B, and Figure 4A illustrates another example of PDCCH candidate-basis search spaces interleaving similar to Figure 3.
  • Figure 5A shows a simplified block diagram of certain apparatus according to various exemplary embodiments of the invention.
  • Figure 5B shows a more particularized block diagram of a user equipment such as that shown at Figure 5A.
  • Figure 6 are two logic flow diagrams that illustrates the operation of a method, and a result of execution of computer program instructions embodied on a computer readable memory, in accordance with the exemplary embodiments of this invention from the perspective of the network access node and the user equipment.
  • DETAILED DESCRIPTION
  • Figure 2A illustrates cross-scheduling with what is termed full flexibility from the eNB's perspective).
  • full flexibility means the PDCCH for any DL/UL CC can be transmitted on any DL CC. This necessarily means that the UE needs to monitor the PDCCH on each DL CC, looking for PDCCH(s) pointing to any DL/UL CC.
  • the illustrated search space for CC#1 means the particular UE needs to blind detect certain PDCCH candidates that exist in CC#1 to see if any of those PDCCHs allocate radio resources to that particular UE.
  • any PDCCH in CC#1 can allocate a PDSCH or PUSCH in any of the CCs, which by the example of Figure 2A there are only three rather than five as in Figure 1 B. The same holds true for each of the three CCs shown at Figure 2A.
  • This method is preferred by the eNB for the full flexible scheduling perspective, while the dynamic switching gain can still be obtained. This means that the PDCCH for a certain PDSCH/PUSCH can be sent on any DL CC in a dynamic manner.
  • One manner to reduce that search space size and the number of possible blind detects the UE must undergo is to limit just which CCs the UE must search for its PDCCH.
  • the limited set of CCs is termed a "PDCCH monitor set", in which the PDCCH(s) for DL/UL CC(s) can only be sent on the CC involved in "PDCCH monitor set".
  • Figure 2B is an example of an bandwidth aggregated from three CCs like Figure 2A, but in Figure 2B only CC#1 and CC#2 are in the PDCCH monitor set.
  • the eNB must send the PDCCH for a particular UE only in CC#1 or CC#2, but that sent PDCCH can schedule the particular UE for UL/DL shared channel on any of the three CCs as indicated by the arrows at Figure 2B.
  • the UE's blind decoding efforts are linearly reduced in comparison with "full flexibility" case of Figure 2A, since the search space locations are reduced,
  • the total number of blind detection efforts depends on the size of that monitor set. But in some cases a slightly increased size of the PDCCH monitor set may lead also to an unacceptably large blind decoding effort (and false positive probability).
  • the worst case is still that the number of CCs in the PDCCH monitor set equals to the total number of DL CCs (three in Figure 2B), which leads to similar blind decoding efforts as is the case of cross-scheduling with full flexibility.
  • the UE's possible blind decoding efforts can also be reduced as compared to the full flexibility option by using a one-to-one mapping between the CC which carries the PDCCH and the CC which carries the PDSCH that is allocated by the PDCCH.
  • This is shown graphically at Figure 2C, in which the PDCCHs within the search space 201 on CC#1 maps only to shared channels in CC#1 , the PDCCH within a first search space 202 on CC#2 map only to shared channels in CC#2, and CC the PDCCH within a second search space 203 on CC#2 map only to shared channels in CC#3.
  • This one-to-one mapping may be pre-defined and stored in a local memory of the UE and eNB so as to avoid signaling overhead, or for example the mapping may be configured by a network layer that is higher than the eNB and sent to the UE via signaling such as in system information.
  • the mapping may be configured by a network layer that is higher than the eNB and sent to the UE via signaling such as in system information. Note that in Figure 2C there is also the concept of a PDCCH monitor set since the UE in question does not need to look anywhere in CC#3 for a PDCCH that allocates to that UE any UL/DL shared channel.
  • the UE blind decoding budget moves between CCs that are used to carry PDCCH(s) [CC#1 and CC#2 in Figure 2C), so the blind decoding efforts (and false positive possibility) are limited without any constraint about CC bandwidth and/or per-CC transmission mode.
  • the needed blind decoding efforts are the same as or smaller than the case of no cross-CC scheduling, with the added benefit shown at search spaces 202 and 203 in Figure 2C that a PDCCH in one CC can map to a shared channel in a different CC.
  • the one-to-one mapping technique shown at Figure 2C reduces the eNB's scheduling flexibility as compared to the full flexibility technique of Figure 2A. Specifically, the eNB must assure that one particular PDCCH is sent on its corresponding (pre-defined/configured) CC, which means that the eNB's potential gain due to inter-CC dynamic switching is lost. In other words, the eNB no longer has the freedom to change the CC used for PDCCH transmission dynamically, which it might want to do based on dynamically changing radio conditions (for example, if there is not enough PDCCH capacity on the pre-defined/configured CC).
  • Example embodiments of the invention address that problem with the Figure 2C approach, providing the technical effect of enabling inter-CC dynamic switching gain for the scheduling entity (for example, the eNB) while the blind decoding efforts and false positive probability for the scheduled entity (the UE) are kept at a reasonable level.
  • These example embodiments may be described as using search space interleaving for cross-scheduling in a component aggregation system, which as will be shown below reduce the total blind decoding efforts on the part of the UE and at the same time introduce inter-CC dynamic switching gain on the part of the eNB.
  • FIG. 3 illustrates an example of the search space interleaving concept.
  • Search space interleaving distributes the possible PDCCH candidates, which are associated with certain PDSCHs/PUSCHs, around the allocated PDCCH CCs.
  • the association between PDCCH candidates and certain PDSCHs/PUSCHs could be pre-defined and stored in the local memories of the UE and eNB to avoid signaling overhead, or it may be signaled via higher-layer signaling such as for example RRC signaling.
  • the association between PDCCH candidates and PDSCH/PUSCH may be communicated to the UE (and eNB) in any other explicit or implicit way.
  • PDCCH candidates in each of CC#1 and CC#2 of the three total CCs of the aggregation in which the eNB can send a PDCCH. These are the PDCCH candidates, and represent the only locations at which the eNB can send a PDCCH to one particular UE. For a different UE the PDCCH candidates may be located for example in CC#1 and CC#3, and there may or may not be nine in each of CC#1 and CC#3 for that other UE. For still another particular UE there may be a different number of PDCCH candidates in the different CC search spaces.
  • this first order inter-CC mapping for CC#1 is a first search space 301a of candidate PDCCHs mapping to CC#1 , a second search space 302a of candidate PDCCHs mapping to CC#2, and a third search space 303a of candidate PDCCHs mapping to CC#3.
  • this first order inter-CC mapping or interleaving of search spaces could be on a PDCCH-candidate-basis as shown at Figure 3, or it could be on an aggregation-level-basis which means the PDCCH candidates for certain PDSCH/PUSCH are distributed across configured CCs in an inter-CC-first manner with the unit of PDCCH candidate or aggregation level.
  • the search space starting point per DL CC can be the same as that in 3GPP LTE Release 8, for a simpler backwards compatibility.
  • the CC-specific parameter that is, the CC to which the first group of PDCCH candidates map
  • the UE searches in the first search space 301a of CC#1 which includes three PDCCH candidates and blind detects each of them.
  • the three PDCCH candidates of the first search space 301a each lie in CC#1 and schedules a PDSCH/PUSCH transmission in CC# .
  • the UE searches in the second search space 302a of CC#1 which includes three PDCCH candidates and blind detects each of them.
  • the three PDCCH candidates of the second search space 302a schedules a PDSCH/PUSCH transmission in CC#2.
  • the UE searches in the third search space 303a of CC#1 which includes three PDCCH candidates and blind detects each of them.
  • the three PDCCH candidates of the third search space 303a schedules a PDSCH/PUSCH transmission in CC#3.
  • the first search space 301b of CC#2 has three PDCCH candidates which schedules a PDSCH/PUSCH transmission in CC#1 ;
  • the second search space 302b of CC#2 has three PDCCH candidates which schedules a PDSCH/PUSCH transmission in CC#2;
  • the third search space 303b of CC#2 has three PDCCH candidates which schedules a PDSCH/PUSCH transmission in CC#3. Since PDCCH for scheduling a PDSCH/PUSCH in any CC can be in both CC#1 and CC#2 in this example, this shows the scheduling flexibility that the eNB retains with the first-order inter-CC mapping technique that Figure 3 illustrates.
  • interleaved search spaces may be in two CCs as Figure 3 shows, or in more than two CCs particularly for the case of more than three CCs in the aggregation.
  • Figure 4B illustrates another example of PDCCH-candidate-basis search spaces interleaving, contrasted against Figure 4A which illustrates a PDCCH monitor set similar to Figure 2B.
  • Figures 4A-B assume there is at least four CCs in the aggregation, and that the PDCCH on CC#1 can be used to schedule PDSCH/PUSCH in either CC#1 or CC#3, and further that the PDCCH on CC#2 can be used to schedule PDSCH/PUSCH in either CC#2 or CC#4.
  • Figure 4A shows that the UE must blind decode all PDCCH candidates (six of them) in the entire search space A of CC#1 which the eNB can use to allocate a shared channel to that UE in CC#1 or CC#3, and must also blind decode all PDCCH candidates (six of them) in the entire search space B of CC#2 which the eNB can use to allocate a shared channel to that UE in CC#2 or CC#4.
  • the PDCCH for scheduling a PDSCH/PUSCH in CC#1 or CC#3 can only be sent in CC#1 ; this is the limitation of such mapping as shown at Figure 4A.
  • Figure 4B illustrates PDCCH-candidate-basis search spaces interleaving according to an exemplary embodiment of the invention.
  • the eNB has the flexibility to schedule a particular UE for a shared channel in any of CC#s 1 through 4 by using a PDCCH candidate in either CC#1 or CC#2.
  • the example of Figure 4B shows the UE's search space is cut in half as compared to Figure 4A.
  • the search space interleaving at Figure 4B there is a first search space 401a and a second search space 401 b in each of two or more difference CCs (CC#1 and CC#2 at Figure 4B).
  • PDCCH candidates in the first search space 401 a are restricted to allocate/schedule a shared channel in only a first set of CCs, which in the case of Figure 4B is CC#1 and CC#3.
  • PDCCH candidates in the second search space 401b are restricted to allocate/schedule a shared channel in only a second set of CCs, which in the case of Figure 4B is CC#2 and CC#4.
  • Both the first search space 401a and the second search space 401b are distributed in two CCs, and so the PDCCH for scheduling a PDSCH/PUSCH in any of the CCs can be sent in either CC#1 or CC#2.
  • the eNB can still allocate to that UE a shared channel in any of CC#s 1 through 4. If the eNB wants to allocate to the UE a shared channel in CC#1 or CC#3 it will schedule the UE using any of the three PDCCH candidates (#s 4, 5 or 6 in CC#1 and #s 1 , 2 or 3 in CC#2 as shown at Figure 4B) in the first search space 401a of CC#1.
  • the eNB wants to allocate to the UE a shared channel in CC#2 or CC#4 it will schedule the UE using any of the three PDCCH candidates (also #s 1 , 2 or 3 in CC#1 and #s 4, 5 or 6 in CC#2 as shown at Figure 4B) in the second search space 40 b of CC#2.
  • the search space interleaving may also be according to control channel element CCE aggregation level, which is known in LTE.
  • the CCE aggregation level can be used as a unit of the interleaving.
  • the unit of interleaving for Figure 4B is the PDCCH candidate with interleaving each three candidates; the interleaving can also be cone by CCE aggregation level.
  • the one-to-one mapping between PDCCH CC and PDSCH/PUSCH CC provides the technical advantage of the same or smaller blind decoding effort as compared to the case of no cross-scheduling at all, while giving the eNB much greater scheduling flexibility than the no cross-scheduling case.
  • the example at Figure 4B shows that the eNB maintains its PDCCH dynamic switching gain capability since it can schedule a UE for a shared channel on any of CC#s 1 through 4 using a PDCCH on either CC#1 or CC#2.
  • the eNB must send a PDCCH on CC#1 in order to schedule a shared channel on CC#1 or CC#3 and must send a PDCCH on CC#2 in order to schedule a shared channel on CC#2 or CC#4.
  • the search space interleaving among CCs means that for a certain UE and a certain CCE aggregation level, there is defined or configured a "logical search space" which includes PDCCH candidates distributed among multiple CCs (CC#1 and CC#2 in the Figure 4B example), and for a certain UE and certain CCE aggregation level there is a one-to-one mapping between that UE's logical search space (the PDCCH candidates of that search space) and their corresponding PDSCH/PUSCH CC.
  • the search space for a certain UE and certain CCE aggregation level is the same as that in Figure 4A.
  • the eNB can use such an algorithm to determine which PDCCH candidates it can use to schedule a particular UE, and the UE can use such an algorithm to figure out exactly which PDCCH candidates are within its search space so it can dispense with blind decoding any other PDCCH candidates outside that search space.
  • N is the number of configured CCs used to send PDCCHs.
  • M and ⁇ are integers greater than one.
  • M (L) is the total number of PDCCH candidates.
  • the term PDCCH candidate may be defined in terms of a search space the UE is to monitor, such as set forth by example at 3GPP TS 36.213, Section 9.1.1 (v9.0.1 , 2009-12).
  • the value for N may be signaled such as via RRC signaling, or it may be indicated to the UE (and eNB if the value for N is chosen by higher levels) in some other implicit or explicit manner.
  • each PDCCH candidate on each configured CC is defined as follows.
  • the CCEs corresponding to PDCCH candidate are given by: where is a CC-specific parameter, and which by example is signaled via RRC signaling or in some other implicit or explicit manner.
  • L e ⁇ 1,2,4,8 ⁇ is the corresponding CCE aggregation level. is the total number of
  • network temporary identifier RNTI assigned by the eNB to the UE.
  • the value used for is defined in 3GPP TS 36.213 (v9.0.1) at
  • a wireless network 1 is adapted for communication over a wireless link 11 with an apparatus, such as a mobile communication device which above is referred to as a UE 10, via a network access node, such as a Node B (base station), and more specifically an eNB 12.
  • the network 1 may include a network control element (NCE) 14 that may include the MME/S-GW functionality shown in Figure 1A, and which provides connectivity with a network, such as a telephone network and/or a data communications network (e.g., the internet).
  • NCE network control element
  • the UE 10 includes a controller, such as a computer or a data processor (DP) 10A, a computer-readable memory medium embodied as a memory (MEM) 10B that stores a program of computer instructions (PROG) 10C, and a suitable radio frequency (RF) transceiver 10D for bidirectional wireless communications with the eNB 12 via one or more antennas.
  • the eNB 12 also includes a controller, such as a computer or a data processor (DP) 12A, a computer-readable memory medium embodied as a memory (MEM) 12B that stores a program of computer instructions (PROG) 12C, and a suitable RF transceiver 12D for communication with the UE 10 via one or more antennas.
  • DP computer or a data processor
  • PROG program of computer instructions
  • RF radio frequency
  • the eNB 12 is coupled via a data / control path 13 to the NCE 14.
  • the path 3 may be implemented as the S1 interface shown in Figure 1A.
  • the eNB 12 may also be coupled to another eNB via data / control path 15, which may be implemented as the X2 interface shown in Figure 1A.
  • At least one of the PROGs 10C and 12C is assumed to include program instructions that, when executed by the associated DP, enable the device to operate in accordance with the exemplary embodiments of this invention, as will be discussed below in greater detail.
  • the exemplary embodiments of this invention may be implemented at least in part by computer software executable by the DP 10A of the UE 10 and/or by the DP 12A of the eNB 12, or by hardware, or by a combination of software and hardware (and firmware).
  • the UE 10 may be assumed to also include a search space (SS) mapping interleaver 10E
  • the eNB 12 may include a search space (SS) mapping interleaver 12E.
  • the UE 10 need only use the mapping interleaver 10E to find its own search space whereas the eNB 12 uses its mapping interleaver 12E to find the search spaces of each UE under its control in the eNB's cell.
  • the various embodiments of the UE 10 can include, but are not limited to, cellular telephones, personal digital assistants (PDAs) having wireless communication capabilities, portable computers having wireless communication capabilities, image capture devices such as digital cameras having wireless communication capabilities, gaming devices having wireless communication capabilities, music storage and playback appliances having wireless communication capabilities, Internet appliances permitting wireless Internet access and browsing, as well as portable units or terminals that incorporate combinations of such functions.
  • PDAs personal digital assistants
  • portable computers having wireless communication capabilities
  • image capture devices such as digital cameras having wireless communication capabilities
  • gaming devices having wireless communication capabilities
  • music storage and playback appliances having wireless communication capabilities
  • Internet appliances permitting wireless Internet access and browsing, as well as portable units or terminals that incorporate combinations of such functions.
  • the computer readable MEMs 10B and 12B may be of any type suitable to the local technical environment and may be implemented using any suitable data storage technology, such as semiconductor based memory devices, flash memory, magnetic memory devices and systems, optical memory devices and systems, fixed memory and removable memory.
  • the DPs 10A and 12A may be of any type suitable to the local technical environment, and may include one or more of general purpose computers, special purpose computers, microprocessors, digital signal processors (DSPs) and processors based on a multicore processor architecture, as non-limiting examples.
  • Figure 5B illustrates further detail of an exemplary UE in both plan view (left) and sectional view (right), and the invention may be embodied in one or some combination of those more function-specific components.
  • the UE 10 has a graphical display interface 20 and a user interface 22 illustrated as a keypad but understood as also encompassing touch-screen technology at the graphical display interface 20 and voice-recognition technology received at the microphone 24.
  • a power actuator 26 controls the device being turned on and off by the user.
  • the exemplary UE 10 may have a camera 28 which is shown as being forward facing (e.g., for video calls) but may alternatively or additionally be rearward facing (e.g., for capturing images and video for local storage).
  • the camera 28 is controlled by a shutter actuator 30 and optionally by a zoom actuator 32 which may alternatively function as a volume adjustment for the speaker(s) 34 when the camera 28 is not in an active mode.
  • the antennas 36 may be multi-band for use with other radios in the UE.
  • the power chip 38 controls power amplification on the channels being transmitted and/or across the antennas that transmit simultaneously where spatial diversity is used, and amplifies the received signals.
  • the power chip 38 outputs the amplified received signal to the radio-frequency (RF) chip 40 which demodulates and downconverts the signal for baseband processing.
  • the baseband (BB) chip 42 detects the signal which is then converted to a bit-stream and finally decoded. Similar processing occurs in reverse for signals generated in the apparatus 10 and transmitted from it.
  • Signals to and from the camera 28 pass through an image/video processor 44 which encodes and decodes the various image frames.
  • a separate audio processor 46 may also be present controlling signals to and from the speakers 34 and the microphone 24.
  • the graphical display interface 20 is refreshed from a frame memory 48 as controlled by a user interface chip 50 which may process signals to and from the display interface 20 and/or additionally process user inputs from the keypad 22 and elsewhere.
  • Certain embodiments of the UE 10 may also include one or more secondary radios such as a wireless local area network radio WLAN 37 and a Bluetooth® radio 39, which may incorporate an antenna on-chip or be coupled to an off-chip antenna.
  • secondary radios such as a wireless local area network radio WLAN 37 and a Bluetooth® radio 39, which may incorporate an antenna on-chip or be coupled to an off-chip antenna.
  • various memories such as random access memory RAM 43, read only memory ROM 45, and in some embodiments removable memory such as the illustrated memory card 47 on which the various programs 10C are stored. All of these components within the UE 10 are normally powered by a portable power supply such as a battery 49.
  • the aforesaid processors 38, 40, 42, 44, 46, 50 may operate in a slave relationship to the main processor 10A, 12A, which may then be in a master relationship to them.
  • Embodiments of this invention need not be disposed in any individual processor/chip but may be disposed across various chips and memories as shown or disposed within another processor that combines some of the functions described above for Figure 5B. Any or all of these various processors of Figure 5B access one or more of the various memories, which may be on-chip with the processor or separate therefrom.
  • Similar function-specific components that are directed toward communications over a network broader than a piconet may also be disposed in exemplary embodiments of the access node 12, which may have an array of tower-mounted antennas rather than the two shown at Figure 5B.
  • Figure 6 is a logic flow diagram that illustrates the operation of a method, and a result of execution of computer program instructions, in accordance with the exemplary embodiments of this invention.
  • the logical search space comprises at [east schedultng/PDCCH candidates on a first component carrier that schedule radio resources on each of N component carriers (in which N is an integer greater than one).
  • search spaces 301a, 302a and 303a are each on CC#1 but schedule a PDSCH/PUSCH transmission on respective CC#1 , CC#2 and CC#3, for which the PDSCH/PUSCH on CC#2 and CC#3 are cross scheduled.
  • Block 606 and 608 of Figure 6 represent an exemplary embodiment of the invention from the perspective of the UE operating in a system which aggregates a plurality of component carriers.
  • the UE receives a parameter N that is a total number of component carriers which have scheduling/PDCCH candidates (N is an integer greater than one).
  • the UE receives a parameter offset(n) that is specific to an n th one of the N component carriers. And at block 610 of Figure 6 the UE determines its logical search space from a stored algorithm and the received parameters. Once the UE receives a PDCCH in that logical search space it determines that radio resources on a specific one of the component carriers are allocated to it by mapping from that received PDCCH to the specific one of the component carriers which has the corresponding PDSCH/PUSCH.
  • the various exemplary embodiments may be implemented in hardware or special purpose circuits, software, logic or any combination thereof.
  • some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software which may be executed by a controller, microprocessor or other computing device, although the invention is not limited thereto.
  • firmware or software which may be executed by a controller, microprocessor or other computing device, although the invention is not limited thereto.
  • various aspects of the exemplary embodiments of this invention may be illustrated and described as block diagrams, flow charts, or using some other pictorial representation, it is well understood that these blocks, apparatus, systems, techniques or methods described herein may be implemented in, as nonlimiting examples, hardware, software, firmware, special purpose circuits or logic, general purpose hardware or controller or other computing devices, or some combination thereof.
  • the integrated circuit, or circuits may comprise circuitry (as well as possibly firmware) for embodying at least one or more of a data processor or data processors, a digital signal processor or processors, baseband circuitry and radio frequency circuitry that are configurable so as to operate in accordance with the exemplary embodiments of this invention.
  • connection means any connection or coupling, either direct or indirect, between two or more elements, and may encompass the presence of one or more intermediate elements between two elements that are “connected” or “coupled” together.
  • the coupling or connection between the elements can be physical, logical, or a combination thereof.
  • two elements may be considered to be “connected” or “coupled” together by the use of one or more wires, cables and/or printed electrical connections, as well as by the use of electromagnetic energy, such as electromagnetic energy having wavelengths in the radio frequency region, the microwave region and the optical (both visible and invisible) region, as several non-limiting and non-exhaustive examples.

Landscapes

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

Abstract

La présente invention se rapporte à un espace de recherche logique configuré pour un équipement d'utilisateur qui comprend au moins des candidats de programmation/PDCCH sur une première composante porteuse qui programme des ressources radio sur chacune de N composantes porteuses (CC). L'équipement d'utilisateur se voit allouer une ressource radio sur une nième des N CC en utilisant l'un des candidats de programmation qui programme, par le biais d'un mappage de 1 à 1, la nième des N CC. Dans ce qui précède, n = 1, 2,... N, et N est un nombre entier plus grand que 1. D'autres aspects de l'invention se rapportent à la détermination, par l'EU, de son espace de recherche logique.
PCT/CN2010/070082 2010-01-08 2010-01-08 Entrelacement d'espace de recherche pour programmation croisée dans une agrégation de porteuses WO2011082539A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2010/070082 WO2011082539A1 (fr) 2010-01-08 2010-01-08 Entrelacement d'espace de recherche pour programmation croisée dans une agrégation de porteuses

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2010/070082 WO2011082539A1 (fr) 2010-01-08 2010-01-08 Entrelacement d'espace de recherche pour programmation croisée dans une agrégation de porteuses

Publications (1)

Publication Number Publication Date
WO2011082539A1 true WO2011082539A1 (fr) 2011-07-14

Family

ID=44305181

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/070082 WO2011082539A1 (fr) 2010-01-08 2010-01-08 Entrelacement d'espace de recherche pour programmation croisée dans une agrégation de porteuses

Country Status (1)

Country Link
WO (1) WO2011082539A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013097120A1 (fr) * 2011-12-28 2013-07-04 富士通株式会社 Procédé et dispositif de mise en correspondance d'un espace de recherche d'un canal de commande en liaison descendante
CN109863803A (zh) * 2016-09-21 2019-06-07 株式会社Ntt都科摩 用户终端和无线通信方法
WO2020125525A1 (fr) * 2018-12-18 2020-06-25 京信通信系统（中国）有限公司 Procédé et dispositif de détermination de type d'attribution de ressources

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1773927A (zh) * 2004-11-08 2006-05-17 上海贝尔阿尔卡特股份有限公司 流媒体业务的动态无线资源调度方法和设备
WO2009029015A1 (fr) * 2007-08-24 2009-03-05 Teliasonera Ab Gestion de ressources dans un système de communication sans fil comprenant au moins un canal de planification
CN101502161A (zh) * 2006-06-19 2009-08-05 株式会社Ntt都科摩 移动台装置和基站装置以及上行链路的调度请求发送方法
EP2096886A1 (fr) * 2008-02-29 2009-09-02 Nokia Siemens Networks Oy Mécanisme pour le signalement de l'attribution de ressources pour la connexion de communications
CN101541029A (zh) * 2009-04-27 2009-09-23 中兴通讯股份有限公司 载波聚合情况下测量参考信号的发送方法和装置
CN101801090A (zh) * 2009-02-05 2010-08-11 大唐移动通信设备有限公司 一种配置下行物理控制信道的方法、基站和用户终端

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1773927A (zh) * 2004-11-08 2006-05-17 上海贝尔阿尔卡特股份有限公司 流媒体业务的动态无线资源调度方法和设备
CN101502161A (zh) * 2006-06-19 2009-08-05 株式会社Ntt都科摩 移动台装置和基站装置以及上行链路的调度请求发送方法
WO2009029015A1 (fr) * 2007-08-24 2009-03-05 Teliasonera Ab Gestion de ressources dans un système de communication sans fil comprenant au moins un canal de planification
EP2096886A1 (fr) * 2008-02-29 2009-09-02 Nokia Siemens Networks Oy Mécanisme pour le signalement de l'attribution de ressources pour la connexion de communications
CN101801090A (zh) * 2009-02-05 2010-08-11 大唐移动通信设备有限公司 一种配置下行物理控制信道的方法、基站和用户终端
CN101541029A (zh) * 2009-04-27 2009-09-23 中兴通讯股份有限公司 载波聚合情况下测量参考信号的发送方法和装置

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013097120A1 (fr) * 2011-12-28 2013-07-04 富士通株式会社 Procédé et dispositif de mise en correspondance d'un espace de recherche d'un canal de commande en liaison descendante
US11160065B2 (en) 2011-12-28 2021-10-26 Fujitsu Limited Mapping method and apparatus for a search space of a physical downlink control channel
CN109863803A (zh) * 2016-09-21 2019-06-07 株式会社Ntt都科摩 用户终端和无线通信方法
JPWO2018056337A1 (ja) * 2016-09-21 2019-07-18 株式会社Ｎｔｔドコモ ユーザ端末及び無線通信方法
JP7046816B2 (ja) 2016-09-21 2022-04-04 株式会社Ｎｔｔドコモ 端末、無線通信方法、無線基地局及び無線通信システム
CN109863803B (zh) * 2016-09-21 2023-05-16 株式会社Ntt都科摩 用户终端和无线通信方法
WO2020125525A1 (fr) * 2018-12-18 2020-06-25 京信通信系统（中国）有限公司 Procédé et dispositif de détermination de type d'attribution de ressources

Similar Documents

Publication Publication Date Title
US20200236671A1 (en) Channelization Procedure for Implementing Persistent ACK/NACK and Scheduling Request
US9143289B2 (en) Multiple uplink control channel transmission with reduced cubic metric
US9025481B2 (en) Aperiodic CQI/PMI request in carrier aggregation
US20130128821A1 (en) Demodulation Reference Signal Arrangement For Uplink Coordinated Multi-Point Reception
EP2524557B1 (fr) Activation de porteuses composantes en agrégation de porteuses
AU2018206059A1 (en) Downlink Control Channel Monitoring
US10645700B2 (en) Communication apparatus and a method for communication
US20110205976A1 (en) UE Specific Signaling Carrier Indicator For Carrier Aggregation
US20110243090A1 (en) Downlink control and physical hybrid arq indicator channel (phich) configuration for extended bandwidth system
US20110222629A1 (en) Pre-coding for downlink control channel
CN111436123B (zh) 一种通信方法及装置
AU2019204282A1 (en) Allocation of communication resources for control signals in the uplink
US8873490B2 (en) Uplink control channel resource allocation for semi-persistent scheduling of user equipment
US11785607B2 (en) Method and apparatus for transmitting control information in wireless cellular communication system
WO2021140674A1 (fr) Terminal et procédé de communication
WO2011082539A1 (fr) Entrelacement d'espace de recherche pour programmation croisée dans une agrégation de porteuses
WO2010049584A1 (fr) Indice d'attribution de liaison descendante rétrocompatible
WO2021214920A1 (fr) Terminal
WO2011082531A1 (fr) Charge de données utiles d'informations de contrôle sur la liaison descendante ayant un certain format, compatible amont et supportant la programmation croisée
CN116137966A (zh) 终端、基站装置及接收方法
US20240032056A1 (en) Method and apparatus for transmitting control information in wireless cellular communication system
WO2021261199A1 (fr) Dispositif de communication
WO2021191982A1 (fr) Terminal
WO2022102669A1 (fr) Terminal
WO2022137570A1 (fr) Terminal, station de base et procédé de communication sans fil

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 10841883

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 10841883

Country of ref document: EP

Kind code of ref document: A1