CN110351841A - A kind of detection method of Physical Downlink Control Channel, sending method and equipment - Google Patents

Abstract

The embodiment of the invention provides a kind of detection method of Physical Downlink Control Channel, sending method and equipment.The candidate required detection number of whole PDCCH that the embodiment of the present invention is configured in target time slot, more than terminal in the maximum detection number in the target time slot, determine the PDCCH detected candidate, so that maximum detection number of the sum of the detection number candidate to the PDCCH detected no more than terminal on the time slot, terminal only detects PDCCH on the PDCCH candidate detected, base station also sends PDCCH to terminal on the PDCCH candidate detected simultaneously, so that terminal can reduce the detection number of PDCCH.

Description

A detection method, transmission method and device for physical downlink control channel

technical field

The present invention relates to the technical field of mobile communication, in particular to a detection method, a transmission method and a device of a physical downlink control channel.

Background technique

The physical downlink control channel can be used to indicate when the PDSCH (Physical Downlink Shared Channel) corresponding to the UE (User Equipment) is scheduled or the PUSCH (Physical Uplink Shared Channel) to be sent is scheduled To obtain these messages, the user terminal needs to detect the downlink control channel first. A PDCCH (Physical Downlink Control Channel) is transmitted on n consecutive CCEs (Control Channel Element, Control Channel Element). PDCCH has 5 formats, corresponding to aggregation levels {1, 2, 4, 8, 16 respectively. }. The aggregation level represents the number n of consecutive CCEs occupied by one PDCCH.

In 5G NR (new radio, new radio), a base station configures a maximum of 10 search space sets on one BWP (bandwidth part) for a UE, and the UE performs blind detection in each search space set. The base station configures the number of PDCCH candidates at each aggregation level for each search space set And the PDCCH detection period k _p,s and the detection offset value op _,s .

At the same time, only fallback DCI (DCI format 0_0 and DCI format 1_0), or DCI (DCI format 0_1 and DCI format 1_1) of scheduling data are configured in a USS (specific search space, UE-specific search space) in NR. The sizes of DCI format 0_0 and DCI format 1_0 are the same, and the sizes of DCI format 0_1 and DCI format 1_1 may be the same or different. Therefore, when only DCI format 0_0 and DCI format 1_0 are configured in a USS, one PDCCH candidate needs to occupy one detection count. If only DCIformat 0_1 and DCI format 1_1 are configured in a USS, if the size of DCI format 0_1 and DCI format 1_1 are the same, one PDCCH candidate needs one detection count, otherwise, one PDCCH candidate needs two detection times.

At the same time, NR also specifies the maximum number of detections that a UE can perform on a PDCCH candidate on a serving cell within a slot. As shown in the table below:

As a function of the subcarrier spacing value, the maximum number of detections per time slot and per serving cell is 2 ^μ ·15kHz, μ∈{0,1,2,3}.

Since different search space sets can be configured with separate detection periods, different aggregation levels, and the number of PDCCH candidates, in some slots, the maximum number of detections required for the PDCCH candidates configured by the base station for the UE will exceed the maximum number of PDCCH detections by the UE. restrictions, which may lead to an increase in the number of times the UE detects the PDCCH.

SUMMARY OF THE INVENTION

The technical problem to be solved by the embodiments of the present invention is to provide a physical downlink control channel detection method, transmission method and device, which are used to determine the PDCCH candidates to be detected and reduce the number of PDCCH detections.

To solve the above technical problems, an embodiment of the present invention provides a method for detecting a physical downlink control channel, which is applied to a terminal, including:

When the first number exceeds the second number, determine the PDCCH candidates to be detected in the target time slot, where the first number is the number of detection times required for all PDCCH candidates configured in the target time slot, The second number is the number of the maximum detection times of the terminal on the target time slot;

The PDCCH is detected on the PDCCH candidates to be detected.

The embodiment of the present invention also provides a method for sending a physical downlink control channel, which is applied to a network device, including:

When the first number exceeds the second number, determine the PDCCH candidates for transmission in the target time slot, where the first number is the number of detection times required for all PDCCH candidates configured in the target time slot, The second quantity is the quantity of the maximum detection times of the terminal on the target time slot;

The PDCCH is transmitted to the terminal on the PDCCH candidates for transmission.

An embodiment of the present invention also provides a terminal, including:

a processor, configured to determine the PDCCH candidates to be detected in the target timeslot when the first quantity exceeds the second quantity, where the first quantity is required for all PDCCH candidates configured in the target timeslot The number of detection times, the second number is the number of the maximum detection times of the terminal on the target time slot;

a transceiver, configured to detect the PDCCH on the PDCCH candidates to be detected.

The embodiment of the present invention also provides a network device, including:

a processor for determining PDCCH candidates for transmission in a target time slot when the first number exceeds a second number, the first number being required for all PDCCH candidates configured in the target time slot the number of detection times, the second number is the number of the maximum detection times of the terminal on the target time slot;

a transceiver, configured to transmit a PDCCH to the terminal on the PDCCH candidates for transmission.

An embodiment of the present invention also provides a communication device, including: a memory, a processor, and a computer program stored in the memory and running on the processor, where the computer program is executed by the processor to achieve the above-mentioned The steps of the detection method, or, implement the steps of the sending method as described above.

Embodiments of the present invention further provide a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the steps of the detection method as described above are implemented, or, Steps to implement the sending method as described above.

Compared with the prior art, in the detection method, transmission method, and device for a physical downlink control channel provided by the embodiment of the present invention, the number of detections required for all PDCCH candidates configured in the target time slot in the embodiment of the present invention exceeds When the maximum number of detections on the target time slot is determined, the PDCCH candidates that need to be detected are determined, so that the sum of the detection times of the PDCCH candidates to be detected is not greater than the maximum detection times of the terminal on the time slot, and the terminal only The PDCCH is detected on the PDCCH candidate to be detected, and the base station also sends the PDCCH to the terminal on the PDCCH candidate to be detected, so that the terminal can reduce the number of PDCCH detections.

Description of drawings

In order to illustrate the technical solutions of the embodiments of the present invention more clearly, the following briefly introduces the drawings that are used in the description of the embodiments of the present invention. Obviously, the drawings in the following description are only some embodiments of the present invention. , for those of ordinary skill in the art, other drawings can also be obtained from these drawings without creative labor.

1 is a flowchart of a detection method provided by an embodiment of the present invention;

2 is a flowchart of a sending method provided by an embodiment of the present invention;

3 is a schematic structural diagram of a terminal provided by an embodiment of the present invention;

FIG. 4 is another schematic structural diagram of a terminal provided by an embodiment of the present invention.

FIG. 5 is a schematic structural diagram of a network device provided by an embodiment of the present invention;

FIG. 6 is another schematic structural diagram of a network device according to an embodiment of the present invention.

Detailed ways

In order to make the technical problems, technical solutions and advantages to be solved by the present invention more clear, the following will be described in detail with reference to the accompanying drawings and specific embodiments. In the following description, specific details such as specific configurations and components are provided merely to assist in a comprehensive understanding of embodiments of the present invention. Accordingly, it should be apparent to those skilled in the art that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted for clarity and conciseness.

It is to be understood that reference throughout the specification to "one embodiment" or "an embodiment" means that a particular feature, structure or characteristic associated with the embodiment is included in at least one embodiment of the present invention. Thus, appearances of "in one embodiment" or "in an embodiment" in various places throughout this specification are not necessarily necessarily referring to the same embodiment. Furthermore, the particular features, structures or characteristics may be combined in any suitable manner in one or more embodiments.

In various embodiments of the present invention, it should be understood that the size of the sequence numbers of the following processes does not mean the sequence of execution, and the execution sequence of each process should be determined by its functions and internal logic, rather than the implementation of the present invention The implementation of the examples constitutes no limitation.

In order to prevent the number of PDCCH candidates configured by the base station in the target time slot from exceeding the maximum number of PDCCH detections of the terminal in the target time slot, which may cause the terminal to increase the number of PDCCH detections, the embodiment of the present invention provides a physical A detection method, a transmission method, and a device for a downlink control channel, in the method of the embodiment of the present invention, both the terminal and the reference discard some PDCCH candidates through preset discarding rules, so that the terminal no longer detects the discarded PDCCH candidates, and at the same time The base station also does not schedule the terminal on these discarded PDCCH candidates. Through the above processing, the embodiment of the present invention can reduce the number of times that the terminal detects the PDCCH.

Referring to FIG. 1, an embodiment of the present invention provides a method for detecting a physical downlink control channel, which is applied to a terminal. The detecting method includes:

Step 11, when the first number exceeds the second number, determine the PDCCH candidates to be detected in the target time slot, and the first number is the number of detections required for all PDCCH candidates configured in the target time slot The second number is the number of the maximum detection times of the terminal on the target time slot;

Here, the first number is the number of times required to detect all PDCCH candidates in the time slot configured by the network device for the terminal, that is, the sum of the number of times to detect each PDCCH candidate in each search space set, for example The time slot includes a first search space set and a second search space set, the first search space set includes 28 PDCCH candidates, and each PDCCH candidate needs to be detected once, and the second search space set includes 10 PDCCH candidates, and Each PDCCH candidate needs to be detected twice, so the number of detections required for all PDCCH candidates in the slot is 48; the second number is the maximum number of detections that the terminal can perform on the slot according to the protocol. For example, this A time slot is a time slot with a subcarrier interval of 15KHz. According to the protocol in the table above, the maximum number of detections that the terminal can perform on this time slot is 44 times.

The above description is given as an example of the correspondence table of the maximum number of detections that a UE can detect on a serving cell in a time slot. On a time slot with a subcarrier interval of 15KHz, the maximum number of detections that the terminal can perform is 44 times. If the base station requires more than 44 times of detection for all the PDCCH candidates configured by the terminal on the time slot, for example, It takes 48 times to detect all PDCCH candidates configured by the base station, wherein the terminal can obtain the PDCCH candidates configured by the base station for itself according to the configuration information parameters sent by the base station, as well as the search space set and the search space set included in the search space set. Downlink control information, the terminal can calculate the number of times of detection of all PDCCH candidates in the search space set according to the downlink control information of the search space set, and then sum the detection times of each search space set to obtain the number of times in the time slot. The number of detection times required for all the configured PDCCH candidates, that is, the first number.

In the case that the first number of detection times configured by the base station exceeds the second maximum number of detection times that can be performed by the base station in the time slot, the terminal will preferentially detect the PDCCH candidates in the common search space (common search space, CSS), Then, according to the difference between the maximum number of detections and the number of CSS PDCCH detections, PDCCH candidates in a UE-specific search space (UE-specific search space, USS) are detected again. In this case, the base station may send the PDCCH on PDCCH candidates beyond the maximum number of times the terminal can detect, so that the terminal cannot detect the PDCCH, thereby increasing the number of times the terminal detects the PDCCH. It should be noted that, since the terminal performs blind detection on PDCCH candidates, when the number of detections required by the base station for all PDCCH candidates configured for the terminal on a time slot is greater than the maximum number of detections by the terminal on the target time slot , the terminal may also detect the PDCCH through blind detection within the maximum number of detections, but only in the case where the base station sends PDCCH on PDCCH candidates beyond the maximum number of detections that the terminal can detect, the terminal performs the second maximum number of detections When the PDCCH cannot be detected even after the number of detections, the number of times the terminal detects the PDCCH is increased.

In order to avoid the above situation, the embodiment of the present invention determines part of the PDCCH candidates that actually need to be detected from among the PDCCH candidates configured by the network device for the terminal, so that the number of times of detection of the part of the PDCCH candidates that actually need to be detected is less than The sum is not greater than the maximum number of detections that the terminal can perform in this time slot.

Step 12: Detect PDCCH on the PDCCH candidates to be detected.

