CN110351841A

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

Info

Publication number: CN110351841A
Application number: CN201810299693.7A
Authority: CN
Inventors: 杨拓; 夏亮; 胡丽洁; 侯雪颖
Original assignee: China Mobile Communications Group Co Ltd; China Mobile Communications Ltd Research Institute
Current assignee: China Mobile Communications Group Co Ltd; China Mobile Communications Ltd Research Institute
Priority date: 2018-04-04
Filing date: 2018-04-04
Publication date: 2019-10-18
Anticipated expiration: 2038-04-04
Also published as: CN110351841B

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

Detection method, sending method and equipment of physical downlink control channel

Technical Field

The invention relates to the technical field of mobile communication, in particular to a method and a device for detecting a physical downlink control channel and a method and a device for sending the physical downlink control channel.

Background

The Physical Downlink control Channel may be used to indicate a time-frequency resource and a transmission parameter of a PDSCH (Physical Downlink Shared Channel) scheduling corresponding to a UE (User Equipment) or a PUSCH (Physical Uplink Shared Channel) scheduling to be sent, and to obtain these messages, the User Equipment needs to first detect the Downlink control Channel. A PDCCH (physical downlink Control Channel) is transmitted on n consecutive CCEs (Control Channel elements), and the PDCCH has 5 formats, which respectively correspond to aggregation levels {1, 2, 4, 8, 16 }. The aggregation level indicates the number n of consecutive CCEs occupied by one PDCCH.

In 5G NR (new radio), a base station configures at most 10 search space sets for a UE on a BWP (bandwidth part), and the UE performs blind detection in each search space set. The base station configures the number of PDCCH candidates of each aggregation level for each search space setAnd PDCCH detection period k_p,sAnd detecting the offset value o_p,s。

Meanwhile, only fallback DCIs (DCI format 0_0 and DCI format1_0) or DCI formats for scheduling data (DCI format 0_1 and DCI format1_ 1) are configured in one USS (UE-specific search space) in NR. The DCI format 0_0 and the DCI format1_0 have the same size, and the DCI format 0_1 and the DCI format1_ 1 may have the same or different sizes. Therefore, when only DCI format 0_0 and DCI format1_0 are configured in one USS, one PDCCH candidate needs to occupy one detection time. If only the DCI format 0_1 and the DCI format1_ 1 are configured in one USS, if the DCI format 0_1 and the DCI format1_ 1 have the same size, one PDCCH candidate needs one detection time, otherwise, one PDCCH candidate needs 2 detection times.

Also, NR specifies the maximum number of detections a UE can perform on a PDCCH candidate in one slot on one serving cellAs shown in the following table:

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

Because 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 detection times required by the PDCCH candidates configured by the base station for the UE may exceed the limit of the maximum detection times of the PDCCH by the UE, which may cause the number of times that the UE detects the PDCCH to increase.

Disclosure of Invention

The technical problem to be solved in the embodiments of the present invention is to provide a method, a method and a device for detecting a physical downlink control channel, which are used to determine a PDCCH candidate to be detected and reduce the number of times of detecting the PDCCH.

In order to solve the above technical problem, an embodiment of the present invention provides a method for detecting a physical downlink control channel, which is applied to a terminal, and includes:

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.

The embodiment of the invention also provides a sending method of the physical downlink control channel, which is applied to network equipment and comprises 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.

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

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.

An embodiment of the present invention further provides a network device, including:

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.

An embodiment of the present invention further provides a communication device, including: a memory, a processor and a computer program stored on the memory and executable on the processor, the computer program, when executed by the processor, implementing the steps of the detection method as described above or implementing the steps of the transmission method as described above.

An embodiment of the present invention further provides 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 described above are implemented, or the steps of the transmission method described above are implemented.

Compared with the prior art, the detection method, the transmission method and the equipment for the physical downlink control channel provided by the embodiment of the invention have the advantages that the detection times required by all PDCCH candidates configured in a target time slot are determined when the detection times exceed the maximum detection times of a terminal on the target time slot, the PDCCH candidates needing to be detected are determined, the sum of the detection times of the PDCCH candidates needing to be detected is not more than the maximum detection times of the terminal on the time slot, the terminal detects the PDCCH only on the PDCCH candidates needing to be detected, and meanwhile, the base station also sends the PDCCH to the terminal on the PDCCH candidates needing to be detected, so that the terminal can reduce the detection times of the PDCCH.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments of the present invention will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without inventive labor.

FIG. 1 is a flow chart of a detection method according to an embodiment of the present invention;

fig. 2 is a flowchart of a transmitting method according to an embodiment of the present invention;

