CN111970104A - Downlink control information transmission method, device and equipment - Google Patents

Downlink control information transmission method, device and equipment Download PDF

Info

Publication number
CN111970104A
CN111970104A CN202011135743.1A CN202011135743A CN111970104A CN 111970104 A CN111970104 A CN 111970104A CN 202011135743 A CN202011135743 A CN 202011135743A CN 111970104 A CN111970104 A CN 111970104A
Authority
CN
China
Prior art keywords
scheduled
pdcch candidate
search space
determining
candidate sets
Prior art date
Legal status (The legal status 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 status listed.)
Pending
Application number
CN202011135743.1A
Other languages
Chinese (zh)
Inventor
丁月友
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou H3C Technologies Co Ltd
New H3C Technologies Co Ltd
Original Assignee
Hangzhou H3C Technologies Co Ltd
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 Hangzhou H3C Technologies Co Ltd filed Critical Hangzhou H3C Technologies Co Ltd
Priority to CN202011135743.1A priority Critical patent/CN111970104A/en
Publication of CN111970104A publication Critical patent/CN111970104A/en
Pending legal-status Critical Current

Links

Images

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
    • H04L5/0053—Allocation of signaling, i.e. of overhead other than pilot signals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0289—Congestion control

Landscapes

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

Abstract

The application provides a method, a device and equipment for transmitting downlink control information, wherein the method comprises the following steps: determining a special search space matched with UE to be scheduled in a scheduling subframe, wherein the special search space comprises a plurality of PDCCH candidate sets, and different PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe; selecting a target PDCCH candidate set from the plurality of PDCCH candidate sets of the dedicated search space; and sending downlink control information to the UE to be scheduled through the target PDCCH candidate set. By the technical scheme of the embodiment of the application, the congestion condition of the special search space is effectively inhibited, the congestion probability of the special search space of each UE is reduced, the PDCCH resource utilization rate is improved, and the problem of PDCCH resource congestion is solved.

Description

