WO2016169047A1 - Procédé et nœud de réseau pour attribution de ressources pdcch - Google Patents

Procédé et nœud de réseau pour attribution de ressources pdcch Download PDF

Info

Publication number
WO2016169047A1
WO2016169047A1 PCT/CN2015/077382 CN2015077382W WO2016169047A1 WO 2016169047 A1 WO2016169047 A1 WO 2016169047A1 CN 2015077382 W CN2015077382 W CN 2015077382W WO 2016169047 A1 WO2016169047 A1 WO 2016169047A1
Authority
WO
WIPO (PCT)
Prior art keywords
cce
weight
search space
ses
pdcch
Prior art date
Application number
PCT/CN2015/077382
Other languages
English (en)
Inventor
Kunpeng Qi
Anders Johansson
Bjorn Nordstrom
Ping Wu
Wei Zhao
Original Assignee
Telefonaktiebolaget Lm Ericsson (Publ)
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Telefonaktiebolaget Lm Ericsson (Publ) filed Critical Telefonaktiebolaget Lm Ericsson (Publ)
Priority to PCT/CN2015/077382 priority Critical patent/WO2016169047A1/fr
Publication of WO2016169047A1 publication Critical patent/WO2016169047A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
    • H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information

Definitions

  • the disclosure relates to communication technology, and more particularly, to a method and a network node for Physical Downlink Control Channel (PDCCH) resource allocation.
  • PDCCH Physical Downlink Control Channel
  • Orthogonal Frequency Division Multiplexing (OFDM) technique has been adopted in downlink (DL) .
  • DL downlink
  • one DL subframe has duration of 1ms and is divided into 12 or 14 OFDM symbols, depending on the subframe configuration.
  • one OFDM symbol consists of a number of sub-carriers, depending on channel bandwidth and configuration.
  • One OFDM symbol on one sub-carrier is referred to as a Resource Element (RE) .
  • RE Resource Element
  • shared channel resources are used in both DL and uplink (UL) .
  • shared channel resources including DL-SCH (Downlink Shared Channel) and UL-SCH (Uplink Shared Channel) , are controlled by a scheduler that allocates different portions of DL and UL shared channels to different User Equipments (UEs) for reception and transmission respectively.
  • UEs User Equipments
  • the allocations of the shared channel resources are signaled in a control region covering a few OFDM symbols at the beginning of each DL subframe.
  • the DL-SCH is transmitted in a data region covering the remaining OFDM symbols in each DL subframe.
  • the size of the control region is typically one, two or three OFDM symbols and is set per subframe.
  • Physical Downlink Control Channel carries control information and is transmitted in the control region of each subframe.
  • a PDCCH can be transmitted over an aggregation of one or more consecutive Control Channel Elements (CCEs) .
  • CCEs Control Channel Elements
  • One CCE corresponds to nine Resource Element Groups (REGs) each containing four REs. Accordingly, the number of REGs in the control region that are not allocated to Physical Control Format Indicator Channel (PCFICH) or Physical Hybrid Automatic Repeat Request (HARQ) Indicator Channel (PHICH) is denoted as N REG .
  • the CCEs available in the control region are numbered from 0 to N CCE -1, where PDCCH supports multiple formats as listed in Table 1 below.
  • a UE shall monitor a set of PDCCH candidates on one or more serving cells as configured via higher layer signaling for control information in each non-DRX (Discontinuous Reception) subframe by attempting to decode each of the PDCCH candidates in the set with all PDCCH formats.
  • Discontinuous Reception discontinuous Reception
  • the set of PDCCH candidates to be monitored constitute a search space, denoted as where k represents a subframe index and L ⁇ ⁇ 1, 2, 4, 8 ⁇ represents Aggregation Level (AL) , i.e., the number of CCEs included in a PDCCH candidate.
  • A Aggregation Level
  • An example of PDCCH candidates are listed in Table 2 below.
  • the indices of the CCEs included in a PDCCH candidate having an index m in the search space are given by:
  • n s is slot number within a radio frame
  • n RNTI is the value of Radio Network Temporary Identifier (RNTI) of the UE
  • SEs Scheduling Entities
  • SE refers to a UE or a common control channel, corresponding to the above UE-specific search space and common search space, respectively.
  • Resources (CCEs) can be allocated to an SE in accordance with the above Equation (1) . When it is desired to allocate resources to two or more SEs in a single subframe, these SEs’ search spaces may overlap, i.e., collide with, each other. One or more SEs may not be allocated with resources successfully due to such collision and have to wait in a scheduling queue to be scheduled in subsequent subframes.
  • Each SE may have its scheduling priority, depending on e.g., its traffic type and/or how long it has waited in the scheduling queue.
  • the SE having the highest scheduling priority first selects a PDCCH candidate (e.g., the one having the lowest CCE indices) from its search space, regardless of the search spaces of the remaining SEs’ in the scheduling queue.
  • Table 3 shows an exemplary PDCCH resource allocation. It is assumed here that there are three SEs, SE1, SE2 and SE3, to be scheduled in one single subframe and that SE1 has a higher scheduling priority than SE2, which in turn has a higher scheduling priority than SE3.
  • SE1 selects C1-1 first, which makes CCEs having indices 0 ⁇ 7 unavailable.
  • SE2 will not be allocated with any PDCCH resource since its entire search space has been occupied by SE1.
  • SE3 selects C3-1 for its PDCCH transmission.
  • the conventional PDCCH resource allocation scheme cannot achieve the optimal resource utilization since SE2 is not allocated with any PDCCH resource. Further, it does not allow an SE having a higher scheduling priority (e.g., SE2) to preempt another SE having a lower scheduling priority (e.g., SE3) .
  • SE2 a higher scheduling priority
  • SE3 a lower scheduling priority
  • a method for Physical Downlink Control Channel (PDCCH) resource allocation for a plurality of Scheduling Entities (SEs) in a control region comprises: determining, for each of the plurality of SEs, a search space consisting a number of PDCCH candidates each including at least one Control Channel Element (CCE) ; assigning, at least for each of other SEs than a first SE having a highest scheduling priority among the plurality of SEs, a SE weight associated with the SE to each CCE in the search space for the SE; calculating, at least for each CCE in the search space for the first SE, a CCE weight by summing up the SE weights assigned to the CCE over at least the other SEs; selecting, for the first SE, one PDCCH candidate based on the CCE weights calculated for the respective CCEs in the search space for the first SE.
  • CCE Control Channel Element
  • the SE weight associated with each SE is dependent on at least one of a size of the search space for the SE and a scheduling priority of the SE.
  • the SE weight associated with an SE having a smaller size of search space is higher than that associated with an SE having a larger size of search space.
  • the step of selecting comprises: selecting, for the first SE, one PDCCH candidate with a smallest sum of CCE weights among the PDCCH candidates in the search space for the first SE.
  • the SE weight associated with each SE is further modified by a factor dependent on a scheduling priority of the SE.
  • the factor for modifying the SE weight of an SE having a higher scheduling priority is larger than the factor for modifying the SE weight of an SE having a lower scheduling priority.
  • the SE weight associated with an SE having a higher scheduling priority is higher than that associated with an SE having a lower scheduling priority.
  • the step of selecting comprises: selecting, for the first SE, one PDCCH candidate with a smallest sum of CCE weights among the PDCCH candidates in the search space for the first SE.
  • the method further comprises: removing the first SE from the plurality of SEs and removing the CCEs included in the selected one PDCCH candidate from the control region.
  • the method further comprises: calculating, for each of the remaining CCEs in search space for a second SE having a highest scheduling priority among the remaining SEs, a CCE weight by summing up the weights assigned to the CCE over the remaining SEs or over the remaining SEs other than the second SE.
  • the step of calculating comprises: calculating, for each CCE in the control region, a CCE weight by summing up the SE weights assigned to the CCE over the other SEs.
  • the method further comprises: updating the CCE weight for each of the remaining CCEs in the control region by subtracting from the CCE weight the SE weight associated with a second SE having a highest scheduling priority among the remaining SEs.
  • the step of assigning comprises: assigning, for each of the plurality of SEs, a SE weight associated with the SE to each CCE in the search space for the SE.
  • the step of calculating comprises: calculating, for each CCE in the control region, a CCE weight by summing up the SE weights assigned to the CCE over the plurality of SEs.
  • the method further comprises: updating the CCE weight for each of the remaining CCEs in the control region by subtracting from the CCE weight the SE weight associated with the first SE.
  • each SE is associated with a User Equipment (UE) or a common control channel.
  • the step of determining comprises: determining for each UE a UE-specific search space; or determining for each common control channel a common search space.
  • a network node for Physical Downlink Control Channel (PDCCH) resource allocation for a plurality of Scheduling Entities (SEs) in a control region comprises: a determining unit configured to determine, for each of the plurality of SEs, a search space consisting a number of PDCCH candidates each including at least one Control Channel Element (CCE) ; an assigning unit configured to assign, at least for each of other SEs than a first SE having a highest scheduling priority among the plurality of SEs, a SE weight associated with the SE to each CCE in the search space for the SE; a calculating unit configured to calculate, at least for each CCE in the search space for the first SE, a CCE weight by summing up the SE weights assigned to the CCE over at least the other SEs; a selecting unit configured to select, for the first SE, one PDCCH candidate based on the CCE weights calculated for the respective CCEs in the search space for the first SE.
  • CCE Control Channel Element
  • an SE weight is introduced into resource allocation for a plurality of SEs in a control region.
  • an SE weight can be assigned to each CCE in the search space for each SE.
  • a CCE weight can be calculated for each CCE in the search space for an SE having a highest scheduling priority based on the assigned SE weights.
  • a PDCCH candidate is selected for that SE based on the calculated CCE weights. In this way, when selecting the PDCCH candidate for the SE having the highest scheduling priority, the SE weights of the other SEs can be considered to increase the probability that the other SEs will be allocated with PDCCH resources, thereby improving the resource utilization in the control region.
  • Fig. 1 is a flowchart illustrating a method for PDCCH resource allocation according to an embodiment of the present disclosure
  • Fig. 2 is a block diagram of a network node for PDCCH resource allocation according to an embodiment of the present disclosure.
  • Fig. 3 is a block diagram of a network node for PDCCH resource allocation according to another embodiment of the present disclosure.
  • Fig. 1 is a flowchart illustrating a method 100 for PDCCH resource allocation according to an embodiment of the present disclosure.
  • the method 100 can be applied in a network node (e.g., an evolved NodeB (eNB) ) to allocate PDCCH resources for a plurality of SEs in a control region of a subframe.
  • a network node e.g., an evolved NodeB (eNB)
  • eNB evolved NodeB
  • eNB evolved NodeB
  • SE1 has a higher scheduling priority than SE2, which in turn has a higher scheduling priority than SE3.
  • the method 100 will be explained with reference to the following exemplary schemes.
  • the method 100 according to this scheme includes the following steps.
  • a search space consisting a number of PDCCH candidates each including at least one CCE.
  • the determination can be made in accordance with the above Equation (1) .
  • a UE-specific search space can be determined for the UE.
  • a common search space can be determined for the common control channel.
  • an SE weight associated with that SE is assigned to each CCE in the search space for that SE.
  • the SE weight associated with each SE can be dependent on a size of the search space for the SE.
  • the SE weight associated with an SE having a smaller size of search space can be higher than that associated with an SE having a larger size of search space, or vice versa.
  • the sizes of the search spaces for SE1, SE2 and SE3 are 16, 6 and 12, respectively.
  • the SE weights associated with SE1, SE2 and SE3 can be 1, 4 and 2, respectively.
  • a CCE weight is calculated by summing up the SE weights assigned to the CCE over SE1, SE2 and SE3, as shown in Table 4 below.
  • one PDCCH candidate is selected for SE1 based on the CCE weights calculated for the respective CCEs in the search space for SE1.
  • step S120 if in the step S120 the SE weight associated with an SE having a smaller size of search space is lower than that associated with an SE having a larger size of search space, one PDCCH candidate with a largest sum of CCE weights among the PDCCH candidates in the search space for SE1 would be selected in the step S140.
  • the same also applies to the schemes described hereinafter.
  • SE1 can be removed from the list of SEs that are to be allocated with PDCCH resources in the control region and the CCEs included in the selected PDCCH candidate C1-2 can be removed from the control region. Then, for each of the remaining CCEs in search space for the SE having the highest scheduling priority among the remaining SEs (i.e., SE2) , a CCE weight is calculated by summing up the weights assigned to the CCE over the remaining SEs (i.e., SE2 and SE3) . This is shown in Table 5 below.
  • one PDCCH candidate with a smallest sum of CCE weights among the PDCCH candidates in the search space for SE2 can be selected.
  • each of the PDCCH candidates C2-1 ⁇ C2-6 has the same CCE weight of 4, any one of them can be selected, e.g., randomly, for SE2.
  • the PDCCH candidate with the lowest CCE index i.e., C2-1
  • SE2 can be removed and the CCEs included in the selected PDCCH candidate C2-1 can be removed from the control region.
  • the only remaining SE is SE3. This is shown in Table 6 below.
  • one PDCCH candidate with a smallest sum of CCE weights among the PDCCH candidates in the search space for SE3 can be selected.
  • each of the PDCCH candidates C3-5 ⁇ C3-6 has the same CCE weight of 2, any one of them can be selected, e.g., randomly, for SE3.
  • the PDCCH candidate with the lowest CCE index i.e., C3-5
  • SE1, SE2 and SE3 are allocated with PDCCH candidates C1-2, C2-1, C3-5, respectively.
  • the resource utilization is improved as all the SEs have been allocated with PDCCH resources. Since an SE having a smaller size of search space is assigned with a higher SE weight and a PDCCH candidate with a smallest sum of CCE weights is selected (or vice versa) , the probability that more SEs will be allocated with PDCCH resources can be increased.
  • the SE weight for SE1 is not considered in the calculation of the CCE weights, it is possible that the SE weight for SE1 is not assigned to each CCE in the search space for SE1. That is, in the step S120, only for each of SE2 and SE3, a SE weight associated with the SE is assigned to each CCE in the search space for the SE. In this case, it is even possible that SE1 does not have its associated SE weight.
  • SE1 can be removed from the list of SEs that are to be allocated with PDCCH resources in the control region and the CCEs included in the selected PDCCH candidate C1-2 can be removed from the control region. Then, for each of the remaining CCEs in search space for the SE having the highest scheduling priority among the remaining SEs (i.e., SE2) , a CCE weight is calculated by summing up the weights assigned to the CCE over the remaining SE other than SE2 (i.e., SE3) . This is shown in Table 8 below. The example is only for generality that the search spaces of SE2 and SE3 are not partly overlapping.
  • one PDCCH candidate with a smallest sum of CCE weights among the PDCCH candidates in the search space for SE2 can be selected.
  • each of the PDCCH candidates C2-1 ⁇ C2-6 has the same CCE weight of 0 (in this case, since no SE weight for SE3 is assigned to CCE 1 ⁇ 6, this SE weight can be considered as 0) , any one of them can be selected for SE2.
  • the PDCCH candidate with the lowest CCE index i.e., C2-1
  • SE2 can be removed and the CCEs included in the selected PDCCH candidate C2-1 can be removed from the control region.
  • the only remaining SE is SE3. This is shown in Table 9 below.
  • one PDCCH candidate with a smallest sum of CCE weights among the PDCCH candidates in the search space for SE3 can be selected.
  • each of the PDCCH candidates C3-5 ⁇ C3-6 has the same CCE weight of 0 (in this case, since there is no other remaining SE, the CCE weight can be considered as 0)
  • any one of them can be selected for SE3.
  • the PDCCH candidate with the lowest CCE index i.e., C3-5
  • a CCE weight is calculated by summing up the SE weights assigned to the CCE over SE1, SE2 and SE3, as shown in Table 10 below.
  • the difference from Scheme I is that the CCE weights of CCE 16 ⁇ 19 are calculated (as opposed to Table 4) .
  • one PDCCH candidate is selected for SE1 based on the CCE weights calculated for the respective CCEs in the search space for SE1.
  • SE1 can be removed from the list of SEs that are to be allocated with PDCCH resources in the control region and the CCEs included in the selected PDCCH candidate C1-2 can be removed from the control region. Then, the CCE weight for each of the remaining CCEs in the control region can be updated by subtracting from the CCE weight the SE weight associated with SE1. This is shown in Table 11 below. It can be seen that Table 11 differs from Table 5 in that the CCE weight has been calculated for each of the remaining CCEs, including CCEs 0, 7 and 16 ⁇ 19.
  • one PDCCH candidate with a smallest sum of CCE weights among the PDCCH candidates in the search space for SE2 can be selected.
  • each of the PDCCH candidates C2-1 ⁇ C2-6 has the same CCE weight of 4, any one of them can be selected for SE2.
  • the PDCCH candidate with the lowest CCE index i.e., C2-1
  • C2-1 the lowest CCE index
  • SE2 can be removed and the CCEs included in the selected PDCCH candidate C2-1 can be removed from the control region.
  • the only remaining SE is SE3. This is shown in Table 12 below.
  • one PDCCH candidate with a smallest sum of CCE weights among the PDCCH candidates in the search space for SE3 can be selected.
  • each of the PDCCH candidates C3-5 ⁇ C3-6 has the same CCE weight of 2, any one of them can be selected for SE3.
  • the PDCCH candidate with the lowest CCE index i.e., C3-5
  • the SE weight for SE1 is not considered in the calculation of the CCE weights, it is possible that the SE weight for SE1 is not assigned to each CCE in the search space for SE1. That is, in the step S120, only for each of SE2 and SE3, a SE weight associated with the SE is assigned to each CCE in the search space for the SE. In this case, it is even possible that SE1 does not have its associated SE weight.
  • SE1 can be removed from the list of SEs that are to be allocated with PDCCH resources in the control region and the CCEs included in the selected PDCCH candidate C1-2 can be removed from the control region. Then, the CCE weight for each of the remaining CCEs in the control region can be updated by subtracting from the CCE weight the SE weight associated with SE2. This is shown in Table 14 below.
  • one PDCCH candidate with a smallest sum of CCE weights among the PDCCH candidates in the search space for SE2 can be selected.
  • each of the PDCCH candidates C2-1 ⁇ C2-6 has the same CCE weight of 0, any one of them can be selected for SE2.
  • the PDCCH candidate with the lowest CCE index i.e., C2-1
  • SE2 can be removed and the CCEs included in the selected PDCCH candidate C2-1 can be removed from the control region.
  • the CCE weight for each of the remaining CCEs in the control region can be updated by subtracting from the CCE weight the SE weight associated with SE3. This is shown in Table 15 below.
  • one PDCCH candidate with a smallest sum of CCE weights among the PDCCH candidates in the search space for SE3 can be selected.
  • each of the PDCCH candidates C3-5 ⁇ C3-6 has the same CCE weight of 0, any one of them can be selected for SE3.
  • the PDCCH candidate with the lowest CCE index i.e., C3-5
  • the SE weight associated with an SE having a higher scheduling priority can be higher than that associated with an SE having a lower scheduling priority, or vice versa.
  • the SE weights associated with SE1, SE2 and SE3 can be 4, 2 and 1, respectively.
  • a CCE weight can be calculated as shown in Table 16 below.
  • one PDCCH candidate is selected for SE1 based on the CCE weights calculated for the respective CCEs in the search space for SE1.
  • SE1 can be removed from the list of SEs that are to be allocated with PDCCH resources in the control region and the CCEs included in the selected PDCCH candidate C1-2 can be removed from the control region. Then, for each of the remaining CCEs in search space for the SE having the highest scheduling priority among the remaining SEs (i.e., SE2) , a CCE weight is calculated by summing up the weights assigned to the CCE over the remaining SEs (i.e., SE2 and SE3) . This is shown in Table 17 below.
  • one PDCCH candidate with a smallest sum of CCE weights among the PDCCH candidates in the search space for SE2 can be selected.
  • each of the PDCCH candidates C2-1 ⁇ C2-6 has the same CCE weight of 2, any one of them can be selected for SE2.
  • the PDCCH candidate with the lowest CCE index i.e., C2-1
  • C2-1 the lowest CCE index
  • SE2 can be removed and the CCEs included in the selected PDCCH candidate C2-1 can be removed from the control region.
  • the only remaining SE is SE3. This is shown in Table 18 below.
  • one PDCCH candidate with a smallest sum of CCE weights among the PDCCH candidates in the search space for SE3 can be selected.
  • each of the PDCCH candidates C3-5 ⁇ C3-6 has the same CCE weight of 1, any one of them can be selected for SE3.
  • the PDCCH candidate with the lowest CCE index i.e., C3-5
  • SE1, SE2 and SE3 are allocated with PDCCH candidates C1-2, C2-1, C3-5, respectively.
  • the resource utilization is improved as all the SEs have been allocated with PDCCH resources.
  • an SE having a higher scheduling priority is assigned with a higher SE weight and a PDCCH candidate with a smallest sum of CCE weights is selected (or vice versa) , the probability that an SE having a higher scheduling priority is allocated with PDCCH resources can be increased when compared with an SE having a lower scheduling priority.
  • the SE weight associated with each SE can be dependent on both a size of the search space for the SE and a scheduling priority of the SE.
  • the SE weight associated with each SE can be further modified by a factor dependent on a scheduling priority of the SE.
  • the factor for modifying the SE weight of an SE having a higher scheduling priority is larger than the factor for modifying the SE weight of an SE having a lower scheduling priority. In this way, if two SEs have the same size of search space but different scheduling priority, the probability that an SE having a higher scheduling priority is allocated with PDCCH resources can be increased when compared with an SE having a lower scheduling priority.
  • Fig. 2 is a block diagram of a network node 200 for PDCCH resource allocation for a plurality of SEs in a control region according to an embodiment of the present disclosure.
  • the network node 200 can be e.g., an eNB.
  • the network node 200 includes a determining unit 210 configured to determine, for each of the plurality of SEs, a search space consisting a number of PDCCH candidates each including at least one Control Channel Element (CCE) .
  • the method node 200 further includes an assigning unit 220 configured to assign, at least for each of other SEs than a first SE having a highest scheduling priority among the plurality of SEs, a SE weight associated with the SE to each CCE in the search space for the SE.
  • the method node 200 further includes a calculating unit 230 configured to calculate, at least for each CCE in the search space for the first SE, a CCE weight by summing up the SE weights assigned to the CCE over at least the other SEs.
  • the method node 200 further includes a selecting unit 240 configured to select, for the first SE, one PDCCH candidate based on the CCE weights calculated for the respective CCEs in the search space for the first SE.
  • the SE weight associated with each SE is dependent on at least one of a size of the search space for the SE and a scheduling priority of the SE.
  • the SE weight associated with an SE having a smaller size of search space is higher than that associated with an SE having a larger size of search space.
  • the selecting unit 240 is configured to select, for the first SE, one PDCCH candidate with a smallest sum of CCE weights among the PDCCH candidates in the search space for the first SE.
  • the SE weight associated with each SE is further modified by a factor dependent on a scheduling priority of the SE.
  • the factor for modifying the SE weight of an SE having a higher scheduling priority is larger than the factor for modifying the SE weight of an SE having a lower scheduling priority.
  • the SE weight associated with an SE having a higher scheduling priority is higher than that associated with an SE having a lower scheduling priority.
  • the selecting unit 240 is configured to select, for the first SE, one PDCCH candidate with a smallest sum of CCE weights among the PDCCH candidates in the search space for the first SE.
  • the calculating unit 230 is further configured to remove the first SE from the plurality of SEs and remove the CCEs included in the selected one PDCCH candidate from the control region.
  • the calculating unit 230 is further configured to calculate, for each of the remaining CCEs in search space for a second SE having a highest scheduling priority among the remaining SEs, a CCE weight by summing up the weights assigned to the CCE over the remaining SEs or over the remaining SEs other than the second SE.
  • the calculating unit 230 is further configured to calculate, for each CCE in the control region, a CCE weight by summing up the SE weights assigned to the CCE over the other SEs, and to update the CCE weight for each of the remaining CCEs in the control region by subtracting from the CCE weight the SE weight associated with a second SE having a highest scheduling priority among the remaining SEs.
  • the assigning unit 220 is configured to assign, for each of the plurality of SEs, a SE weight associated with the SE to each CCE in the search space for the SE.
  • the calculating unit 230 is configured to calculate, for each CCE in the control region, a CCE weight by summing up the SE weights assigned to the CCE over the plurality of SEs, and to update the CCE weight for each of the remaining CCEs in the control region by subtracting from the CCE weight the SE weight associated with the first SE.
  • each SE is associated with a User Equipment (UE) or a common control channel.
  • the determining unit 210 is configured to determine for each UE a UE-specific search space, or to determine for each common control channel a common search space.
  • Each of the units 210-240 can be implemented as a pure hardware solution or as a combination of software and hardware, e.g., by one or more of: a processor or a micro processor and adequate software and memory for storing of the software, a Programmable Logic Device (PLD) or other electronic component (s) or processing circuitry configured to perform the actions described above, and illustrated, e.g., in Fig. 1.
  • a processor or a micro processor and adequate software and memory for storing of the software e.g., a Programmable Logic Device (PLD) or other electronic component (s) or processing circuitry configured to perform the actions described above, and illustrated, e.g., in Fig. 1.
  • PLD Programmable Logic Device
  • Fig. 3 is a block diagram a block diagram of a network node 300 according to another embodiment of the present disclosure.
  • the network node 300 is e.g., an eNB.
  • the network node 3300 includes a transceiver 310, a processor 320 and a memory 330.
  • the memory 330 contains instructions executable by the processor 320 whereby the network node 300 is operative to allocate Physical Downlink Control Channel (PDCCH) resource for a plurality of Scheduling Entities (SEs) in a control region by: determining, for each of the plurality of SEs, a search space consisting a number of PDCCH candidates each including at least one Control Channel Element (CCE) ; assigning, at least for each of other SEs than a first SE having a highest scheduling priority among the plurality of SEs, a SE weight associated with the SE to each CCE in the search space for the SE; calculating, at least for each CCE in the search space for the first SE, a CCE weight by summing up the SE weights assigned to the CCE over at least the other SEs; selecting, for the first SE, one PDCCH candidate based on the CCE weights calculated for the respective CCEs in the
  • the present disclosure also provides at least one computer program product in the form of a non-volatile or volatile memory, e.g., an Electrically Erasable Programmable Read-Only Memory (EEPROM) , a flash memory and a hard drive.
  • the computer program product includes a computer program.
  • the computer program includes: code/computer readable instructions, which when executed by the processor 320 causes the network 300 to perform the actions, e.g., of the procedure described earlier in conjunction with Fig. 1.
  • the computer program product may be configured as a computer program code structured in computer program modules.
  • the computer program modules could essentially perform the actions of the flow illustrated in Fig. 1.
  • the processor may be a single CPU (Central processing unit) , but could also comprise two or more processing units.
  • the processor may include general purpose microprocessors; instruction set processors and/or related chips sets and/or special purpose microprocessors such as Application Specific Integrated Circuit (ASICs) .
  • the processor may also comprise board memory for caching purposes.
  • the computer program may be carried by a computer program product connected to the processor.
  • the computer program product may comprise a computer readable medium on which the computer program is stored.
  • the computer program product may be a flash memory, a Random-access memory (RAM) , a Read-Only Memory (ROM) , or an EEPROM, and the computer program modules described above could in alternative embodiments be distributed on different computer program products in the form of memories.