fig. 3 is a schematic structural diagram of a terminal according to an embodiment of the present invention;

fig. 4 is another schematic structural diagram of a terminal according to an embodiment of the present invention.

Fig. 5 is a schematic structural diagram of a network device according to 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 Description

In order to make the technical problems, technical solutions and advantages of the present invention more apparent, the following detailed description is given with reference to the accompanying drawings and specific embodiments. In the following description, specific details such as specific configurations and components are provided only to help the full understanding of the embodiments of the present invention. Thus, it will be apparent to those skilled in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the invention. In addition, descriptions of well-known functions and constructions are omitted for clarity and conciseness.

It should be appreciated that reference throughout this specification to "one embodiment" or "an embodiment" means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, the appearances of the phrases "in one embodiment" or "in an embodiment" in various places throughout this specification are not necessarily all 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 sequence numbers of the following processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.

In order to avoid that the number of PDCCH candidates configured in a target time slot by a base station exceeds the maximum PDCCH detection times of a terminal in the target time slot, thereby possibly causing the terminal to increase the PDCCH detection times, embodiments of the present invention provide a method, a device, and a computer program product for detecting a physical downlink control channel.

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, and the method includes:

step 11, determining 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 in the target time slot;

here, the first number is the number of times required for the network device to detect all PDCCH candidates in a time slot configured for the terminal, that is, the sum of the number of times for detecting 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, each PDCCH candidate needs to be detected 1 time, the second search space set includes 10 PDCCH candidates, and each PDCCH candidate needs to be detected 2 times, so that the number of times required for detecting all PDCCH candidates in the time slot is 48 times; the second number is the maximum number of detections that can be made by the terminal on that timeslot as specified by the protocol, e.g., the timeslot is a timeslot with a subcarrier spacing of 15KHz, then the maximum number of detections that can be made by the terminal on that timeslot is 44 as specified by the protocol in the above table.

The above description illustrates a correspondence table of the maximum detection times that can be detected by a UE in a slot in a serving cell. In a time slot with a subcarrier interval of 15KHz, the maximum detection frequency that can be performed by the terminal is 44 times, and if the detection frequency that is required by the base station for all PDCCH candidates configured by the terminal on the time slot exceeds 44 times, for example, 48 times are required for detecting all PDCCH candidates configured by the base station, where the terminal may obtain PDCCH candidates configured by the base station for itself and downlink control information included in the search space set and the search space set according to configuration information parameters sent by the base station, and the terminal may calculate the detection frequency for all PDCCH candidates in the search space set according to the downlink control information of the search space set, and sum the detection frequency of each search space set to obtain the number of detection frequencies that are required for all PDCCH candidates configured in the time slot, that is, the first number.

When the first number of detection times configured by the base station exceeds the second number of maximum detection times that can be performed in the time slot, the terminal preferentially detects a PDCCH candidate in a Common Search Space (CSS), and then detects a PDCCH candidate in a terminal-specific search space (USS) according to a difference between the maximum detection times and the CSS PDCCH detection times. In this case, the base station may transmit the PDCCH on PDCCH candidates other than the maximum number of times that the terminal can detect, so that the terminal cannot detect the PDCCH, thereby increasing the number of times that the terminal detects the PDCCH. It should be noted that, since the terminal performs blind detection on the PDCCH candidates, when the number of times of detection required by the base station for all PDCCH candidates configured by the terminal in a time slot is greater than the maximum number of times of detection of the terminal in the target time slot, the terminal may also detect the PDCCH by blind detection within the maximum number of times of detection, and only when the base station transmits the PDCCH on PDCCH candidates other than the maximum number of times of detection that the terminal can detect, the terminal does not detect the PDCCH after performing detection of the second number of maximum number of times of detection, and the number of times of detection of the PDCCH by the terminal is increased.

In order to avoid the above situation, in the embodiments of the present invention, a part of PDCCH candidates actually needing to be detected is determined from PDCCH candidates configured by a network device for a terminal, so that the sum of the detection times of the part of PDCCH candidates actually needing to be detected is not greater than the maximum detection time that can be performed by the terminal in the time slot.

And step 12, detecting PDCCH on the PDCCH candidate needing to be detected.

Here, it is understood that the base station also transmits PDCCH on partial PDCCH candidates based on the same rule, and since the terminal and the reference are based on the same rule, the PDCCH candidate determined by the reference for transmission is the same as the PDCCH candidate to be detected determined by the terminal, and the terminal detects PDCCH only on the PDCCH candidate to be detected, thereby being able to reduce the number of times of detection of PDCCH candidates by the terminal.