Here, it can be understood that the base station also transmits the PDCCH on some PDCCH candidates based on the same rule. Since the terminal and the reference are based on the same rule, the PDCCH candidates for transmission determined by the reference are the same as those determined by the terminal to be detected. The PDCCH candidates are the same, and the terminal detects the PDCCH only on the PDCCH candidate to be detected, thereby reducing the number of times that the terminal detects the PDCCH candidates.

In the embodiment of the present invention, when the number of detections required for all PDCCH candidates configured in the target time slot exceeds the maximum number of detections of the terminal on the target time slot, the PDCCH candidates that need to be detected are determined, so that the required detection times are determined. The sum of the detection times of the detected PDCCH candidates is not greater than the maximum detection times of the terminal on the time slot. The terminal only detects the PDCCH on the PDCCH candidate that needs to be detected, and the base station also sends the terminal to the PDCCH candidate that needs to be detected. By transmitting the PDCCH, the terminal can reduce the number of times of detection of the PDCCH.

For step 11, the step of determining the PDCCH candidates to be detected in the target time slot may include:

According to the second number and the first number, determine the number of detections of the third number to be discarded;

Here, continue to use the above examples for description. In order to avoid the situation in the above example, according to the agreement on the maximum number of detections for each time slot and each serving cell, the terminal can determine that the maximum number of times it can detect on a time slot with a subcarrier interval of 15KHz is: 44 times. If the maximum number of detections of the PDCCH candidates configured by the base station for the terminal in this time slot is 48 times, the terminal can determine that 4 times of detections need to be discarded according to the difference between the two.

It should be noted that the third quantity is preferably the difference between the first quantity and the second quantity, which is the difference between 48 and 44 by the above example, that is, it is preferable to discard 4 times of detection. However, it can be understood that the number of discards may also be greater than 4 times, that is, the third number is greater than or equal to the difference between the first number and the second number, and is less than the first number.

According to a preset discarding rule, a fourth number of PDCCH candidates to be discarded are selected from the target time slot, and the remaining PDCCH candidates in the target time slot are determined, wherein the PDCCH candidates of the fourth number of PDCCH candidates are determined. The number of detections is greater than or equal to the third number;

Here, continue to use the above examples for description. In the above example, the number of detections needs to be discarded 4 times, so that the number of detections configured by the base station for the terminal on the target time slot is not greater than the maximum number of detections that the terminal can perform on the time slot. Suppose the discarding rule discards some PDCCH candidates, thereby reducing the maximum number of detections required. For example, discarding 2 PDCCH candidates in the first search space set in the target time slot, where the downlink control information of the first search space set is the part of the scheduling data. For the second downlink control information, and the data sizes of the two formats of downlink control information included in the downlink control information are different, the PDCCH candidates in the search space set need to be detected twice, so two PDCCH candidates are discarded in the search space set The PDCCH candidate can make the maximum number of detections that the terminal can perform on the time slot not less than the maximum number of detections required by the PDCCH candidate configured by the base station. It can be known from the above table that the maximum number of detections that can be performed by the terminal is different on time slots with different subcarrier intervals.

The remaining PDCCH candidates are determined as PDCCH candidates to be detected in the target time slot.

Here, the discarded PDCCH candidates are excluded from the PDCCH candidates configured by the base station, and the remaining PDCCH candidates are determined as the PDCCH candidates to be detected in the target time slot.

In this embodiment of the present invention, when the total number of detections required by the PDCCH candidates configured in the target time slot exceeds the maximum number of detections of the terminal on the target time slot, part of the PDCCH candidates is discarded by using a preset discarding rule, so that the remaining PDCCH candidates are discarded. The number of detections of the discarded PDCCH candidates is not greater than the maximum number of detections of the terminal in this time slot, the terminal will no longer detect the discarded PDCCH candidates, and the base station will not schedule the terminal on these discarded PDCCH candidates, so that the terminal can Reduce the number of PDCCH detections.

Further, the preset discarding rule may be a rule based on a preset variable, and the preset variable includes the index of the search space set configured on the target time slot, the index of the CCE, the aggregation level, and the fourth quantity. at least one. Which PDCCH candidates are discarded at which aggregation levels of which search space sets and which positions of the discarded PDCCH candidates can be determined according to the discarding rules or functions for discarding PDCCH candidates defined by these four variables.

Further, in the preset discarding rule, the number of discarded PDCCH candidates of higher aggregation level does not exceed the number of discarded PDCCH candidates of lower aggregation level, or the discarded ratio of PDCCH candidates of higher aggregation level. , does not exceed the drop ratio among PDCCH candidates of lower aggregation levels.

Here, since the number of PDCCH candidates with a higher aggregation level tends to be small, and the number of PDCCH candidates with a lower aggregation level is relatively large, through the preset discarding rule, more PDCCH candidates with a lower aggregation level can be discarded, The impact on PDCCH candidates of higher aggregation levels is reduced, and the collision probability between different user terminals is reduced.

For the above, the step of selecting the fourth number of PDCCH candidates to be discarded from the target time slot according to the preset discarding rule may include:

According to the first preset rule, determine the fifth number of PDCCH candidates to be discarded in each aggregation level of each search space set, wherein the number of PDCCH candidates to be discarded in each aggregation level of each search space set The sum of the fifth number is equal to the fourth number, and the sum of the detection times of the PDCCH candidates that need to be discarded in each aggregation level of each search space set is greater than or equal to the third number;

And, according to the second preset rule, the fourth number of PDCCH candidates is selected from the PDCCH candidates in each aggregation level of each search space set.

In this embodiment of the present invention, discarding PDCCH candidates is divided into two levels. The first level is to determine in which search space set several PDCCH candidate sets of which aggregation level are discarded according to the first preset rule, and the second level is According to the second preset rule, which position or positions of several PDCCH candidate sets are discarded in the multiple candidate sets of the same aggregation level. Further description is given below by way of examples. For example, the number of detections currently needs to be discarded 6 times. At this time, there are PDCCH candidates with aggregation levels of 2, 4, and 8, and these candidates are distributed in the first search space set and the second search space set, and need to be determined according to the first preset rule. The number of PDCCH candidates to be discarded in each aggregation level of each search space set, for example, according to a first preset rule, it is determined to discard two PDCCH candidates with aggregation level 2 in the first search space set, and according to the first search space set The downlink control information of the set determines that each PDCCH candidate in the search space set needs to be detected twice, then it can be determined that discarding two PDCCH candidates in the first search space set can discard four detection times, and in the second search space set 1 PDCCH candidate with aggregation level 2 and 1 PDCCH candidate with aggregation level 4 are discarded, and according to the downlink control information of the second search space set, it is determined that each PDCCH candidate in the search space set needs to be detected once, Then discarding 2 more in the second search space set can meet the goal of discarding 6 detection times in total; further, it is necessary to determine the position of the PDCCH candidate to be discarded in the search space set to which it belongs according to the second preset rule, for example 2 The positions of the PDCCH candidates with aggregation level 2 in the first search space set. For example, there are 4 PDCCH candidates with aggregation level 2 in the first search space set. It is required to determine the position of the 2 PDCCH candidates to be discarded among the 4 PDCCH candidates. position, such as first and third in order.

Wherein, the downlink control information configured in each search space set includes: first downlink control information for back-off transmission or scheduling data or second downlink control information for scheduling data;

The data size of the downlink control information of the first format in the first downlink control information is the same as the data size of the downlink control information of the second format. For each PDCCH in the search space set including the first downlink control information The number of candidate detections is 1;

When the data size of the downlink control information in the third format and the data size of the downlink control information in the fourth format in the second downlink control information are the same, perform a search on each PDCCH candidate in the search space set including the second downlink control information The number of detections is 1; otherwise, the number of detections for each PDCCH candidate in the search space set including the second downlink control information is 2.

Here, the first downlink control information may be fallback DCI (DCI format 0_0 and DCI format1_0), wherein the data size of the first format downlink control information DCI format 0_0 is the same as the data size of the second format downlink control information DCI format 1_0, so Each PDCCH candidate terminal in the search space set including the first downlink control information needs to be detected once; the second downlink control information may be the DCI of the scheduling data (DCI format 0_1 and DCI format 1_1), wherein the third format downlink control information DCI When the data size of format 0_1 is the same as the data size of the downlink control information of the fourth format DCI format 1_1, each PDCCH candidate terminal in the search space set including the second downlink control information needs to be detected once, otherwise, when the downlink control information of the third format is detected once. When the data size of the control information DCI format 0_1 and the data size of the fourth format downlink control information DCI format 1_1 are different, each PDCCH candidate terminal in the search space set including the second downlink control information needs to be detected twice.

In order to better illustrate the first preset rule, the present invention provides three preferred embodiments, each of which includes a first preset rule. It can be understood that the specific rules can be defined according to the above four variables, and are not limited to the following four embodiments.

First, the step of determining the fifth number of PDCCH candidates to be discarded in each aggregation level of each search space set may include:

In the order of increasing aggregation levels, the sixth number of PDCCH candidates to be discarded in each aggregation level is determined one by one, until the sum of the detection times of the determined PDCCH candidates to be discarded reaches the third number, and the sixth number of PDCCH candidates to be discarded reaches the third number. The number is the smaller of the number of PDCCH candidates at the aggregation level and the number of PDCCH candidates currently remaining to be discarded; wherein, if the number of PDCCH candidates to be discarded in one aggregation level is greater than or equal to 2, and the number of PDCCH candidates in the aggregation level is greater than or equal to 2 The PDCCH candidates are distributed in at least two search space sets, and the PDCCH candidates that need to be discarded in the aggregation level are equally divided into each search space set according to the increasing order of the indexes of the search space sets.

Wherein, the number of the remaining PDCCH candidates that need to be discarded is the difference between the third number and the sum of the detected times of the PDCCH candidates that need to be discarded. It has been determined that the sum of the detection times of the discarded PDCCH candidates is 6, and the number of PDCCH candidates remaining to be discarded is 4 (at this time, each PDCCH candidate needs to be detected once). If the sum of the detection times of the PDCCH candidates that need to be discarded reaches the third number, it will not be discarded. For example, it is determined that 4 more PDCCH candidates need to be discarded. The sum of the detection times of the PDCCH candidates satisfies the requirement, and is not discarded any more.

Further description is given below by way of examples. In this embodiment, the number of discarded PDCCH candidate sets is calculated in a manner of first increasing the aggregation level and then increasing the search space set index. Therefore, PDCCH candidates with low aggregation levels are preferentially discarded, and the impact on PDCCH candidates with higher aggregation levels is reduced. The number of PDCCH candidate sets to be discarded at a certain aggregation level=min{the remaining number to be discarded, the number of all PDCCH candidates in this aggregation level}. If the PDCCH candidates of one aggregation level are distributed in multiple search space sets, the discarded PDCCH candidates are equally divided into each search space set in the order of increasing indexes of the search space sets. For example, search space set #1 includes 2 PDCCHs with aggregation level 2 and 2 PDCCHs with aggregation level 4; search space set #2 includes 2 PDCCHs with aggregation level 4 and 1 PDCCH with aggregation level 8 the PDCCH. A total of 4 PDCCHs need to be discarded, then in the order of increasing aggregation level, the PDCCH candidates with aggregation level 2 are discarded first, that is, the PDCCH candidates with aggregation level 2 in the 2 search space sets #1 are discarded; then the PDCCH candidates with aggregation level 4 are discarded. Candidate, since the PDCCH candidates with aggregation level 4 are distributed in two search space sets, the PDCCH candidates with aggregation level 4 in one search space set #1 and the PDCCH candidates with aggregation level 4 in one search space set #2 are discarded. PDCCH candidate. In the above examples, the PDCCH candidates in the search space set only need to be detected once. After aggregating the PDCCH candidates of level 2, the discarding may be stopped if the number of detections of the discarded PDCCH candidates reaches the third number. It can be understood that, in this embodiment and the following embodiments, after determining the discarded PDCCH candidates, it is determined whether it is necessary to continue discarding the PDCCH candidates by whether the sum of the detection times of the determined PDCCH candidates reaches the third number. When the sum of the detection times of the discarded PDCCH candidates reaches the third number, the discarding may be stopped.

