Method, apparatus, and storage medium for determining control channel element positions

Abstract

The present disclosure discloses a method, apparatus, and storage medium for determining the position of control channel elements, belonging to the field of wireless communication technologies. The method includes: determining configuration information of a search space set; determining a set of control channel element (CCE) positions of a physical downlink control channel (PDCCH) candidate set of the search space set according to the configuration information of the search space set and a hash function; wherein the configuration information includes group identification information of the search space set. This solution can meet the requirements of PDCCH repeated transmission under multi-transmission point (Multi-TRP) of frequency-division multiplexing (FDM), and improve the transmission reliability of the PDCCH.

Description

Technical Field

[0001] The present disclosure relates to the field of wireless communication technologies, and particularly relates to a method, an apparatus, and a storage medium for determining the position of a control channel element. Background Art

[0002] In a wireless communication system, in order to implement the transmission of a Physical Downlink Control Channel (PDCCH), a communication device needs to determine a set of positions of control channel elements (CCEs) of a PDCCH candidate set for a search space set.

[0003] In related technologies, a communication device can calculate a set of CCE positions of a PDCCH candidate set corresponding to a search space set through relevant parameters for CCE position selection. Among them, the above-mentioned relevant parameters include an aggregation level, the maximum number of PDCCH candidate sets at the aggregation level, the number of CCEs in a Control Resource Set (CORESET), carrier-related parameters, and the like. Summary of the Invention

[0004] The present disclosure provides a method, an apparatus, and a storage medium for determining the position of a control channel element. The technical solution is as follows:

[0005] According to a first aspect of an embodiment of the present disclosure, a method for determining the position of a control channel element is provided. The method includes:

[0006] Determine the configuration information of a search space set;

[0007] According to the configuration information of the search space set and a hash function, determine a set of positions of control channel elements (CCEs) of a PDCCH candidate set of the search space set;

[0008] Wherein, the configuration information includes group identification information of the search space set.

[0009] In a possible implementation manner, the step of determining a set of positions of control channel elements (CCEs) of a PDCCH candidate set of the search space set according to the configuration information of the search space set and a hash function includes:

[0010] Input the group identification information of the search space set into a hash function formula to obtain a set of CCE positions of the PDCCH candidate set of the search space set.

[0011] In a possible implementation, when there are at least two search space sets, the set of CCE positions of the first PDCCH candidate corresponding to the first search space set and the set of CCE positions of the second PDCCH candidate corresponding to the second search space set are distributed in a comb-like and cross manner;

[0012] wherein, the first search space set and the second search space set are any two of the at least two search space sets.

[0013] In a possible implementation, the hash function formula includes a first hash function formula, and the first hash function formula is as follows:

[0014]

[0015] wherein, K is the group identification information of the search space set, and K is an integer greater than or equal to 0.

[0016] In a possible implementation, the hash function formula includes a second hash function formula, and the second hash function formula is as follows:

[0017]

[0018] wherein, is the identification of the enhanced PDCCH candidate set;

[0019] The identification of the enhanced PDCCH candidate set of the PDCCH candidate set of each of the at least two search space sets is determined by the identification of the PDCCH candidate set of the at least two search space sets.

[0020] In a possible implementation, when there are at least two search space sets, there is no overlap between the smallest continuous position interval where the set of CCE positions of the first PDCCH candidate corresponding to the first search space set is located and the smallest continuous position interval where the set of CCE positions of the second PDCCH candidate corresponding to the second search space set is located;

[0021] wherein, the smallest continuous position interval is the interval from the first CCE position to the last CCE position in the corresponding set of CCE positions of the PDCCH candidate, and the first search space set and the second search space set are any two of the at least two search space sets.

[0022] In a possible implementation, the hash function formula includes a third hash function formula, and the third hash function formula is as follows:

[0023]

[0024] Among them, for the search space set with group identification information 0, is the identification of the PDCCH candidate set within the search space set with group identification information 0;

[0025] For the search space set with group identification information j, where j is an integer greater than 0, is the sum of the numbers of PDCCH candidate sets within the search space sets with group identification information less than j, plus the identification of the PDCCH candidate set within the search space set with group identification information j.

[0026] In a possible implementation, the CCEs of the PDCCH candidate sets of the at least two search space sets are in the same time slot; and, the at least two search space sets correspond to the same control resource set.

[0027] In a possible implementation, the at least two search space sets correspond to different beam direction identifiers.

[0028] In a possible implementation, the group identification information of the search space set is obtained by grouping each of the search space sets and according to the grouping result;

[0029] Among them, the search space sets within the same search space set group correspond to the same beam direction identifier.

[0030] In a possible implementation, the group identification information of the search space set is the identification information obtained after re-numbering the specified identifiers in each of the search space set groups obtained by grouping in ascending order; the specified identifier is the identification of the search space set with the smallest identification in the corresponding search space set group, or, the specified identifier is the identification of the search space set with the largest identification in the corresponding search space set group.

[0031] In a possible implementation, the group identification information of the search space set is the identification information obtained after re-numbering the beam direction identifiers corresponding to each of the search space set groups obtained by grouping.

[0032] According to the second aspect of the embodiments of the present disclosure, a control channel element position determination device is provided, and the device includes:

[0033] A configuration information determination module, configured to determine the configuration information of the search space set;

[0034] A position set determination module, configured to determine the control channel element CCE position set of the PDCCH candidate set of the search space set according to the configuration information of the search space set and a hash function;

[0035] Among them, the configuration information includes the group identification information of the search space set.

[0036] In a possible implementation manner, the position set determination module is configured to input the group identification information of the search space set into a hash function formula to obtain the CCE position set of the PDCCH candidate set of the search space set.

[0037] In a possible implementation manner, when the search space set is at least two search space sets, the first PDCCH candidate CCE position set corresponding to the first search space set and the second PDCCH candidate CCE position set corresponding to the second search space set are in a comb-like cross distribution;

[0038] Among them, the first search space set and the second search space set are any two of the at least two search space sets.

[0039] In a possible implementation manner, the hash function formula includes a first hash function formula, and the first hash function formula is as follows:

[0040]

[0041] Among them, K is the group identification information of the search space set, and K is an integer greater than or equal to 0.

[0042] In a possible implementation manner, the hash function formula includes a second hash function formula, and the second hash function formula is as follows:

[0043]

[0044] Among them, is the identification of the enhanced PDCCH candidate set;

[0045] The enhanced PDCCH candidate set identifications of the PDCCH candidate sets of the at least two search space sets are determined by the PDCCH candidate set identifications of the at least two search space sets.

[0046] In a possible implementation manner, when the search space set is at least two search space sets, there is no overlap between the smallest continuous position interval where the first PDCCH candidate CCE position set corresponding to the first search space set is located and the smallest continuous position interval where the second PDCCH candidate CCE position set corresponding to the second search space set is located;