In the embodiment of the invention, when the detection times required by all PDCCH candidates configured in a target time slot exceed the maximum detection times of a terminal on the target time slot, the PDCCH candidates needing to be detected are determined, so that the sum of the detection times of the PDCCH candidates needing to be detected is not more than the maximum detection times of the terminal on the time slot, the terminal only detects the PDCCH on the PDCCH candidates needing to be detected, and meanwhile, the base station also sends the PDCCH to the terminal on the PDCCH candidates needing to be detected, thereby reducing the detection times of the PDCCH.

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

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

here, the description is continued with the above example. In order to avoid the situation in the above example, according to the specification of the maximum detection times of each timeslot and each serving cell by the protocol, the terminal may determine that the maximum detection times of the terminal itself on the timeslot with the subcarrier spacing of 15KHz is 44, and if the maximum detection times of the PDCCH candidate configured for the terminal by the base station on the timeslot is 48, the terminal may determine that the detection times need to be discarded by 4 times according to the difference between the two.

It should be noted that the third number is preferably a difference between the first number and the second number, which is a difference between 48 and 44 in the above example, that is, the third number is preferably discarded for 4 times of detection. It is understood that the number of discards may be greater than 4 times, i.e. 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.

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;

here, the description is continued with the above example. In the above example, it is necessary to discard 4 detection times, so that the detection times configured by the base station for the terminal on the target timeslot is not greater than the maximum detection times that the terminal can perform on the timeslot, in the embodiment of the present invention, part of PDCCH candidates are discarded by a preset discarding rule, so as to reduce the maximum required number of detections, for example, 2 PDCCH candidates in the first search space set in the target timeslot are discarded, wherein the downlink control information of the first search space set is second downlink control information of the scheduling data, and the data sizes of the downlink control information of 2 formats included in the downlink control information are different, the PDCCH candidates in the search space set need to be detected twice, so that discarding 2 PDCCH candidates in the search space set can make the maximum number of detections that the terminal can perform on the timeslot not less than the maximum number of detections required by the PDCCH candidates configured by the base station. As can be seen from the above table, the maximum number of times that the terminal can perform detection is different in the time slots of different subcarrier intervals.

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

Here, the PDCCH candidates to be detected in the target slot are determined by excluding the PDCCH candidates discarded from the PDCCH candidates allocated by the base station and determining the remaining PDCCH candidates.

In the embodiment of the invention, when the total detection times required by the PDCCH candidates configured in the target time slot exceed the maximum detection times of the terminal on the target time slot, part of the PDCCH candidates are discarded through the preset discarding rule, so that the detection times of the rest PDCCH candidates are not more than the maximum detection times of the terminal on the time slot, the terminal does not detect the discarded PDCCH candidates any more, and meanwhile, the base station does not schedule the terminal on the discarded PDCCH candidates, thereby reducing the detection times of the PDCCH.

Further, the preset discarding rule may be a rule based on preset variables, where the preset variables include at least one of an index of a search space set configured on a target timeslot, an index of a CCE, an aggregation level, and the fourth number. The determination of which PDCCH candidates to discard at which aggregation levels of which search space sets and the locations of the discarded PDCCH candidates may be based on a discard rule or function of the discarded PDCCH candidates defined by these four variables.

Further, in the preset discarding rule, the discarding number of the PDCCH candidates with a higher aggregation level does not exceed the discarding number of the PDCCH candidates with a lower aggregation level, or the discarding proportion of the PDCCH candidates with a higher aggregation level does not exceed the discarding proportion of the PDCCH candidates with a lower aggregation level.

Here, since the number of PDCCH candidates with higher aggregation level is often smaller, and the number of PDCCH candidates with lower aggregation level is relatively larger, the PDCCH candidates with lower aggregation level can be discarded more by the preset discarding rule, so as to reduce the influence on the PDCCH candidates with higher aggregation level and reduce the collision probability between different ues.

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

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.

In the embodiment of the present invention, the discarded PDCCH candidates are divided into two levels, where the first level determines which aggregation level sets of PDCCH candidates are discarded in which search space set according to a first preset rule, and the second level determines which aggregation level set or sets of PDCCH candidates are discarded in a plurality of aggregation level sets according to a second preset rule. Further description is made below by way of example. For example, 6 detection times need to be discarded currently, 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 the number of PDCCH candidates that need to be discarded in each aggregation level of each search space set needs to be determined according to a first preset rule, for example, 2 PDCCH candidates with aggregation level of 2 need to be discarded in the first search space set is determined according to the first preset rule, and 2 detections need to be performed on each PDCCH candidate in the search space set is determined according to downlink control information of the first search space set, so that 4 detection times can be discarded when 2 PDCCH candidates are discarded in the first search space set, 4 detection times can be discarded when 1 PDCCH candidate with aggregation level of 2 and 1 PDCCH candidate with aggregation level of 4 are discarded in the second search space set, and 1 detection need to be performed on each PDCCH candidate in the search space set is determined according to downlink control information of the second search space set, then discarding 2 more in the second search space set can meet the target of discarding 6 detection times in total; it is further required to determine, according to a second preset rule, positions of PDCCH candidates to be discarded in the search space set to which the PDCCH candidates belong, for example, positions of 2 PDCCH candidates with aggregation level 2 in the first search space set, for example, 4 PDCCH candidates with aggregation level 2 in the first search space set, and to determine positions of 2 PDCCH candidates to be discarded in 4, for example, a first PDCCH candidate and a third PDCCH candidate in sequence.