Wherein, the above-mentioned equalization is described by an example in each search space set. For example, a search space set index of 1 includes 2 PDCCH candidates with aggregation level 4, and a search space set index of 2 includes 2 PDCCH candidates with aggregation level 4. If 3 PDCCH candidates with aggregation level 4 are to be dropped at this time, 2 out of 1 search space set index should be dropped, and 1 out of 2 search space set index should be dropped. Therefore, the equalization can be achieved through multiple rounds of division. During each round of division, according to the increasing order of the search space set index, one PDCCH that needs to be discarded is set in each space set in turn, until The total number of discards required to reach this aggregation level.

Second, the step of determining the fifth number of PDCCH candidates to be discarded in each aggregation level of each search space set may include:

Determine the number of PDCCH candidates that need to be discarded through one or more rounds of determination processes, until the sum of the detection times of the determined PDCCH candidates that need to be discarded reaches the third number; wherein, in each round In the process of determining the aggregation level, poll each pending aggregation level in the order of increasing aggregation level, and set 1 PDCCH candidate to be discarded in each polled pending aggregation level, and at the end of each round , update the pending aggregation level;

Wherein, polling each aggregation level to be processed in the order of increasing aggregation level, and setting one PDCCH candidate to be discarded in each polled aggregation level to be processed will be described by taking an example. For example, if there are PDCCH candidates with aggregation level 2, 4, and 8, first determine a PDCCH candidate with aggregation level 2, then determine a PDCCH candidate with aggregation level 4, and then determine a PDCCH candidate with aggregation level 8. The above is in one round , if the sum of the detection times of the discarded PDCCH candidates after one round is less than the third number, a second round needs to be performed until the sum of the detection times of the discarded PDCCH candidates reaches the third number.

And, when setting the one PDCCH candidate that needs to be discarded: determine the search space set where the one PDCCH candidate to be discarded is located according to the increasing order of the search space set index in the aggregation level, or, according to the search space set In the order of increasing set index, determine the first search space set to be processed after the first search space set and including the PDCCH candidates of the aggregation level, and use the first search space set to be processed as the one required The search space set where the discarded PDCCH candidates are located, the first search space set is: in the current round, the search space set where the discarded PDCCH candidates are located at the previous aggregation level;

Continuing to illustrate with the above example, if the PDCCH candidate with aggregation level 2 is in search space set 1, and the PDCCH candidates with aggregation level 4 exist in both search space set 1 and search space set 2, according to the search space set In the order of increasing indexes, the search space set 2 including the PDCCH candidates with aggregation level 4 after the search space set 1 where the aggregation level 2 is located is determined as the search space set to be processed.

Further description will be given for determining the search space set where the one PDCCH candidate to be discarded is located in the above-mentioned order according to the increasing order of the search space set index in the aggregation level. For example, one drop should be set at aggregation level 4 in the first round, one drop should be set at aggregation level 4 in the second round, and one drop should be set at the adjacent round, according to the increasing order of the space set index, Set the space set where the one discarded PDCCH candidate is located. If there is no PDCCH candidate of the aggregation level in the next space set in the increasing order, continue to poll the next space set in the order of increasing search space set index.

Wherein, the to-be-processed aggregation level is initially all aggregation levels including the target time slot, and the updating the to-be-processed aggregation level includes: the highest aggregation level among the to-be-processed aggregation levels is not currently discarded When the number of PDCCH candidates is less than or equal to 1, the highest aggregation level is deleted from the to-be-processed aggregation level.

When the total number of PDCCH candidates with the highest aggregation level is 1 in all search space sets, skip the discarding of PDCCH candidates of this aggregation level, thereby ensuring that the number of PDCCH candidates with the highest aggregation level exists in the search space set, reducing the need for higher aggregation levels. The impact of the level of PDCCH candidates reduces the collision probability between different user terminals.

Further description is given below by way of examples. In this embodiment, the number of detections required for the PDCCH candidates in each search space set is 1. It can be understood that when the number of detections of the PDCCH candidates to be discarded is 2, only the PDCCH candidates need to be detected. The number of PDCCHs is multiplied by 2, and the detection times of all the PDCCH candidates determined to have been discarded are summed, and whether the PDCCH needs to be continued to be discarded can be determined according to whether the sum reaches the third number. The number of PDCCH candidate sets to be discarded at each aggregation level in each round is fixed at 1, and the PDCCH candidate set is discarded in a manner of increasing the search space index at the same time. At this time, the total number of PDCCH candidate sets of the highest aggregation level may be 1 in all search space sets, and the discarding of the PDCCH candidate sets of this aggregation level is skipped from this round, and so on. For example, search space set #1 contains 4 PDCCHs with aggregation level 2 and 2 PDCCHs with aggregation level 4; search space set #2 contains 2 PDCCHs with aggregation level 4 and 2 PDCCHs with aggregation level 8 PDCCH. A total of 5 PDCCHs need to be discarded. In the first round, 1 PDCCH with aggregation level 2 in search space set #1, 1 PDCCH with aggregation level 4 in search space set #2, and 1 search space set #2 are discarded. A PDCCH with a medium aggregation level of 8. In the second round, the PDCCH with aggregation level 2 in one search space set #1 and the PDCCH with aggregation level 4 in one search space set #2 are discarded.

Third, the step of determining the fifth number of PDCCH candidates to be discarded in each aggregation level of each search space set may include:

Taking the PDCCH candidates of each aggregation level of each search space set as a target object, calculating the product of the proportional value and the third number and rounding up to determine the number of detections to be discarded that need to be discarded in each target object, Wherein, the ratio value is the ratio of the number of detections of the PDCCH candidates included in the target object to the first number;

Determine the number of PDCCH candidates to be discarded in each target object according to the number of detections to be discarded, wherein if the number of detections to be discarded in all target objects exceeds the third number, the aggregation level is decremented first, and then the search is performed again. In the decreasing order of the spatial set index, one PDCCH candidate to be discarded is sequentially reduced from each target object, until the sum of the detection times of the determined PDCCH candidates to be discarded reaches the third number. Wherein, after reducing one PDCCH candidate to be discarded, if the sum of the detected times of the determined PDCCH candidates to be discarded is less than the third number, the PDCCH candidate is discarded.

As a target object, the product of the proportional value and the third number is calculated and rounded up, that is, the sum of the number of detections required to calculate a PDCCH candidate of an aggregation level in a search space set accounts for the first number The number of detections to be discarded for each aggregation level in each search space set is determined in proportion to the number of detections to be discarded. The number of times determines the number of PDCCH candidates to be discarded. For example, the number of detections to be discarded for the first aggregation level in the first search space set is 4. If the PDCCH candidates in the search space set need to be detected once, they need to be discarded. There are 4 PDCCH candidates. If the PDCCH candidates in the search space set need to be detected twice, 2 PDCCH candidates need to be discarded. The above method of proportional discarding thus avoids discarding only from low aggregation level to high aggregation level, reduces the impact on the terminals in the cell center that only need low aggregation level, and reduces the missed detection of PDCCH. At the same time, due to rounding up, the total number after proportional allocation is often larger than the minimum number to be discarded. Therefore, in the order of decreasing aggregation level first, and then search space set index decreasing, each target object is decreased by 1 in turn. PDCCH candidates that need to be discarded, so that PDCCH candidates of higher aggregation levels are retained to reduce the impact on PDCCH candidates of higher aggregation levels.

Further description is given below by way of examples. In this embodiment, it is assumed that a total of m detection times needs to be discarded, and the total detection times of PDCCH candidates of a certain aggregation level of a certain search space set is n, then the aggregation level needs to be discarded. The number of PDCCH candidates to be discarded is determined according to the number of detections and the number of detections required for PDCCH candidates in the search space set, where N is the sum of the number of detections required for all PDCCH candidates on all search space sets, That is, the first quantity. Due to rounding up, if the number of detections that need to be discarded at all aggregation levels in all search space sets exceeds the third number that needs to be discarded, according to the aggregation level first, from high to low, in the search space index from high to low The method reduces and discards one PDCCH successively until the sum of the detection times of the determined PDCCH candidates that need to be discarded reaches the third number. Wherein, after reducing one PDCCH candidate to be discarded, if the sum of the detected times of the determined PDCCH candidates to be discarded is less than the third number, the PDCCH candidate is discarded. For the convenience of description, the following description takes as an example that only one detection of the PDCCH candidates in each search space set is required. For example, search space set #1 contains 4 PDCCHs with aggregation level 2 and 2 PDCCHs with aggregation level 4; search space set #2 contains 2 PDCCHs with aggregation level 4 and 2 PDCCHs with aggregation level 8 PDCCH. A total of 4 detection times need to be discarded. For the first calculation, the aggregation level of search space set #1 is 2 and needs to be discarded. Since the PDCCH candidate only needs to be detected once, the number of discarded PDCCH candidates is 2, and the aggregation level of search space set #1 is 4 and needs to be discarded The number of detections, the search space set #2 aggregation level is 4 and needs to be discarded The number of detections, the search space set #2 aggregation level is 8 and needs to be discarded The number of detections, because the first calculation needs to discard 5 detections, which is greater than the 4 detections that need to be discarded, so the highest aggregation level, that is, search space set #2 PDCCH candidates with aggregation level 8 do not need to be discarded, and the final result It is that search space set #1 with aggregation level 2 needs to drop 2 PDCCH candidates, search space set #1 with aggregation level 4 needs to drop 1 PDCCH candidate, and search space set #2 with aggregation level 4 needs to drop 1 PDCCH candidate.

It can be understood that, in the above calculation of the product of the proportional value and the third quantity and rounding up, in another embodiment, the product of the proportional value and the third quantity may be calculated and rounded down, at this time. If the sum of the number of detections to be discarded in all the target objects is less than the third number, then one PDCCH candidate to be discarded is added to each target object in the order of increasing the aggregation level first and then the search space set index increasing. , until the sum of the detection times of the determined PDCCH candidates that need to be discarded reaches the third number.

Fourth, selecting the fifth number of PDCCH candidates from PDCCH candidates in each aggregation level of each search space set may include:

Calculate the third number divided by the number of search space sets and round down to determine the number of detections of the seventh number that need to be discarded for each search space set, where if the sum of the seventh number of each search space set is is less than the third number, then the search space sets are sorted in descending order according to the number of PDCCH candidates included in each search space set, and an additional PDCCH candidate is discarded in each search space set in descending order, until The sum of the seventh number and the number of times of detection of additionally discarded PDCCH candidates reaches the third number;

Here, by dividing the third number by the number of search space sets, the number of detections that need to be discarded is evenly distributed to each search space set. The spatial set discards 5 detections. Since rounding down may be insufficient, for example, a total of 10 detections need to be discarded, and there are 3 search space sets, then each search space set discards 3 detections, and there is one more detection, then the search space set is discarded from the search space set. The search space set with the largest number of PDCCH candidates is additionally discarded once.

According to the seventh number and the additional discarded PDCCH candidates, determine the number of PDCCH candidates that need to be discarded for each search space set;

Here, since the number of detections that need to be discarded is known, for example, it needs to be discarded 4 times. According to the number of detections of PDCCH candidates in the search space set, for example, each PDCCH candidate in the search space set needs to be detected 2 times, which can be calculated to obtain The number of PDCCH candidates to be discarded in the search space set, that is, 4 divided by 2, and 2 PDCCH candidates need to be discarded.

Through one or more rounds of index coding process, the PDCCH candidates in each search space set are indexed and numbered, and according to the descending order of the coding values of the index coding, the discarded items to be discarded in each search space set are determined. The aggregation level of the PDCCH candidates and the PDCCH candidates to be discarded, wherein in each round, the index coding is performed on one PDCCH candidate in each aggregation level in descending order of the aggregation level, and the coding value is The order of increasing is determined.