[0047] Among them, the minimum continuous position interval is the interval between the first CCE position and the last CCE position in the corresponding PDCCH candidate CCE position set, and the first search space set and the second search space set are any two of the at least two search space sets.

[0048] In a possible implementation, the hash function formula includes a third hash function formula, and the third hash function formula is as follows:

[0049]

[0050] Among them, for the search space set with group identification information of 0, is the identifier of the PDCCH candidate set in the search space set with group identification information of 0;

[0051] For the search space set with group identification information of j, where j is an integer greater than 0, is the sum of the numbers of PDCCH candidate sets in the search space sets with group identification information less than j, plus the identifier of the PDCCH candidate set in the search space set with group identification information of j.

[0052] In a possible implementation, the CCEs of the PDCCH candidate sets of the at least two search space sets are in the same time slot; and, the at least two search space sets correspond to the same control resource set.

[0053] In a possible implementation, the at least two search space sets correspond to different beam direction identifiers.

[0054] In a possible implementation, the group identification information of the search space set is obtained according to the grouping result by grouping each of the search space sets.

[0055] Among them, the search space sets within the same search space set group correspond to the same beam direction identifier.

[0056] In a possible implementation, the group identification information of the search space set is the identification information obtained by renumbering the specified identifiers in each of the search space set groups obtained by grouping in ascending order; the specified identifier is the identifier of the search space set with the smallest identifier in the corresponding search space set group, or, the specified identifier is the identifier of the search space set with the largest identifier in the corresponding search space set group.

[0057] In a possible implementation, the group identification information of the search space set is the identification information obtained by renumbering the beam direction identifiers corresponding to each of the search space set groups obtained by grouping.

[0058] According to a third aspect of the embodiments of the present disclosure, there is provided an apparatus for determining the position of a control channel element, the apparatus comprising:

[0059] a processor;

[0060] a memory for storing executable instructions of the processor;

[0061] wherein the processor is configured to:

[0062] determine configuration information of a search space set;

[0063] determine a set of control channel element (CCE) positions of a physical downlink control channel (PDCCH) candidate set of the search space set according to the configuration information of the search space set and a hash function;

[0064] wherein the configuration information includes group identification information of the search space set.

[0065] According to a fourth aspect of the embodiments of the present disclosure, there is provided a computer-readable storage medium, which contains executable instructions, and a processor in a communication device calls the executable instructions to implement the above method for determining the position of a control channel element.

[0066] According to a fifth aspect of the embodiments of the present disclosure, there is provided a computer program product or a computer program, which includes computer instructions stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes the above method for determining the position of a control channel element.

[0067] The technical solutions provided by the embodiments of the present disclosure may include the following beneficial effects:

[0068] When calculating the set of CCE positions of the PDCCH candidate set of the search space set, the configuration information of the search space set is introduced to calculate in combination with the hash function. That is to say, the determined set of CCE positions of the PDCCH candidate set is related to the configuration information of the search space set, that is, the group identification information of the search space set. For two or more search space sets with different group identification information, even if they correspond to the same control resource set (CORESET), have the same aggregation level, and are in the same time slot, it is possible to achieve non-overlap of the set of CCE positions of the PDCCH candidate set, thereby meeting the requirements of PDCCH repeated transmission under multi-transmit receive point (Multi-TRP) of frequency division multiplexing (FDM), and improving the transmission reliability of PDCCH.

[0069] It should be understood that the above general description and the following detailed description are only exemplary and do not limit the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0070] The accompanying drawings herein are incorporated into the specification and constitute a part of this specification, showing embodiments consistent with the present disclosure, and are used together with the specification to explain the principles of the present disclosure.

[0071] Figure 1 It is a schematic diagram of an implementation environment involved in a method for determining the position of a control channel element shown according to an exemplary embodiment;

[0072] Figure 2 It is a flowchart of a method for determining the position of a control channel element shown according to an exemplary embodiment;

[0073] Figure 3 It is a flowchart of a method for determining the position of a control channel element shown according to an exemplary embodiment;

[0074] Figure 4 is Figure 3 a distribution diagram of a set of CCE positions involved in the shown embodiment;

[0075] Figure 5 is Figure 3 another distribution diagram of a set of CCE positions involved in the shown embodiment;

[0076] Figure 6 It is a block diagram of a device for determining the position of a control channel element shown according to an exemplary embodiment;

[0077] Figure 7 It is a schematic structural diagram of a communication device shown according to an exemplary embodiment. Detailed implementation manners

[0078] Here, the exemplary embodiments will be described in detail, and the examples are shown in the accompanying drawings. When the following description refers to the accompanying drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The implementation manners described in the following exemplary embodiments do not represent all implementation manners consistent with the present disclosure. On the contrary, they are merely examples of devices and methods consistent with some aspects of the present disclosure as detailed in the appended claims.

[0079] It should be understood that the "several" mentioned herein refers to one or more, and "a plurality" refers to two or more. "And / or" describes the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist simultaneously, and B exists alone. The character " / " generally represents an "or" relationship between the associated objects before and after.

[0080] In the new radio (NR) of the 5th - Generation (5G) mobile communication, especially when the communication frequency band is in frequency range 2, due to the relatively fast attenuation of high - frequency channels, in order to ensure the coverage range, beam - based transmission and reception need to be used.

[0081] When a base station has multiple transmission and reception points (TRPs), the base station can use multiple TRPs to serve a terminal, including using multiple TRPs to send PDCCH to the terminal. In the traditional method, when the base station uses one TRP to send PDCCH to the terminal, the CORESET configures one transmission configuration indication (TCI) state, and then the TCI states of the search space set (SS set) associated with this CORESET are the same as the TCI state of this CORESET.

[0082] When using the repeated transmission method of PDCCH with multi - transmission and reception points (Multi - TRP), it is equivalent to the terminal needing to use beams corresponding to different TCI states to receive PDCCH sent by different TRPs. And these multiple PDCCHs may come from different search space sets, and different search space sets belong to the same CORESET, that is, this CORESET corresponds to multiple TCI states. In order to achieve different search spaces corresponding to different TCI states and corresponding to different frequency - domain resources, that is, to support the frequency - division multiplexing (FDM) method, the frequency - domain positions of the PDCCH candidate CCE sets (PDCCH candidate CCE sets) corresponding to multiple search space sets need to be different.

[0083] However, in the related art, the CCE position set of the PDCCH candidate set corresponding to the search space set is calculated through information such as the aggregation level, the maximum number of PDCCH candidates at the aggregation level, the number of CCEs in the CORESET, and carrier - related parameters. That is to say, for different search space sets, if the corresponding aggregation levels are the same and in the same time slot, then for the same terminal, there are cases where some or all of the positions of the CCE position sets of the PDCCH candidate sets corresponding to each of the multiple search space sets are the same.

[0084] Each embodiment involved in the present disclosure shows a solution for calculating a set of CCE positions of a PDCCH candidate set of a search space set, which can determine a set of CCE positions of a PDCCH candidate set with different frequency domain positions for different search space sets to meet the requirements of PDCCH repeated transmission under Multi-TRP.