Downlink control information transmission method, device and equipment
Technical Field
The present application relates to the field of communications, and in particular, to a method, an apparatus, and a device for transmitting downlink control information.
Background
In an LTE (Long Term Evolution) network, a network side device (e.g., a base station) schedules uplink data and/or Downlink data of each UE (User Equipment), stores scheduling information (e.g., occupied time-frequency resources, modulation and coding scheme, power adjustment, etc.) in DCI (Downlink Control Channel), and transmits the DCI to the UE through PDCCH (Physical Downlink Control Channel) resources. And the UE receives the DCI through the PDCCH resources and correctly receives downlink data or transmits uplink data based on scheduling information in the DCI.
In order to implement the above process, the network side device allocates PDCCH resources to the UE to be scheduled in each scheduling subframe, and the network side device can only send DCI to the UE to be scheduled through the PDCCH resources. However, during the PDCCH resource allocation process, a PDCCH resource collision situation may occur, that is, the PDCCH resource of a certain UE is occupied by other UEs, and the PDCCH resource collision situation is referred to as PDCCH resource congestion. For example, the PDCCH resource allocated for UE1 is the same as the PDCCH resource allocated for UE2, which results in the PDCCH resource of UE1 colliding with the PDCCH resource of UE2, UE1 or UE2 cannot be scheduled in the current subframe, PDCCH resource allocation fails, and scheduling can only be continuously attempted in the next scheduling subframe.
Disclosure of Invention
The application provides a downlink control information transmission method, which is applied to network side equipment and comprises the following steps:
determining a special search space matched with UE to be scheduled in a scheduling subframe, wherein the special search space comprises a plurality of PDCCH candidate sets, and different PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe;
selecting a target PDCCH candidate set from the plurality of PDCCH candidate sets of the dedicated search space;
and sending downlink control information to the UE to be scheduled through the target PDCCH candidate set.
The application provides a downlink control information transmission method, which is applied to UE to be scheduled and comprises the following steps:
determining a special search space matched with UE to be scheduled in a scheduling subframe, wherein the special search space comprises a plurality of PDCCH candidate sets, and different PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe;
and receiving downlink control information sent to the UE to be scheduled by the network side equipment based on the special search space.
The application provides a downlink control information transmission device, which is applied to network side equipment and comprises:
the determining module is used for determining a special search space matched with the UE to be scheduled in the scheduling subframe; wherein the dedicated search space comprises a plurality of PDCCH candidate sets, and different PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe; a selection module, configured to select a target PDCCH candidate set from the multiple PDCCH candidate sets in the dedicated search space; and the sending module is used for sending downlink control information to the UE to be scheduled through the target PDCCH candidate set.
The application provides a downlink control information transmission device, is applied to treating scheduling UE, includes:
the determining module is used for determining a special search space matched with the UE to be scheduled in the scheduling subframe; wherein the dedicated search space comprises a plurality of PDCCH candidate sets, and different PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe; and the receiving module is used for receiving the downlink control information sent to the UE to be scheduled by the network side equipment based on the special search space.
The application provides an electronic device, including: a processor and a machine-readable storage medium storing machine-executable instructions executable by the processor; the processor is configured to execute the machine executable instruction to implement the downlink control information transmission method.
A machine-readable storage medium having stored thereon machine-executable instructions which, when invoked and executed by a processor, cause the processor to implement the method of downlink control information transmission described above.
According to the technical scheme, in the embodiment of the application, when the special search space matched with the UE to be scheduled in the scheduling subframe is determined, the special search space comprises a plurality of PDCCH candidate sets, different PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe, namely, each PDCCH candidate set in the special search space is uniformly and discretely distributed in the whole PDCCH control domain, so that the congestion condition of the special search space is effectively inhibited, the congestion probability of the special search space of each UE is reduced, the utilization rate of PDCCH resources is improved, the problem of PDCCH resource congestion is solved, the timely scheduling of uplink and downlink data is ensured, the data transmission performance is effectively improved, the congestion problem of the special search space is not easy to occur in a multi-user scene, and the problem that some UEs cannot be scheduled in time is avoided.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments of the present application or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the present application, and other drawings can be obtained by those skilled in the art according to the drawings of the embodiments of the present application.
FIGS. 1 and 2 are schematic diagrams of a search space in one embodiment of the present application;
fig. 3 is a flowchart of a downlink control information transmission method according to an embodiment of the present application;
FIGS. 4 and 5 are schematic diagrams of a search space in one embodiment of the present application;
fig. 6 is a flowchart of a downlink control information transmission method according to an embodiment of the present application;
fig. 7 is a block diagram of a downlink control information transmission apparatus according to an embodiment of the present application;
fig. 8 is a block diagram of a downlink control information transmission apparatus according to an embodiment of the present application;
fig. 9 is a hardware configuration diagram of an electronic device according to an embodiment of the present application.
Detailed Description
The terminology used in the embodiments of the present application is for the purpose of describing particular embodiments only and is not intended to be limiting of the embodiments of the present application. As used in the examples and claims of this application, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. The term "and/or" as used herein is meant to encompass any and all possible combinations of one or more of the associated listed items.
It should be understood that although the terms first, second, third, etc. may be used in the embodiments of the present application to describe various information, the information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, the first information may also be referred to as second information, and similarly, the second information may also be referred to as first information, without departing from the scope of the embodiments of the present application. Depending on the context, moreover, the word "if" as used may be interpreted as "at … …" or "when … …" or "in response to a determination".
In an LTE network, a network device (e.g., a base station) schedules uplink data and/or downlink data of each UE, stores scheduling information (e.g., occupied time-frequency resources, modulation and coding scheme, power adjustment, etc.) in DCI, and transmits the DCI to the UE through a PDCCH resource. And the UE receives the DCI through the PDCCH resources and correctly receives downlink data or transmits uplink data based on scheduling information in the DCI.
In an LTE network, a minimum unit of a PDCCH resource is called a CCE (Control Channel Element), and an allocation range of the PDCCH resource is called a search space, where the search space includes a common search space and a dedicated search space, the common search space is mainly used for transmitting Control information related to cell-level common information (such as paging messages and broadcast messages), and the dedicated search space is mainly used for transmitting Control information related to uplink and downlink data of a UE. In summary, the PDCCH resource includes a common search space and a dedicated search space, the common search space is composed of a plurality of CCEs, and the dedicated search space is composed of a plurality of CCEs.
For example, the common search space may include a plurality of PDCCH candidate sets, each PDCCH candidate set including at least one CCE, the number of CCEs in a PDCCH candidate set being determined by an aggregation level, the aggregation level indicating the number of CCEs in the PDCCH candidate set. For example, the aggregation level of the common search space may be 4, and each PDCCH candidate set of the common search space includes 4 CCEs. As another example, the aggregation level of the common search space may be 8, with each PDCCH candidate set of the common search space including 8 CCEs.
For example, the dedicated search space may include a plurality of PDCCH candidate sets, each PDCCH candidate set may include at least one CCE, and the number of CCEs in a PDCCH candidate set is determined by an aggregation level. For example, the aggregation level of the dedicated search space may be 1, with each PDCCH candidate set of the dedicated search space including 1 CCE. For another example, the aggregation level of the dedicated search space may be 2, with each PDCCH candidate set of the dedicated search space including 2 CCEs. As another example, the aggregation level for the dedicated search space may be 4, with each PDCCH candidate set for the dedicated search space including 4 CCEs. As another example, the aggregation level for a dedicated search space may be 8, with each PDCCH candidate set for the dedicated search space including 8 CCEs.
Referring to fig. 1, assuming that the total number of CCEs available for the PDCCH control field of the scheduling subframe is 41, at an aggregation level of 1, the dedicated search space may include 6 PDCCH candidate sets, PDCCH candidate set 1 includes CCE9 (CCE 9 is used to represent the 10 th CCE of all CCEs), PDCCH candidate set 2 includes CCE10, PDCCH candidate set 3 includes CCE11, PDCCH candidate set 4 includes CCE12, PDCCH candidate set 5 includes CCE13, and PDCCH candidate set 6 includes CCE 14. When the aggregation level is 2, the dedicated search space may include 6 PDCCH candidate sets, PDCCH candidate set 1 includes CCE0 and CCE1, PDCCH candidate set 2 includes CCE2 and CCE3, PDCCH candidate set 3 includes CCE4 and CCE5, PDCCH candidate set 4 includes CCE6 and CCE7, PDCCH candidate set 5 includes CCE8 and CCE9, and PDCCH candidate set 6 includes CCE10 and CCE 11. At an aggregation level of 4, the dedicated search space may include 2 PDCCH candidate sets, PDCCH candidate set 1 includes CCE0, CCE1, CCE2 and CCE3, and PDCCH candidate set 2 includes CCE4, CCE5, CCE6 and CCE 7. When the aggregation level is 8, the dedicated search space may include 2 PDCCH candidate sets, PDCCH candidate set 1 includes CCE0, CCE1, CCE2, CCE3, CCE4, CCE5, CCE6, and CCE7, and PDCCH candidate set 2 includes CCE8, CCE9, CCE10, CCE11, CCE12, CCE13, CCE14, and CCE 15.
Referring to fig. 1, when the aggregation level is 4, the common search space includes 4 PDCCH candidate sets, PDCCH candidate set 1 includes CCE0, CCE1, CCE2 and CCE3, PDCCH candidate set 2 includes CCE4, CCE5, CCE6 and CCE7, PDCCH candidate set 3 includes CCE8, CCE9, CCE10 and CCE11, and PDCCH candidate set 4 includes CCE12, CCE13, CCE14 and CCE 15. When the aggregation level is 8, the common search space includes 2 PDCCH candidate sets, PDCCH candidate set 1 includes CCE0, CCE1, CCE2, CCE3, CCE4, CCE5, CCE6, and CCE7, and PDCCH candidate set 2 includes CCE8, CCE9, CCE10, CCE11, CCE12, CCE13, CCE14, and CCE 15.
As can be seen from fig. 1, the dedicated search space consists of multiple PDCCH candidate sets, and the multiple PDCCH candidate sets are consecutive CCE resources. For example, at an aggregation level of 1, 6 PDCCH candidate sets consist of consecutive CCEs 9-CCE14, at an aggregation level of 2, 6 PDCCH candidate sets consist of consecutive CCEs 0-CCE11, at an aggregation level of 4, 2 PDCCH candidate sets consist of consecutive CCEs 0-CCE7, and at an aggregation level of 8, 2 PDCCH candidate sets consist of consecutive CCEs 0-CCE 15.
Since a plurality of PDCCH candidate sets of the dedicated search space are continuous CCE resources, in an application scenario of multiple UEs, a situation of dedicated search space congestion (which may be referred to as PDCCH resource collision or PDCCH resource congestion) may occur, that is, a CCE resource corresponding to a dedicated search space of a certain UE is occupied by other UEs, so that a CCE resource corresponding to the dedicated search space cannot be allocated to the UE, the UE cannot be scheduled in a current scheduling subframe, and scheduling can be continuously attempted only in a next scheduling subframe.
For example, assuming that there are three UEs requiring scheduling, UE1, UE2, and UE3, and the aggregation levels of UE1, UE2, and UE3 are 2, 4, and 4, respectively, the dedicated search spaces of the three UEs are as shown in fig. 2.
Referring to fig. 2, a dedicated search space of a UE1 includes 6 PDCCH candidate sets, a PDCCH candidate set 11 includes CCE0 and CCE1, a PDCCH candidate set 12 includes CCE2 and CCE3, a PDCCH candidate set 13 includes CCE4 and CCE5, a PDCCH candidate set 14 includes CCE6 and CCE7, a PDCCH candidate set 15 includes CCE8 and CCE9, and a PDCCH candidate set 16 includes CCE10 and CCE 11. The dedicated search space of UE2 includes 2 PDCCH candidate sets, PDCCH candidate set 21 includes CCE4, CCE5, CCE6 and CCE7, and PDCCH candidate set 22 includes CCE8, CCE9, CCE10 and CCE 11. The dedicated search space of UE3 includes 2 PDCCH candidate sets, PDCCH candidate set 31 includes CCE0, CCE1, CCE2 and CCE3, and PDCCH candidate set 32 includes CCE4, CCE5, CCE6 and CCE 7.
In the above application scenario, assuming that UE1 selects PDCCH candidate set 11 or PDCCH candidate set 12 and UE2 selects PDCCH candidate set 21, since PDCCH candidate set 31 collides with PDCCH candidate set 11 or PDCCH candidate set 12 and PDCCH candidate set 32 collides with PDCCH candidate set 21, the dedicated search space of UE3 may be congested, PDCCH candidate set 31 or PDCCH candidate set 32 cannot be allocated to UE3, and UE3 cannot be scheduled in the current scheduling subframe.
Further, since the probability of selecting either PDCCH candidate set 11 or PDCCH candidate set 12 for UE1 is 1/3 and the probability of selecting PDCCH candidate set 21 for UE2 is 1/2, the probability that the dedicated search space of UE3 is congested is about 16.67% (i.e., 1/6). Referring to fig. 2, the total number of CCEs available in the PDCCH control field of the scheduling subframe is 41, that is, 41 CCEs are available, that is, CCE resources are sufficient, and if the dedicated search space of the UE3 is congested, CCE resources cannot be scheduled, resulting in low resource utilization.
In view of the above discovery, in the embodiment of the present application, multiple PDCCH candidate sets in a dedicated search space of a UE are discretely distributed at different positions of a scheduling subframe, that is, each PDCCH candidate set in the dedicated search space is uniformly and discretely distributed in the entire PDCCH control domain, which effectively suppresses a congestion situation of the dedicated search space, reduces a congestion probability of the dedicated search space of each UE, improves a PDCCH resource utilization rate, solves a PDCCH resource congestion problem, ensures timely scheduling of each UE, ensures timely scheduling of uplink and downlink data, effectively improves data transmission performance, effectively improves uplink and downlink transmission delay, is less prone to a congestion problem of the dedicated search space in a multi-user scenario, and avoids that some UEs cannot schedule in time. For a system based on an LTE network, such as LTE-M (a track traffic wireless communication private network system based on LTE), LTE-230 (an electric power wireless communication private network system based on LTE), and the like, service experience can be effectively improved.
The technical solutions of the embodiments of the present application will be described below with reference to specific embodiments.
An embodiment of the present application provides a Downlink Control Information (DCI) transmission method, which may be applied to a network side device (e.g., a base station, etc.), and is shown in fig. 3, and is a flowchart of the method, where the method may include:
step 301, determining a dedicated search space matched with the UE to be scheduled in the scheduling subframe, where the dedicated search space may include a plurality of PDCCH candidate sets, and different PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe, that is, different PDCCH candidate sets are not distributed at continuous positions of the scheduling subframe.
Exemplarily, the discrete distribution of different PDCCH candidate sets at different positions of the scheduling subframe refers to: instead of occupying contiguous CCE resources, different PDCCH candidate sets occupy non-contiguous CCE resources. For example, assuming that the dedicated search space includes 2 PDCCH candidate sets, if PDCCH candidate set 1 includes CCE0, CCE1, CCE2 and CCE3, PDCCH candidate set 2 does not include CCE4, CCE5, CCE6 and CCE7, but rather needs to be distributed discretely from PDCCH candidate set 1 at different positions of the scheduling subframe, for example, PDCCH candidate set 2 includes CCE16, CCE17, CCE18 and CCE 19.
For CCEs in the same PDCCH candidate set, the CCEs in the PDCCH candidate set may occupy consecutive CCE resources, for example, PDCCH candidate set 1 includes CCE0, CCE1, CCE2 and CCE3, and PDCCH candidate set 2 includes CCE16, CCE17, CCE18 and CCE 19.
In one possible embodiment, in order to discretely distribute different PDCCH candidate sets at different positions of a scheduling subframe, the following steps may be adopted when determining a dedicated search space (the dedicated search space includes a plurality of PDCCH candidate sets) in the scheduling subframe, which is matched with a UE to be scheduled (for the sake of convenience of differentiation, the UE to be scheduled is referred to as a UE to be scheduled herein). Of course, the following steps are only an example, and are not limited thereto, as long as different PDCCH candidate sets can be discretely distributed in different positions of the scheduling subframe.
Step 3011, determine the number of PDCCH candidate sets for the UE to be scheduled based on the aggregation level of the UE to be scheduled, where the number of PDCCH candidate sets is used to indicate that the UE to be scheduled has several PDCCH candidate sets.
For example, the aggregation level is used to indicate the number of CCEs in the PDCCH candidate set, and the network side device may determine the aggregation level of the UE to be scheduled, where the aggregation level may be 1, 2, 4, 8, and the like, and the determination manner is not limited as long as the network side device can determine the aggregation level of the UE to be scheduled.
For example, a mapping relationship between the aggregation level and the number of PDCCH candidate sets may be preconfigured, as shown in table 1, which is an example of the mapping relationship, based on the mapping relationship, after the aggregation level of the UE to be scheduled is obtained, the number of PDCCH candidate sets of the UE to be scheduled may be queried.
TABLE 1
Grade of polymerization PDCCH candidate set number
1 6
2 6
4 2
8 2
For example, if the aggregation level of the UE to be scheduled is 1, the number of PDCCH candidate sets of the UE to be scheduled is 6, if the aggregation level of the UE to be scheduled is 2, the number of PDCCH candidate sets of the UE to be scheduled is 6, if the aggregation level of the UE to be scheduled is 4, the number of PDCCH candidate sets of the UE to be scheduled is 2, and if the aggregation level of the UE to be scheduled is 8, the number of PDCCH candidate sets of the UE to be scheduled is 2.
Referring to table 2, as another example of the mapping relationship, in the common search space and the dedicated search space, different aggregation levels correspond to PDCCH candidate set numbers, and after the aggregation level of the UE to be scheduled is obtained, the PDCCH candidate set number of the UE to be scheduled may be queried based on the mapping relationship in table 2.
Figure DEST_PATH_IMAGE001
In table 2, the search space size indicates the sum of the number of CCEs in all PDCCH candidate sets, for example, when the aggregation level is 2, there are 6 PDCCH candidate sets in the dedicated search space, there are 2 CCEs in each PDCCH candidate set, and the sum of the number of CCEs in all PDCCH candidate sets is 12. When the aggregation level is 4, 2 PDCCH candidate sets exist in the dedicated search space, 4 CCEs exist in each PDCCH candidate set, the sum of the CCEs in all PDCCH candidate sets is 8, and so on.
Step 3012, determine a dedicated search space matched with the UE to be scheduled in the scheduling subframe based on the number of PDCCH candidate sets, where a plurality of PDCCH candidate sets included in the dedicated search space are discretely distributed at different positions of the scheduling subframe, that is, the plurality of PDCCH candidate sets are not distributed at consecutive positions of the scheduling subframe.
For example, the number of PDCCH candidate sets is used to indicate that the UE to be scheduled has several PDCCH candidate sets, and the network side device may discretely distribute the PDCCH candidate sets in different positions of the scheduling subframe.
For example, when the number of PDCCH candidate sets is 6, and each PDCCH candidate set includes 1 CCE, the network side device discretely distributes the 6 PDCCH candidate sets at different positions of the scheduling subframe, and N1 CCEs may exist between different PDCCH candidate sets, and N1 may be a positive integer, such as 1, 2, 3, and the like.
When the number of PDCCH candidate sets is 6 and each PDCCH candidate set includes 2 CCEs, the network side device discretely distributes the 6 PDCCH candidate sets at different positions of the scheduling subframe, and N2 CCEs may exist between different PDCCH candidate sets, where N2 may be a positive integer multiple of 2, such as 2, 4, 6, 8, and the like.
When the number of PDCCH candidate sets is 2 and each PDCCH candidate set includes 4 CCEs, the network side device discretely distributes the 2 PDCCH candidate sets at different positions of the scheduling subframe, and N3 CCEs may exist between different PDCCH candidate sets, and N3 may be a positive integer multiple of 4, such as 4, 8, 12, 16, and the like.
When the number of PDCCH candidate sets is 2 and each PDCCH candidate set includes 8 CCEs, the network side device discretely distributes the 2 PDCCH candidate sets at different positions of the scheduling subframe, and N4 CCEs may exist between different PDCCH candidate sets, and N4 may be a positive integer multiple of 8, such as 8, 16, and the like.
When determining the dedicated search space matched with the UE to be scheduled in the scheduling subframe based on the number of PDCCH candidate sets, the implementation is not limited as long as the plurality of PDCCH candidate sets of the dedicated search space are discretely distributed at different positions of the scheduling subframe. In one possible implementation manner, in order to discretely distribute the plurality of PDCCH candidate sets at different positions of the scheduling subframe, the network side device may determine, based on the aggregation level of the UE to be scheduled, the starting position parameter of the UE to be scheduled, the number of PDCCH candidate sets of the UE to be scheduled, the total number of control channel elements, the first count variable, and the second count variable, a dedicated search space in the scheduling subframe that matches the UE to be scheduled, so that the plurality of PDCCH candidate sets of the dedicated search space are discretely distributed at different positions of the scheduling subframe. Of course, the above manner is only an example, and the implementation is not limited.
For example, the dedicated search space matched with the UE to be scheduled in the scheduling subframe may be determined based on the aggregation level of the UE to be scheduled, the starting location parameter of the UE to be scheduled, the number of PDCCH candidate sets of the UE to be scheduled, the total number of control channel elements, the first counting variable, and a part of the second counting variable.
For another example, the dedicated search space matched with the UE to be scheduled in the scheduling subframe may be determined based on the aggregation level of the UE to be scheduled, the starting location parameter of the UE to be scheduled, the number of PDCCH candidate sets of the UE to be scheduled, the total number of control channel elements, some or all of the first counting variable and the second counting variable, and other parameters (without limitation on types of other parameters) other than the above parameters.
In a possible embodiment, based on the aggregation level of the UE to be scheduled, the starting location parameter of the UE to be scheduled, the number of PDCCH candidate sets of the UE to be scheduled, the total number of control channel elements, the first counting variable, the second counting variable, and other parameters, the dedicated search space matched with the UE to be scheduled in the scheduling subframe may be determined by the following formula (1), of course, the formula (1) is only an example, and is not limited thereto, as long as the plurality of PDCCH candidate sets of the dedicated search space are discretely distributed at different positions of the scheduling subframe.
Figure 667762DEST_PATH_IMAGE002
Formula (1)
For example, equation (1) may be referred to as a hash function for determining the dedicated search space, i.e., the position of the dedicated search space in the control domain of the scheduled subframe can be determined by the hash function.
In the above-mentioned formula (1),
Figure 81426DEST_PATH_IMAGE003
indicates an aggregation level of the UE to be scheduled, i.e. an aggregation level of a dedicated search space of the UE to be scheduled, which may be 1, 2, 4, 8, etc.
Figure 338970DEST_PATH_IMAGE004
The PDCCH candidate set number indicating the UE to be scheduled is determined according to the foregoing embodiment, and is related to the aggregation level of the UE to be scheduled, which is not repeated herein.
Figure 812677DEST_PATH_IMAGE005
Represents the total number of control channel elements, i.e., the total number of CCEs, which is the total number of CCEs of the control field of the scheduling subframe. The total number of CCEs, the bandwidth, the number of symbols (CFI) occupied by the control channel, the uplink and downlink subframe ratio, the RNTI (Radio Network temporary Identity) of the UE to be scheduled, and other parameters are related, and the determination method of the total number of CCEs is not limited. In TDD-LTE, for example, at 15M bandwidth,the CFI is equal to 2, the ratio of uplink subframes to downlink subframes is 1, the RNTI of the UE to be scheduled is 100, and the total number of the available CCEs is 41 when the scheduling subframes are frames No. 0.
Figure 391557DEST_PATH_IMAGE006
Represents a starting location parameter of the UE to be scheduled, and
Figure 343332DEST_PATH_IMAGE006
the determination may be based on a radio network temporary identity RNTI of the UE to be scheduled. Wherein, for a common search space,
Figure 19164DEST_PATH_IMAGE006
is 0, i.e., the starting position of the common search space starts from the first CCE of the control field of the scheduling subframe. For the dedicated search space to be used,
Figure 539138DEST_PATH_IMAGE007
，
Figure 995527DEST_PATH_IMAGE008
，
Figure 127825DEST_PATH_IMAGE009
，
Figure 720480DEST_PATH_IMAGE010
indicating the slot number.
Figure 145776DEST_PATH_IMAGE011
And
Figure 761566DEST_PATH_IMAGE012
are all fixed values, e.g.
Figure 55144DEST_PATH_IMAGE013
，
Figure 643251DEST_PATH_IMAGE014
Of course, the above values are only
Figure 364082DEST_PATH_IMAGE011
And
Figure 168965DEST_PATH_IMAGE012
examples of (2).
Figure 266234DEST_PATH_IMAGE015
RNTI indicating UE to be scheduled, as described above, known in the art
Figure 974427DEST_PATH_IMAGE015
And
Figure 538263DEST_PATH_IMAGE010
under the condition of (2), the initial position parameter of the UE to be scheduled can be determined
Figure 456541DEST_PATH_IMAGE006
I.e. determining the starting position of the dedicated search space of the UE to be scheduled.
Figure 967288DEST_PATH_IMAGE016
And
Figure 389042DEST_PATH_IMAGE017
representing counting variables, to be distinguished
Figure 105805DEST_PATH_IMAGE016
Is recorded as a first counting variable, will
Figure 245799DEST_PATH_IMAGE017
Is recorded as a second count variable, the first count variable
Figure 825816DEST_PATH_IMAGE016
Is a variable of the number of PDCCH candidate sets, i.e.
Figure 367656DEST_PATH_IMAGE016
Is determined based on the number of PDCCH candidate sets. If the number of PDCCH candidate sets is 6,
Figure 742137DEST_PATH_IMAGE016
is in the range of 0 to 5, i.e.
Figure 41531DEST_PATH_IMAGE016
The value of (b) can be 0, 1, 2, 3, 4, 5. When the number of PDCCH candidate sets is 2,
Figure 284293DEST_PATH_IMAGE016
is in the range of 0-1, i.e.
Figure 54541DEST_PATH_IMAGE016
The value of (b) may be 0 or 1. Second counting variable
Figure 458978DEST_PATH_IMAGE017
Is a variable of the aggregation level, i.e.
Figure 448930DEST_PATH_IMAGE017
Is determined based on the aggregation level. If the aggregation level is 1, for example,
Figure 229805DEST_PATH_IMAGE017
is in the range of 0, i.e.
Figure 621603DEST_PATH_IMAGE017
The value of (d) may be 0. When the polymerization degree is set to 2,
Figure 462520DEST_PATH_IMAGE017
is in the range of 0-1, i.e.
Figure 939769DEST_PATH_IMAGE017
The value of (b) may be 0 or 1. When the polymerization degree is 4, the polymer is,
Figure 524334DEST_PATH_IMAGE017
is in the range of 0-3, i.e.
Figure 68841DEST_PATH_IMAGE017
The value of (b) can be 0, 1, 2, 3. When the polymerization degree is set to 8,
Figure 956025DEST_PATH_IMAGE017
is in the range of 0 to 7, i.e.
Figure 779625DEST_PATH_IMAGE017
The value of (b) can be 0, 1, 2, 3, 4, 5, 6, 7.
For example, assuming that the number of PDCCH candidate sets for a UE to be scheduled is 2, the aggregation level for a UE to be scheduled is 4,
Figure 43247DEST_PATH_IMAGE016
the value of (a) is in the range of 0 to 1,
Figure 268692DEST_PATH_IMAGE017
if the value range of (1) is 0-3, then: will be provided with
Figure 61199DEST_PATH_IMAGE016
The value of (a) is 0,
Figure 637674DEST_PATH_IMAGE017
substituting the value of (2) into the formula (1) to obtain the index of the first CCE in the PDCCH candidate set 1 (indicating the position of the first CCE, for example, indicating the 10 th CCE in all CCEs if the index is 9). Will be provided with
Figure 937943DEST_PATH_IMAGE016
The value of (a) is 0,
Figure 17894DEST_PATH_IMAGE017
substituting the value 1 into the formula (1) to obtain the index of the second CCE of the PDCCH candidate set 1; will be provided with
Figure 512461DEST_PATH_IMAGE016
The value of (a) is 0,
Figure 310652DEST_PATH_IMAGE017
substituting the value 2 into the formula (1) to obtain the index of the third CCE of the PDCCH candidate set 1; will be provided with
Figure 916077DEST_PATH_IMAGE016
The value of (a) is 0,
Figure 522639DEST_PATH_IMAGE017
substituting the value 3 into the formula (1) to obtain the index of the fourth CCE of the PDCCH candidate set 1, so that 4 CCEs of the PDCCH candidate set 1 can be obtained. Then, will
Figure 312740DEST_PATH_IMAGE016
The value of (a) is 1,
Figure 975059DEST_PATH_IMAGE017
substituting the value 0 into the formula (1) to obtain the index of the first CCE of the PDCCH candidate set 2; will be provided with
Figure 243230DEST_PATH_IMAGE016
The value of (a) is 1,
Figure 173140DEST_PATH_IMAGE017
substituting the value 1 into the formula (1) to obtain the index of the second CCE of the PDCCH candidate set 2; will be provided with
Figure 868563DEST_PATH_IMAGE016
The value of (a) is 1,
Figure 251134DEST_PATH_IMAGE017
substituting the value 2 into the formula (1) to obtain the index of the third CCE of the PDCCH candidate set 2; will be provided with
Figure 322995DEST_PATH_IMAGE016
The value of (a) is 1,
Figure 372991DEST_PATH_IMAGE017
substituting the value 3 into the formula (1) to obtain the index of the fourth CCE of the PDCCH candidate set 2, so that 4 CCEs of the PDCCH candidate set 2 can be obtained.
In summary, 4 CCEs of PDCCH candidate set 1 and 4 CCEs of PDCCH candidate set 2 can be obtained, where the 4 CCEs of PDCCH candidate set 1 occupy continuous CCE resources, and the 4 CCEs of PDCCH candidate set 2 also occupy continuous CCE resources, but the CCE resources occupied by PDCCH candidate set 1 and the CCE resources occupied by PDCCH candidate set 2 are discretely distributed in different positions of the scheduling subframe.
Illustratively, in the following
Figure 239316DEST_PATH_IMAGE016
Is taken from the value sum
Figure 873297DEST_PATH_IMAGE017
When the value of (2) is substituted into the formula (1), the aggregation level is also required
Figure 483270DEST_PATH_IMAGE003
Initial position parameter
Figure 184510DEST_PATH_IMAGE006
PDCCH candidate set number
Figure 97102DEST_PATH_IMAGE004
Controlling the total number of channel units
Figure 844478DEST_PATH_IMAGE005
And substituting the index into formula (1) to obtain the index of the CCE in the PDCCH candidate set, which is not described herein again.
Referring to fig. 4, in TDD-LTE, under a bandwidth of 15M, CFI is equal to 2, uplink and downlink subframes are configured to be 1, RNTI value of a UE to be scheduled is 100, a scheduling subframe is a frame No. 0, total number of CCEs available in a PDCCH control field of the scheduling subframe is 41, based on formula (1), when an aggregation level is 1, a dedicated search space includes 6 PDCCH candidate sets, PDCCH candidate set 1 includes CCE2, PDCCH candidate set 2 includes CCE9, PDCCH candidate set 3 includes CCE15, PDCCH candidate set 4 includes CCE22, PDCCH candidate set 5 includes CCE29, and PDCCH candidate set 6 includes CCE 36. In summary, it can be seen that CCE resources occupied by the 6 PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe.
When the aggregation level is 2, the dedicated search space includes 6 PDCCH candidate sets, PDCCH candidate set 1 includes CCE0 and CCE1, PDCCH candidate set 2 includes CCE6 and CCE7, PDCCH candidate set 3 includes CCE12 and CCE13, PDCCH candidate set 4 includes CCE20 and CCE21, PDCCH candidate set 5 includes CCE26 and CCE27, and PDCCH candidate set 6 includes CCE34 and CCE 35. In summary, CCE resources occupied by the 6 PDCCH candidate sets are distributed discretely at different positions of the scheduling subframe.
At an aggregation level of 4, the dedicated search space includes 2 PDCCH candidate sets, PDCCH candidate set 1 includes CCE0-CCE3, and PDCCH candidate set 2 includes CCE 20-23. In summary, it can be seen that CCE resources occupied by the 2 PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe.
At an aggregation level of 8, the dedicated search space includes 2 PDCCH candidate sets, PDCCH candidate set 1 includes CCE0-CCE7, and PDCCH candidate set 2 includes CCE16-CCE 23. In summary, it can be seen that CCE resources occupied by the 2 PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe.
At an aggregation level of 4, the common search space includes 4 PDCCH candidate sets, PDCCH candidate set 1 includes CCE0-CCE3, PDCCH candidate set 2 includes CCE8-CCE11, PDCCH candidate set 3 includes CCE20-CCE23, and PDCCH candidate set 4 includes CCE28-CCE 31. In summary, it can be seen that CCE resources occupied by the 4 PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe.
At an aggregation level of 8, the common search space includes 2 PDCCH candidate sets, PDCCH candidate set 1 includes CCE0-CCE7, and PDCCH candidate set 2 includes CCE16-CCE 23. In summary, it can be seen that CCE resources occupied by the 2 PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe.
As can be seen from fig. 4, the dedicated search space may be composed of a plurality of PDCCH candidate sets, and CCE resources occupied by the plurality of PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe.
In a possible implementation manner, the network side device may further determine a common search space in the scheduling subframe, where the common search space includes multiple PDCCH candidate sets, and different PDCCH candidate sets are discretely distributed in different positions of the scheduling subframe. For example, the number of PDCCH candidate sets for the common search space is determined based on the aggregation level, and for example, the number of PDCCH candidate sets for the common search space may be queried based on the mapping relationship shown in table 2. And determining the common search space in the scheduling subframe based on the PDCCH candidate set quantity of the common search space, wherein a plurality of PDCCH candidate sets of the common search space are distributed at different positions of the scheduling subframe in a discrete mode. For example, the network side device may determine the common search space in the scheduling subframe based on the aggregation level, the starting location parameter, the number of PDCCH candidate sets, the total number of control channel elements, the first count variable, and the second count variable. For example, the common search space in the scheduled subframe may be determined by formula (1), and the related content of formula (1) is referred to the above embodiments and is not repeated herein.
Referring to fig. 4, the common search space may be composed of a plurality of PDCCH candidate sets, and CCE resources occupied by the plurality of PDCCH candidate sets are discretely distributed at different positions of a scheduling subframe.
Step 302, select a target PDCCH candidate set from a plurality of PDCCH candidate sets in the dedicated search space, where the target PDCCH candidate set is used as a target PDCCH candidate set for the UE to be scheduled.
For example, after obtaining a plurality of PDCCH candidate sets of the dedicated search space, selecting an unoccupied PDCCH candidate set (e.g., a PDCCH candidate set that is not occupied by the common search space and a PDCCH candidate set that is not occupied by other UEs) from the PDCCH candidate sets, and selecting one PDCCH candidate set from the unoccupied PDCCH candidate set as a target PDCCH candidate set for the UE to be scheduled.
For example, one PDCCH candidate set is randomly selected from the unoccupied PDCCH candidate set as the target PDCCH candidate set of the UE to be scheduled, or the first PDCCH candidate set is selected from the unoccupied PDCCH candidate set as the target PDCCH candidate set of the UE to be scheduled, or the last PDCCH candidate set is selected from the unoccupied PDCCH candidate set as the target PDCCH candidate set of the UE to be scheduled.
Step 303, sending downlink control information to the UE to be scheduled through the target PDCCH candidate set.
For example, after selecting the target PDCCH candidate set, the network side device may send downlink control information to the UE to be scheduled through the target PDCCH candidate set, that is, send downlink control information, that is, DCI, to the UE to be scheduled through CCE resources in the target PDCCH candidate set.
According to the technical scheme, in the embodiment of the application, when the special search space matched with the UE to be scheduled in the scheduling subframe is determined, the special search space comprises a plurality of PDCCH candidate sets, different PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe, namely, each PDCCH candidate set in the special search space is uniformly and discretely distributed in the whole PDCCH control domain, so that the congestion condition of the special search space is effectively inhibited, the congestion probability of the special search space of each UE is reduced, the utilization rate of PDCCH resources is improved, the problem of PDCCH resource congestion is solved, the timely scheduling of uplink and downlink data is ensured, the data transmission performance is effectively improved, the congestion problem of the special search space is not easy to occur in a multi-user scene, and the problem that some UEs cannot be scheduled in time is avoided.
For example, in TDD-LTE, under 15M bandwidth, CFI is equal to 2, and uplink and downlink subframes are matched to 1, three UEs, namely UE1, UE2, and UE3, need to be scheduled in subframe 0 of a certain radio frame, where the RNTIs corresponding to UE1, UE2, and UE3 are 125, 93, and 100, and the aggregation levels of UE1, UE2, and UE3 are 2, 4, and 4, respectively, so the dedicated search spaces of the three UEs are as shown in fig. 5.
The dedicated search space of UE1 includes 6 PDCCH candidate sets, PDCCH candidate set 11 includes CCE0 and CCE1, PDCCH candidate set 12 includes CCE6 and CCE7, PDCCH candidate set 13 includes CCE12 and CCE13, PDCCH candidate set 14 includes CCE20 and CCE21, PDCCH candidate set 15 includes CCE26 and CCE27, and PDCCH candidate set 16 includes CCE34 and CCE 35. The dedicated search space for UE2 includes 2 PDCCH candidate sets, PDCCH candidate set 21 includes CCE4-CCE7, and PDCCH candidate set 22 includes CCE 24-27. The dedicated search space for UE3 includes 2 PDCCH candidate sets, PDCCH candidate set 31 includes CCE0-CCE3, and PDCCH candidate set 32 includes CCE20-CCE 23.
Under the application scenario described above, no congestion situation exists for UE1, UE2, and UE3 regardless of which PDCCH candidate set is used. For example, assuming that UE1 selects PDCCH candidate set 11 and UE2 selects PDCCH candidate set 21, PDCCH candidate set 32 may be selected for UE3, PDCCH candidate set 32 does not collide with PDCCH candidate set 11, and PDCCH candidate set 32 does not collide with PDCCH candidate set 21, so the dedicated search space of UE3 is not congested, and a PDCCH candidate set can be allocated for UE3, and UE3 can be scheduled in the current scheduling subframe, thereby ensuring timely scheduling of UE 3.
An embodiment of the present application provides a Downlink Control Information (DCI) transmission method, which may be applied to a UE to be scheduled, and is shown in fig. 6, and is a flowchart of the method, where the method may include:
step 601, determining a dedicated search space matched with the UE to be scheduled in the scheduling subframe, where the dedicated search space may include multiple PDCCH candidate sets, and different PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe, that is, different PDCCH candidate sets are not distributed at continuous positions of the scheduling subframe.
Exemplarily, the discrete distribution of different PDCCH candidate sets at different positions of the scheduling subframe refers to: instead of occupying contiguous CCE resources, different PDCCH candidate sets occupy non-contiguous CCE resources.
For example, the dedicated search space in the scheduling subframe that matches the UE to be scheduled may be determined as follows: and determining the number of PDCCH candidate sets of the UE to be scheduled based on the aggregation level of the UE to be scheduled, and determining a special search space matched with the UE to be scheduled in the scheduling subframe based on the number of the PDCCH candidate sets.
In one possible implementation manner, in order to discretely distribute the plurality of PDCCH candidate sets at different positions of the scheduling subframe, the UE to be scheduled may determine a dedicated search space matching the UE to be scheduled in the scheduling subframe based on an aggregation level of the UE to be scheduled, a starting position parameter of the UE to be scheduled, a number of PDCCH candidate sets of the UE to be scheduled, a total number of control channel elements, the first count variable, and the second count variable, so that the plurality of PDCCH candidate sets of the dedicated search space are discretely distributed at different positions of the scheduling subframe. For example, based on the aggregation level of the UE to be scheduled, the starting location parameter of the UE to be scheduled, the number of PDCCH candidate sets of the UE to be scheduled, the total number of control channel elements, the first counting variable, the second counting variable, and other parameters, the dedicated search space matched with the UE to be scheduled in the scheduling subframe may be determined by the following formula.
Figure 133508DEST_PATH_IMAGE018
Wherein the content of the first and second substances,
Figure 17151DEST_PATH_IMAGE003
representing an aggregation level of the UE to be scheduled;
Figure 602109DEST_PATH_IMAGE006
represents a starting location parameter of the UE to be scheduled, and
Figure 571202DEST_PATH_IMAGE006
determining based on the RNTI of the UE to be scheduled;
Figure 398344DEST_PATH_IMAGE004
indicating the number of PDCCH candidate sets of the UE to be scheduled;
Figure 74176DEST_PATH_IMAGE005
representing the total number of control channel elements;
Figure 187625DEST_PATH_IMAGE016
it is shown that the first counting variable,
Figure 316118DEST_PATH_IMAGE016
the value range of (a) is determined based on the number of PDCCH candidate sets;
Figure 445486DEST_PATH_IMAGE017
it is indicated that the second counting variable,
Figure 303721DEST_PATH_IMAGE017
is determined based on the aggregation level.
Exemplarily, the implementation process of step 601 is similar to that of step 301, except that the execution main body is changed from the network side device to the UE to be scheduled, and the implementation process of step 601 is not repeated herein.
Step 602, receiving downlink control information sent by the network side device to the UE to be scheduled based on the dedicated search space. For example, the UE to be scheduled attempts to receive downlink control information from multiple PDCCH candidate sets in the dedicated search space in a blind detection manner. For example, first, a first PDCCH candidate set in the dedicated search space is tried to receive downlink control information, if no downlink control information is received, a second PDCCH candidate set in the dedicated search space is tried to receive downlink control information, if no downlink control information is received, a third PDCCH candidate set in the dedicated search space is tried to receive downlink control information, and so on until the UE to be scheduled receives downlink control information sent by the network side device to the UE to be scheduled.
According to the technical scheme, in the embodiment of the application, when the special search space matched with the UE to be scheduled in the scheduling subframe is determined, the special search space comprises a plurality of PDCCH candidate sets, different PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe, namely, each PDCCH candidate set in the special search space is uniformly and discretely distributed in the whole PDCCH control domain, so that the congestion condition of the special search space is effectively inhibited, the congestion probability of the special search space of each UE is reduced, the utilization rate of PDCCH resources is improved, the problem of PDCCH resource congestion is solved, the timely scheduling of uplink and downlink data is ensured, the data transmission performance is effectively improved, the congestion problem of the special search space is not easy to occur in a multi-user scene, and the problem that some UEs cannot be scheduled in time is avoided.
Accordingly, based on the same application concept as the method, an embodiment of the present application further provides a downlink control information transmission apparatus, where the apparatus may be applied to a network side device, as shown in fig. 7, and the apparatus may include: a determining module 71, configured to determine a dedicated search space in a scheduling subframe, where the dedicated search space is matched with a UE to be scheduled; wherein the dedicated search space comprises a plurality of PDCCH candidate sets, and different PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe; a selecting module 72, configured to select a target PDCCH candidate set from the multiple PDCCH candidate sets in the dedicated search space; a sending module 73, configured to send downlink control information to the UE to be scheduled through the target PDCCH candidate set.
The determining module 71 is specifically configured to, when determining the dedicated search space matched with the UE to be scheduled in the scheduling subframe: and determining the number of PDCCH candidate sets of the UE to be scheduled based on the aggregation level of the UE to be scheduled, and determining a special search space matched with the UE to be scheduled in a scheduling subframe based on the number of the PDCCH candidate sets.
The determining module 71 is specifically configured to, when determining the dedicated search space matched with the UE to be scheduled in the scheduling subframe: and determining a special search space matched with the UE to be scheduled in the scheduling subframe based on the aggregation level of the UE to be scheduled, the initial position parameter of the UE to be scheduled, the number of PDCCH candidate sets of the UE to be scheduled, the total number of control channel units, a first counting variable and a second counting variable.
The determining module 71 is specifically configured to, when determining the dedicated search space matched with the UE to be scheduled in the scheduling subframe: determining a special search space matched with the UE to be scheduled in the scheduling subframe by the following formula:
Figure 729017DEST_PATH_IMAGE019
wherein the content of the first and second substances,
Figure 672702DEST_PATH_IMAGE003
representing the aggregation level of the UE to be scheduled;
Figure 841646DEST_PATH_IMAGE006
a starting position parameter representing the UE to be scheduled, and
Figure 554388DEST_PATH_IMAGE006
determining based on the wireless network temporary identifier of the UE to be scheduled;
Figure 416164DEST_PATH_IMAGE004
representing the number of PDCCH candidate sets of the UE to be scheduled;
Figure 847146DEST_PATH_IMAGE005
representing the total number of control channel elements;
Figure 106265DEST_PATH_IMAGE016
represents a first counting variable, and
Figure 548878DEST_PATH_IMAGE016
is determined based on the number of the PDCCH candidate sets;
Figure 706190DEST_PATH_IMAGE017
represents a second counting variable, and
Figure 499834DEST_PATH_IMAGE017
is determined based on the aggregation level.
Accordingly, based on the same application concept as the method, an embodiment of the present application further provides a downlink control information transmission apparatus, where the apparatus may be applied to a UE to be scheduled, and as shown in fig. 8, the apparatus may include: a determining module 81, configured to determine a dedicated search space in a scheduling subframe, where the dedicated search space is matched with a UE to be scheduled; wherein the dedicated search space comprises a plurality of PDCCH candidate sets, and different PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe; a receiving module 82, configured to receive, based on the dedicated search space, downlink control information sent by the network side device to the UE to be scheduled.
The determining module 81 is specifically configured to, when determining the dedicated search space matched with the UE to be scheduled in the scheduling subframe: and determining the number of PDCCH candidate sets of the UE to be scheduled based on the aggregation level of the UE to be scheduled, and determining a special search space matched with the UE to be scheduled in a scheduling subframe based on the number of the PDCCH candidate sets.
The determining module 81 is specifically configured to, when determining the dedicated search space matched with the UE to be scheduled in the scheduling subframe: and determining a special search space matched with the UE to be scheduled in the scheduling subframe based on the aggregation level of the UE to be scheduled, the initial position parameter of the UE to be scheduled, the number of PDCCH candidate sets of the UE to be scheduled, the total number of control channel units, a first counting variable and a second counting variable.
The determining module 81 is specifically configured to, when determining the dedicated search space matched with the UE to be scheduled in the scheduling subframe: determining a special search space matched with the UE to be scheduled in the scheduling subframe by the following formula:
Figure 135215DEST_PATH_IMAGE019
wherein the content of the first and second substances,
Figure 432335DEST_PATH_IMAGE003
representing the aggregation level of the UE to be scheduled;
Figure 760548DEST_PATH_IMAGE006
a starting position parameter representing the UE to be scheduled, and
Figure 274444DEST_PATH_IMAGE006
determining based on the wireless network temporary identifier of the UE to be scheduled;
Figure 979095DEST_PATH_IMAGE004
representing the number of PDCCH candidate sets of the UE to be scheduled;
Figure 396300DEST_PATH_IMAGE005
representing the total number of control channel elements;
Figure 895415DEST_PATH_IMAGE016
represents a first counting variable, and
Figure 398072DEST_PATH_IMAGE016
is determined based on the number of the PDCCH candidate sets;
Figure 375255DEST_PATH_IMAGE017
represents a second counting variable, and
Figure 912547DEST_PATH_IMAGE017
is determined based on the aggregation level.
In terms of hardware, a schematic diagram of a hardware architecture of an electronic device (such as the above-mentioned network-side device or the UE to be scheduled) provided in the embodiment of the present application may be shown in fig. 9, where the electronic device may include: a machine-readable storage medium and a processor, wherein: a machine-readable storage medium stores machine-executable instructions executable by the processor. A processor: the downlink control information transmission method is communicated with a machine-readable storage medium, reads and executes the machine-executable instructions stored in the machine-readable storage medium, and realizes the downlink control information transmission method disclosed by the above example of the application. Illustratively, a machine-readable storage medium stores machine-executable instructions that, when invoked and executed by a processor, cause the processor to implement the downlink control information transmission method disclosed in the above-mentioned examples of the present application.
Here, a machine-readable storage medium may be any electronic, magnetic, optical, or other physical storage device that can contain or store information such as executable instructions, data, and so forth. For example, the machine-readable storage medium may be: a RAM (random Access Memory), a volatile Memory, a non-volatile Memory, a flash Memory, a storage drive (e.g., a hard drive), a solid state drive, any type of storage disk (e.g., an optical disk, a dvd, etc.), or similar storage medium, or a combination thereof.
The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. A typical implementation device is a computer, which may take the form of a personal computer, laptop computer, cellular telephone, camera phone, smart phone, personal digital assistant, media player, navigation device, email messaging device, game console, tablet computer, wearable device, or a combination of any of these devices.
For convenience of description, the above devices are described as being divided into various units by function, and are described separately. Of course, the functionality of the units may be implemented in one or more software and/or hardware when implementing the present application.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Furthermore, these computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.