The downlink control information configured in each search space set includes: 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.

Here, the first downlink control information may be fallback DCI (DCI format 0_0 and DCI format1_0), where 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 format1_0, so that each PDCCH candidate terminal in the search space set including the first downlink control information needs to be detected 1 time; the second downlink control information may be DCI (DCI format 0_1 and DCI format1_ 1) of scheduling data, where the data size of the third format downlink control information DCI format 0_1 is the same as the data size of the fourth format downlink control information DCI format1_ 1, and each PDCCH candidate terminal in the search space set including the second downlink control information needs to be detected 1 time, otherwise, when the data size of the third format downlink control information DCI format 0_1 is different from the data size of the fourth format downlink control information DCI format1_ 1, each PDCCH candidate terminal in the search space set including the second downlink control information needs to be detected 2 times.

To better illustrate the first predetermined rule, the present invention provides three preferred embodiments, each of which includes a first predetermined rule. It is understood that the specific rule can be defined according to the four variables in the above description, and is not limited to the following four embodiments.

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

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.

The number of the PDCCH candidates which need to be discarded currently is a difference between the third number and the sum of the detection times of the PDCCH candidates which need to be discarded and is determined, that is, if the third number which need to be discarded currently is 10 times and the sum of the detection times of the PDCCH candidates which need to be discarded is determined to be 6 times, the number of the PDCCH candidates which need to be discarded currently is 4 (at this time, one time detection is required for each PDCCH candidate), when the PDCCH candidates are discarded sequentially, if the sum of the detection times of the PDCCH candidates which need to be discarded and is determined to be determined reaches the third number, the PDCCH candidates which need to be discarded currently are not discarded, for example, 4 PDCCH candidates which need to be discarded currently are not discarded, at this time, 2 PDCCH candidates which need to be detected for 2 times are discarded, and the sum of the detection times of the discarded PDCCH candidates meets the requirement, and.

Further description is made below by way of example. In this embodiment, the number of PDCCH candidate set drops 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 level are preferentially discarded, and the influence on PDCCH candidates with high aggregation level is reduced. Where the number of PDCCH candidate sets that need to be discarded for a certain aggregation level is min { the number of remaining PDCCH candidates that need to be discarded, the number of all PDCCH candidates for that aggregation level }. If PDCCH candidates of one aggregation level are distributed in a plurality of search space sets, the discarded PDCCH candidates are equally divided in each search space set in the order of increasing index of the search space sets. For example, search space set #1 includes 2 PDCCHs of aggregation level 2 and 2 PDCCHs of aggregation level 4; search space set #2 includes 2 PDCCHs of aggregation level 4 and 1 PDCCH of aggregation level 8. If 4 PDCCHs need to be discarded in total, the PDCCH candidates with the aggregation level of 2 are discarded firstly according to the ascending order of the aggregation level, namely the PDCCH candidates with the aggregation level of 2 in the 2 search space sets # 1; and then, the PDCCH candidates with aggregation level 4 are discarded, and since the PDCCH candidates with aggregation level 4 are distributed in two search space sets, the PDCCH candidates with aggregation level 4 in 1 search space set #1 and the PDCCH candidates with aggregation level 4 in 1 search space set #2 are discarded. In the above example, the PDCCH candidates in the search space set are only detected once, and it can be understood that, if the PDCCH candidates in the search space set #1 need to be detected 2 times, after the PDCCH candidates with the aggregation level of 2 in the search space set #1 are lost, the number of times of detecting the PDCCH candidates that are discarded reaches the third number, the discarding may be stopped. It is understood that, in both the embodiment and the embodiments described below, after determining the discarded PDCCH candidates, whether the PDCCH candidates need to be discarded continuously is determined by determining whether the sum of the detected times of the determined PDCCH candidates reaches a third number, and the discarding may be stopped when the sum of the detected times of the discarded PDCCH candidates reaches the third number.