Here, further description is given by way of example. After determining the number of PDCCH candidates to be discarded in each search space set, it is necessary to determine which aggregation levels to discard. Index coding is performed for each PDCCH candidate according to the aggregation level and the number of PDCCHs at each aggregation level. For example, a two-dimensional index can be established. The highest priority is in the upper right corner of the matrix, and the lowest priority is in the lower left corner, as shown in the following table. ,

Wherein aggregation level=1, 2, 4, 8, the number of PDCCH candidates is 4, 4, 2, 2, respectively. For the example in the above table, the number of PDCCH candidates with aggregation level 1 is 4, and the index code of each PDCCH candidate is 4. The values are 3, 7, 9, and 11 respectively; according to the number of PDCCH candidates to be discarded, the ones with the highest indices are discarded. Thereby, more PDCCH candidates with a large number of PDCCH candidates are discarded, and more PDCCH candidates with lower aggregation levels are discarded, thereby reducing the impact on PDCCH candidates of higher levels, and at the same time, it is not possible to discard the PDCCH candidates of a certain aggregation level. All PDCCH candidates are discarded, and some PDCCH candidates with lower aggregation levels are maintained, thereby reducing the impact on terminals that only use PDCCH candidates with lower aggregation levels in the cell.

Through the above embodiments, it is explained how to determine the number of PDCCH candidates to be discarded at each aggregation level and the search space set to which they belong. The number of discarded PDCCH candidates also needs to be determined according to the second preset rule in the search space to which the discarded PDCCH candidates belong.

Wherein, selecting the fifth number of PDCCH candidates from PDCCH candidates in each aggregation level of each search space set may include:

Starting from a PDCCH candidate at a preset position in each aggregation level of each search space set, according to a preset interval, select the fifth number of PDCCH candidates;

The PDCCH candidates of the preset positions may be the starting PDCCH candidates in the aggregation level of the search space set or other positions, such as the second, third and so on PDCCH candidates. The preset interval may be 0, that is, the first PDCCH candidate starting position of the aggregation level in the search space set is continuously discarded. Of course, the preset interval may also be other natural numbers, so that the first PDCCH candidate starting position of the aggregation level in the search space set can be discarded at the preset interval. For example, if the preset interval is set to 1, the starting position of the first PDCCH candidate of the aggregation level in the search space set starts to discard every other PDCCH candidate until the fourth number is reached. In one embodiment, the preset interval is an interval value obtained according to a preset formula q/Q, where q is the number of the aggregation level to be discarded, and Q is the total number of the aggregation level in the search space set, for example, in There are 4 PDCCH candidates with aggregation level 2 in search space set 1, and 2 need to be discarded, then the interval is 2, then the interval between the first drop position and the second drop position is 2, for example, the first and second drop positions are dropped. Three, when the fourth number is still not met until the last bit is discarded, the aggregation level continues to discard according to the preset interval at the starting position of the search space set.

or,

Based on a preset function whose variables are the terminal identifier and/or the time slot number, calculate the positions of the PDCCH candidates to be discarded in each aggregation level of each search space set, and select the first PDCCH candidates according to the calculated positions. Five number of PDCCH candidates.

Among them, when the preset interval is used for discarding, different terminals may discard PDCCH candidates at the same position, so that the base station can only schedule these terminals in a limited interval, which is equivalent to restricting the base station to schedule PDCCHs of multiple terminals range of resources. Therefore, in the embodiment of the present invention, the position to be discarded can also be calculated by a preset function based on the terminal identifier and/or the time slot sequence number as variables. The preset function is preferably a random function, and each position to be discarded is obtained by calculating the random function, so that the PDCCH candidate positions discarded by different terminals are random. Introducing a randomization function can reduce the probability of collision between different users. It can be understood that, for the terminal and the reference, when the same terminal identifier and/or time slot sequence number are variables, the location results obtained by the two are the same.

Referring to FIG. 2, an embodiment of the present invention further provides a method for sending a physical downlink control channel, which is applied to a network device. The sending method includes:

Step 21, when the first number exceeds the second number, determine the PDCCH candidates for transmission in the target time slot, and the first number is the number of detections required for all PDCCH candidates configured in the target time slot The second number is the number of the maximum detection times of the terminal on the target time slot;

Step 22: Send a PDCCH to the terminal on the PDCCH candidate for transmission.

In the embodiment of the present invention, when the number of detections required for all PDCCH candidates configured in the target time slot exceeds the maximum number of detections of the terminal on the target time slot, the PDCCH candidates that need to be detected are determined, so that the required detection times are determined. The sum of the detection times of the detected PDCCH candidates is not greater than the maximum detection times of the terminal on the time slot. The terminal only detects the PDCCH on the PDCCH candidate that needs to be detected, and the base station also sends the terminal to the PDCCH candidate that needs to be detected. By transmitting the PDCCH, the terminal can reduce the number of times of detection of the PDCCH.

In this embodiment of the present invention, when the total number of detections required by the PDCCH candidates configured in the target time slot exceeds the maximum number of detections of the terminal on the target time slot, part of the PDCCH candidates is discarded by using a preset discarding rule, so that the remaining PDCCH candidates are discarded. The number of detections of the discarded PDCCH candidates is not greater than the maximum number of detections of the terminal in this time slot, the terminal will no longer detect the discarded PDCCH candidates, and the base station will not schedule the terminal on these discarded PDCCH candidates, so that the terminal can Reduce the number of PDCCH detections.

Further, the step of determining the PDCCH candidates for transmission in the target time slot includes:

According to the second number and the first number, determine the number of detections of the third number to be discarded;

According to a preset discarding rule, a fourth number of PDCCH candidates to be discarded are selected from the target time slot, and the remaining PDCCH candidates in the target time slot are determined, wherein the PDCCH candidates of the fourth number of PDCCH candidates are determined. The number of detections is greater than or equal to the third number;

The remaining PDCCH candidates are determined as PDCCH candidates for transmission in the target time slot.

Further, the preset discarding rule is a rule based on a preset variable, and the preset variable includes at least the index of the search space set configured on the target time slot, the index of the CCE, the aggregation level, and the fourth quantity. one. It can be understood that, when the network device configures the terminal, the number of PDCCH candidates configured in only a few time slots may exceed the maximum number of PDCCH detections of the terminal on the target time slot. , therefore, in order to increase the resources of PDCCH candidates that can be scheduled, the network device may not use the above-mentioned preset discarding rule to discard.

Further, in the preset discarding rule, the number of discarded PDCCH candidates of higher aggregation level does not exceed the number of discarded PDCCH candidates of lower aggregation level, or the discarded ratio of PDCCH candidates of higher aggregation level. , does not exceed the drop ratio among PDCCH candidates of lower aggregation levels.

Further, the step of selecting the fourth number of PDCCH candidates to be discarded from the target time slot according to a preset discarding rule includes:

According to the first preset rule, determine the fifth number of PDCCH candidates to be discarded in each aggregation level of each search space set, wherein the number of PDCCH candidates to be discarded in each aggregation level of each search space set The sum of the fifth number is equal to the fourth number, and the sum of the detection times of the PDCCH candidates that need to be discarded in each aggregation level of each search space set is greater than or equal to the third number;

And, according to the second preset rule, the fourth number of PDCCH candidates is selected from the PDCCH candidates in each aggregation level of each search space set.

Further, the downlink control information configured in each search space set includes: first downlink control information for back-off transmission or scheduling data or second downlink control information for scheduling data;

The data size of the downlink control information of the first format in the first downlink control information is the same as the data size of the downlink control information of the second format. For each PDCCH in the search space set including the first downlink control information The number of candidate detections is 1;

When the data size of the downlink control information in the third format and the data size of the downlink control information in the fourth format in the second downlink control information are the same, perform a search on each PDCCH candidate in the search space set including the second downlink control information The number of detections is 1; otherwise, the number of detections for each PDCCH candidate in the search space set including the second downlink control information is 2.

Further, the step of determining the fifth number of PDCCH candidates that need to be discarded in each aggregation level of each search space set includes:

In the order of increasing aggregation levels, the sixth number of PDCCH candidates to be discarded in each aggregation level is determined one by one, until the sum of the detection times of the determined PDCCH candidates to be discarded reaches the third number, and the sixth number of PDCCH candidates to be discarded reaches the third number. The number is the smaller of the number of PDCCH candidates at the aggregation level and the number of PDCCH candidates currently remaining to be discarded; wherein, if the number of PDCCH candidates to be discarded in one aggregation level is greater than or equal to 2, and the number of PDCCH candidates in the aggregation level is greater than or equal to 2 The PDCCH candidates are distributed in at least two search space sets, and the PDCCH candidates that need to be discarded in the aggregation level are equally divided into each search space set according to the increasing order of the indexes of the search space sets.

Further, the step of determining the fifth number of PDCCH candidates that need to be discarded in each aggregation level of each search space set includes:

Determine the number of PDCCH candidates that need to be discarded through one or more rounds of determination processes, until the sum of the detection times of the determined PDCCH candidates that need to be discarded reaches the third number; wherein, in each round In the process of determining the aggregation level, poll each pending aggregation level in the order of increasing aggregation level, and set 1 PDCCH candidate to be discarded in each polled pending aggregation level, and at the end of each round , update the pending aggregation level;

And, when setting the one PDCCH candidate that needs to be discarded: determine the search space set where the one PDCCH candidate to be discarded is located according to the increasing order of the search space set index in the aggregation level, or, according to the search space set In the order of increasing set index, determine the first search space set to be processed after the first search space set and including the PDCCH candidates of the aggregation level, and use the first search space set to be processed as the one required The search space set where the discarded PDCCH candidates are located, the first search space set is: in the current round, the search space set where the discarded PDCCH candidates are located at the previous aggregation level;

Wherein, the to-be-processed aggregation level is initially all aggregation levels including the target time slot, and the updating the to-be-processed aggregation level includes: the highest aggregation level among the to-be-processed aggregation levels is not currently discarded When the number of PDCCH candidates is less than or equal to 1, the highest aggregation level is deleted from the to-be-processed aggregation level.

Further, the step of determining the fifth number of PDCCH candidates that need to be discarded in each aggregation level of each search space set includes:

Taking the PDCCH candidates of each aggregation level of each search space set as a target object, calculating the product of the proportional value and the third number and rounding up to determine the number of detections to be discarded that need to be discarded in each target object, Wherein, the ratio value is the ratio of the number of detections of the PDCCH candidates included in the target object to the first number;

Determine the number of PDCCH candidates to be discarded in each target object according to the number of detections to be discarded, wherein if the number of detections to be discarded in all target objects exceeds the third number, the aggregation level is decremented first, and then the search is performed again. In the decreasing order of the spatial set index, one PDCCH candidate to be discarded is sequentially reduced from each target object, until the sum of the detection times of the determined PDCCH candidates to be discarded reaches the third number.

Further, selecting the fifth number of PDCCH candidates from PDCCH candidates in each aggregation level of each search space set, including:

Calculate the third number divided by the number of search space sets and round down to determine the number of detections of the seventh number that need to be discarded for each search space set, where if the sum of the seventh number of each search space set is is less than the third number, then the search space sets are sorted in descending order according to the number of PDCCH candidates included in each search space set, and an additional PDCCH candidate is discarded in each search space set in descending order, until The sum of the seventh number and the number of times of detection of additionally discarded PDCCH candidates reaches the third number;

According to the seventh number and the additional discarded PDCCH candidates, determine the number of PDCCH candidates that need to be discarded for each search space set;

Through one or more rounds of index coding process, the PDCCH candidates in each search space set are indexed and numbered, and according to the descending order of the coding values of the index coding, the discarded items to be discarded in each search space set are determined. The aggregation level of the PDCCH candidates and the PDCCH candidates to be discarded, wherein in each round, the index coding is performed on one PDCCH candidate in each aggregation level in descending order of the aggregation level, and the coding value is The order of increasing is determined.