[0085] Figure 1 It is a schematic diagram of an implementation environment involved in a control channel element position determination method shown according to some exemplary embodiments. As Figure 1 shown, the implementation environment may include: a plurality of user equipments 110 and a base station 120.

[0086] The user equipment 110 may support cellular mobile communication technology. For example, it may support the 5th generation mobile communication (5G) technology. Alternatively, the user equipment 110 may also support the next generation of mobile communication technology after 5G.

[0087] For example, or, the user equipment 110 may also be a user terminal device, such as a mobile phone (or referred to as a "cellular" phone) and a computer with a mobile terminal. For example, it may be a portable, pocket-sized, handheld, computer-integrated or vehicle-mounted mobile device. For example, a Station (STA), a subscriber unit, a subscriber station, a mobile station, a mobile, a remote station, an access point, a remote terminal, an access terminal, a user terminal, a user agent, a user device, or a user equipment (UE). Specifically, for example, the user equipment 110 may be a mobile terminal such as a smart phone, a tablet computer, an e-book reader, or the like, or may be a smart wearable device such as smart glasses, a smart watch or a smart bracelet.

[0088] Alternatively, the user equipment 110 may be a vehicle-mounted communication device. For example, it may be an on-board computer with wireless communication function, or a wireless communication device external to the on-board computer.

[0089] Alternatively, the user equipment 110 may also be a roadside device. For example, it may be a street lamp, a traffic signal or other roadside device with wireless communication function.

[0090] The base station 120 may be a network-side device in a wireless communication system. Among them, the wireless communication system may also be a 5G system, also known as the New Radio (NR) system. Or, the wireless communication system may also be the next-generation system of the 5G system.

[0091] Among them, the base station 120 may be a base station (gNB) adopting a centralized distributed architecture in the 5G system. When the base station 120 adopts a centralized distributed architecture, it usually includes a central unit (CU) and at least two distributed units (DUs). The protocol stacks of the Packet Data Convergence Protocol (PDCP) layer, Radio Link Control (RLC) layer, and Media Access Control (MAC) layer are set in the central unit; the Physical (PHY) layer protocol stack is set in the distributed unit. The specific implementation manner of the base station 120 is not limited in the embodiments of the present disclosure.

[0092] A wireless connection may be established between the base station 120 and the user equipment 110 through a wireless air interface. The wireless air interface is a wireless air interface based on the fifth-generation mobile communication network technology (5G) standard. For example, the wireless air interface is the New Radio; or, the wireless air interface may also be a wireless air interface based on the next-generation mobile communication network technology standard of 5G.

[0093] Optionally, the above wireless communication system may further include a network management device 130.

[0094] A plurality of base stations 120 are respectively connected to the network management device 130. Among them, the network management device 130 may be a core network device in the wireless communication system. For example, the network management device 130 may be a Mobility Management Entity (MME) in the Evolved Packet Core (EPC). Or, the network management device may also be other core network devices, such as a Serving GateWay (SGW), a Public Data Network GateWay (PGW), a Policy and Charging Rules Function (PCRF), or a Home Subscriber Server (HSS), etc. The implementation form of the network management device 130 is not limited in the embodiments of the present disclosure.

[0095] Figure 2 is a flowchart of a method for determining the position of a control channel element shown according to an exemplary embodiment. The method for determining the position of the control channel element can be executed by a communication device. For example, the communication device can be Figure 1 the user equipment 110 or the base station 120 in the shown implementation environment. As Figure 2 shown, the method may include the following steps.

[0096] In step 201, the configuration information of the search space set is determined.

[0097] In step 202, according to the configuration information of the search space set and the hash function, the set of control channel element (CCE) positions of the PDCCH candidate set of the search space set is determined.

[0098] Wherein, the configuration information includes the group identification information of the search space set.

[0099] For example, taking the communication device as a terminal, the terminal calculates the first PDCCH candidate CCE position set and the second PDCCH candidate CCE position set within the same time slot according to the configuration information of the first search space set (first SS set) and the second search space set (second SS set), and the hash function formula. Among them, the first PDCCH candidate CCE position set corresponds to the first SS set, and the second PDCCH candidate CCE position set corresponds to the second SS set. And since the configuration information of the two SS sets is different, the above-mentioned first PDCCH candidate CCE position set and the second PDCCH candidate CCE position set are also different.

[0100] In a possible implementation manner, the determining the set of control channel element (CCE) positions of the PDCCH candidate set of the search space set according to the configuration information of the search space set and the hash function includes:

[0101] Input the group identification information of the search space set into the hash function formula to obtain the set of CCE positions of the PDCCH candidate set of the search space set.

[0102] In a possible implementation manner, when the search space set is at least two search space sets, the first PDCCH candidate CCE position set corresponding to the first search space set and the second PDCCH candidate CCE position set corresponding to the second search space set are in a comb-like cross distribution;

[0103] Wherein, the first search space set and the second search space set are any two of the at least two search space sets.

[0104] In a possible implementation, the hash function formula includes a first hash function formula, and the first hash function formula is as follows:

[0105]

[0106] where K is the group identification information of the search space set, and K is an integer greater than or equal to 0.

[0107] In a possible implementation, the hash function formula includes a second hash function formula, and the second hash function formula is as follows:

[0108]

[0109] where is the identification of the enhanced PDCCH candidate set;

[0110] the identification of the enhanced PDCCH candidate set of the PDCCH candidate set of each of the at least two search space sets is determined by the identification of the PDCCH candidate set of the at least two search space sets.

[0111] In a possible implementation, when the search space set is at least two search space sets, there is no overlap between the smallest continuous position interval where the first PDCCH candidate CCE position set corresponding to the first search space set is located and the smallest continuous position interval where the second PDCCH candidate CCE position set corresponding to the second search space set is located;

[0112] where the smallest continuous position interval is the interval from the first CCE position to the last CCE position in the corresponding PDCCH candidate CCE position set, and the first search space set and the second search space set are any two of the at least two search space sets.

[0113] In a possible implementation, the hash function formula includes a third hash function formula, and the third hash function formula is as follows:

[0114]

[0115] where, for the search space set with group identification information of 0, is the identification of the PDCCH candidate set within the search space set with group identification information of 0;

[0116] for the search space set with group identification information of j, where j is an integer greater than 0, It is the sum of the number of PDCCH candidate sets in the search space set where the group identification information is less than j, plus the identification of the PDCCH candidate set in the search space set where the group identification information is j.

[0117] In a possible implementation manner, the CCEs of the PDCCH candidate sets of the above at least two search space sets are in the same time slot; and, the above at least two search space sets correspond to the same control resource set.

[0118] In a possible implementation manner, the above at least two search space sets correspond to different beam direction identifiers.

[0119] In a possible implementation manner, the group identification information of the search space set is obtained according to the grouping result of grouping each search space set;

[0120] Among them, the search space sets within the same search space set group correspond to the same beam direction identifier.