The above-mentioned sharing is illustrated by way of example in each search space set. For example, the search space set index is 1 and includes 2 PDCCH candidates with aggregation level 4, and the search space set index is 2 and includes 2 PDCCH candidates with aggregation level 4. If 3 PDCCH candidates with aggregation level 4 are to be dropped at this time, 2 of the search space set index 1 should be dropped, and 1 of the search space set index 2 should be dropped. The averaging may be implemented through a plurality of rounds of dividing processes, and in each round of dividing process, according to the ascending order of the search space set index, sequentially set 1 PDCCH that needs to be discarded in each space set until the total number of PDCCHs that need to be discarded in the aggregation level is reached.

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

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;

the following description is given by way of example for polling each aggregation level to be processed in the ascending order of the aggregation levels, and setting 1 PDCCH candidate to be discarded in each polled aggregation level to be processed. For example, if PDCCH candidates with aggregation levels of 2, 4, and 8 are determined, a PDCCH candidate with aggregation level of 2 is determined first, then an aggregation level of 4 is determined, and then an aggregation level of 8 is determined, in one round, if the sum of the detection times of PDCCH candidates discarded after the one round is performed 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 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;

continuing with the above example, if a PDCCH candidate with an aggregation level of 2 is in search space set 1, and a PDCCH candidate with an aggregation level of 4 is present in both search space set 1 and search space set 2, according to the ascending order of search space set indexes, determining search space set 2, which includes PDCCH candidates with an aggregation level of 4 and is subsequent to search space set 1 with aggregation level 2, as a search space set to be processed.

The following is further described with respect to determining the search space set where the 1 PDCCH candidate needing to be discarded is located according to the ascending order of the search space set indexes in the aggregation level. For example, a first round is to set 1 discard at aggregation level 4, a second round is to set 1 discard at aggregation level 4, and when 1 discard is set in an adjacent round, the spatial set where the 1 discarded PDCCH candidates are located may be set according to the ascending order of spatial set indexes. If there is no PDCCH candidate of the aggregation level in the next spatial set in the increasing order, the polling of the next spatial set is continued in the order in which the search spatial set indexes are increased.

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.

And when the total number of the PDCCH candidates with the highest aggregation level in all the search space sets is 1, skipping the discarding of the PDCCH candidates with the aggregation level, thereby ensuring that the PDCCH candidates with the highest aggregation level exist in the search space sets, reducing the influence on the PDCCH candidates with higher aggregation levels, and reducing the collision probability among different user terminals.

Further description is made below by way of example. In this embodiment, the number of detections required for PDCCH candidates in each search space set is 1, and it can be understood that when the number of detections for PDCCH candidates that need to be discarded is 2, the number of PDCCH candidates only needs to be multiplied by 2, and the number of detections for all PDCCH candidates that are determined to have been discarded is summed, so as to determine whether PDCCH needs to be discarded continuously according to whether the sum reaches a third number. The dropping of the PDCCH candidate sets is carried out in a mode that the aggregation level is increased in advance, but the number of the PDCCH candidate sets which need to be dropped per aggregation level in each turn is fixed to be 1, and meanwhile, the search space index is increased in an increasing mode. When the total number of the PDCCH candidate sets with the highest aggregation level possibly occurring in all the search space sets is 1, the dropping of the PDCCH candidate set with the aggregation level is skipped from the round, and the like. For example, search space set #1 includes 4 PDCCHs of aggregation level 2 and 2 PDCCHs of aggregation level 4; the search space set #2 includes 2 PDCCHs of aggregation level 4 and 2 PDCCHs of aggregation level 8. A total of 5 PDCCHs need to be discarded, and then a first round discards a PDCCH with an aggregation level of 2 in 1 search space set #1, a PDCCH with an aggregation level of 4 in 1 search space set #2, and a PDCCH with an aggregation level of 8 in 1 search space set # 2. The second round discards PDCCH of aggregation level 2 in 1 search space set #1 and PDCCH of aggregation level 4 in 1 search space set # 2.

Thirdly, the step of determining the fifth number of PDCCH candidates needing 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 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. And if the sum of the detection times of the determined PDCCH candidates needing to be discarded is less than a third number after 1 PDCCH candidate needing to be discarded is reduced, discarding the PDCCH candidate.