Further, selecting the fifth number of PDCCH candidates from PDCCH candidates in each aggregation level of each search space set, including:

Starting from a PDCCH candidate at a preset position in each aggregation level of each search space set, according to a preset interval, select the fifth number of PDCCH candidates; or,

Based on a preset function whose variables are the terminal identifier and/or the time slot number, calculate the positions of the PDCCH candidates to be discarded in each aggregation level of each search space set, and select the first PDCCH candidates according to the calculated positions. Five number of PDCCH candidates.

The above-mentioned preset discarding rule is the same as the preset discarding rule adopted by the terminal, and in order to avoid repetition, details are not repeated here.

Referring to FIG. 3, an embodiment of the present invention further provides a terminal 30, including:

The processor 31 is configured to determine the PDCCH candidates to be detected in the target timeslot when the first quantity exceeds the second quantity, where the first quantity is required for all PDCCH candidates configured in the target timeslot The number of detection times of the terminal is the number of the maximum detection times of the terminal on the target time slot.

The transceiver 32 is configured to detect the PDCCH on the PDCCH candidates to be detected.

The terminal 30 in this embodiment of the present invention can implement each process in the foregoing detection method embodiments, and has corresponding beneficial effects, and to avoid repetition, details are not described here.

Preferably, the processor 31 may be specifically configured to: determine, according to the second number and the first number, the number of detections of the third number to be discarded;

According to a preset discarding rule, a fourth number of PDCCH candidates to be discarded are selected from the target time slot, and the remaining PDCCH candidates in the target time slot are determined, wherein the PDCCH candidates of the fourth number of PDCCH candidates are determined. The number of detections is greater than or equal to the third number;

The remaining PDCCH candidates are determined as PDCCH candidates to be detected in the target time slot.

Further, the preset discarding rule is a rule based on a preset variable, and the preset variable includes at least the index of the search space set configured on the target time slot, the index of the CCE, the aggregation level, and the fourth quantity. one.

Preferably, in the preset discarding rule, the number of discarded PDCCH candidates of higher aggregation level does not exceed the number of discarded PDCCH candidates of lower aggregation level, or the discarded ratio of PDCCH candidates of higher aggregation level , does not exceed the drop ratio among PDCCH candidates of lower aggregation levels.

Preferably, the processor 31 may be specifically configured to: according to the first preset rule, determine the fifth number of PDCCH candidates to be discarded in each aggregation level of each search space set, wherein the number of PDCCH candidates in each search space set is The sum of the fifth number of PDCCH candidates to be discarded in each aggregation level is equal to the fourth number, and the sum of the detection times of the PDCCH candidates to be discarded in each aggregation level of each search space set greater than or equal to said third quantity;

And, according to the second preset rule, the fourth number of PDCCH candidates is selected from the PDCCH candidates in each aggregation level of each search space set.

Preferably, the downlink control information configured in each search space set includes: first downlink control information for back-off transmission or scheduling data or second downlink control information for scheduling data;

The data size of the downlink control information of the first format in the first downlink control information is the same as the data size of the downlink control information of the second format. For each PDCCH in the search space set including the first downlink control information The number of candidate detections is 1;

When the data size of the downlink control information in the third format and the data size of the downlink control information in the fourth format in the second downlink control information are the same, perform a search on each PDCCH candidate in the search space set including the second downlink control information The number of detections is 1; otherwise, the number of detections for each PDCCH candidate in the search space set including the second downlink control information is 2.

Preferably, the processor 31 may be specifically configured to: determine, one by one, the sixth number of PDCCH candidates to be discarded in each aggregation level in an increasing order of aggregation levels, until the number of times of detection of the determined PDCCH candidates to be discarded The sum reaches the third number, and the sixth number is the smaller of the number of PDCCH candidates at the aggregation level and the number of PDCCH candidates currently remaining to be discarded; There are more than or equal to 2 PDCCH candidates, and the PDCCH candidates of this aggregation level are distributed in at least two search space sets, then according to the increasing order of the indexes of the search space sets, the PDCCH candidates to be discarded in this aggregation level are equally divided into each The search space is concentrated.

Preferably, the processor 31 may be specifically configured to: determine the number of PDCCH candidates that need to be discarded through one or more rounds of determination processes, until the sum of the detection times of the determined PDCCH candidates that need to be discarded The third number is reached; wherein, in the determination process of each round, each aggregation level to be processed is polled in the order of increasing aggregation level, and 1 required aggregation level is set in each polled aggregation level to be processed. discarded PDCCH candidates, and at the end of each round, update the pending aggregation level;

And, when setting the one PDCCH candidate that needs to be discarded: determine the search space set where the one PDCCH candidate to be discarded is located according to the increasing order of the search space set index in the aggregation level, or, according to the search space set In the order of increasing set index, determine the first search space set to be processed after the first search space set and including the PDCCH candidates of the aggregation level, and use the first search space set to be processed as the one required The search space set where the discarded PDCCH candidates are located, the first search space set is: in the current round, the search space set where the discarded PDCCH candidates are located at the previous aggregation level;

Wherein, the to-be-processed aggregation level is initially all aggregation levels including the target time slot, and the updating the to-be-processed aggregation level includes: the highest aggregation level among the to-be-processed aggregation levels is not currently discarded When the number of PDCCH candidates is less than or equal to 1, the highest aggregation level is deleted from the to-be-processed aggregation level.

Preferably, the processor 31 may be specifically configured to: take the PDCCH candidates of each aggregation level of each search space set as a target object, calculate the product of the proportional value and the third number, and round up to determine The number of detections to be discarded that needs to be discarded in each target object, wherein the ratio value is the ratio of the number of detections of the PDCCH candidates included in the target object to the first number;

Determine the number of PDCCH candidates to be discarded in each target object according to the number of detections to be discarded, wherein if the number of detections to be discarded in all target objects exceeds the third number, the aggregation level is decremented first, and then the search is performed again. In the decreasing order of the spatial set index, one PDCCH candidate to be discarded is sequentially reduced from each target object, until the sum of the detection times of the determined PDCCH candidates to be discarded reaches the third number.

Preferably, the processor 31 may be specifically configured to: calculate the third number divided by the number of search space sets and round down to determine the number of detections of the seventh number to be discarded for each search space set, wherein if The sum of the seventh number of each search space set is less than the third number, then the search space sets are sorted in descending order according to the number of PDCCH candidates included in each search space set, and in descending order One additional PDCCH candidate is discarded in each search space set, until the sum of the seventh number and the number of detections of the additionally discarded PDCCH candidates reaches the third number;

According to the seventh number and the additional discarded PDCCH candidates, determine the number of PDCCH candidates that need to be discarded for each search space set;

Through one or more rounds of index coding process, the PDCCH candidates in each search space set are indexed and numbered, and according to the descending order of the coding values of the index coding, the discarded items to be discarded in each search space set are determined. The aggregation level of the PDCCH candidates and the PDCCH candidates to be discarded, wherein in each round, the index coding is performed on one PDCCH candidate in each aggregation level in descending order of the aggregation level, and the coding value is The order of increasing is determined.

Preferably, the processor 31 may be specifically configured to: start from a PDCCH candidate at a preset position in each aggregation level of each search space set, and select the fifth number of PDCCH candidates according to a preset interval; or,

Based on a preset function whose variables are the terminal identifier and/or the time slot number, calculate the positions of the PDCCH candidates to be discarded in each aggregation level of each search space set, and select the first PDCCH candidates according to the calculated positions. Five number of PDCCH candidates.

Referring to FIG. 4 , another structure of a terminal provided by an embodiment of the present invention, the terminal 400 includes: a processor 401, a transceiver 402, a memory 403, a user interface 404, and a bus interface, wherein:

In this embodiment of the present invention, the terminal 400 further includes: a computer program stored on the memory 403 and executable on the processor 401. When the computer program is executed by the processor 401, the following steps are implemented: when the first quantity exceeds the second quantity , determine the PDCCH candidates to be detected in the target time slot, the first number is the number of detection times required for all PDCCH candidates configured in the target time slot, and the second number is the number of times the terminal The maximum number of detection times on the target slot; the PDCCH is detected on the PDCCH candidates to be detected.

In FIG. 4 , the bus architecture may include any number of interconnected buses and bridges, in particular one or more processors represented by processor 401 and various circuits of memory represented by memory 403 linked together. The bus architecture may also link together various other circuits, such as peripherals, voltage regulators, and power management circuits, which are well known in the art and, therefore, will not be described further herein. The bus interface provides the interface. Transceiver 402 may be a number of elements, including a transmitter and a receiver, that provide a means for communicating with various other devices over a transmission medium. For different user equipments, the user interface 404 may also be an interface capable of externally connecting a required device, and the connected devices include but are not limited to a keypad, a display, a speaker, a microphone, a joystick, and the like.

The processor 401 is responsible for managing the bus architecture and general processing, and the memory 403 may store data used by the processor 501 in performing operations.

Optionally, when the computer program is executed by the processor 401, the following steps may also be implemented: according to the second quantity and the first quantity, determine the number of detections of the third quantity to be discarded;

According to a preset discarding rule, a fourth number of PDCCH candidates to be discarded are selected from the target time slot, and the remaining PDCCH candidates in the target time slot are determined, wherein the PDCCH candidates of the fourth number of PDCCH candidates are determined. The number of detections is greater than or equal to the third number;

The remaining PDCCH candidates are determined as PDCCH candidates to be detected in the target time slot.

Optionally, the preset discarding rule is a rule based on a preset variable, and the preset variable includes the index of the search space set configured on the target time slot, the index of the CCE, the aggregation level, and the fourth quantity. at least one.

Optionally, in the preset discarding rule, the number of discarded PDCCH candidates of higher aggregation level does not exceed the number of discarded PDCCH candidates of lower aggregation level, or the discarded number of PDCCH candidates of higher aggregation level ratio, not to exceed the drop ratio among PDCCH candidates of lower aggregation levels.

Optionally, when the computer program is executed by the processor 401, the following steps may also be implemented: according to the first preset rule, determine the fifth number of PDCCH candidates that need to be discarded in each aggregation level of each search space set, wherein each The sum of the fifth number of PDCCH candidates to be discarded in each aggregation level of each search space set is equal to the fourth number, and for the PDCCH candidates to be discarded in each aggregation level of each search space set The sum of the number of detections is greater than or equal to the third number;

And, according to the second preset rule, the fourth number of PDCCH candidates is selected from the PDCCH candidates in each aggregation level of each search space set.

Optionally, the downlink control information configured in each search space set includes: first downlink control information for back-off transmission or scheduling data or second downlink control information for scheduling data;

The data size of the downlink control information of the first format in the first downlink control information is the same as the data size of the downlink control information of the second format. For each PDCCH in the search space set including the first downlink control information The number of candidate detections is 1;

When the data size of the downlink control information in the third format and the data size of the downlink control information in the fourth format in the second downlink control information are the same, perform a search on each PDCCH candidate in the search space set including the second downlink control information The number of detections is 1; otherwise, the number of detections for each PDCCH candidate in the search space set including the second downlink control information is 2.

Optionally, when the computer program is executed by the processor 401, the following steps may also be implemented: in the order of increasing aggregation levels, determine one by one the sixth number of PDCCH candidates that need to be discarded in each aggregation level, until the determined number of PDCCH candidates that need to be discarded is determined one by one. The sum of the detection times of PDCCH candidates reaches the third number, and the sixth number is the smaller of the number of PDCCH candidates at the aggregation level and the number of PDCCH candidates currently remaining to be discarded; If the number of PDCCH candidates to be discarded in the level is greater than or equal to 2, and the PDCCH candidates of the aggregation level are distributed in at least two search space sets, the PDCCH candidates to be discarded in the aggregation level are sorted in the order of increasing index of the search space sets. Divide evenly in each search space set.