[0121] In a possible implementation manner, the group identification information of the search space set is the identification information obtained after re-numbering the specified identifiers in each search space set group obtained by grouping in ascending order; the specified identifier is the identifier of the search space set with the smallest identifier in the corresponding search space set group, or, the specified identifier is the identifier of the search space set with the largest identifier in the corresponding search space set group.

[0122] In a possible implementation manner, the group identification information of the search space set is the identification information obtained after re-numbering the beam direction identifiers corresponding to each search space set group obtained by grouping.

[0123] In summary, in the solution shown in the embodiments of the present application, when calculating the CCE position set of the PDCCH candidate set of the search space set, the configuration information of the search space set is introduced to combine with the hash function for calculation, that is, the determined CCE position set of the PDCCH candidate set is related to the configuration information of the search space set, that is, the group identification information of the search space set. For two or more search space sets with different group identification information, even if they correspond to the same CORESET, have the same aggregation level, and are in the same time slot, it is possible to achieve non-overlapping of the CCE position sets of the PDCCH candidate sets, thereby meeting the requirements of PDCCH repeated transmission under FDM's Multi-TRP and improving the transmission reliability of the PDCCH.

[0124] Figure 3 It is a flowchart of a method for determining the position of a control channel element shown according to an exemplary embodiment. The method for determining the position of the control channel element can be executed by a communication device. For example, the communication device can be Figure 1The user equipment 110 or the base station 120 in the shown implementation environment. As Figure 3 shown, the method may include the following steps.

[0125] In step 301, determine the configuration information of the search space set.

[0126] In a possible implementation, the communication device obtains the configuration information of a single search space set.

[0127] That is to say, the solution shown in the embodiments of the present application can be applied to the scenario of determining the CCE position set of the PDCCH candidate set for a single search space set alone. For example, it can be applied to the scenario of sending PDCCH through a single TRP.

[0128] In another possible implementation, the communication device obtains the configuration information of at least two search space sets; that is to say, the search space sets obtained by the communication device include at least two search space sets.

[0129] Among them, the CCEs of the PDCCH candidate sets of the above at least two search space sets are in the same time slot; and, the above at least two search space sets correspond to the same control resource set. Further, the aggregation levels of the PDCCH candidate sets of the above at least two search space sets are the same.

[0130] In the solution shown in the embodiments of the present application, it can also be applied to the scenario of determining the CCE position set of the PDCCH candidate set for two or more search space sets whose CCEs of the respective PDCCH candidate sets are in the same time slot and correspond to the same control resource set. For example, it can be applied to the scenario of sending PDCCH from multiple TRPs to the same terminal.

[0131] In a possible implementation, the above at least two search space sets correspond to different beam direction identifiers.

[0132] For example, in the scenario of sending PDCCH from multiple TRPs to the same terminal as described above, each of the at least two search space sets obtained by the communication device corresponds to a beam direction identifier, and the beam direction identifiers corresponding to the at least two search space sets are different, that is, they correspond to different beam directions.

[0133] In a possible implementation, each of the at least two search space sets obtained by the above communication device corresponds to a different TRP.

[0134] In a possible implementation, the configuration information of the above search space set includes the group identifier information of the search space set.

[0135] In a possible implementation, the group identification information of the search space set is obtained according to the grouping result of grouping each search space set;

[0136] Among them, the search space sets within the same search space set group correspond to the same beam direction identification.

[0137] In the embodiments of the present application, the communication device groups each search space set, allocates the search space sets with the same beam direction identification to the same search space set group, and sets group identification information for each search space set group. In an exemplary solution, when determining the configuration information of the search space set, the communication device may obtain the group identification information of the search space set group where the search space set is located as the configuration information of the search space set.

[0138] In a possible implementation, when the communication device obtains at least two search space sets, it respectively obtains one search space set from different search space set groups, so that the configuration information of the obtained at least two search space sets is different from each other.

[0139] In a possible implementation, the group identification information of the search space set is the identification information obtained after re - numbering the specified identifications in each of the grouped search space set groups in ascending order; the specified identification is the identification of the search space set with the smallest identification in the corresponding search space set group, or the specified identification is the identification of the search space set with the largest identification in the corresponding search space set group.

[0140] In the embodiments of the present application, after the communication device groups each search space set, it determines the identification of the search space set that meets the specified condition from each search space set. Among them, the above - mentioned specified condition may be the smallest identification in the corresponding search space set group, or it may also be the largest identification in the corresponding search space set group.

[0141] Taking the above - mentioned specified condition that the identification is the smallest in the corresponding search space set group as an example, the communication device respectively obtains the identification of the search space set with the smallest identification from each search space set group, and re - numbers the obtained identifications of each search space in ascending order to obtain the group identification information of each search space set group.

[0142] For example, for two SS set groups within the same slot, namely the first SS set group and the second SS set group, where the identifier of the search space set with the smallest identifier in the first SS set group is SS set #3, and the identifier of the search space set with the smallest identifier in the second SS set group is SS set #5. After re-numbering in ascending order, the group identifier information of the first SS set group is ID #0, that is, the value of K in the first hash function formula is 0; the group identifier information of the second SS set group can be ID #1, that is, the value of K in the first hash function formula is 1.

[0143] In a possible implementation manner, the group identifier information of the search space set is the identifier information obtained after re-numbering the beam direction identifiers corresponding to each search space set group obtained by grouping.

[0144] In the embodiment of the present application, after the communication device groups each search space set, since each search space set group corresponds to the same beam direction identifier, the communication device can obtain the beam direction identifier corresponding to each search space set group, and then re-number in ascending or descending order to obtain the group identifier information of each search space set group.

[0145] For example, for two SS set groups within the same slot, namely the first SS set group and the second SS set group, where the beam direction identifier corresponding to the first SS set group is beam #4, and the beam direction identifier corresponding to the second SS set group is beam #2. After the communication device re-numbers in ascending order of the beam direction identifier, the group identifier information of the second SS set group is ID #0, that is, the value of K in the first hash function formula is 0; the group identifier information of the first SS set group can be ID #1, that is, the value of K in the first hash function formula is 1.

[0146] In a possible implementation manner, the above beam direction identifier may be a Transmission Configuration Indication (TCI) status identifier (such as a downlink TCI status identifier, an uplink TCI status identifier), or a SpatialRelationInfo identifier, etc.

[0147] In step 302, the group identifier information of the search space set is input into the hash function formula to obtain the CCE position set of the PDCCH candidate set of the search space set.

[0148] In an embodiment of the present application, a communication device may calculate a set of CCE positions of a PDCCH candidate set of a search space set by inputting a hash function of group identification information of the search space set.

[0149] In a possible implementation manner, when the above search space set is at least two search space sets, a first set of CCE positions of a first PDCCH candidate corresponding to a first search space set and a second set of CCE positions of a second PDCCH candidate corresponding to a second search space set are comb-shaped cross-distributed; wherein, the first search space set and the second search space set are any two of the at least two search space sets.