As a target object, calculating a product of the ratio value and the third number and rounding up, that is, calculating a ratio of a sum of detection times required by PDCCH candidates of an aggregation level in a search space set to the first number, thereby determining the detection times required to be discarded for each aggregation level in each search space set according to a proportional relationship, after determining the detection times required to be discarded, determining the number of PDCCH candidates required to be discarded according to the detection times required by the aggregation level in the search space set, for example, the detection times required to be discarded for the first aggregation level in the first search space set is 4, if PDCCH candidates in the search space set need to be detected for 1 time, 4 PDCCH candidates need to be discarded, and if PDCCH candidates in the search space set need to be detected for 2 times, 2 PDCCH candidates need to be discarded. The mode of proportional discarding avoids discarding from a low aggregation level to a high aggregation level, reduces the influence on a terminal which only needs a low aggregation level in a cell center, and reduces the omission of the PDCCH. Meanwhile, the rounding-up is performed, so that the total number after proportional allocation is often larger than the minimum number to be discarded, and 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, so that the PDCCH candidates with high aggregation level are reserved, and the influence on the PDCCH candidates with higher aggregation level is reduced.

Further description is made below by way of example. In this embodiment, assuming that m detection times need to be discarded altogether, and the total detection times of PDCCH candidates of a certain aggregation level of a certain search space set is n, the PDCCH candidates need to be discarded at the aggregation levelAnd determining the number of PDCCH candidates to be discarded according to the detection times and the required detection times of the PDCCH candidates in the search space set, wherein N is the sum of the required detection times of all PDCCH candidates in all the search space sets, namely the first number. And rounding up, if the number of detection times needing to be discarded on all aggregation levels in all search space sets exceeds a third number needing to be discarded, sequentially reducing the discarding of 1 PDCCH from the aggregation level to the low level and from the high to the low of the search space index until the sum of the detection times of the determined PDCCH candidates needing to be discarded reaches the third number. And if the sum of the detection times of the determined PDCCH candidates needing to be discarded is less than a third number after 1 PDCCH candidate needing to be discarded is reduced, discarding the PDCCH candidate. For convenience of explanation, the following description will be given by taking an example in which PDCCH candidates in each search space set are detected only once. For example, search space set #1 includes 4 PDCCHs of aggregation level 2 and 2 PDCCHs of aggregation level 4; the search space set #2 includes 2 PDCCHs of aggregation level 4 and 2 PDCCHs of aggregation level 8. The total number of detection times needs to be discarded for 4 times, and the first calculation is that the aggregation level of the search space set #1 is 2 and the discarding is neededThe number of secondary detections, since the PDCCH candidate only needs to be detected 1 time, the number of discarded PDCCH candidates is 2, and the search space set #1 aggregation level is 4 and needs to be discardedThe number of secondary detections, search space set #2 with aggregation level 4, needs to be discardedThe number of secondary detections, search space set #2 with aggregation level of 8, needs to be discardedFor the number of secondary detections, since the number of detections that need to be discarded for 5 times is calculated for the first time and is greater than the number of detections that need to be discarded for 4 times, the highest aggregation level, that is, the PDCCH candidate with the aggregation level of search space set #2 being 8 does not need to be discarded, and as a final result, 2 PDCCH candidates need to be discarded with the aggregation level of search space set #1 being 2, 1 PDCCH candidate needs to be discarded with the aggregation level of search space set #1 being 4, and 1 PDCCH candidate needs to be discarded with the aggregation level of search space set #2 being 4.

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

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

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;

here, the number of detections that need to be discarded is equally distributed to each search space set by dividing the third number by the number of search space sets, for example, 10 detections need to be discarded in total, and 2 search space sets are total, and 5 detections are discarded per search space set. Due to the fact that rounding-down may be insufficient, for example, 10 detection times need to be discarded altogether, and there are 3 search space sets in total, each search space set discards 3 detection times, and if the detection times are still worse, the search space set with the largest number of PDCCH candidates is discarded additionally once.

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;

here, since the number of detections that need to be discarded is known, for example, 4 times need to be discarded, and according to the number of detections of PDCCH candidates in the search space set, for example, 2 times need to be detected for each PDCCH candidate in the search space set, the number of PDCCH candidates that need to be discarded in the search space set can be calculated, that is, 4 is divided by 2, and 2 PDCCH candidates need to be discarded.

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.

Here, the description will be further made by way of examples. Having determined the number of PDCCH candidates that need to be discarded in each search space set, it needs to be determined at which aggregation levels to discard. Index coding is performed on each PDCCH candidate according to the aggregation level and the number of PDCCHs per aggregation level, for example, a two-dimensional index may be established with the highest priority in the upper right corner of the matrix and the lowest priority in the lower left corner, as shown in the following table,