Claims (14)

1. A downlink control information transmission method is applied to a network side device, and comprises the following steps:
determining a special search space matched with UE to be scheduled in a scheduling subframe, wherein the special search space comprises a plurality of PDCCH candidate sets, and different PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe;
selecting a target PDCCH candidate set from the plurality of PDCCH candidate sets of the dedicated search space;
and sending downlink control information to the UE to be scheduled through the target PDCCH candidate set.
2. The method of claim 1,
the determining the special search space matched with the UE to be scheduled in the scheduling subframe comprises the following steps:
and determining the number of PDCCH candidate sets of the UE to be scheduled based on the aggregation level of the UE to be scheduled, and determining a special search space matched with the UE to be scheduled in a scheduling subframe based on the number of the PDCCH candidate sets.
3. The method according to claim 1 or 2,
the determining the special search space matched with the UE to be scheduled in the scheduling subframe comprises the following steps:
and determining a special search space matched with the UE to be scheduled in the scheduling subframe based on the aggregation level of the UE to be scheduled, the initial position parameter of the UE to be scheduled, the number of PDCCH candidate sets of the UE to be scheduled, the total number of control channel units, a first counting variable and a second counting variable.
4. The method of claim 3,
the determining the special search space matched with the UE to be scheduled in the scheduling subframe comprises the following steps:
determining a special search space matched with the UE to be scheduled in the scheduling subframe by the following formula:
Figure 567846DEST_PATH_IMAGE001
wherein the content of the first and second substances,
Figure 494213DEST_PATH_IMAGE002
representing the aggregation level of the UE to be scheduled;
Figure 449531DEST_PATH_IMAGE003
a starting position parameter representing the UE to be scheduled, and
Figure 803152DEST_PATH_IMAGE003
determining based on the wireless network temporary identifier of the UE to be scheduled;
Figure 476710DEST_PATH_IMAGE004
representing the number of PDCCH candidate sets of the UE to be scheduled;
Figure 206769DEST_PATH_IMAGE005
representing the total number of control channel elements;
Figure 78910DEST_PATH_IMAGE006
represents a first counting variable, and
Figure 977333DEST_PATH_IMAGE006
is determined based on the number of the PDCCH candidate sets;
Figure 262821DEST_PATH_IMAGE007
represents a second counting variable, and
Figure 406358DEST_PATH_IMAGE007
is determined based on the aggregation level.
5. A downlink control information transmission method is applied to UE to be scheduled, and comprises the following steps:
determining a special search space matched with UE to be scheduled in a scheduling subframe, wherein the special search space comprises a plurality of PDCCH candidate sets, and different PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe;
and receiving downlink control information sent to the UE to be scheduled by the network side equipment based on the special search space.
6. The method of claim 5,
the determining the special search space matched with the UE to be scheduled in the scheduling subframe comprises the following steps:
and determining the number of PDCCH candidate sets of the UE to be scheduled based on the aggregation level of the UE to be scheduled, and determining a special search space matched with the UE to be scheduled in a scheduling subframe based on the number of the PDCCH candidate sets.
7. The method according to claim 5 or 6,
the determining the special search space matched with the UE to be scheduled in the scheduling subframe comprises the following steps:
and determining a special search space matched with the UE to be scheduled in the scheduling subframe based on the aggregation level of the UE to be scheduled, the initial position parameter of the UE to be scheduled, the number of PDCCH candidate sets of the UE to be scheduled, the total number of control channel units, a first counting variable and a second counting variable.
8. The method of claim 7,
the determining the special search space matched with the UE to be scheduled in the scheduling subframe comprises the following steps:
determining a special search space matched with the UE to be scheduled in the scheduling subframe by the following formula:
Figure 460901DEST_PATH_IMAGE008
wherein the content of the first and second substances,
Figure 297270DEST_PATH_IMAGE002
representing the aggregation level of the UE to be scheduled;
Figure 70054DEST_PATH_IMAGE003
a starting position parameter representing the UE to be scheduled, and
Figure 751702DEST_PATH_IMAGE003
determining based on the wireless network temporary identifier of the UE to be scheduled;
Figure 926332DEST_PATH_IMAGE004
representing the number of PDCCH candidate sets of the UE to be scheduled;
Figure 915627DEST_PATH_IMAGE005
representing the total number of control channel elements;
Figure 175707DEST_PATH_IMAGE006
represents a first counting variable, and
Figure 661046DEST_PATH_IMAGE006
is determined based on the number of the PDCCH candidate sets;
Figure 690182DEST_PATH_IMAGE007
represents a second counting variable, and
Figure 133933DEST_PATH_IMAGE007
is determined based on the aggregation level.
9. A downlink control information transmission device is applied to a network side device, and comprises:
the determining module is used for determining a special search space matched with the UE to be scheduled in the scheduling subframe; wherein the dedicated search space comprises a plurality of PDCCH candidate sets, and different PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe;
a selection module, configured to select a target PDCCH candidate set from the multiple PDCCH candidate sets in the dedicated search space;
and the sending module is used for sending downlink control information to the UE to be scheduled through the target PDCCH candidate set.
10. The apparatus of claim 9,
the determining module is specifically configured to, when determining the dedicated search space matched with the UE to be scheduled in the scheduling subframe: and determining the number of PDCCH candidate sets of the UE to be scheduled based on the aggregation level of the UE to be scheduled, and determining a special search space matched with the UE to be scheduled in a scheduling subframe based on the number of the PDCCH candidate sets.
11. A downlink control information transmission device, applied to a UE to be scheduled, includes:
the determining module is used for determining a special search space matched with the UE to be scheduled in the scheduling subframe; wherein the dedicated search space comprises a plurality of PDCCH candidate sets, and different PDCCH candidate sets are discretely distributed at different positions of the scheduling subframe;
and the receiving module is used for receiving the downlink control information sent to the UE to be scheduled by the network side equipment based on the special search space.
12. The apparatus of claim 11,
the determining module is specifically configured to, when determining the dedicated search space matched with the UE to be scheduled in the scheduling subframe: and determining the number of PDCCH candidate sets of the UE to be scheduled based on the aggregation level of the UE to be scheduled, and determining a special search space matched with the UE to be scheduled in a scheduling subframe based on the number of the PDCCH candidate sets.
13. An electronic device, comprising: a processor and a machine-readable storage medium storing machine-executable instructions executable by the processor;
the processor is configured to execute the machine executable instructions to implement the method steps of any of claims 1-4; alternatively, the method steps of any one of claims 5 to 8 are carried out.
14. A machine-readable storage medium comprising, in combination,
the machine-readable storage medium stores machine-executable instructions that, when invoked and executed by a processor, cause the processor to implement the method steps of any of claims 1-4; alternatively, the method steps of any one of claims 5 to 8 are carried out.
CN202011135743.1A 2020-10-22 2020-10-22 Downlink control information transmission method, device and equipment Pending CN111970104A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011135743.1A CN111970104A (en) 2020-10-22 2020-10-22 Downlink control information transmission method, device and equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011135743.1A CN111970104A (en) 2020-10-22 2020-10-22 Downlink control information transmission method, device and equipment