[0150] In a possible implementation manner, the hash function formula includes a first hash function formula, and the first hash function formula is as follows:

[0151]

[0152] Wherein, in the above formula (1), K is the group identification information of the search space set, and K is an integer greater than or equal to 0.

[0153] Wherein, in the above formula (1), L is the aggregation level, is an initial value, is the maximum number of PDCCH candidate sets at the aggregation level, is the number of PDCCH candidate sets configured for the terminal, N CCE，p is the number of CCEs included in the control resource set, n CI is a carrier parameter, i ∈ [0, L - 1].

[0154] In a possible implementation manner, when the above search space set includes at least two search space sets, in the above formula (1) is the sum of the numbers of PDCCH candidate sets at the aggregation level L of the at least two search space sets, or is the number of PDCCH candidate sets at the aggregation level L of each search space set in the at least two search space sets.

[0155] In an embodiment of the present application, taking two search space sets corresponding to the same slot and the same control resource set as an example, for PDCCH candidates with the same aggregation level, when calculating a first set of CCE positions of a first PDCCH candidate and a second set of CCE positions of a second PDCCH candidate through the above formula (1), the first set of CCE positions of the first PDCCH candidate and the second set of CCE positions of the second PDCCH candidate are comb-shaped cross-distributed.

[0156] For example, please refer to Figure 4 , which shows a distribution map of a set of CCE positions involved in an embodiment of the present application. As Figure 4 shown, the set of CCE positions of the first PDCCH candidate set and the set of CCE positions of the second PDCCH candidate set are respectively: the CCE position 41 of the first PDCCH candidate #1 in the frequency domain, the CCE position 42 of the second PDCCH candidate #1, the CCE position 43 of the first PDCCH candidate #2, the CCE position 44 of the second PDCCH candidate #2, and so on. In a possible implementation, there is no continuity between these adjacent two PDCCH candidate positions, that is, there may be PDCCH candidate CCEs of other terminals between the adjacent two PDCCH candidate positions.

[0157] To achieve the above effect, the configuration information of the SS set, that is, the group identification information of the search space set, i.e., the ID value, can be added after n in formula (1), and this ID value is K in the above formula (1).

[0158] In a possible implementation, the above hash function formula includes a second hash function formula, and the second hash function formula is as follows:

[0159]

[0160] Among them, different from the above formula (1), in the above formula (2), is the enhanced PDCCH candidate set identifier;

[0161] The enhanced PDCCH candidate set identifiers of the PDCCH candidate sets of the above at least two search space sets are determined by the PDCCH candidate set identifiers of the at least two search space sets.

[0162] In a possible implementation, when the above search space set includes at least two search space sets, in the above formula (2) is the sum of the numbers of PDCCH candidate sets with the aggregation level L of the above at least two search space sets or is the number of PDCCH candidate sets with the aggregation level L of each search space set in the above at least two search space sets.

[0163] For example, the number of PDCCH candidates with the aggregation level L of 4 in SS set1 is 4, and the number of PDCCH candidates with the aggregation level L of 4 in SS set2 is also 4.

[0164] Let the group identifier corresponding to SS set1 be 0, and the group identifier corresponding to SS set2 be 1.

[0165] Based on the traditional method, the values of m for the PDCCH candidates of these two SS sets are all 0, 1, 2, 3. While based on the method shown in the above formula (2), the values of m for the 4 PDCCH candidates of SS set1 are 0, 2, 4, 6; and the values of m for the 4 PDCCH candidates of SS set2 are 1, 3, 5, 7. That is, the total number of PDCCH candidates with L = 4 for these two SS sets is 8, and the values of m are 0, 1, 2, 3, 4, 5, 6, 7; and the m values of the PDCCH candidates of the two SS sets are 0, 2, 4, 6 and 1, 3, 5, 7 respectively; then combining the above values of m and the above formula (2), the two sets of PDCCH candidate CCE positions calculated are in a comb-like cross distribution, thus achieving the effect of interleaving the PDCCH candidate CCE position sets.

[0166] Furthermore, The value of is the number of respective PDCCH candidates with aggregation level L = 4 within the search space, that is is 4; or the value of M is the sum of the numbers of PDCCH candidates with aggregation level L = 4 within the two search spaces, that is is 8.

[0167] In a possible implementation, when the above search space set is at least two search space sets, there is no overlap between the smallest continuous position interval where the first PDCCH candidate CCE position set corresponding to the first search space set is located and the smallest continuous position interval where the second PDCCH candidate CCE position set corresponding to the second search space set is located; where, this smallest continuous position interval is the interval from the first CCE position to the last CCE position in the corresponding PDCCH candidate CCE position set.

[0168] In a possible implementation, the hash function formula includes a third hash function formula, and the third hash function formula is as follows:

[0169]

[0170] In the above formula (3), L is the aggregation level, is the initial value, is the maximum number of the PDCCH candidate set at the said aggregation level, NCCE，p To control the number of CCEs included in the resource set, n CI is a carrier parameter, where i ∈ [0, L - 1].

[0171] is an initial value related to the cell radio network temporary identity and time slot number of the terminal. That is, this can be determined by the cell radio network temporary identity and time slot number of the terminal.

[0172] In a possible implementation, when the above search space set includes at least two search space sets, in the above formula (3), is the sum of the numbers of PDCCH candidate sets with aggregation level L in the set of the above at least two search space sets, or is the number of PDCCH candidate sets with aggregation level L in each of the above at least two search space sets.

[0173] Among them, different from the above formula (1) or formula (2), in the above formula (3), for the PDCCH candidate set with aggregation level L, for the search space set with group identification information 0, is the identification of the PDCCH candidate set in the search space set with group identification information 0; for the search space set with group identification information j, where j is an integer greater than 0, is the total number of the PDCCH candidate sets in the search space sets with group identification information less than j, plus the identification of the PDCCH candidate set in the search space set with group identification information j.

[0174] For example, when j in the above formula (3) is 0, formula (3) is equivalent to the traditional hash function formula. Assuming that the number of PDCCH candidate sets with aggregation level L of 4 is 4, then the value of m is 0, 1, 2, 3.

[0175] For another example, when j is 1 and the number of PDCCH candidate sets with aggregation level L of 4 is also 4, the numbers of the PDCCH candidate sets in this search space set should be added with the number of the PDCCH candidate sets in the first search space set, that is, the numbers of the PDCCH candidate sets become 0 + 4, 1 + 4, 2 + 4, and 3 + 4.

[0176] Furthermore, the value of is the number of respective PDCCH candidates with aggregation level L in the search space, that is is 4; or the value of M is the sum of the numbers of PDCCH candidates with aggregation level L in two search spaces, that is is 8.

[0177] Taking two search space sets corresponding to the same slot and the same control resource set as an example, when calculating the first PDCCH candidate CCE position set and the second PDCCH candidate CCE position set through the above formula (3), there is no overlap between the smallest continuous position interval where the first PDCCH candidate CCE position set is located and the smallest continuous position interval where the second PDCCH candidate CCE position set is located.