where the aggregation level is 1, 2, 4, 8, and the number of PDCCH candidates is 4, 4, 2, 2, respectively, as illustrated in the above table, where the number of PDCCH candidates with an aggregation level of 1 is 4, and the index code value of each PDCCH candidate is 3, 7, 9, 11, respectively; and according to the number of PDCCH candidates needing to be discarded, discarding according to the highest indexes. Therefore, more PDCCH candidates with a larger number of discarded PDCCH candidates are realized, and more PDCCH candidates with a lower aggregation level are discarded, so that the influence on the PDCCH candidates with a higher level is reduced, meanwhile, the PDCCH candidates with a certain aggregation level are not discarded completely, part of PDCCH candidates with a lower aggregation level are maintained, and the influence on a terminal which only uses the PDCCH candidates with a lower aggregation level in a cell is reduced.

With the above-described embodiments, how to determine the number of PDCCH candidates that need to be discarded per aggregation level and the search space set to which the PDCCH candidates belong is described, but since the number of PDCCH candidates of the aggregation level may be greater than the number of PDCCH candidates that need to be discarded per aggregation level in the search space set to which the PDCCH candidates belong, the positions of the discarded PDCCH candidates in the search space set to which the PDCCH candidates belong need to be determined according to a second preset rule.

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

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;

the PDCCH candidate in the predetermined position may be a starting PDCCH candidate in the aggregation level of the search space set or other positions, such as PDCCH candidates in 2 nd, 3 rd, and so on. It may be 0 for a preset interval, i.e., continuously discarded from the first PDCCH candidate start position of the aggregation level in the search space set. Of course, the preset interval may be other natural numbers, so that the first PDCCH candidate start position of the aggregation level in the search space set may be discarded at the preset interval. For example, if the preset interval is set to 1, the first PDCCH candidate start position of the aggregation level in the search space set starts to discard every other PDCCH candidate until the fourth number is reached. In an embodiment, the preset interval is obtained according to a preset formula Q/Q, where Q is the number of the aggregation levels that need to be discarded, Q is the total number of the aggregation levels in the search space set, for example, 4 PDCCH candidates with an aggregation level of 2 are total in the search space set 1, 2 PDCCH candidates need to be discarded, if the interval is 2, the interval is 2 between the first discarding location and the second discarding location, for example, the first and the third are discarded, and when the fourth number is not satisfied by discarding the last bit, the discarding continues according to the preset interval from the starting location of the aggregation level in the 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.

When the PDCCH candidates are discarded in the preset interval mode, different terminals may discard the PDCCH candidates at the same position, so that the base station may schedule the terminals only in a limited interval, which is equivalent to limiting the resource range of the PDCCH for scheduling multiple terminals by the base station. Therefore, in the embodiment of the present invention, the position to be discarded can be calculated through a preset function based on the terminal identifier and/or the timeslot number as variables. The preset function is preferably a random function, and each position needing to be discarded is obtained by calculation through the random function, so that the PDCCH candidate positions discarded by different terminals are random. The introduction of a randomization function can reduce the probability of collisions between different users. It can be understood that, for the terminal and the reference, the position results obtained based on the same terminal identifier and/or the slot number are the same when the two are variables.

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

step 21, determining 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 by all PDCCH candidates configured in the target time slot, and the second number is the number of maximum detection times of a terminal in the target time slot;

and step 22, sending the PDCCH to the terminal on the PDCCH candidates for sending.

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

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

Further, the preset discarding rule is a rule based on preset variables, where the preset variables include at least one of an index of a search space set configured on a target timeslot, an index of a CCE, an aggregation level, and the fourth number. It can be understood that, when the network device configures for the terminal, the number of PDCCH candidates configured in only a few time slots of the multiple time slots may exceed the maximum PDCCH detection times of the terminal on the target time slot, so the network device may also discard the PDCCH candidates without using the preset discarding rule to improve resources of the PDCCH candidates that can be scheduled.

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

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

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

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.

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

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,

The preset discarding rule is the same as the preset discarding rule adopted by the terminal, and is not described herein again to avoid repetition.

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

a processor 31, 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 32 for detecting PDCCH on the PDCCH candidate that needs to be detected.

The terminal 30 of the embodiment of the present invention can implement each process in the above-described detection method embodiments, and has corresponding beneficial effects, and for avoiding repetition, details are not described here again.

Preferably, the processor 31 may be specifically configured to: determining the detection times of a third quantity which needs to be discarded according to the second quantity and the first quantity;

Further, the preset discarding rule is a rule based on preset variables, where the preset variables include at least one of an index of a search space set configured on a target timeslot, an index of a CCE, an aggregation level, and the fourth number.

Preferably, in the preset discarding rule, the discarding number of the PDCCH candidates with a higher aggregation level does not exceed the discarding number of the PDCCH candidates with a lower aggregation level, or the discarding proportion of the PDCCH candidates with a higher aggregation level does not exceed the discarding proportion of the PDCCH candidates with a lower aggregation level.