Publications (1)

Publication Number Publication Date
CN111970104A true CN111970104A (en) 2020-11-20

Family

ID=73387630

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011135743.1A Pending CN111970104A (en) 2020-10-22 2020-10-22 Downlink control information transmission method, device and equipment

Country Status (1)

Country Link
CN (1) CN111970104A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110269492A1 (en) * 2010-05-03 2011-11-03 Ping Wang Allocating a control channel for carrier aggregation
CN109041243A (en) * 2017-06-12 2018-12-18 中国移动通信有限公司研究院 A kind of sending method of Physical Downlink Control Channel, method of reseptance and relevant device
CN110495125A (en) * 2017-03-24 2019-11-22 英特尔Ip公司 Technology for supporting physical downlink control channel to communicate
CN111211872A (en) * 2020-01-09 2020-05-29 重庆邮电大学 PDCCH blind detection method for SNR mean value feedback and CCEs energy judgment in 5G

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110269492A1 (en) * 2010-05-03 2011-11-03 Ping Wang Allocating a control channel for carrier aggregation
CN110495125A (en) * 2017-03-24 2019-11-22 英特尔Ip公司 Technology for supporting physical downlink control channel to communicate
CN109041243A (en) * 2017-06-12 2018-12-18 中国移动通信有限公司研究院 A kind of sending method of Physical Downlink Control Channel, method of reseptance and relevant device
CN111211872A (en) * 2020-01-09 2020-05-29 重庆邮电大学 PDCCH blind detection method for SNR mean value feedback and CCEs energy judgment in 5G