Abstract

La présente invention concerne un procédé (100) permettant une attribution de ressources PDCCH pour une pluralité d'entités de programmation (SE) dans une région de commande. Le procédé (100) consiste à : déterminer (S110), pour chaque SE de la pluralité de SE, un espace de recherche constitué d'un certain nombre de candidats PDCCH comprenant chacun au moins un élément de canal de commande (CCE); attribuer (S120), au moins à chaque SE de la pluralité de SE autre qu'une première SE présentant une priorité de programmation la plus élevée, une pondération de SE associée à la SE à chaque CCE dans l'espace de recherche pour la SE; calculer (S130), au moins pour chaque CCE dans l'espace de recherche pour la première SE, une pondération de CCE en additionnant les pondérations de SE attribuées au CCE sur au moins les autres SE; sélectionner (S140), pour la première SE, un candidat PDCCH sur la base des pondérations de CCE calculées pour les CCE respectifs dans l'espace de recherche pour la première SE.
PCT/CN2015/077382 2015-04-24 2015-04-24 Procédé et nœud de réseau pour attribution de ressources pdcch WO2016169047A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2015/077382 WO2016169047A1 (fr) 2015-04-24 2015-04-24 Procédé et nœud de réseau pour attribution de ressources pdcch

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2015/077382 WO2016169047A1 (fr) 2015-04-24 2015-04-24 Procédé et nœud de réseau pour attribution de ressources pdcch