[0178] For example, please refer to Figure 5 , which shows another CCE position set distribution diagram involved in the embodiments of the present application. As Figure 5 shown, the first PDCCH candidate CCE position set and the second PDCCH candidate CCE position set are arranged as follows: the frequency domain positions are the CCE position 51 of the first PDCCH candidate #1, the CCE position 52 of the first PDCCH candidate #2, the CCE position 53 of the second PDCCH candidate #1, and the CCE position 54 of the second PDCCH candidate #2.

[0179] To make the above two PDCCH candidate CCE position sets continuous respectively, the hash function of the first PDCCH candidate CCE position set remains unchanged. The position of the second PDCCH candidate CCE set needs to be entirely behind the position of the last CCE of the last PDCCH candidate in the first PDCCH candidate CCE set.

[0180] Taking the determination of the PDCCH candidate CCE position sets corresponding to two search space sets as an example, the above formula (2) realizes the overall translation of the CCEs of the second PDCCH candidate CCE set to behind the last CCE of the first PDCCH candidate CCE set. For example, the CCEs of the first PDCCH candidate CCE set are among the 0 - 31 CCEs, while the CCEs of the second PDCCH candidate CCE set are after the CCE numbered 31.

[0181] In the embodiment of the present application, the calculated PDCCH candidate number is relatively large, but the frequency domain position of its CCE is not necessarily at the back. That is, assuming that from low frequency to high frequency is from front to back, since the frequency domain position of the first PDCCH candidate can start at any position in the entire frequency domain position, if the frequency domain position corresponding to the subsequent number exceeds the highest frequency position of the entire frequency domain, the frequency domain position is recalculated starting from the lowest frequency. Therefore, for the CCEs included in a PDCCH candidate with a high number, its frequency domain position is not necessarily high.

[0182] In the solution shown in the embodiment of the present application, when the base station uses multiple TRPs to send PDCCH services to the terminal, when different SS sets of the same CORESET correspond to different TRPs, the configuration information of different SS sets is introduced into the hash function to calculate the CCE position set of the PDCCH candidate, so that different SS sets can support the FDM method to implement the transmission of the multi-TRP PDCCH, improving the DCI signaling decoding success rate.

[0183] In summary, in the solution shown in the embodiment of the present application, when calculating the CCE position set of the PDCCH candidate set of the search space set, the configuration information of the search space set is introduced to combine with the hash function for calculation. That is to say, the determined CCE position set of the PDCCH candidate set is related to the configuration information of the search space set, that is, the group identification information of the search space set. For two or more search space sets with different group identification information, even if they correspond to the same CORESET, have the same aggregation level, and are in the same time slot, it is possible to make the CCE position sets of the PDCCH candidate sets non-overlapping, thus meeting the requirement of repeated transmission of the PDCCH under FDM multi-TRP and improving the transmission reliability of the PDCCH.

[0184] The following is an embodiment of the device of the present disclosure, which can be used to execute the embodiment of the method of the present disclosure. For the details not disclosed in the embodiment of the device of the present disclosure, please refer to the embodiment of the method of the present disclosure.

[0185] Figure 6 is a block diagram of a control channel element position determination device shown according to an exemplary embodiment, as Figure 6 shown, this control channel element position determination device can be used for Figure 1 the user equipment 110 or the base station 120 in the shown implementation environment to execute Figure 2 or Figure 3 all or part of the steps in the shown embodiments. This control channel element position determination device may include:

[0186] A configuration information determination module 601, configured to determine configuration information of a search space set;

[0187] A position set determination module 602, configured to determine a set of control channel element (CCE) positions of a PDCCH candidate set of the search space set according to the configuration information of the search space set and a hash function;

[0188] Wherein, the configuration information includes group identification information of the search space set.

[0189] In a possible implementation manner, the position set determination module 602 is configured to input the group identification information of the search space set into a hash function formula to obtain a set of CCE positions of the PDCCH candidate set of the search space set.

[0190] In a possible implementation manner, when the search space set is at least two search space sets, a first set of CCE positions of PDCCH candidates corresponding to a first search space set and a second set of CCE positions of PDCCH candidates corresponding to a second search space set are distributed in a comb-like and cross manner;

[0191] Wherein, the first search space set and the second search space set are any two of the at least two search space sets.

[0192] In a possible implementation manner, the hash function formula includes a first hash function formula, and the first hash function formula is as follows:

[0193]

[0194] Wherein, K is the group identification information of the search space set, and K is an integer greater than or equal to 0.

[0195] In a possible implementation manner, the hash function formula includes a second hash function formula, and the second hash function formula is as follows:

[0196]

[0197] Wherein, is an identifier of an enhanced PDCCH candidate set;

[0198] The identifiers of the enhanced PDCCH candidate sets of the PDCCH candidate sets of the at least two search space sets are determined by the identifiers of the PDCCH candidate sets of the at least two search space sets.

[0199] In a possible implementation, when there are at least two search space sets, there is no overlap between the smallest continuous position interval where the set of first PDCCH candidate CCE positions corresponding to the first search space set is located and the smallest continuous position interval where the set of second PDCCH candidate CCE positions corresponding to the second search space set is located;

[0200] Among them, the smallest continuous position interval is the interval between the first CCE position and the last CCE position in the corresponding set of PDCCH candidate CCE positions, and the first search space set and the second search space set are any two of the at least two search space sets.

[0201] In a possible implementation, the hash function formula includes a third hash function formula, and the third hash function formula is as follows:

[0202]

[0203] Among them, for the search space set with group identification information 0, is the identification of the PDCCH candidate set within the search space set with group identification information 0;

[0204] For the search space set with group identification information j, where j is an integer greater than 0, is the sum of the numbers of PDCCH candidate sets within the search space sets with group identification information less than j, plus the identification of the PDCCH candidate set within the search space set with group identification information j.

[0205] In a possible implementation, the CCEs of the PDCCH candidate sets of the at least two search space sets are in the same time slot; and, the at least two search space sets correspond to the same control resource set.

[0206] In a possible implementation, the at least two search space sets correspond to different beam direction identifiers.

[0207] In a possible implementation, the group identification information of the search space set is obtained according to the grouping result of grouping each of the search space sets;

[0208] Among them, the search space sets within the same search space set group correspond to the same beam direction identifier.

[0209] In a possible implementation, the group identification information of the search space set is the identification information obtained by renumbering the specified identifications in each search space set group obtained by grouping in ascending order; the specified identification is the identification of the search space set with the smallest identification in the corresponding search space set group, or the specified identification is the identification of the search space set with the largest identification in the corresponding search space set group.

[0210] In a possible implementation, the group identification information of the search space set is the identification information obtained by renumbering the beam direction identifications corresponding to each search space set group obtained by grouping.