Similar Documents

Publication Publication Date Title
US20210266884A1 (en) Decoding control information received over a control channel
CN107295696B (en) Channel access method, device, UE and base station
KR101104965B1 (en) Method and Apparatus for scheduling in BaseStation
CN109526056B (en) Resource selection method and device under multi-carrier, computer equipment and storage medium
WO2017167271A1 (en) Downlink information transmission and reception method and device
CN107371272B (en) Transmission method, device and system of downlink control information
KR101144099B1 (en) Mobile communication method, mobile station, and radio base station
US9814061B2 (en) Data scheduling method and device
US10499392B2 (en) Method and apparatus for resource allocation
US9307524B2 (en) Method for communicating in mobile system
CN110637439A (en) Search space monitoring
WO2020143773A1 (en) Transmission resource selection method and apparatus
CN102404862B (en) Method for PDCCH (Physical Downlink Control Channel) resource allocation in LTE (Long Term Evolution) system
CN111555839B (en) Method and equipment for allocating uplink carrier resources in carrier aggregation
CN109152033B (en) Method and device for sending information and determining information
WO2010110285A9 (en) Radio base station and mobile communication method
CN112040531A (en) Access control method, device and system
CN113475030B (en) Method, device, equipment and medium for determining uplink channel transmission mode
JP5393672B2 (en) Wireless communication system, communication apparatus, wireless communication method, and wireless communication program
US9066218B2 (en) Method and apparatus for allocating resources in a wireless communication system and system thereof
WO2010110284A9 (en) Radio base station and mobile communication method
CN116131999B (en) Code rate adjusting method, device, electronic equipment and machine-readable storage medium
CN107623948B (en) CCE candidate position selection method and device under PDCCH aggregation level
WO2018000940A1 (en) Resource allocation method for physical uplink control channel, base station and storage medium
CN111970104A (en) Downlink control information transmission method, device and equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20201120

RJ01 Rejection of invention patent application after publication