Publications (1)

Publication Number Publication Date
WO2016169047A1 true WO2016169047A1 (fr) 2016-10-27

Family

ID=57143695

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/077382 WO2016169047A1 (fr) 2015-04-24 2015-04-24 Procédé et nœud de réseau pour attribution de ressources pdcch

Country Status (1)

Country Link
WO (1) WO2016169047A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106658671A (zh) * 2017-01-11 2017-05-10 广东美的制冷设备有限公司 一种连接无线网络的方法及装置
WO2018171353A1 (fr) * 2017-03-24 2018-09-27 中兴通讯股份有限公司 Procédé et dispositif de détermination d'espace de recherche de canal de commande et support de stockage informatique
CN110149181A (zh) * 2018-02-12 2019-08-20 维沃移动通信有限公司 搜索空间信道估计数的分配方法和终端设备
EP3751922A4 (fr) * 2018-02-11 2021-03-31 Vivo Mobile Communication Co., Ltd. Procédé et dispositif pour déterminer des informations de détection dans un espace de recherche

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009116824A1 (fr) * 2008-03-20 2009-09-24 Lg Electronics Inc. Surveillance de canal de commande dans un système de communication sans fil
US20130201923A1 (en) * 2012-02-07 2013-08-08 Telefonaktiebolaget L M Ericsson (Publ) Allocating control channel elements to downlink control channels
US20140185540A1 (en) * 2013-01-03 2014-07-03 Qualcomm Incorporated Enb pdcch implementation to avoid ambiguous dci information

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009116824A1 (fr) * 2008-03-20 2009-09-24 Lg Electronics Inc. Surveillance de canal de commande dans un système de communication sans fil
US20130201923A1 (en) * 2012-02-07 2013-08-08 Telefonaktiebolaget L M Ericsson (Publ) Allocating control channel elements to downlink control channels
US20140185540A1 (en) * 2013-01-03 2014-07-03 Qualcomm Incorporated Enb pdcch implementation to avoid ambiguous dci information

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106658671A (zh) * 2017-01-11 2017-05-10 广东美的制冷设备有限公司 一种连接无线网络的方法及装置
WO2018171353A1 (fr) * 2017-03-24 2018-09-27 中兴通讯股份有限公司 Procédé et dispositif de détermination d'espace de recherche de canal de commande et support de stockage informatique
EP3751922A4 (fr) * 2018-02-11 2021-03-31 Vivo Mobile Communication Co., Ltd. Procédé et dispositif pour déterminer des informations de détection dans un espace de recherche
US11146424B2 (en) 2018-02-11 2021-10-12 Vivo Mobile Communication Co., Ltd. Method and device for determining detection information about search spaces
CN110149181A (zh) * 2018-02-12 2019-08-20 维沃移动通信有限公司 搜索空间信道估计数的分配方法和终端设备
US11412499B2 (en) 2018-02-12 2022-08-09 Vivo Mobile Communication Co., Ltd. Method of allocating channel estimation number for search space and terminal device