[0211] In summary, in the solution shown in the embodiments of the present application, when calculating the CCE position set of the PDCCH candidate set of the search space set, the configuration information of the search space set is introduced to calculate in combination with the hash function. That is to say, the determined CCE position set of the PDCCH candidate set is related to the configuration information of the search space set, that is, the group identification information of the search space set. For two or more search space sets with different group identification information, even if they correspond to the same CORESET, have the same aggregation level, and are in the same time slot, it is possible to achieve non-overlapping of the CCE position sets of the PDCCH candidate sets, thereby meeting the requirements of PDCCH repeated transmission under FDM Multi-TRP and improving the transmission reliability of PDCCH.

[0212] It should be noted that when the device provided in the above embodiments implements its functions, only the above-mentioned division of each functional module is used for illustration. In actual applications, the above functions can be allocated to different functional modules according to actual needs, that is, the content structure of the device is divided into different functional modules to complete all or part of the functions described above.

[0213] Regarding the device in the above embodiments, the specific manner in which each module performs operations has been described in detail in the embodiments related to the method, and will not be elaborated here.

[0214] An exemplary embodiment of the present disclosure provides a control channel element position determination device, which can implement all or part of the steps in the above Figure 2 or Figure 3 illustrated embodiments of the present disclosure. The control channel element position determination device includes: a processor and a memory for storing processor-executable instructions;

[0215] Wherein, the processor is configured to:

[0216] Determine the configuration information of the search space set;

[0217] Determine a set of control channel element (CCE) positions of the PDCCH candidate set of the search space set according to the configuration information of the search space set and a hash function;

[0218] Wherein, the configuration information includes group identification information of the search space set.

[0219] In a possible implementation manner, the determining a set of control channel element (CCE) positions of the PDCCH candidate set of the search space set according to the configuration information of the search space set and a hash function includes:

[0220] Input the group identification information of the search space set into the hash function formula to obtain a set of CCE positions of the PDCCH candidate set of the search space set.

[0221] In a possible implementation manner, when the search space set is at least two search space sets, a first set of CCE positions of the first PDCCH candidate corresponding to the first search space set and a second set of CCE positions of the second PDCCH candidate corresponding to the second search space set are distributed in a comb-like cross pattern;

[0222] Wherein, the first search space set and the second search space set are any two of the at least two search space sets.

[0223] In a possible implementation manner, the hash function formula includes a first hash function formula, and the first hash function formula is as follows:

[0224]

[0225] Wherein, K is the group identification information of the search space set, and K is an integer greater than or equal to 0.

[0226] In a possible implementation manner, the hash function formula includes a second hash function formula, and the second hash function formula is as follows:

[0227]

[0228] Wherein, is an identifier of an enhanced PDCCH candidate set;

[0229] The identifiers of the enhanced PDCCH candidate sets of the PDCCH candidate sets of the at least two search space sets are determined by the identifiers of the PDCCH candidate sets of the at least two search space sets.

[0230] In a possible implementation, when there are at least two search space sets, there is no overlap between the smallest continuous position interval where the first PDCCH candidate CCE position set corresponding to the first search space set is located and the smallest continuous position interval where the second PDCCH candidate CCE position set corresponding to the second search space set is located;

[0231] Among them, the smallest continuous position interval is the interval from the first CCE position to the last CCE position in the corresponding PDCCH candidate CCE position set, and the first search space set and the second search space set are any two of the at least two search space sets.

[0232] In a possible implementation, the hash function formula includes a third hash function formula, and the third hash function formula is as follows:

[0233]

[0234] Among them, for the search space set with group identification information 0, is the identification of the PDCCH candidate set within the search space set with group identification information 0;

[0235] For the search space set with group identification information j, where j is an integer greater than 0, is the sum of the numbers of PDCCH candidate sets within the search space sets with group identification information less than j, plus the identification of the PDCCH candidate set within the search space set with group identification information j.

[0236] In a possible implementation, the CCEs of the PDCCH candidate sets of the at least two search space sets are in the same time slot; and the at least two search space sets correspond to the same control resource set.

[0237] In a possible implementation, the at least two search space sets correspond to different beam direction identifiers.

[0238] In a possible implementation, the group identification information of the search space set is obtained by grouping each of the search space sets according to the grouping result;

[0239] Among them, the search space sets within the same search space set group correspond to the same beam direction identifier.

[0240] In a possible implementation, the group identification information of the search space set is identification information obtained by renumbering in ascending order the specified identifications in each search space set group obtained by grouping; the specified identification is the identification of the search space set with the smallest identification in the corresponding search space set group, or the specified identification is the identification of the search space set with the largest identification in the corresponding search space set group.

[0241] In a possible implementation, the group identification information of the search space set is identification information obtained by renumbering the beam direction identifications corresponding to each search space set group obtained by grouping.

[0242] Among them, the steps that the above processor is configured to execute can refer to the respective steps in the above Figure 2 and Figure 3 illustrated embodiments, which will not be elaborated here.

[0243] The above mainly takes a communication device as an example to introduce the solution provided by the embodiments of the present disclosure. It can be understood that in order to implement the above functions, the communication device includes the corresponding hardware structure and / or software module for executing each function. Combining the modules and algorithm steps of each example described in the embodiments disclosed in the present disclosure, the embodiments of the present disclosure can be implemented in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed in the way of hardware or computer software driving hardware depends on the specific application and design constraint conditions of the technical solution. Those skilled in the art can use different methods to implement the described function for each specific application, but such implementation should not be considered to exceed the scope of the technical solution of the embodiments of the present disclosure.

[0244] Figure 7 is a schematic structural diagram of a communication device shown according to an exemplary embodiment. The communication device can be implemented as a user equipment or a base station in the above Figure 1 illustrated system environment, and can execute the method as described above or all or part of the steps in the Figure 2 or Figure 3 illustrated embodiments.

[0245] The communication device 700 includes a communication unit 704 and a processor 702. Among them, the processor 702 can also be a controller, Figure 7 denoted as "controller / processor 702" in the

[0246] The communication unit 704 is used to support the communication device to communicate with other network entities (such as other user equipment or base stations, etc.).

[0247] It can be understood that Figure 7 Only a simplified design of the communication device 700 is shown. In practical applications, the communication device 700 may include any number of processors, controllers, memories, communication units, etc., and all communication devices that can implement the embodiments of the present disclosure are within the protection scope of the embodiments of the present disclosure.

[0248] Those skilled in the art should be able to realize that in one or more of the above examples, the functions described in the embodiments of the present disclosure can be implemented by hardware, software, firmware, or any combination thereof. When implemented using software, these functions can be stored in a computer-readable medium or transmitted as one or more instructions or codes on a computer-readable medium. The computer-readable medium includes computer storage media and communication media, where the communication media includes any medium that facilitates the transmission of a computer program from one place to another. The storage media can be any available medium accessible by a general-purpose or special-purpose computer.