Optionally, when the computer program is executed by the processor 401, the following steps may also be implemented: determine the number of PDCCH candidates that need to be discarded through one or more rounds of determination processes, until the determined PDCCH candidates that need to be discarded are determined. The sum of the detection times reaches the third number; wherein, in the determination process of each round, the aggregation levels to be processed are polled in the order of increasing aggregation levels, and each polled aggregation level to be processed is polled. 1 PDCCH candidate that needs to be discarded is set in , and at the end of each round, the aggregation level to be processed is updated;

And, when setting the one PDCCH candidate that needs to be discarded: determine the search space set where the one PDCCH candidate to be discarded is located according to the increasing order of the search space set index in the aggregation level, or, according to the search space set In the order of increasing set index, determine the first search space set to be processed after the first search space set and including the PDCCH candidates of the aggregation level, and use the first search space set to be processed as the one required The search space set where the discarded PDCCH candidates are located, the first search space set is: in the current round, the search space set where the discarded PDCCH candidates are located at the previous aggregation level;

Wherein, the to-be-processed aggregation level is initially all aggregation levels including the target time slot, and the updating the to-be-processed aggregation level includes: the highest aggregation level among the to-be-processed aggregation levels is not currently discarded When the number of PDCCH candidates is less than or equal to 1, the highest aggregation level is deleted from the to-be-processed aggregation level.

Optionally, when the computer program is executed by the processor 401, the following steps may also be implemented: taking the PDCCH candidates of each aggregation level of each search space set as a target object, calculating the product of the proportional value and the third number and combining the results. Round up to determine the number of detections to be discarded that need to be discarded in each target object, wherein the ratio value is the ratio of the number of detections of the PDCCH candidates included in the target object to the first number;

Determine the number of PDCCH candidates to be discarded in each target object according to the number of detections to be discarded, wherein if the number of detections to be discarded in all target objects exceeds the third number, the aggregation level is decremented first, and then the search is performed again. In the decreasing order of the spatial set index, one PDCCH candidate to be discarded is sequentially reduced from each target object, until the sum of the detection times of the determined PDCCH candidates to be discarded reaches the third number.

Optionally, when the computer program is executed by the processor 401, the following steps may also be implemented: calculating the third number divided by the number of search space sets and rounding down to determine the detection of the seventh number that needs to be discarded for each search space set. number of times, wherein, if the sum of the seventh number of each search space set is less than the third number, then the search space sets are sorted in descending order according to the number of PDCCH candidates included in each search space set, and In a descending order, an additional PDCCH candidate is discarded in each search space set in turn, until the sum of the seventh number and the number of detections of the additionally discarded PDCCH candidates reaches the third number;

According to the seventh number and the additional discarded PDCCH candidates, determine the number of PDCCH candidates that need to be discarded for each search space set;

Through one or more rounds of index coding process, the PDCCH candidates in each search space set are indexed and numbered, and according to the descending order of the coding values of the index coding, the discarded items to be discarded in each search space set are determined. The aggregation level of the PDCCH candidates and the PDCCH candidates to be discarded, wherein in each round, the index coding is performed on one PDCCH candidate in each aggregation level in descending order of the aggregation level, and the coding value is The order of increasing is determined.

Optionally, when the computer program is executed by the processor 401, the following steps may also be implemented: starting from a PDCCH candidate at a preset position in each aggregation level of each search space set, and selecting the fifth the number of PDCCH candidates; or,

Based on a preset function whose variables are the terminal identifier and/or the time slot number, calculate the positions of the PDCCH candidates to be discarded in each aggregation level of each search space set, and select the first PDCCH candidates according to the calculated positions. Five number of PDCCH candidates.

Referring to FIG. 5, an embodiment of the present invention further provides a network device 50, including:

A processor 51, configured to determine the PDCCH candidates for transmission in the target time slot when the first quantity exceeds the second quantity, where the first quantity is required for all PDCCH candidates configured in the target time slot The number of detection times of the terminal, the second number is the number of the maximum detection times of the terminal on the target time slot.

A transceiver 52, configured to send a PDCCH to the terminal on the PDCCH candidates for sending.

The network device 50 in this embodiment of the present invention can implement each process in the foregoing sending method embodiments, and has corresponding beneficial effects. To avoid repetition, details are not repeated here.

Preferably, the processor 51 may be specifically configured to: determine, according to the second number and the first number, the number of detections of the third number to be discarded;

According to a preset discarding rule, a fourth number of PDCCH candidates to be discarded are selected from the target time slot, and the remaining PDCCH candidates in the target time slot are determined, wherein the PDCCH candidates of the fourth number of PDCCH candidates are determined. The number of detections is greater than or equal to the third number;

The remaining PDCCH candidates are determined as PDCCH candidates for transmission in the target time slot.

Further, the preset discarding rule is a rule based on a preset variable, and the preset variable includes at least the index of the search space set configured on the target time slot, the index of the CCE, the aggregation level, and the fourth quantity. one.

Preferably, in the preset discarding rule, the number of discarded PDCCH candidates of higher aggregation level does not exceed the number of discarded PDCCH candidates of lower aggregation level, or the discarded ratio of PDCCH candidates of higher aggregation level , does not exceed the drop ratio among PDCCH candidates of lower aggregation levels.

Preferably, the processor 51 may be specifically configured to: according to the first preset rule, determine the fifth number of PDCCH candidates to be discarded in each aggregation level of each search space set, wherein the number of PDCCH candidates of each search space set is The sum of the fifth number of PDCCH candidates to be discarded in each aggregation level is equal to the fourth number, and the sum of the detection times of the PDCCH candidates to be discarded in each aggregation level of each search space set greater than or equal to said third quantity;

And, according to the second preset rule, the fourth number of PDCCH candidates is selected from the PDCCH candidates in each aggregation level of each search space set.

Preferably, the downlink control information configured in each search space set includes: first downlink control information for back-off transmission or scheduling data or second downlink control information for scheduling data;

The data size of the downlink control information of the first format in the first downlink control information is the same as the data size of the downlink control information of the second format. For each PDCCH in the search space set including the first downlink control information The number of candidate detections is 1;

When the data size of the downlink control information in the third format and the data size of the downlink control information in the fourth format in the second downlink control information are the same, perform a search on each PDCCH candidate in the search space set including the second downlink control information The number of detections is 1; otherwise, the number of detections for each PDCCH candidate in the search space set including the second downlink control information is 2.

Preferably, the processor 51 may be specifically configured to: determine the sixth number of PDCCH candidates to be discarded in each aggregation level one by one in the order of increasing aggregation levels, until the number of times of detection of the determined PDCCH candidates to be discarded The sum reaches the third number, and the sixth number is the smaller of the number of PDCCH candidates at the aggregation level and the number of PDCCH candidates currently remaining to be discarded; There are more than or equal to 2 PDCCH candidates, and the PDCCH candidates of this aggregation level are distributed in at least two search space sets, then according to the increasing order of the indexes of the search space sets, the PDCCH candidates to be discarded in this aggregation level are equally divided into each The search space is concentrated.

Preferably, the processor 51 may be specifically configured to: determine the number of PDCCH candidates that need to be discarded through one or more rounds of determination processes, until the sum of the detection times of the determined PDCCH candidates that need to be discarded The third number is reached; wherein, in the determination process of each round, each aggregation level to be processed is polled in the order of increasing aggregation level, and 1 required aggregation level is set in each polled aggregation level to be processed. discarded PDCCH candidates, and at the end of each round, update the pending aggregation level;

And, when setting the one PDCCH candidate that needs to be discarded: determine the search space set where the one PDCCH candidate to be discarded is located according to the increasing order of the search space set index in the aggregation level, or, according to the search space set In the order of increasing set index, determine the first search space set to be processed after the first search space set and including the PDCCH candidates of the aggregation level, and use the first search space set to be processed as the one required The search space set where the discarded PDCCH candidates are located, the first search space set is: in the current round, the search space set where the discarded PDCCH candidates are located at the previous aggregation level;

Wherein, the to-be-processed aggregation level is initially all aggregation levels including the target time slot, and the updating the to-be-processed aggregation level includes: the highest aggregation level among the to-be-processed aggregation levels is not currently discarded When the number of PDCCH candidates is less than or equal to 1, the highest aggregation level is deleted from the to-be-processed aggregation level.

Preferably, the processor 51 may be specifically configured to: take the PDCCH candidates of each aggregation level of each search space set as a target object, calculate the product of the proportional value and the third number, and round up to determine The number of detections to be discarded that needs to be discarded in each target object, wherein the ratio value is the ratio of the number of detections of the PDCCH candidates included in the target object to the first number;

Determine the number of PDCCH candidates to be discarded in each target object according to the number of detections to be discarded, wherein if the number of detections to be discarded in all target objects exceeds the third number, the aggregation level is decremented first, and then the search is performed again. In the decreasing order of the spatial set index, one PDCCH candidate to be discarded is sequentially reduced from each target object, until the sum of the detection times of the determined PDCCH candidates to be discarded reaches the third number.

Preferably, the processor 51 may be specifically configured to: calculate the third number divided by the number of search space sets and round down to determine the number of detections of the seventh number that needs to be discarded for each search space set, where, if The sum of the seventh number of each search space set is less than the third number, then the search space sets are sorted in descending order according to the number of PDCCH candidates included in each search space set, and in descending order One additional PDCCH candidate is discarded in each search space set, until the sum of the seventh number and the number of detections of the additionally discarded PDCCH candidates reaches the third number;

According to the seventh number and the additional discarded PDCCH candidates, determine the number of PDCCH candidates that need to be discarded for each search space set;

Through one or more rounds of index coding process, the PDCCH candidates in each search space set are indexed and numbered, and according to the descending order of the coding values of the index coding, the discarded items to be discarded in each search space set are determined. The aggregation level of the PDCCH candidates and the PDCCH candidates to be discarded, wherein in each round, the index coding is performed on one PDCCH candidate in each aggregation level in descending order of the aggregation level, and the coding value is The order of increasing is determined.

Preferably, the processor 51 may be specifically configured to: start from a PDCCH candidate at a preset position in each aggregation level of each search space set, and select the fifth number of PDCCH candidates according to a preset interval; or,

Based on a preset function whose variables are the terminal identifier and/or the time slot number, calculate the positions of the PDCCH candidates to be discarded in each aggregation level of each search space set, and select the first PDCCH candidates according to the calculated positions. Five number of PDCCH candidates.

Referring to FIG. 6, an embodiment of the present invention provides another schematic structural diagram of a network device 600, including: a processor 601, a transceiver 602, a memory 603, and a bus interface, wherein:

In this embodiment of the present invention, the network device 600 further includes: a computer program stored on the memory 603 and executable on the processor 601, and the computer program is executed by the processor 601 to implement the following steps: when the first quantity exceeds the second quantity , determine the PDCCH candidates for transmission in the target time slot, the first number is the number of detection times required for all PDCCH candidates configured in the target time slot, and the second number is the number of times the terminal is in the target time slot The maximum number of times of detection on the target time slot; the PDCCH is sent to the terminal on the PDCCH candidate for sending.

In FIG. 6, the bus architecture may include any number of interconnected buses and bridges, in particular one or more processors represented by processor 601 and various circuits of memory represented by memory 603 linked together. The bus architecture may also link together various other circuits, such as peripherals, voltage regulators, and power management circuits, which are well known in the art and, therefore, will not be described further herein. The bus interface provides the interface. Transceiver 602 may be a number of elements, including a transmitter and a receiver, that provide a means for communicating with various other devices over a transmission medium.

The processor 601 is responsible for managing the bus architecture and general processing, and the memory 603 may store data used by the processor 601 in performing operations.

Optionally, when the computer program is executed by the processor 601, the following steps may also be implemented: according to the second quantity and the first quantity, determine the number of detections of the third quantity that needs to be discarded;