Similar Documents

Publication Publication Date Title
US10231226B2 (en) Allocating a control channel for carrier aggregation
EP2805438B1 (fr) Conception de canal de commande de liaison descendante physique amélioré (e-pdcch) pour réduire un décodage aveugle
US20230354316A1 (en) Method and apparatus for short pdcch operation
JP5162416B2 (ja) 無線基地局
JP2021536179A (ja) 情報決定方法およびデバイスならびに記憶媒体
US7873011B2 (en) Apparatus, method and computer program product for bi-directional resource allocation to decrease signaling for retransmissions
US20120201230A1 (en) Method for Transmitting Physical Downlink Control Channel (PDCCH) Information, Method for Determining PDCCH Search Space and Devices Thereof
WO2016169047A1 (fr) Procédé et nœud de réseau pour attribution de ressources pdcch
US8724575B2 (en) Method and device for allocating control channel element resources
KR20150063118A (ko) 채널 검출 방법 및 사용자 장비
EP3198961B1 (fr) Procédé et station de base pour planification d'équipement utilisateur, et procédé et équipement utilisateur pour transmission harq
US10306605B2 (en) Allocation of uplink control channel resources from mapped resource region
WO2017129035A1 (fr) Procédé et appareil de transmission et de détection d'informations de contrôle en liaison descendante
WO2018233566A1 (fr) Procédé et appareil permettant de déterminer une ressource de canal de commande de liaison descendante, équipement utilisateur et station de base
WO2014043890A1 (fr) Procédé pour la transmission de données de contrôle, équipement d'utilisateur et station de base
WO2018000940A1 (fr) Procédé d'attribution de ressources pour canal de commande de liaison montante physique, station de base, et support de stockage
CN109842867B (zh) 一种eMTC PUCCH资源预留方法及装置
WO2013139011A1 (fr) Procédé et dispositif pour cartographier un espace de recherche d'un canal de commande sur la liaison descendante
WO2017193921A1 (fr) Procédé et dispositif d'envoi et de détection d'informations de planification de liaison montante et de liaison descendante

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

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

Country of ref document: EP

Kind code of ref document: A1