[0249] The embodiments of the present disclosure also provide a computer storage medium for storing computer software instructions used for the above communication device, which includes a program designed to execute the methods shown in the above various embodiments.

[0250] In an exemplary embodiment, a computer program product or a computer program is also provided. The computer program product or the computer program includes computer instructions, and the computer instructions are stored in a computer-readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes the methods shown in the above various embodiments.

[0251] After considering the specification and practicing the invention disclosed herein, those skilled in the art will readily conceive of other embodiments of the present disclosure. The present disclosure is intended to cover any variations, uses, or adaptations of the present disclosure, which follow the general principles of the present disclosure and include well-known knowledge or conventional technical means in the technical field not disclosed in the present disclosure. The specification and the embodiments are only regarded as exemplary, and the true scope and spirit of the present disclosure are pointed out by the following claims.

[0252] It should be understood that the present disclosure is not limited to the exact structures already described and shown in the drawings, and various modifications and changes can be made without departing from its scope. The scope of the present disclosure is only limited by the appended claims.

Claims

1. A method for determining the position of a control channel element, characterized in that, The method includes: Determining configuration information of a search space set; the configuration information includes group identification information of the search space set; the group identification information of the search space set is the group identification information of the search space set group where the search space set is located, and the search space sets within the same search space set group correspond to the same beam direction identification; Inputting the group identification information of the search space set into a hash function formula to obtain a set of CCE positions of the PDCCH candidate set of the search space set; The group identification information of the search space set is identification information obtained by renumbering the specified identifications in each of the grouped search space set groups in ascending order; the specified identification is the identification of the search space set with the smallest identification in the corresponding search space set group, or is the identification of the search space set with the largest identification in the corresponding search space set group; alternatively, the group identification information of the search space set is identification information obtained by renumbering the beam direction identifications corresponding to each of the grouped search space set groups; The hash function formula includes: K is the group identification information of the search space set, and K is an integer greater than 0; L is the aggregation level, is the initial value, is the maximum number of PDCCH candidate sets at the aggregation level, is the number of PDCCH candidate sets configured for the terminal, N CCE，p is the number of CCEs included in the control resource set, n CI is a carrier parameter, where i ∈ [0, L - 1].

2. The method according to claim 1, wherein When the search space set is at least two search space sets, the set of CCE positions of the first PDCCH candidate corresponding to the first search space set and the set of CCE positions of the second PDCCH candidate corresponding to the second search space set are in a comb-like cross distribution; Wherein, the first search space set and the second search space set are any two of the at least two search space sets.

3. The method according to claim 1, wherein When the search space set is at least two search space sets, there is no overlap between the smallest continuous position interval where the set of CCE positions of the first PDCCH candidate corresponding to the first search space set is located and the smallest continuous position interval where the set of CCE positions of the second PDCCH candidate corresponding to the second search space set is located; Wherein, the smallest continuous position interval is the interval from the first CCE position to the last CCE position in the corresponding set of CCE positions of the PDCCH candidate, and the first search space set and the second search space set are any two of the at least two search space sets.

4. The method according to claim 2 or 3, wherein The CCEs of the PDCCH candidate sets of the at least two search space sets are in the same time slot; and, the at least two search space sets correspond to the same control resource set.

5. The method according to claim 4, wherein The at least two search space sets correspond to different beam direction identifications.

6. A control channel element position determination device, characterized in that, The apparatus includes: A configuration information acquisition module, configured to determine configuration information of a search space set; the configuration information includes group identification information of the search space set; the group identification information of the search space set is the group identification information of the search space set group where the search space set is located, and the search space sets within the same search space set group correspond to the same beam direction identification; A location set determination module, configured to input the group identification information of the search space set into a hash function formula to obtain a CCE location set of the PDCCH candidate set of the search space set; The group identification information of the search space set is identification information obtained by renumbering the specified identifications in each search space set group obtained by grouping in ascending order; the specified identification is the identification of the search space set with the smallest identification in the corresponding search space set group, or is the identification of the search space set with the largest identification in the corresponding search space set group; alternatively, the group identification information of the search space set is identification information obtained by renumbering the beam direction identifications corresponding to each search space set group obtained by grouping. The hash function formula includes: K is the group identification information of the search space set, and K is an integer greater than 0; L is the aggregation level, is the initial value, is the maximum number of PDCCH candidate sets at the aggregation level, is the number of PDCCH candidate sets configured for the terminal, N CCE，p is the number of CCEs included in the control resource set, n CI is the carrier parameter, i ∈ [0, L - 1].

7. The apparatus according to claim 6, wherein When the search space set is at least two search space sets, the first PDCCH candidate CCE location set corresponding to the first search space set and the second PDCCH candidate CCE location set corresponding to the second search space set are in a comb-like cross distribution; Wherein, the first search space set and the second search space set are any two of the at least two search space sets.

8. The apparatus according to claim 6, wherein When the search space set is at least two search space sets, there is no overlap between the smallest continuous position interval where the first PDCCH candidate CCE location set corresponding to the first search space set is located and the smallest continuous position interval where the second PDCCH candidate CCE location set corresponding to the second search space set is located; Wherein, the smallest continuous position interval is an interval from the first CCE position to the last CCE position in the corresponding PDCCH candidate CCE location set, and the first search space set and the second search space set are any two of the at least two search space sets.

9. The apparatus according to claim 7 or 8, wherein The CCEs of the PDCCH candidate sets of the at least two search space sets are in the same time slot; and, the at least two search space sets correspond to the same control resource set.

10. The device according to claim 9, characterized in that, The at least two search space sets correspond to different beam direction identifications.

11. A control channel element position determination device, characterized in that, The apparatus includes: A processor and a memory for storing processor-executable instructions; Wherein, the processor is configured to: Determine the configuration information of the search space set; the configuration information includes the group identification information of the search space set; the group identification information of the search space set is the group identification information of the search space set group where the search space set is located, and the search space sets within the same search space set group correspond to the same beam direction identification; Input the group identification information of the search space set into a hash function formula to obtain a CCE location set of the PDCCH candidate set of the search space set; The group identification information of the search space set is the identification information obtained by renumbering the specified identifications in each search space set group obtained by grouping in ascending order; the specified identification is the identification of the search space set with the smallest identification in the corresponding search space set group, or is the identification of the search space set with the largest identification in the corresponding search space set group; alternatively, the group identification information of the search space set is the identification information obtained by renumbering the beam direction identifications corresponding to each search space set group obtained by grouping. The hash function formula includes: K is the group identification information of the search space set, and K is an integer greater than 0; L is the aggregation level, is the initial value, is the maximum number of PDCCH candidate sets at the aggregation level, is the number of PDCCH candidate sets configured for the terminal, N CCE，p is the number of CCEs included in the control resource set, n CI is a carrier parameter, i ∈ [0, L - 1].

12. A computer-readable storage medium, characterized in that, The readable storage medium contains executable instructions, and the executable instructions are called by the processor to implement the control channel element position determination method according to any one of claims 1 to 5 above.

Images