Preferably, the processor 31 may be specifically configured to: 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;

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

Preferably, the processor 31 may be specifically configured to: 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.

Preferably, the processor 31 may be specifically configured to: 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;

Preferably, the processor 31 may be specifically configured to: 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;

Preferably, the processor 31 may be specifically configured to: 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;

Preferably, the processor 31 may be specifically configured to: 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,

Referring to fig. 4, another structure of a terminal according to an embodiment of the present invention is shown, in which the terminal 400 includes: a processor 401, a transceiver 402, a memory 403, a user interface 404, and a bus interface, wherein:

in the embodiment of the present invention, the terminal 400 further includes: a computer program stored in a memory 403 and executable on a processor 401, the computer program when executed by the processor 401 performing the steps of: 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.

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

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, the computer program when executed by the processor 401 may further implement the steps of: determining the detection times of a third quantity which needs to be discarded according to the second quantity and the first quantity;

Optionally, the preset discarding rule is a rule based on preset variables, where the preset variables include at least one of an index of a search space set configured on a target timeslot, an index of a CCE, an aggregation level, and the fourth number.

Optionally, in the preset discarding rule, the discarding number of the PDCCH candidates with a higher aggregation level does not exceed the discarding number of the PDCCH candidates with a lower aggregation level, or the discarding proportion of the PDCCH candidates with a higher aggregation level does not exceed the discarding proportion of the PDCCH candidates with a lower aggregation level.

Optionally, the computer program when executed by the processor 401 may further implement the steps of: 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;

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

Optionally, the computer program when executed by the processor 401 may further implement the steps of: 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.

Optionally, the computer program when executed by the processor 401 may further implement the steps of: 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;

Optionally, the computer program when executed by the processor 401 may further implement the steps of: 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;

Optionally, the computer program when executed by the processor 401 may further implement the steps of: 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;

Optionally, the computer program when executed by the processor 401 may further implement the steps of: 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,

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

the apparatus includes a processor 51, 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 52 configured to transmit PDCCH to the terminal on the PDCCH candidates for transmission.

The network device 50 according to the embodiment of the present invention can implement each process in the foregoing sending method embodiment, and has corresponding beneficial effects, and for avoiding repetition, details are not described here again.

Preferably, the processor 51 is specifically configured to: determining the detection times of a third quantity which needs to be discarded according to the second quantity and the first quantity;

Preferably, the processor 51 is specifically configured to: 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;

Preferably, the processor 51 is specifically configured to: 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.

Preferably, the processor 51 is specifically configured to: 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;

Preferably, the processor 51 is specifically configured to: 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;

Preferably, the processor 51 is specifically configured to: 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;

Preferably, the processor 51 is specifically configured to: 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,

Referring to fig. 6, another schematic structural diagram of a network device 600 according to an embodiment of the present invention includes: 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 in the memory 603 and executable on the processor 601, the computer program when executed by the processor 601 performing the steps of: 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.

In fig. 6, the bus architecture may include any number of interconnected buses and bridges, with one or more processors represented by processor 601 and various circuits of memory represented by memory 603 being linked together. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. The bus interface provides an interface. The transceiver 602 may be a number of elements including a transmitter and a receiver that provide a means for communicating with various other apparatus 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, the computer program when executed by the processor 601 may further implement the following steps: determining the detection times of a third quantity which needs to be discarded according to the second quantity and the first quantity;

Optionally, the computer program when executed by the processor 601 may further implement the following steps: 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;

Optionally, the computer program when executed by the processor 601 may further implement the following steps: 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.

Optionally, the computer program when executed by the processor 601 may further implement the following steps: 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;

Optionally, the computer program when executed by the processor 601 may further implement the following steps: 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;

Optionally, the computer program when executed by the processor 601 may further implement the following steps: 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;

Optionally, the computer program when executed by the processor 601 may further implement the following steps: 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,

The communication device of the embodiment of the present invention can implement each process in the above-mentioned detection method or transmission method embodiment, and has corresponding beneficial effects, and is not described here again in order to avoid repetition.

The computer-readable storage medium according to the embodiment of the present invention can implement each process in the above-described detection method or transmission method embodiment, and has corresponding beneficial effects, and for avoiding repetition, details are not described here again.

Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.

It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment of the present invention.

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

The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention or a part of the technical solution that substantially contributes to the prior art may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the detection method or the transmission method according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a U disk, a removable hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.

The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims

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

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:

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:

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;

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:

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:

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:

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:

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:

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

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:

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:

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;

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:

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:

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:

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:

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:

21. A terminal, comprising:

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

22. A network device, comprising:

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.