According to a preset discarding rule, a fourth number of PDCCH candidates to be discarded are selected from the target time slot, and the remaining PDCCH candidates in the target time slot are determined, wherein the PDCCH candidates of the fourth number of PDCCH candidates are determined. The number of detections is greater than or equal to the third number;

The remaining PDCCH candidates are determined as PDCCH candidates for transmission in the target time slot.

Optionally, the preset discarding rule is a rule based on a preset variable, and the preset variable includes the index of the search space set configured on the target time slot, the index of the CCE, the aggregation level, and the fourth quantity. at least one.

Optionally, in the preset discarding rule, the number of discarded PDCCH candidates of higher aggregation level does not exceed the number of discarded PDCCH candidates of lower aggregation level, or the discarded number of PDCCH candidates of higher aggregation level ratio, not to exceed the drop ratio among PDCCH candidates of lower aggregation levels.

Optionally, when the computer program is executed by the processor 601, the following steps may also be implemented: according to the first preset rule, determine the fifth number of PDCCH candidates that need to be discarded in each aggregation level of each search space set, wherein each The sum of the fifth number of PDCCH candidates to be discarded in each aggregation level of each search space set is equal to the fourth number, and for the PDCCH candidates to be discarded in each aggregation level of each search space set The sum of the number of detections is greater than or equal to the third number;

And, according to the second preset rule, the fourth number of PDCCH candidates is selected from the PDCCH candidates in each aggregation level of each search space set.

Optionally, the downlink control information configured in each search space set includes: first downlink control information for back-off transmission or scheduling data or second downlink control information for scheduling data;

The data size of the downlink control information of the first format in the first downlink control information is the same as the data size of the downlink control information of the second format. For each PDCCH in the search space set including the first downlink control information The number of candidate detections is 1;

When the data size of the downlink control information in the third format and the data size of the downlink control information in the fourth format in the second downlink control information are the same, perform a search on each PDCCH candidate in the search space set including the second downlink control information The number of detections is 1; otherwise, the number of detections for each PDCCH candidate in the search space set including the second downlink control information is 2.

Optionally, when the computer program is executed by the processor 601, the following steps may also be implemented: in the order of increasing aggregation levels, determine one by one the sixth number of PDCCH candidates that need to be discarded in each aggregation level, until the determined number of PDCCH candidates that need to be discarded is determined one by one. The sum of the detection times of PDCCH candidates reaches the third number, and the sixth number is the smaller of the number of PDCCH candidates at the aggregation level and the number of PDCCH candidates currently remaining to be discarded; If the number of PDCCH candidates to be discarded in the level is greater than or equal to 2, and the PDCCH candidates of the aggregation level are distributed in at least two search space sets, the PDCCH candidates to be discarded in the aggregation level are sorted in the order of increasing index of the search space sets. Divide evenly in each search space set.

Optionally, when the computer program is executed by the processor 601, the following steps may also be implemented: determine the number of PDCCH candidates that need to be discarded through one or more rounds of determination processes, until the determined PDCCH candidates that need to be discarded are determined. The sum of the detection times reaches the third number; wherein, in the determination process of each round, the aggregation levels to be processed are polled in the order of increasing aggregation levels, and each polled aggregation level to be processed is polled. 1 PDCCH candidate that needs to be discarded is set in , and at the end of each round, the aggregation level to be processed is updated;

And, when setting the one PDCCH candidate that needs to be discarded: determine the search space set where the one PDCCH candidate to be discarded is located according to the increasing order of the search space set index in the aggregation level, or, according to the search space set In the order of increasing set index, determine the first search space set to be processed after the first search space set and including the PDCCH candidates of the aggregation level, and use the first search space set to be processed as the one required The search space set where the discarded PDCCH candidates are located, the first search space set is: in the current round, the search space set where the discarded PDCCH candidates are located at the previous aggregation level;

Wherein, the to-be-processed aggregation level is initially all aggregation levels including the target time slot, and the updating the to-be-processed aggregation level includes: the highest aggregation level among the to-be-processed aggregation levels is not currently discarded When the number of PDCCH candidates is less than or equal to 1, the highest aggregation level is deleted from the to-be-processed aggregation level.

Optionally, when the computer program is executed by the processor 601, the following steps may also be implemented: taking the PDCCH candidates of each aggregation level of each search space set as a target object, calculating the product of the proportional value and the third number and combining the results. Round up to determine the number of detections to be discarded that need to be discarded in each target object, wherein the ratio value is the ratio of the number of detections of the PDCCH candidates included in the target object to the first number;

Determine the number of PDCCH candidates to be discarded in each target object according to the number of detections to be discarded, wherein if the number of detections to be discarded in all target objects exceeds the third number, the aggregation level is decremented first, and then the search is performed again. In the decreasing order of the spatial set index, one PDCCH candidate to be discarded is sequentially reduced from each target object, until the sum of the detection times of the determined PDCCH candidates to be discarded reaches the third number.

Optionally, when the computer program is executed by the processor 601, the following steps may also be implemented: calculating the third number divided by the number of search space sets and rounding down to determine the detection of the seventh number that needs to be discarded for each search space set. number of times, wherein, if the sum of the seventh number of each search space set is less than the third number, then the search space sets are sorted in descending order according to the number of PDCCH candidates included in each search space set, and In a descending order, an additional PDCCH candidate is discarded in each search space set in turn, until the sum of the seventh number and the number of detections of the additionally discarded PDCCH candidates reaches the third number;

According to the seventh number and the additional discarded PDCCH candidates, determine the number of PDCCH candidates that need to be discarded for each search space set;

Through one or more rounds of index coding process, the PDCCH candidates in each search space set are indexed and numbered, and according to the descending order of the coding values of the index coding, the discarded items to be discarded in each search space set are determined. The aggregation level of the PDCCH candidates and the PDCCH candidates to be discarded, wherein in each round, the index coding is performed on one PDCCH candidate in each aggregation level in descending order of the aggregation level, and the coding value is The order of increasing is determined.

Optionally, when the computer program is executed by the processor 601, the following steps may also be implemented: starting from a PDCCH candidate at a preset position in each aggregation level of each search space set, and selecting the fifth the number of PDCCH candidates; or,

Based on a preset function whose variables are the terminal identifier and/or the time slot number, calculate the positions of the PDCCH candidates to be discarded in each aggregation level of each search space set, and select the first PDCCH candidates according to the calculated positions. Five number of PDCCH candidates.

An embodiment of the present invention also provides a communication device, including: a memory, a processor, and a computer program stored in the memory and running on the processor, where the computer program is executed by the processor to achieve the above-mentioned The steps of the detection method, or, implement the steps of the sending method as described above.

The communication device in the embodiment of the present invention can implement each process in the foregoing detection method or the transmission method embodiment, and has corresponding beneficial effects. To avoid repetition, details are not repeated here.

Embodiments of the present invention further provide a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the steps of the detection method as described above are implemented, or, Steps to implement the sending method as described above.

The computer-readable storage medium of the embodiment of the present invention can implement each process in the foregoing detection method or the transmission method embodiment, and has corresponding beneficial effects. To avoid repetition, details are not repeated here.

Those of ordinary skill in the art can realize that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Skilled artisans may implement the described functionality using different methods for each particular application, but such implementations should not be considered beyond the scope of the present invention.

Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the above-described systems, devices and units may refer to the corresponding processes in the foregoing method embodiments, which will not be repeated here.

In the embodiments provided in this application, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the apparatus embodiments described above are only illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored, or not implemented. On the other hand, the shown or discussed mutual coupling or direct coupling or communication connection may be through some interfaces, indirect coupling or communication connection of devices or units, and may be in electrical, mechanical or other forms.

The units described as separate components may or may not be physically separated, and components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solutions in the embodiments of the present invention.

In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit.

The functions, if implemented in the form of software functional units and sold or used as independent products, may be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention can be embodied in the form of a software product in essence, or the part that contributes to the prior art or the part of the technical solution. The computer software product is stored in a storage medium, including Several instructions are used to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the detection method or the transmission method described in the various embodiments of the present invention. The aforementioned storage medium includes: a U disk, a removable hard disk, a ROM, a RAM, a magnetic disk, or an optical disk and other mediums that can store program codes.

The above are only specific embodiments of the present invention, but the protection scope of the present invention is not limited thereto. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed by the present invention. should be included within the protection scope of the present invention. Therefore, the protection scope of the present invention should be subject to the protection scope of the claims.

Claims (24)

1. A method for detecting a physical downlink control channel is applied to a terminal, and is characterized by comprising the following steps:

determining PDCCH candidates needing to be detected in a target time slot when a first number exceeds a second number, wherein the first number is the number of detection times needed by all PDCCH candidates configured in the target time slot, and the second number is the number of maximum detection times of the terminal on the target time slot;

and detecting the PDCCH on the PDCCH candidate needing to be detected.

2. The method of claim 1, wherein the step of determining the PDCCH candidates required to be detected in the target slot comprises:

determining the detection times of a third quantity which needs to be discarded according to the second quantity and the first quantity;

selecting a fourth number of PDCCH candidates needing to be discarded from the target time slot according to a preset discarding rule, and determining the remaining PDCCH candidates in the target time slot, wherein the detection times of the fourth number of PDCCH candidates are more than or equal to the third number;

and determining the remaining PDCCH candidates as the PDCCH candidates needing to be detected in the target time slot.

3. The method of claim 2, wherein in the preset dropping rule, the number of drops in the PDCCH candidates of a higher aggregation level does not exceed the number of drops in the PDCCH candidates of a lower aggregation level, or the dropping proportion in the PDCCH candidates of a higher aggregation level does not exceed the dropping proportion in the PDCCH candidates of a lower aggregation level.

4. The method of claim 3, wherein the step of selecting the fourth number of PDCCH candidates that need to be discarded from the target slot according to a preset discarding rule comprises:

determining a fifth number of PDCCH candidates needing to be discarded in each aggregation level of each search space set according to a first preset rule, wherein the sum of the fifth number of PDCCH candidates needing to be discarded in each aggregation level of each search space set is equal to the fourth number, and the sum of the detection times of the PDCCH candidates needing to be discarded in each aggregation level of each search space set is greater than or equal to the third number;

and selecting the fourth number of PDCCH candidates from the PDCCH candidates in each aggregation level of each search space set according to a second preset rule.

5. The method of claim 4, wherein the downlink control information configured in each search space set comprises: first downlink control information for fallback transmission or scheduling data or second downlink control information for scheduling data;

the data size of first format downlink control information in the first downlink control information is the same as the data size of second format downlink control information, and the detection frequency of each PDCCH candidate in a search space set comprising the first downlink control information is 1 time;

when the data size of the third format downlink control information and the data size of the fourth format downlink control information in the second downlink control information are the same, detecting each PDCCH candidate in a search space set comprising the second downlink control information for 1 time; otherwise, the number of detections for each PDCCH candidate in the search space set including the second downlink control information is 2.

6. The method of claim 4, wherein the step of determining a fifth number of PDCCH candidates that need to be discarded in each aggregation level of each search space set comprises:

determining a sixth number of PDCCH candidates needing to be discarded in each aggregation level one by one according to the ascending order of the aggregation levels until the sum of the detection times of the determined PDCCH candidates needing to be discarded reaches the third number, wherein the sixth number is the smaller of the number of the PDCCH candidates of the aggregation level and the number of the remaining PDCCH candidates needing to be discarded; if the number of the PDCCH candidates needing to be discarded in one aggregation level is greater than or equal to 2 and the PDCCH candidates of the aggregation level are distributed in at least two search space sets, the PDCCH candidates needing to be discarded in the aggregation level are uniformly distributed in each search space set according to the ascending order of the indexes of the search space sets.

7. The method of claim 4, wherein the step of determining a fifth number of PDCCH candidates that need to be discarded in each aggregation level of each search space set comprises:

determining the number of the PDCCH candidates needing to be discarded through one or more rounds of determination processes until the sum of the detection times of the determined PDCCH candidates needing to be discarded reaches the third number; in the determination process of each round, polling each aggregation level to be processed according to the ascending order of the aggregation levels, setting 1 PDCCH candidate needing to be discarded in each polled aggregation level to be processed, and updating the aggregation level to be processed when each round is finished;

and, when setting the 1 PDCCH candidates that need to be discarded: determining a search space set in which the 1 PDCCH candidate needing to be discarded is located according to an increasing order of search space set indexes in the aggregation level, or determining a first to-be-processed search space set which is subsequent to the first search space set and contains the PDCCH candidate of the aggregation level according to an increasing order of search space set indexes, and taking the first to-be-processed search space set as the search space set in which the 1 PDCCH candidate needing to be discarded is located, where the first search space set is: in the current round, the search space set in which the PDCCH candidates discarded in the previous aggregation level are located;

wherein the aggregation levels to be processed are initially all aggregation levels including the target timeslot, and the updating the aggregation levels to be processed includes: and deleting the highest aggregation level from the aggregation levels to be processed when the number of PDCCH candidates which are not discarded currently in the highest aggregation level in the aggregation levels to be processed is less than or equal to 1.

8. The method of claim 4, wherein the step of determining a fifth number of PDCCH candidates that need to be discarded in each aggregation level of each search space set comprises:

taking the PDCCH candidates of each aggregation level of each search space set as a target object, calculating the product of a proportional value and the third quantity, rounding up, and determining the number of times of detection to be discarded, which needs to be discarded, in each target object, wherein the proportional value is the ratio of the number of times of detection of the PDCCH candidates contained in the target object to the first quantity;

and determining the number of PDCCH candidates needing to be discarded in each target object according to the detection times to be discarded, wherein if the detection times needing to be discarded in all the target objects exceed the third number, 1 PDCCH candidate needing to be discarded is sequentially reduced in each target object according to the sequence of descending the aggregation level and descending the search space set index until the sum of the detection times of the determined PDCCH candidates needing to be discarded reaches the third number.

9. The method of claim 4, wherein the selecting the fifth number of PDCCH candidates from the PDCCH candidates in each aggregation level of each search space set comprises:

calculating the third number divided by the number of the search space sets and rounding down, and determining the detection times of the seventh number to be discarded for each search space set, wherein if the sum of the seventh number of each search space set is less than the third number, the search space sets are sorted in a descending order according to the number of PDCCH candidates included in each search space set, and one PDCCH candidate is discarded additionally in each search space set in the descending order until the sum of the seventh number and the detection times of the PDCCH candidates discarded additionally reaches the third number;

determining the number of PDCCH candidates which need to be discarded per search space set according to the seventh number and the extra discarded PDCCH candidates;

and performing index numbering on the PDCCH candidates in each search space set through one or more rounds of index coding processes, and determining the aggregation levels of the PDCCH candidates to be discarded in each search space set and the PDCCH candidates to be discarded according to the descending order of the coding values of the index coding, wherein the index coding is performed on 1 PDCCH candidate in each aggregation level in each round in turn according to the descending order of the aggregation levels, and the coding values are determined according to the ascending order.

10. The method of claim 4, wherein the selecting the fifth number of PDCCH candidates from the PDCCH candidates in each aggregation level of each search space set comprises:

selecting the fifth number of PDCCH candidates according to a preset interval from PDCCH candidates at a preset position in each aggregation level of each search space set; or,

and calculating the positions of the PDCCH candidates needing to be discarded in each aggregation level of each search space set based on a preset function with the terminal identification and/or the time slot sequence number as variables, and selecting the PDCCH candidates of the fifth quantity according to the calculated positions.

11. A sending method of a physical downlink control channel is applied to network equipment, and is characterized by comprising the following steps:

determining PDCCH candidates for transmission in a target time slot when a first number exceeds a second number, wherein the first number is the number of detection times required by all PDCCH candidates configured in the target time slot, and the second number is the number of maximum detection times of a terminal on the target time slot;

and sending the PDCCH to the terminal on the PDCCH candidate for sending.

12. The method of claim 11, wherein the step of determining the PDCCH candidates for transmission in the target slot comprises:

determining the detection times of a third quantity which needs to be discarded according to the second quantity and the first quantity;

selecting a fourth number of PDCCH candidates needing to be discarded from the target time slot according to a preset discarding rule, and determining the remaining PDCCH candidates in the target time slot, wherein the detection times of the fourth number of PDCCH candidates are more than or equal to the third number;

and determining the remaining PDCCH candidates as PDCCH candidates for transmission in the target time slot.

13. The method of claim 12, wherein in the preset dropping rule, a dropping number of the PDCCH candidates of a higher aggregation level does not exceed a dropping number of the PDCCH candidates of a lower aggregation level, or a dropping proportion of the PDCCH candidates of a higher aggregation level does not exceed a dropping proportion of the PDCCH candidates of a lower aggregation level.

14. The method of claim 13, wherein the step of selecting the fourth number of PDCCH candidates to be discarded from the target time slot according to a preset discard rule comprises:

determining a fifth number of PDCCH candidates needing to be discarded in each aggregation level of each search space set according to a first preset rule, wherein the sum of the fifth number of PDCCH candidates needing to be discarded in each aggregation level of each search space set is equal to the fourth number, and the sum of the detection times of the PDCCH candidates needing to be discarded in each aggregation level of each search space set is greater than or equal to the third number;

and selecting the fourth number of PDCCH candidates from the PDCCH candidates in each aggregation level of each search space set according to a second preset rule.

15. The method of claim 14, wherein the downlink control information configured in each search space set comprises: first downlink control information for fallback transmission or scheduling data or second downlink control information for scheduling data;

the data size of first format downlink control information in the first downlink control information is the same as the data size of second format downlink control information, and the detection frequency of each PDCCH candidate in a search space set comprising the first downlink control information is 1 time;

when the data size of the third format downlink control information and the data size of the fourth format downlink control information in the second downlink control information are the same, detecting each PDCCH candidate in a search space set comprising the second downlink control information for 1 time; otherwise, the number of detections for each PDCCH candidate in the search space set including the second downlink control information is 2.

16. The method of claim 14, wherein the step of determining a fifth number of PDCCH candidates that need to be discarded in each aggregation level for each search space set comprises:

determining a sixth number of PDCCH candidates needing to be discarded in each aggregation level one by one according to the ascending order of the aggregation levels until the sum of the detection times of the determined PDCCH candidates needing to be discarded reaches the third number, wherein the sixth number is the smaller of the number of the PDCCH candidates of the aggregation level and the number of the remaining PDCCH candidates needing to be discarded; if the number of the PDCCH candidates needing to be discarded in one aggregation level is greater than or equal to 2 and the PDCCH candidates of the aggregation level are distributed in at least two search space sets, the PDCCH candidates needing to be discarded in the aggregation level are uniformly distributed in each search space set according to the ascending order of the indexes of the search space sets.

17. The method of claim 14, wherein the step of determining a fifth number of PDCCH candidates that need to be discarded in each aggregation level for each search space set comprises:

determining the number of the PDCCH candidates needing to be discarded through one or more rounds of determination processes until the sum of the detection times of the determined PDCCH candidates needing to be discarded reaches the third number; in the determination process of each round, polling each aggregation level to be processed according to the ascending order of the aggregation levels, setting 1 PDCCH candidate needing to be discarded in each polled aggregation level to be processed, and updating the aggregation level to be processed when each round is finished;

and, when setting the 1 PDCCH candidates that need to be discarded: determining a search space set in which the 1 PDCCH candidate needing to be discarded is located according to an increasing order of search space set indexes in the aggregation level, or determining a first to-be-processed search space set which is subsequent to the first search space set and contains the PDCCH candidate of the aggregation level according to an increasing order of search space set indexes, and taking the first to-be-processed search space set as the search space set in which the 1 PDCCH candidate needing to be discarded is located, where the first search space set is: in the current round, the search space set in which the PDCCH candidates discarded in the previous aggregation level are located;

wherein the aggregation levels to be processed are initially all aggregation levels including the target timeslot, and the updating the aggregation levels to be processed includes: and deleting the highest aggregation level from the aggregation levels to be processed when the number of PDCCH candidates which are not discarded currently in the highest aggregation level in the aggregation levels to be processed is less than or equal to 1.

18. The method of claim 14, wherein the step of determining a fifth number of PDCCH candidates that need to be discarded in each aggregation level for each search space set comprises:

taking the PDCCH candidates of each aggregation level of each search space set as a target object, calculating the product of a proportional value and the third quantity, rounding up, and determining the number of times of detection to be discarded, which needs to be discarded, in each target object, wherein the proportional value is the ratio of the number of times of detection of the PDCCH candidates contained in the target object to the first quantity;

and determining the number of PDCCH candidates needing to be discarded in each target object according to the detection times to be discarded, wherein if the detection times needing to be discarded in all the target objects exceed the third number, 1 PDCCH candidate needing to be discarded is sequentially reduced in each target object according to the sequence of descending the aggregation level and descending the search space set index until the sum of the detection times of the determined PDCCH candidates needing to be discarded reaches the third number.

19. The method of claim 14, wherein the selecting the fifth number of PDCCH candidates from the PDCCH candidates in each aggregation level for each search space set comprises:

calculating the third number divided by the number of the search space sets and rounding down, and determining the detection times of the seventh number to be discarded for each search space set, wherein if the sum of the seventh number of each search space set is less than the third number, the search space sets are sorted in a descending order according to the number of PDCCH candidates included in each search space set, and one PDCCH candidate is discarded additionally in each search space set in the descending order until the sum of the seventh number and the detection times of the PDCCH candidates discarded additionally reaches the third number;

determining the number of PDCCH candidates which need to be discarded per search space set according to the seventh number and the extra discarded PDCCH candidates;

and performing index numbering on the PDCCH candidates in each search space set through one or more rounds of index coding processes, and determining the aggregation levels of the PDCCH candidates to be discarded in each search space set and the PDCCH candidates to be discarded according to the descending order of the coding values of the index coding, wherein the index coding is performed on 1 PDCCH candidate in each aggregation level in each round in turn according to the descending order of the aggregation levels, and the coding values are determined according to the ascending order.

20. The method of claim 14, wherein the selecting the fifth number of PDCCH candidates from the PDCCH candidates in each aggregation level for each search space set comprises:

selecting the fifth number of PDCCH candidates according to a preset interval from PDCCH candidates at a preset position in each aggregation level of each search space set; or,

and calculating the positions of the PDCCH candidates needing to be discarded in each aggregation level of each search space set based on a preset function with the terminal identification and/or the time slot sequence number as variables, and selecting the PDCCH candidates of the fifth quantity according to the calculated positions.

21. A terminal, comprising:

a processor, configured to determine PDCCH candidates required to be detected in a target time slot when a first number exceeds a second number, where the first number is the number of detection times required for all PDCCH candidates configured in the target time slot, and the second number is the number of maximum detection times of the terminal on the target time slot;

a transceiver for detecting PDCCH on the PDCCH candidate to be detected.

22. A network device, comprising:

a processor, configured to determine PDCCH candidates for transmission in a target time slot when a first number exceeds a second number, where the first number is the number of detection times required for all PDCCH candidates configured in the target time slot, and the second number is the number of maximum detection times of a terminal on the target time slot;

a transceiver for transmitting PDCCH to the terminal on the PDCCH candidates for transmission.

23. A communication device, comprising: memory, processor and computer program stored on the memory and executable on the processor, which when executed by the processor performs the steps of the detection method according to any one of claims 1 to 10 or the steps of the transmission method according to any one of claims 11 to 20.

24. A computer-readable storage medium, characterized in that a computer program is stored thereon, which, when being executed by a processor, carries out the steps of the detection method according to any one of claims 1 to 10 or the steps of the transmission method according to any one of claims 11 to 20.