Communication method, device and equipment

Abstract

The embodiment of the present application provides a communication method, apparatus and device. The method comprises: a terminal device acquires first information, the first information is used to indicate the association relationship of physical downlink control channels PDCCH sent by N transceiver points, and N is an integer greater than or equal to 2; the terminal device receives PDCCH according to the first information. The success rate of the terminal device receiving PDCCH is improved.

Description

Technical Field

[0001] The present invention relates to communication technology, and in particular to a communication method, device and equipment. Background Art

[0002] The network device may send a physical downlink control channel (PDCCH) to the terminal device, and the PDCCH may carry control information to schedule the terminal device for data transmission.

[0003] In a multi-transmission receiving point (M-TRP) communication scenario, multiple TRPs (network devices) can send the same PDCCH to a terminal device so that the terminal device can jointly decode the same multiple PDCCHs to increase the probability of successfully receiving the PDCCH. However, in actual applications, after the terminal device receives multiple PDCCHs, the terminal device cannot determine which PDCCHs are the same, resulting in the terminal device being unable to jointly decode the same multiple PDCCHs, resulting in a low success rate for the terminal device to receive the PDCCH. Summary of the invention

[0004] The embodiments of the present application provide a communication method, apparatus and device, which improve the success rate of a terminal device receiving a PDCCH.

[0005] In a first aspect, an embodiment of the present application provides a communication method, including:

[0006] The terminal device acquires first information, where the first information is used to indicate an association relationship between physical downlink control channels (PDCCHs) sent by N transceiver points, where N is an integer greater than or equal to 2;

[0007] The terminal device receives the PDCCH according to the first information.

[0008] In a possible implementation manner, the first information is used to indicate at least one of the following information:

[0009] The relationship between different search spaces; or,

[0010] The association relationship between different PDCCH candidate sets; or,

[0011] The association relationship between different PDCCH candidates.

[0012] In a possible implementation manner, the N transceiver points correspond to the same frequency domain resource set; different transceiver points correspond to different PDCCH candidate sets;

[0013] The first information is used to indicate an association relationship between different PDCCH candidate sets.

[0014] In a possible implementation manner, the N transceiver points include a first transceiver point and a second transceiver point; the first transceiver point corresponds to a first PDCCH candidate set, and the second transceiver point corresponds to a second PDCCH candidate set;

[0015] The first information is used to indicate an association relationship between the first PDCCH candidate set and the second PDCCH candidate set.

[0016] In a possible implementation manner, the first information is used to indicate that the i-th PDCCH in the first PDCCH candidate set is associated with the i-th PDCCH in the second PDCCH candidate set;

[0017] The i is less than or equal to the number of PDCCHs included in the first PDCCH candidate set, and the i is less than or equal to the number of PDCCHs included in the second PDCCH candidate set.

[0018] In a possible implementation manner, the N transceiver points correspond to the same frequency domain resource set;

[0019] The first information is used to indicate the association relationship between different PDCCH candidates at the same aggregation level.

[0020] In a possible implementation, the multiple search spaces correspond to the same set of frequency domain resources;

[0021] The first information is used to indicate that PDCCHs in at least two search spaces have an associated relationship.

[0022] In a possible implementation manner, the multiple search spaces include a first search space and a second search space, wherein the first search space includes M in one cycle. 1 PDCCH candidate sets, the second search space includes M in one cycle 2 PDCCH candidate sets;

[0023] The first information is used to indicate that the i-th PDCCH candidate set in the first search space is associated with the i-th PDCCH candidate set in the second search space, i≤M 1 , i≤M 2 .

[0024] In a possible implementation manner, in the time domain, the M 1 PDCCH candidate sets are arranged in sequence, and the M 2The PDCCH candidate sets are arranged in sequence.

[0025] In a possible implementation manner, one search space is associated with at least two frequency domain resource sets;

[0026] The first information is used to indicate that the PDCCHs corresponding to the at least two frequency domain resource sets are associated.

[0027] In a possible implementation manner, different control resource sets CORESET are frequency division multiplexing FDM; the at least two frequency domain resource sets include a first frequency domain resource set and a second frequency domain resource set; the first frequency domain resource set corresponds to a first PDCCH candidate set, and the second frequency domain resource set corresponds to a second PDCCH candidate set;

[0028] The first information is used to indicate that a PDCCH candidate in the first PDCCH candidate set is associated with a PDCCH candidate in the second PDCCH candidate set.

[0029] In one possible implementation, the first information is used to indicate that the i-th PDCCH candidate in the first PDCCH candidate set is associated with the i-th PDCCH candidate in the second PDCCH candidate set, where i is a positive integer less than or equal to P, and P is the number of PDCCH candidates included in the search space.

[0030] In a possible implementation manner, the first PDCCH candidate set includes Q first sub-PDCCH candidate sets, and the second PDCCH candidate set includes Q second sub-PDCCH candidate sets;

[0031] The first information is used to indicate that an i-th first sub-PDCCH candidate set in the first PDCCH candidate set is associated with an i-th second sub-PDCCH candidate set in the second PDCCH candidate set.

[0032] In a possible implementation manner, the at least two frequency domain resource sets include a first frequency domain resource set and a second frequency domain resource set, the first frequency domain resource set corresponds to T first PDCCH candidate sets, the second frequency domain resource set corresponds to T second PDCCH candidate sets, and T is an integer greater than or equal to 1;

[0033] The first information is used to indicate that the i-th first PDCCH candidate set among the T first PDCCH candidate sets is associated with the i-th second PDCCH candidate set among the T second PDCCH candidate sets, and i is a positive integer less than or equal to T.

[0034] In a possible implementation manner, the i-th first PDCCH candidate set includes S PDCCH candidates, the i-th second PDCCH candidate set includes S PDCCH candidates, and S is an integer greater than or equal to 1;

[0035] The first information is also used to indicate that the jth PDCCH candidate in the i-th first PDCCH candidate set is associated with the j-th PDCCH candidate in the i-th second PDCCH candidate set, where j is an integer less than or equal to S.

[0036] In a possible implementation manner, the first search space is associated with a first frequency domain resource set, and the second search space is associated with a second frequency domain resource set;

[0037] The first information is used to indicate that the PDCCH candidates in the first search space are associated with the PDCCH candidates in the second search space.

[0038] In a possible implementation manner, a period of the first search space includes K 1 PDCCH candidate sets, a period of the second search space includes K 2 PDCCH candidate sets, the K 1 is an integer greater than or equal to 1, the K 2 is an integer greater than or equal to 1;

[0039] The first information is used to indicate that the K 1 The i-th PDCCH candidate set in the PDCCH candidate sets is 2 The i-th PDCCH candidate set in the PDCCH candidate sets has an associated relationship, i≤K 1 , i≤K 2 .

[0040] In a possible implementation manner, in the time domain, the K 1 PDCCH candidate sets are arranged in sequence, and the K 2 The PDCCH candidate sets are arranged in sequence.

[0041] In a possible implementation manner, the first information is used to indicate that a first PDCCH candidate set in the first search space is associated with a second PDCCH candidate set in the second search space;

[0042] In the time domain, the second PDCCH candidate set is a PDCCH candidate set that is subsequent to the first PDCCH candidate set and is closest to the first PDCCH candidate set.

[0043] In a second aspect, an embodiment of the present application provides a communication device, including a processing module and a receiving module, wherein:

[0044] The processing module is used to obtain first information, where the first information is used to indicate an association relationship between physical downlink control channels PDCCH sent by N transceiver points, where N is an integer greater than or equal to 2;

[0045] The receiving module is used to receive the PDCCH according to the first information.

[0046] In a possible implementation manner, the first information is used to indicate at least one of the following information:

[0047] The relationship between different search spaces; or,

[0048] The association relationship between different PDCCH candidate sets; or,

[0049] The association relationship between different PDCCH candidates.

[0050] In a possible implementation manner, the N transceiver points correspond to the same frequency domain resource set; different transceiver points correspond to different PDCCH candidate sets;

[0051] The first information is used to indicate an association relationship between different PDCCH candidate sets.

[0052] In a possible implementation manner, the N transceiver points include a first transceiver point and a second transceiver point; the first transceiver point corresponds to a first PDCCH candidate set, and the second transceiver point corresponds to a second PDCCH candidate set;

[0053] The first information is used to indicate an association relationship between the first PDCCH candidate set and the second PDCCH candidate set.

[0054] In a possible implementation manner, the first information is used to indicate that the i-th PDCCH in the first PDCCH candidate set is associated with the i-th PDCCH in the second PDCCH candidate set;

[0055] The i is less than or equal to the number of PDCCHs included in the first PDCCH candidate set, and the i is less than or equal to the number of PDCCHs included in the second PDCCH candidate set.

[0056] In a possible implementation manner, the N transceiver points correspond to the same frequency domain resource set;

[0057] The first information is used to indicate the association relationship between different PDCCH candidates at the same aggregation level.

[0058] In a possible implementation, the multiple search spaces correspond to the same set of frequency domain resources;

[0059] The first information is used to indicate that PDCCHs in at least two search spaces have an associated relationship.

[0060] In a possible implementation manner, the multiple search spaces include a first search space and a second search space, wherein the first search space includes M in one cycle. 1 PDCCH candidate sets, the second search space includes M in one cycle 2 PDCCH candidate sets;

[0061] The first information is used to indicate that the i-th PDCCH candidate set in the first search space is associated with the i-th PDCCH candidate set in the second search space, i≤M 1 , i≤M 2 .

[0062] In a possible implementation manner, in the time domain, the M 1 PDCCH candidate sets are arranged in sequence, and the M 2 The PDCCH candidate sets are arranged in sequence.

[0063] In a possible implementation manner, one search space is associated with at least two frequency domain resource sets;

[0064] The first information is used to indicate that the PDCCHs corresponding to the at least two frequency domain resource sets are associated.

[0065] In a possible implementation manner, different control resource sets CORESET are frequency division multiplexing FDM; the at least two frequency domain resource sets include a first frequency domain resource set and a second frequency domain resource set; the first frequency domain resource set corresponds to a first PDCCH candidate set, and the second frequency domain resource set corresponds to a second PDCCH candidate set;

[0066] The first information is used to indicate that a PDCCH candidate in the first PDCCH candidate set is associated with a PDCCH candidate in the second PDCCH candidate set.

[0067] In one possible implementation, the first information is used to indicate that the i-th PDCCH candidate in the first PDCCH candidate set is associated with the i-th PDCCH candidate in the second PDCCH candidate set, where i is a positive integer less than or equal to P, and P is the number of PDCCH candidates included in the search space.

[0068] In a possible implementation manner, the first PDCCH candidate set includes Q first sub-PDCCH candidate sets, and the second PDCCH candidate set includes Q second sub-PDCCH candidate sets;

[0069] The first information is used to indicate that an i-th first sub-PDCCH candidate set in the first PDCCH candidate set is associated with an i-th second sub-PDCCH candidate set in the second PDCCH candidate set.

[0070] In a possible implementation manner, the at least two frequency domain resource sets include a first frequency domain resource set and a second frequency domain resource set, the first frequency domain resource set corresponds to T first PDCCH candidate sets, the second frequency domain resource set corresponds to T second PDCCH candidate sets, and T is an integer greater than or equal to 1;

[0071] The first information is used to indicate that the i-th first PDCCH candidate set among the T first PDCCH candidate sets is associated with the i-th second PDCCH candidate set among the T second PDCCH candidate sets, and i is a positive integer less than or equal to T.

[0072] In a possible implementation manner, the i-th first PDCCH candidate set includes S PDCCH candidates, the i-th second PDCCH candidate set includes S PDCCH candidates, and S is an integer greater than or equal to 1;

[0073] The first information is also used to indicate that the jth PDCCH candidate in the i-th first PDCCH candidate set is associated with the j-th PDCCH candidate in the i-th second PDCCH candidate set, where j is an integer less than or equal to S.

[0074] In a possible implementation manner, the first search space is associated with a first frequency domain resource set, and the second search space is associated with a second frequency domain resource set;

[0075] The first information is used to indicate that the PDCCH candidates in the first search space are associated with the PDCCH candidates in the second search space.

[0076] In a possible implementation manner, a period of the first search space includes K 1 PDCCH candidate sets, a period of the second search space includes K 2 PDCCH candidate sets, the K 1 is an integer greater than or equal to 1, the K 2 is an integer greater than or equal to 1;

[0077] The first information is used to indicate that the K 1 The i-th PDCCH candidate set in the PDCCH candidate sets is 2 The i-th PDCCH candidate set in the PDCCH candidate sets has an associated relationship, i≤K 1 , i≤K 2 .

[0078] In a possible implementation manner, in the time domain, the K 1 PDCCH candidate sets are arranged in sequence, and the K 2 The PDCCH candidate sets are arranged in sequence.

[0079] In a possible implementation manner, the first information is used to indicate that a first PDCCH candidate set in the first search space is associated with a second PDCCH candidate set in the second search space;

[0080] In the time domain, the second PDCCH candidate set is a PDCCH candidate set that is subsequent to the first PDCCH candidate set and is closest to the first PDCCH candidate set.

[0081] In a third aspect, an embodiment of the present application provides a terminal device, including: a transceiver, a processor, and a memory;

[0082] The memory stores computer-executable instructions;

[0083] The processor executes the computer-executable instructions stored in the memory, so that the processor executes the communication method as described in any one of the first aspects.

[0084] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer-executable instructions, and when the computer-executable instructions are executed by a processor, they are used to implement the communication method described in any one of the first aspects.

[0085] The communication method, apparatus and equipment provided in the embodiments of the present application enable the terminal device to first obtain the association relationship between the PDCCHs sent by multiple transceiver points before receiving the PDCCH, and receive and jointly decode the PDCCH based on the association relationship between the PDCCHs, thereby increasing the probability of the terminal device successfully receiving the PDCCH. BRIEF DESCRIPTION OF THE DRAWINGS

[0086] Figure 1A An architecture diagram of a communication system provided in an embodiment of the present application;

[0087] Figure 1B An architecture diagram of another communication system provided in an embodiment of the present application;

[0088] Figure 2 A flow chart of a communication method provided in an embodiment of the present application;

[0089] Figure 3A A schematic diagram of a search space provided in an embodiment of the present application;

[0090] Figure 3B A schematic diagram of another search space provided in an embodiment of the present application;

[0091] Figure 3C A schematic diagram of another search space provided in an embodiment of the present application;

[0092] Figure 3D A schematic diagram of another search space provided in an embodiment of the present application;

[0093] Figure 4A A schematic diagram of a search space in an FDM mode provided in an embodiment of the present application;

[0094] Figure 4B A schematic diagram of another search space in an FDM mode provided in an embodiment of the present application;

[0095] Figure 4C A schematic diagram of a search space in a TDM mode provided in an embodiment of the present application;

[0096] Figure 4D A schematic diagram of another search space in the TDM mode provided in an embodiment of the present application;

[0097] Figure 5A A schematic diagram of a search space provided in an embodiment of the present application;

[0098] Figure 5B A schematic diagram of another search space provided in an embodiment of the present application;

[0099] Figure 5C A schematic diagram of another search space provided in an embodiment of the present application;

[0100] Figure 6 A schematic diagram of the structure of a communication device provided in an embodiment of the present application;

[0101] Figure 7 A schematic diagram of the structure of a terminal device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0102] To facilitate understanding, the concepts involved in the embodiments of the present application are first explained.

[0103] Network equipment: a device with wireless transceiver functions. Including but not limited to: Evolutional Node B (eNB or eNodeB) in long term evolution (LTE), base station (gNodeB or gNB) or TRP in new radio (NR), base station in subsequent evolution system, access node in wireless fidelity (WiFi) system, wireless relay node, wireless backhaul node, etc. Base station can be: macro base station, micro base station, pico base station, small station, relay station, or balloon station, etc. Multiple base stations can support the same technology mentioned above, or they can support the different technologies mentioned above. The base station can include one or more co-sited or non-co-sited TRPs.

[0104] Terminal device: a device with wireless transceiver function. Terminal devices can be deployed on land, including indoors or outdoors, handheld, wearable or vehicle-mounted; they can also be deployed on the water (such as ships, etc.); they can also be deployed in the air (such as airplanes, balloons and satellites, etc.). The terminal device can be a mobile phone, a tablet computer, a computer with wireless transceiver function, a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal in industrial control, a vehicle-mounted terminal device, a wireless terminal in self-driving, a wireless terminal device in remote medical, a wireless terminal device in smart grid, a wireless terminal device in transportation safety, a wireless terminal device in smart city, a wireless terminal device in smart home, a wearable terminal device, etc. The terminal equipment involved in the embodiments of the present application may also be referred to as a terminal, user equipment (UE), access terminal equipment, vehicle-mounted terminal, industrial control terminal, UE unit, UE station, mobile station, mobile station, remote station, remote terminal equipment, mobile equipment, UE terminal equipment, wireless communication equipment, UE agent or UE device, etc. The terminal equipment may also be fixed or mobile.

[0105] Transmit / receive point (TRP): A network device may include one or more TRPs. A TRP may be an independent network device or a part of a network device that has a transceiver function. For example, a TRP may be an antenna or an antenna array or an antenna panel in a network device.

[0106] The frequency-domain resource set may also be a control-resource set (CORESET).

[0107] The association relationship between different PDCCH candidates refers to that the PDCCHs received on the different PDCCH candidates have an association relationship. The PDCCHs received on different PDCCH candidates with an association relationship are the same or the received PDCCHs carry the same control information or the received PDCCHs schedule the same PDSCH. Optionally, if multiple PDCCHs are received on PDCCH candidates with an association relationship, joint decoding can be performed based on the multiple PDCCHs. Optionally, different PDCCH candidates must have the same aggregation level.

[0108] There is an association relationship between different PDCCH candidate sets: it means that the PDCCHs detected in different PDCCH candidate sets are associated with each other. For example, assuming that there is an association relationship between the first PDCCH candidate set and the second PDCCH candidate set, there is an association relationship between the PDCCH detected in the first PDCCH candidate set and the PDCCH detected in the second PDCCH candidate set. Among them, the PDCCHs received on different PDCCH candidate sets with an associated relationship are the same, or the received PDCCHs carry the same control information, or the received PDCCHs schedule the same PDSCH. Optionally, the PDCCH candidates in the different PDCCH candidate sets must have the same aggregation level.

[0109] There is an association relationship between different search spaces: it means that the PDCCHs detected in different search spaces are associated with each other. For example, assuming that there is an association relationship between the first search space and the second search space, there is an association relationship between the PDCCH detected in the first search space and the PDCCH detected in the second search space. Among them, the PDCCHs received in different search spaces with an associated relationship are the same or the received PDCCHs carry the same control information or the received PDCCHs schedule the same PDSCH. Optionally, the detected PDCCHs must have the same aggregation level.

[0110] Next, combine Figure 1A-1B , a communication system to which the embodiments of the present application are applicable is described.

[0111] Figure 1A This is an architecture diagram of a communication system provided in an embodiment of the present application. Figure 1A , including a network device 101 and a terminal device 102. The network device 101 is provided with a transceiver point A and a transceiver point B, which can send the same PDCCH to the terminal device 102, and the terminal device 102 can jointly decode the same PDCCH to increase the probability that the terminal device 102 successfully receives (or decodes) the PDCCH.

[0112] Figure 1B This is another architecture diagram of a communication system provided in an embodiment of the present application. Figure 1B , including a transceiver point 101-A, a transceiver point 101-B and a terminal device 102. The two transceiver points are two independent network devices. The multiple transceiver points can each send an independent PDCCH to the terminal device 102. The independent PDCCHs have an associated relationship, and the associated relationship means that these PDCCHs can be the same PDCCH or a PDCCH carrying the same control information or a PDCCH scheduling the same PDSCH. The terminal device 102 can jointly decode the PDCCHs with an associated relationship to increase the probability that the terminal device 102 successfully receives (or decodes) the PDCCH.

[0113] In the related art, after multiple transceiver points send the same PDCCH to a terminal device, the terminal device cannot determine which PDCCHs are associated with each other. Therefore, the terminal device cannot jointly decode the associated PDCCHs, resulting in a low probability of the terminal device successfully receiving the PDCCH.

[0114] In order to solve the above technical problems, before receiving PDCCH, the terminal device can first obtain the association relationship between PDCCHs sent by multiple transceiver points, and receive and jointly decode PDCCH according to the association relationship of PDCCH, thereby increasing the probability of the terminal device successfully receiving PDCCH.

[0115] The technical solutions shown in the present application are described below through specific embodiments. It should be noted that the following embodiments can exist independently or in combination with each other, and the same or similar contents will not be described repeatedly in different embodiments.

[0116] Figure 2 A flow chart of a communication method provided in an embodiment of the present application. Figure 2 , the method may include:

[0117] S201. The terminal device obtains first information.

[0118] The first information is used to indicate the association relationship between PDCCHs sent by N transceiver points, where N is an integer greater than or equal to 2.

[0119] An association relationship refers to an association relationship between PDCCHs sent by different transceiver points, that is, an association relationship is used to indicate which PDCCHs sent by different transceiver points are the same. For example, if PDCCH1 corresponding to TRP1 and PDCCH2 corresponding to TRP2 have an association relationship, then PDCCH1 sent by TRP1 is the same as PDCCH2 sent by TRP2, and the terminal device can jointly receive and jointly decode PDCCH1 and PDCCH2. Joint reception can indicate that the terminal device blindly detects PDCCH1 and PDCCH2 at the same time, and joint decoding can refer to the terminal device softly merging PDCCH1 and PDCCH2 for decoding.

[0120] The terminal device can obtain the first information in the following two ways:

[0121] Method 1: The terminal device may receive the first information from the network device.

[0122] For example, the network device may send the first information to the terminal device via high-layer signaling, such as reestablishing radio resource control (RRC) signaling, media access control-control element (MAC CE), downlink control information (DCI), etc.

[0123] Mode 2: The first information may also be pre-configured or agreed upon in a protocol.

[0124] It should be noted that when the application scenario is different, the first information is also different, which is explained in the following embodiments and will not be repeated here.

[0125] S202. The terminal device receives PDCCH according to the first information.

[0126] The terminal device determines the associated PDCCH according to the first information, and receives the associated PDCCH. The associated PDCCH is sent by different transceiver points. After the terminal device receives the associated PDCCH, the terminal device can perform joint decoding on the associated PDCCH.

[0127] In an embodiment of the present application, before receiving PDCCH, the terminal device can first obtain the association relationship between PDCCHs sent by multiple transceiver points, and receive and jointly decode PDCCH according to the association relationship of PDCCH, thereby increasing the probability of the terminal device successfully receiving PDCCH.

[0128] The following describes the first information in different situations.

[0129] The first case: N transceiver points correspond to the same frequency domain resource set.

[0130] In this case, one CORESET is associated with at least two transmission configuration indicator (TCI) states, each transceiver point corresponds to one TCI state, and the corresponding transceiver point can be determined according to the TCI state.

[0131] In this case, the PDCCH candidates may be divided into N PDCCH candidate sets according to the number of transceiver points N. Different transceiver points correspond to different PDCCH candidate sets. The first information may indicate the following two situations:

[0132] Case 1: The first information is used to indicate the association relationship between different PDCCH candidate sets.

[0133] Optionally, the terminal device may obtain N PDCCH candidate sets in advance.

[0134] For example, assuming that N is 3, the PDCCH candidates are divided into three PDCCH candidate sets, which are respectively recorded as PDCCH candidate set 1, PDCCH candidate set 2 and PDCCH candidate set 3. The first information may indicate that there is an association relationship between PDCCH candidate set 1, PDCCH candidate set 2 and PDCCH candidate set 3. That is, there is an association relationship between the PDCCH detected in PDCCH candidate set 1, the PDCCH detected in PDCCH candidate set 2, and the PDCCH detected in PDCCH candidate set 3. Optionally, the PDCCH candidates may be of the same aggregation level. Case 2: The first information indicates an association relationship between different PDCCH candidates. Optionally, the PDCCH candidates may be of the same aggregation level.

[0135] In case 2, the first information may indicate the association relationship between different PDCCH candidates. Different PDCCH candidates may correspond to different transceiver points. For example, the first indication information indicates the association relationship between N different PDCCH candidates, where the N different PDCCHs are respectively associated with N

[0136] For example, assuming that N is 3, the three transceiver points are respectively recorded as transceiver point 1, transceiver point 2, and transceiver point 3. Assuming that there are 6 PDCCH candidates, the indexes of the 6 PDCCH candidates are 1, 2, 3, 4, 5, and 6, respectively. Transceiver point 1 corresponds to PDCCH 1 and PDCCH 4, transceiver point 2 corresponds to PDCCH 2 and PDCCH 5, and transceiver point 3 corresponds to PDCCH 3 and PDCCH 6. The association relationship indicated by the first indication information can be shown in Table 1:

[0137] Table 1

[0138] PDCCH candidate index Relationship 1,2,3,4,5,6 (1,2,3)，(4,5,6)

[0139] Referring to Table 1, the first information indicates that PDCCH 1, PDCCH 2 and PDCCH 3 are associated with each other, and PDCCH 4, PDCCH 5 and PDCCH 6 are associated with each other.

[0140] Below, taking N being 2 as an example, the first information is described.

[0141] When N is 2, the two transceiver points may include a first transceiver point and a second transceiver point; the first transceiver point corresponds to a first PDCCH candidate set, and the second transceiver point corresponds to a second PDCCH candidate set. The first information may indicate the following two situations:

[0142] Case 1: The first information is used to indicate an association relationship between the first PDCCH candidate set and the second PDCCH candidate set.

[0143] Optionally, assuming that the number of PDCCH candidates is K, and the index numbers of the PDCCH candidates are sequentially recorded as 1, 2, ..., K (K is an even number greater than or equal to 2), then the index numbers of the PDCCH candidates in the first PDCCH candidate set are less than or equal to K / 2, and the index numbers of the PDCCH candidates in the second PDCCH candidate set are greater than K / 2; or, the index numbers of the PDCCH candidates in the second PDCCH candidate set are less than or equal to K / 2, and the index numbers of the PDCCH candidates in the first PDCCH candidate set are greater than K / 2. The PDCCH candidates may have the same aggregation level.

[0144] For example, assuming that the number of PDCCH candidates is 6, and the index numbers of the PDCCH candidates are 1, 2, 3, 4, 5, and 6, respectively, the PDCCH candidates included in the first PDCCH candidate set and the second PDCCH candidate set may be as shown in Table 2 or Table 3:

[0145] Table 2

[0146] The first PDCCH candidate set Second PDCCH candidate set 1,2,3 4,5,6

[0147] Please refer to Table 2. The index numbers of the PDCCH candidates included in the first PDCCH candidate set are less than or equal to 3, and the index numbers of the PDCCH candidates included in the second PDCCH candidate set are greater than 3.

[0148] Table 3

[0149] The first PDCCH candidate set Second PDCCH candidate set 4,5,6 1,2,3

[0150] Please refer to Table 3. The index numbers of the PDCCH candidates included in the first PDCCH candidate set are greater than 3, and the index numbers of the PDCCH candidates included in the second PDCCH candidate set are less than or equal to 3.

[0151] Optionally, assuming that the number of PDCCH candidates is K, and the index numbers of the PDCCH candidates are sequentially recorded as 1, 2, ..., K (K is an even number greater than or equal to 2), the index numbers of the PDCCH candidates included in the first PDCCH candidate set may be odd numbers, and the index numbers of the PDCCH candidates included in the second PDCCH candidate set may be even numbers; or, the index numbers of the PDCCH candidates included in the first PDCCH candidate set may be even numbers, and the index numbers of the PDCCH candidates included in the second PDCCH candidate set may be odd numbers. The PDCCH candidates may have the same aggregation level.

[0152] For example, assuming that the number of PDCCH candidates is 6, and the index numbers of the PDCCH candidates are 1, 2, 3, 4, 5, 6 in sequence, the PDCCH candidates included in the first PDCCH candidate set and the second PDCCH candidate set may be as shown in Table 4 or Table 5:

[0153] Table 4

[0154] The first PDCCH candidate set Second PDCCH candidate set 1,3,5 2,4,6

[0155] Please refer to Table 2, the index numbers of the PDCCH candidates included in the first PDCCH candidate set are odd numbers, and the index numbers of the PDCCH candidates included in the second PDCCH candidate set are even numbers.

[0156] Table 5

[0157] The first PDCCH candidate set Second PDCCH candidate set 2,4,6 1,3,5

[0158] Please refer to Table 3, the index numbers of the PDCCH candidates included in the first PDCCH candidate set are even numbers, and the index numbers of the PDCCH candidates included in the second PDCCH candidate set are odd numbers.

[0159] Case 2: The first information is used to indicate that the i-th PDCCH candidate in the PDCCH candidate set has an association relationship with the j-th PDCCH candidate, where i and j may be index numbers of the PDCCH candidates. Optionally, the PDCCH candidates must be of the same aggregation level. i and j are respectively less than or equal to the number of PDCCH candidates included in the PDCCH candidate set, and the PDCCH candidate set includes PDCCH candidates at a preset aggregation level.

[0160] For example, the association relationship indicated by the first information may be as shown in Table 6:

[0161] Table 6

[0162] PDCCH candidate index Relationship 1,2,3,4,5,6 (1,4)，(2,5)，(3,6) 1,2 (1,2) 1,2,3,4 (1,3)，(2,4)

[0163] Please refer to Table 6. When the index of the PDCCH candidate is 1, 2, 3, 4, 5, 6, the first information indicates that PDCCH1 is associated with PDCCH4, PDCCH2 is associated with PDCCH5, and PDCCH3 is associated with PDCCH6. When the index of the PDCCH candidate is 1, 2, PDCCH1 is associated with PDCCH2. When the index of the PDCCH candidate is 1, 2, 3, 4, PDCCH1 is associated with PDCCH3, and PDCCH2 is associated with PDCCH4.

[0164] For example, assuming that the first PDCCH candidate set and the second PDCCH candidate set are as shown in Table 5, the association relationship indicated by the first information may be as shown in Table 7:

[0165] Table 7

[0166] PDCCH candidate index Relationship 1,2,3,4,5,6 (1,2)，(3,4)，(5,6) 1,2 (1,2) 1,2,3,4 (1,2)，(3,4)

[0167] Please refer to Table 7. When the index of the PDCCH candidate is 1, 2, 3, 4, 5, 6, the first information indicates that PDCCH1 is associated with PDCCH2, PDCCH3 is associated with PDCCH4, and PDCCH5 is associated with PDCCH6. When the index of the PDCCH candidate is 1, 2, PDCCH1 is associated with PDCCH2. When the index of the PDCCH candidate is 1, 2, 3, 4, PDCCH1 is associated with PDCCH2, and PDCCH3 is associated with PDCCH4.

[0168] The second case: multiple search spaces correspond to the same frequency domain resource set.

[0169] In this case, the first information is used to indicate that the PDCCHs in the two or more search spaces have an associated relationship.

[0170] The following description is made by taking the example that the first information indicates that the PDCCHs in the two search spaces have an associated relationship.

[0171] A cycle in the first search space includes M 1 time slots, wherein in each time slot, the time-frequency resource region determined according to the configuration information of the search space and CORESET corresponds to the respective PDCCH candidate set. A cycle in the second search space includes M 2 time slots, wherein in each time slot, the time-frequency resource region that can be determined according to the configuration information of the search space and CORESET corresponds to the respective PDCCH candidate sets; for one period, the first information is used to indicate that the i-th PDCCH candidate set in the first search space is associated with the i-th PDCCH candidate set in the second search space, i≤M 1 , i≤M 2 Among them, in the time domain, M 1 The PDCCH candidate sets corresponding to the time slots are arranged in sequence, M 2 The PDCCH candidate sets corresponding to the time slots are arranged in sequence. Optionally, a PDCCH candidate set may include a PDCCH in a time slot.

[0172] The i-th time-frequency resource region corresponds to the time-frequency resource region on the i-th slot determined jointly by the search space and CORESET within a search space period, and the time-frequency resource region can be used to carry the transmission of PDCCH. i is less than or equal to the number of time slots included in the search space in a period.

[0173] It should be noted that the PDCCH candidate set X mentioned in the embodiment of the present application can also be understood as the Xth time-frequency resource region.

[0174] In this case, the correlation between adjacent cycles of the two search spaces may be different. Figure 3A-3D Provide explanation.

[0175] As an example, the periods of search space 1 and search space 2 may be the same. Optionally, the time slot durations of search space 1 and search space 2 may be the same. The time slot duration refers to the number of time slots occupied by the search space in one period.

[0176] Figure 3A A schematic diagram of a search space provided in an embodiment of the present application. Figure 3A, the horizontal axis represents the time domain, and the vertical axis represents the frequency domain. The frequency domain resources corresponding to search space 1 and search space 2 are the same, both corresponding to CORESER1. The periods of search space 1 and search space 2 are the same, both are period 1. The time slot duration of search space 1 and search space 2 is the same (both are 4 time slots). Search space 1 includes 4 PDCCH candidate sets in one period, which are respectively recorded as PDCCH candidate set 1-1, PDCCH candidate set 1-2, PDCCH candidate set 1-3 and PDCCH candidate set 1-4. Search space 2 includes 4 PDCCH candidate sets in one period, which are respectively recorded as PDCCH candidate set 2-1, PDCCH candidate set 2-2, PDCCH candidate set 2-3 and PDCCH candidate set 2-4. The offsets of search space 1 and search space 2 can be different. The offset of search space 1 is offset 1, and the offset of search space 2 is offset 2. In this scenario, the first information indicates that the i-th (i is less than or equal to 4) PDCCH candidate set in search space 1 is associated with the i-th PDCCH candidate set in search space 2, that is, the first information indicates that PDCCH candidate set 1-1 is associated with PDCCH candidate set 2-1, PDCCH candidate set 1-2 is associated with PDCCH candidate set 2-2, PDCCH candidate set 1-3 is associated with PDCCH candidate set 2-3, and PDCCH candidate set 1-4 is associated with PDCCH candidate set 2-4.

[0177] Figure 3B A schematic diagram of another search space provided in an embodiment of the present application. Figure 3B, the horizontal axis represents the time domain, and the vertical axis represents the frequency domain. The frequency domain resources corresponding to search space 1 and search space 2 are the same, both corresponding to CORESER1. The periods of search space 1 and search space 2 are the same, both are period 1. The time slot durations of search space 1 and search space 2 are different. The duration of search space 1 is 2 time slots, and the duration of search space 2 is 4 time slots. Search space 1 includes 2 PDCCH candidate sets in one period, which are respectively recorded as PDCCH candidate set 1-1 and PDCCH candidate set 1-2. Search space 2 includes 4 PDCCH candidate sets in one period, which are respectively recorded as PDCCH candidate set 2-1, PDCCH candidate set 2-2, PDCCH candidate set 2-3 and PDCCH candidate set 2-4. The offsets of search space 1 and search space 2 are different. The offset of search space 1 is offset 1, and the offset of search space 2 is offset 2. In this scenario, the first information indicates that the i-th (i is less than or equal to 2) PDCCH candidate set in search space 1 is associated with the i-th PDCCH candidate set in search space 2, that is, the first information indicates that PDCCH candidate set 1-1 is associated with PDCCH candidate set 2-1, and PDCCH candidate set 1-2 is associated with PDCCH candidate set 2-2. That is, assuming that the time slot duration of search space 1 is M1 time slots and the time slot duration of search space 2 is M2 time slots, then the association relationship only exists between the i-th (i is less than or equal to min(M1, M2)) PDCCH candidate set in search space and the i-th PDCCH candidate set in search space 2. Where min(x, y) represents the minimum value of x and y.

[0178] Figure 3C A schematic diagram of another search space provided in an embodiment of the present application. Figure 3C, the horizontal axis represents the time domain, and the vertical axis represents the frequency domain. The frequency domain resources corresponding to search space 1 and search space 2 are the same, both corresponding to CORESER1. The periods of search space 1 and search space 2 are different, the period of search space 1 is period 1, and the period of search space 2 is period 2. The time slot duration of search space 1 and search space 2 is the same (both are 4 time slots). Search space 1 includes 4 PDCCH candidate sets in one period, which are respectively recorded as PDCCH candidate set 1-1, PDCCH candidate set 1-2, PDCCH candidate set 1-3 and PDCCH candidate set 1-4, and search space 2 includes 4 PDCCH candidate sets in one period, which are respectively recorded as PDCCH candidate set 2-1, PDCCH candidate set 2-2, PDCCH candidate set 2-3 and PDCCH candidate set 2-4. Among them, a period of search space 1 and a period of search space 2 have a specific relationship in the time domain. Among them, the specific relationship can be that the two periods are adjacent in time. For example, one cycle of search space 2 may be one cycle of search space 2 that is most adjacent to one cycle of search space 1, or one cycle of search space 2 may be one cycle of search space 2 that is most adjacent to one cycle of search space 1. The offsets of search space 1 and search space 2 may be different, assuming that the offset of search space 1 is offset 1 and the offset of search space 2 is offset 2. In this scenario, the first information indicates that the i-th (i is less than or equal to 4) PDCCH candidate set in search space 1 is associated with the i-th PDCCH candidate set in search space 2, that is, the first information indicates that PDCCH candidate set 1-1 is associated with PDCCH candidate set 2-1, PDCCH candidate set 1-2 is associated with PDCCH candidate set 2-2, PDCCH candidate set 1-3 is associated with PDCCH candidate set 2-3, and PDCCH candidate set 1-4 is associated with PDCCH candidate set 2-4.

[0179] Figure 3D A schematic diagram of another search space provided in an embodiment of the present application. Figure 3D, the horizontal axis represents the time domain, and the vertical axis represents the frequency domain. The frequency domain resources corresponding to search space 1 and search space 2 are the same, both corresponding to CORESER1. The periods of search space 1 and search space 2 are different, the period of search space 1 is period 1, and the period of search space 2 is period 2. The duration of time slots of search space 1 and search space 2 is different, the duration of search space 1 is 2 time slots (slots), and the duration of search space 2 is 4 time slots. Search space 1 includes 2 PDCCH candidate sets in one period, which are respectively recorded as PDCCH candidate set 1-1 and PDCCH candidate set 1-2, and search space 2 includes 4 PDCCH candidate sets in one period, which are respectively recorded as PDCCH candidate set 2-1, PDCCH candidate set 2-2, PDCCH candidate set 2-3 and PDCCH candidate set 2-4. Among them, a period of search space 1 and a period of search space 2 have a specific relationship in the time domain. Among them, the specific relationship can be that the two periods are adjacent in time. For example, one cycle of search space 2 may be one cycle of search space 2 that is most adjacent to one cycle of search space 1, or one cycle of search space 2 may be one cycle of search space 2 that is most adjacent to one cycle of search space 1. The offsets of search space 1 and search space 2 may be different, with the offset of search space 1 being offset 1 and the offset of search space 2 being offset 2. In this scenario, the first information indicates that the i-th (i is less than or equal to 2) PDCCH candidate set in search space 1 is associated with the i-th PDCCH candidate set in search space 2, that is, the first information indicates that PDCCH candidate set 1-1 is associated with PDCCH candidate set 2-1, and PDCCH candidate set 1-2 is associated with PDCCH candidate set 2-2.

[0180] exist Figure 3A-3D In the scenario shown, the first information may also indicate an association relationship between PDCCH candidates in two PDCCH candidate sets having an association relationship. Optionally, assuming that the first PDCCH candidate set has an association relationship with the second PDCCH candidate set, the first information may also indicate an association relationship between the PDCCH candidates in the first PDCCH candidate set and the PDCCH candidates in the second PDCCH candidate set.

[0181] Example 1: Figure 3A-3D In any scenario, assuming that the PDCCH candidate set 1-1 and the PDCCH candidate set 2-1 include 6 PDCCH candidates respectively, the first information indicates that the association relationship between the PDCCH candidate set 1-1 and the PDCCH candidate set 1-2 may be as shown in Table 8:

[0182] Table 8

[0183] PDCCH candidate set 1-1 PDCCH candidate set 2-1 PDCCH candidate 1-1 PDCCH candidate 2-1 PDCCH candidate 1-2 PDCCH candidate 2-2 PDCCH candidates 1-3 PDCCH candidates 2-3 PDCCH candidates 1-4 PDCCH candidates 2-4 PDCCH candidates 1-5 PDCCH candidates 2-5 PDCCH candidates 1-6 PDCCH candidates 2-6

[0184] Please refer to Table 8, the first information is used to indicate that the i-th PDCCH candidate in PDCCH candidate set 1-1 is associated with the i-th PDCCH candidate in PDCCH candidate set 2-1. i is 1, 2, 3, 4, 5, 6 in sequence. Among them, PDCCH candidate set 1-1 can correspond to being sent by TRP-1, and PDCCH candidate set 2-1 can correspond to being sent by TRP-2.

[0185] Example 2: Figure 3A-3D In any scenario, assuming that PDCCH candidate set 1-1 and PDCCH candidate set 1-2 include 6 PDCCH candidates respectively, PDCCH candidate set 1-1 includes sub-PDCCH candidate set 1-1 (PDCCH candidate 1-1, PDCCH candidate 1-2, PDCCH candidate 1-3) and sub-PDCCH candidate set 1-2 (PDCCH candidate 1-4, PDCCH candidate 1-5, PDCCH candidate 1-6), PDCCH candidate set 2-1 includes sub-PDCCH candidate set 2-1 (PDCCH candidate 2-1, PDCCH candidate 2-2, PDCCH candidate 2-3) and sub-PDCCH candidate set 2-2, then the association relationship indicated by the first information can be shown in Table 9:

[0186] Table 9

[0187]

[0188] As shown in Table 9, sub-PDCCH candidate set 1-1 is associated with sub-PDCCH candidate set 2-1, and sub-PDCCH candidate set 1-2 is associated with sub-PDCCH candidate set 2-2.

[0189] The third case: one search space is associated with at least two frequency domain resource sets.

[0190] In this case, the first information is used to indicate that PDCCHs corresponding to at least two frequency domain resource sets are associated.

[0191] Optionally, assuming that at least two frequency domain resources include a first frequency domain resource set and a second frequency domain resource set, the first frequency domain resource set corresponds to a first PDCCH candidate set, and the second frequency domain resource set corresponds to a second PDCCH candidate set, then the first information is used to indicate that there is an association relationship between the first PDCCH candidate set and the second PDCCH candidate set.

[0192] Different CORESETs may use frequency division multiplexing (FDM) and time division multiplexing (TDM). The following describes the association relationship indicated by the first information in different multiplexing modes, including the following two cases:

[0193] Case 1: FDM between different CORESETs.

[0194] When FDM is used between different CORESETs, at least two frequency domain resource sets include a first frequency domain resource set and a second frequency domain resource set; the first frequency domain resource set corresponds to a first PDCCH candidate set, and the second frequency domain resource set corresponds to a second PDCCH candidate set; the first information is used to indicate that the PDCCH in the first PDCCH candidate set is associated with the PDCCH in the second PDCCH candidate set.

[0195] Next, combine Figure 4A-4B , the search space in FDM mode is explained.

[0196] Figure 4A This is a schematic diagram of a search space in an FDM mode provided in an embodiment of the present application. Figure 4A , the horizontal axis represents the time domain, and the vertical axis represents the frequency domain. Search space 1 is associated with two frequency domain resource sets. The time slot duration of search space 1 is 1 time slot. Search space 1 includes PDCCH candidate set 1 and PDCCH candidate set 2 in one cycle, PDCCH candidate set 1 corresponds to frequency domain resource 1 (CORESET1), and PDCCH candidate set 2 corresponds to frequency domain resource 2 (CORESET2), then the first information may indicate that PDCCH candidate set 1 corresponds to PDCCH candidate set 2. On one frequency domain resource set, one time slot corresponds to one PDCCH candidate set.

[0197] Figure 4B This is a schematic diagram of another search space in FDM mode provided in an embodiment of the present application. Figure 4B, the horizontal axis represents the time domain, and the vertical axis represents the frequency domain. Search space 1 is associated with two frequency domain resource sets. The time slot duration of search space 1 is 1 time slot. In one cycle, search space 1 includes PDCCH candidate set 1, PDCCH candidate set 2, PDCCH candidate set 3 and PDCCH candidate set 4 in one cycle. PDCCH candidate set 1 and PDCCH candidate set 3 correspond to frequency domain resource 1 (CORESET1), and PDCCH candidate set 2 and PDCCH candidate set 4 correspond to frequency domain resource 2 (CORESET2). Then the first information can indicate that PDCCH candidate set 1 corresponds to PDCCH candidate set 2, and PDCCH candidate set 2 corresponds to PDCCH candidate set 3. On one frequency domain resource set, one time slot corresponds to one PDCCH candidate set.

[0198] Optionally, the first information may also indicate an association relationship between a PDCCH in the first PDCCH candidate set and a PDCCH candidate in the second PDCCH candidate set. Please refer to the examples shown in Tables 8 and 9, which will not be described in detail here.

[0199] Case 2: TDM is used between different CORESETs.

[0200] When TDM is used between different CORESETs, at least two frequency domain resource sets include a first frequency domain resource set and a second frequency domain resource set, the first frequency domain resource set corresponds to T first PDCCH candidate sets, the second frequency domain resource set corresponds to T second PDCCH candidate sets, and the first information is used to indicate that the i-th first PDCCH candidate set among the T first PDCCH candidate sets is associated with the i-th second PDCCH candidate set among the T second PDCCH candidate sets. T is an integer greater than or equal to 1, and i is a positive integer less than or equal to T. Each PDCCH candidate set corresponds to a time slot, the T first PDCCH candidate sets are arranged sequentially in the time domain, and the T second PDCCH candidate sets are arranged sequentially in the time domain.

[0201] Next, combine Figure 4C-4D , the search space in TDM mode is described.

[0202] Figure 4C A schematic diagram of a search space in a TDM mode provided in an embodiment of the present application. Figure 4D This is a schematic diagram of another search space in the TDM mode provided in an embodiment of the present application. Figure 4C-4D, the horizontal axis represents the time domain, and the vertical axis represents the frequency domain. Search space 1 is associated with two frequency domain resource sets (frequency domain resource set 1 (CORESET1) and frequency domain resource set 2 (CORESET2)). The time slot duration of search space 1 is 4 time slots. Search space 1 includes PDCCH candidate set 1, PDCCH candidate set 2, PDCCH candidate set 3 and PDCCH candidate set 4 in one cycle. Frequency domain resource set 1 (CORESET1) corresponds to PDCCH candidate set 1 and PDCCH candidate set 2, and frequency domain resource set 2 (CORESET2) corresponds to PDCCH candidate set 3 and PDCCH candidate set 4. The first information indicates that PDCCH candidate set 1 is associated with PDCCH candidate set 3, and PDCCH candidate set 2 is associated with PDCCH candidate set 4. Optionally, assuming that the time slot duration of search space 1 is N time slots, the i-th time slot (i is less than or equal to N / 2) can be associated with CORESET1, and the j-th time slot (j is greater than N / 2 and j is less than or equal to N) can be associated with CORESET2; or, the even-numbered index number can be associated with CORESET1, and the odd-numbered index number can be associated with CORESET2; or, the odd-numbered index number can be associated with CORESET1, and the even-numbered index number can be associated with CORESET2.

[0203] Optionally, the i-th first PDCCH candidate set includes S PDCCH candidates, and the i-th second PDCCH candidate set includes S PDCCH candidates, where S is an integer greater than or equal to 1; in addition to indicating that the i-th first PDCCH candidate set has an associated relationship with the i-th second PDCCH candidate set, the first information is also used to indicate that the PDCCH candidates in the i-th first PDCCH candidate set have an associated relationship with the PDCCH candidates in the i-th second PDCCH candidate set.

[0204] For example, the first information is also used to indicate that the jth PDCCH candidate in the i-th first PDCCH candidate set is associated with the j-th PDCCH candidate in the i-th second PDCCH candidate set, where j is an integer less than or equal to S. For specific examples, please refer to the examples shown in Table 8, which will not be repeated here.

[0205] For example, the first information is also used to indicate that the sub-PDCCH candidate set in the i-th first PDCCH candidate set is associated with the sub-PDCCH candidate set in the i-th second PDCCH candidate set. For specific examples, please refer to the example shown in Table 9, which will not be repeated here.

[0206] The fourth case: different search spaces are associated with different sets of frequency domain resources.

[0207] In this case, the first information is used to indicate that PDCCHs in different search spaces are associated with each other.

[0208] Optionally, the first search space is associated with a first frequency domain resource set, and the second search space is associated with a second frequency domain resource set. In this case, the first information is used to indicate that the PDCCH in the first search space is associated with the PDCCH in the second search space.

[0209] A cycle in the first search space includes K 1 time slots, wherein in each time slot, the time-frequency resource area determined according to the configuration information of the search space and CORESET corresponds to the respective PDCCH candidate set, that is, the first search space includes K in one cycle 1 PDCCH candidate sets, K 1 is an integer greater than or equal to 1. A cycle in the second search space includes K 2 time slots, wherein in each time slot, the time-frequency resource area determined according to the configuration information of the search space and CORESET corresponds to the respective PDCCH candidate set, that is, the second search space includes K in one cycle 2 PDCCH candidate sets, K 2 is an integer greater than or equal to 1; for a PDCCH candidate period of a PDCCH candidate, the first information is used to indicate that K 1 The i-th PDCCH candidate set in the PDCCH candidate sets is K 2 The i-th PDCCH candidate set in the PDCCH candidate sets has an associated relationship, i≤K 1 , i≤K 2 Among them, in the time domain, K 1 The PDCCH candidate sets corresponding to the time slots are arranged in sequence, K 2 The PDCCH candidate sets corresponding to the time slots are arranged in sequence.

[0210] The configuration parameters between the first search space and the second search space may be different. The following describes the association relationship indicated by the first information when the first search space and the second search space have different configuration parameters. The configuration parameters may include a period, a time slot duration, an offset, and the like.

[0211] Figure 5A A schematic diagram of a search space provided in an embodiment of the present application. Figure 5A, the horizontal axis represents the time domain, and the vertical axis represents the frequency domain. Search space 1 corresponds to frequency domain resource set 1 (CORESET1), and search space 2 corresponds to frequency domain resource set 2 (CORESET2). Search space 1 and search space 2 have the same period, which is period 1. Search space 1 and search space 2 have the same time slot duration, which is 2 time slots. In one period, search space 1 includes PDCCH candidate set 1 and PDCCH candidate set 2, and search space 2 includes PDCCH candidate set 3 and PDCCH candidate set 4. In this case, the first information indicates that the first PDCCH candidate set (PDCCH candidate set 1) in search space 1 is associated with the first PDCCH candidate set (PDCCH candidate set 3) in search space 2, and the second PDCCH candidate set (PDCCH candidate set 2) in search space 1 is associated with the second PDCCH candidate set (PDCCH candidate set 4) in search space 2. Optionally, the two search spaces with an associated relationship have the same period and / or the same time slot duration. That is, assuming that the periods of search space 1 and search space 2 are the same, their time slot durations are both N time slots. Then, the first information indicates that the i-th (i is less than or equal to N) PDCCH candidate set in search space 1 is associated with the i-th PDCCH candidate set in search space 2.

[0212] It should be noted that in other periods, search space 1 includes PDCCH set 5 and PDCCH set 6, and search space 2 includes PDCCH set 7 and PDCCH candidate set 8. In this period, the association between search space 1 and search space 2 can be found in the above description and will not be repeated here.

[0213] Figure 5B A schematic diagram of another search space provided in an embodiment of the present application. Figure 5B, the horizontal axis represents the time domain, and the vertical axis represents the frequency domain. Search space 1 corresponds to frequency domain resource set 1 (CORESET1), and search space 2 corresponds to frequency domain resource set 2 (CORESET2). Search space 1 and search space 2 have the same period, which is period 1. Search space 1 and search space 2 have different time slot durations. The duration of search space 1 is 4 time slots, and the duration of search space is 2 time slots. In one period, search space 1 includes PDCCH candidate set 1, PDCCH candidate set 2, PDCCH candidate set 3, and PDCCH candidate set 4, and search space 2 includes PDCCH candidate set 5 and PDCCH candidate set 6. In this case, the first information indicates that the first PDCCH candidate set (PDCCH candidate set 1) in search space 1 is associated with the first PDCCH candidate set (PDCCH candidate set 5) in search space 2, and the second PDCCH candidate set (PDCCH candidate set 2) in search space 1 is associated with the second PDCCH candidate set (PDCCH candidate set 6) in search space 2. That is, assuming that the periods of search space 1 and search space 2 are the same, the time slot duration of search space 1 is M1 time slots, and the time slot duration of search space 2 is M2 time slots, then the association relationship only exists between the i-th (i is less than or equal to min(M1, M2)) PDCCH candidate set in the search space and the i-th PDCCH candidate set in the search space 2. Where min(x, y) represents the minimum value of x and y.

[0214] It should be noted that in other periods, search space 1 includes PDCCH set 7 to PDCCH set 10, and search space 2 includes PDCCH set 11 and PDCCH candidate set 12. In this period, the association between search space 1 and search space 2 can be found in the above description and will not be repeated here.

[0215] Optionally, when the periods of the first search space and the second search space are different, and within one period, one search space includes one PDCCH candidate set, the first information is used to indicate that the first PDCCH candidate set in the first search space is associated with the second PDCCH candidate set in the second search space; wherein, in the time domain, the second PDCCH candidate set is the PDCCH candidate set that is closest to the first PDCCH candidate set after the first PDCCH candidate set. Figure 5C Provide explanation.

[0216] Figure 5C A schematic diagram of another search space provided in an embodiment of the present application. Figure 5C, the horizontal axis represents the time domain, and the vertical axis represents the frequency domain. Search space 1 corresponds to frequency domain resource set 1 (CORESET1), and search space 2 corresponds to frequency domain resource set 2 (CORESET2). The periods of search space 1 and search space 2 are different, the period of search space 1 is period 1, and the period of search space 2 is period 2. Among them, a period of search space 1 and a period of search space 2 have a specific relationship in the time domain. Among them, the specific relationship can be that the two periods are adjacent in time. For example, a period of search space 2 can be a period of search space 2 that is closest to a period of search space 1, or a period of search space 2 can be a period of search space 2 that is closest to a period of search space 1. The time slots of search space 1 and search space 2 have the same duration, which is one time slot. In one cycle of search space 1, search space 1 includes PDCCH candidate set 1, in one cycle of search space 2, search space 2 includes PDCCH candidate set 2, in another cycle of search space 1, search space 1 includes PDCCH candidate set 3, and in another cycle of search space 2, search space 2 includes PDCCH candidate set 4. In this case, the first information indicates that PDCCH candidate set 1 is associated with PDCCH candidate set 2, and PDCCH candidate set 3 is associated with PDCCH candidate set 4.

[0217] When the periods of the first search space and the second search space are different, and the durations of the first search space and the second search space are different, the association relationship indicated by the first indication information can be referred to in Figure 5A-5C , which will not be elaborated here.

[0218] exist Figure 5A-5C In the search space shown in any embodiment, the first information may also indicate the association relationship between PDCCHs in the PDCCH candidate set with an associated relationship. Please refer to the examples shown in Tables 8 and 9, which will not be repeated here.

[0219] Figure 6 A schematic diagram of the structure of a communication device provided in an embodiment of the present application. The communication device 10 can be set in a terminal device. Figure 6 The communication device 10 may include a processing module 11 and a receiving module 12, wherein:

[0220] The processing module 11 is used to obtain first information, where the first information is used to indicate the association relationship between physical downlink control channels PDCCH sent by N transceiver points, where N is an integer greater than or equal to 2;

[0221] The receiving module 12 is configured to receive the PDCCH according to the first information.

[0222] The communication device provided in the embodiment of the present application can execute the technical solution shown in the above method embodiment, and its implementation principle and beneficial effects are similar, which will not be repeated here.

[0223] In a possible implementation manner, the first information is used to indicate at least one of the following information:

[0224] The relationship between different search spaces; or,

[0225] The association relationship between different PDCCH candidate sets; or,

[0226] The association relationship between different PDCCH candidates.

[0227] In a possible implementation manner, the N transceiver points correspond to the same frequency domain resource set; different transceiver points correspond to different PDCCH candidate sets;

[0228] The first information is used to indicate an association relationship between different PDCCH candidate sets.

[0229] In a possible implementation manner, the N transceiver points include a first transceiver point and a second transceiver point; the first transceiver point corresponds to a first PDCCH candidate set, and the second transceiver point corresponds to a second PDCCH candidate set;

[0230] The first information is used to indicate an association relationship between the first PDCCH candidate set and the second PDCCH candidate set.

[0231] In a possible implementation manner, the first information is used to indicate that the i-th PDCCH in the first PDCCH candidate set is associated with the i-th PDCCH in the second PDCCH candidate set;

[0232] The i is less than or equal to the number of PDCCHs included in the first PDCCH candidate set, and the i is less than or equal to the number of PDCCHs included in the second PDCCH candidate set.

[0233] In a possible implementation manner, the N transceiver points correspond to the same frequency domain resource set;

[0234] The first information is used to indicate the association relationship between different PDCCH candidates at the same aggregation level.

[0235] In a possible implementation, the multiple search spaces correspond to the same set of frequency domain resources;

[0236] The first information is used to indicate that PDCCHs in at least two search spaces have an associated relationship.

[0237] In a possible implementation manner, the multiple search spaces include a first search space and a second search space, wherein the first search space includes M in one cycle. 1 PDCCH candidate sets, the second search space includes M in one cycle 2 PDCCH candidate sets;

[0238] The first information is used to indicate that the i-th PDCCH candidate set in the first search space is associated with the i-th PDCCH candidate set in the second search space, i≤M 1 , i≤M 2 .

[0239] In a possible implementation manner, in the time domain, the M 1 PDCCH candidate sets are arranged in sequence, and the M 2 The PDCCH candidate sets are arranged in sequence.

[0240] In a possible implementation manner, one search space is associated with at least two frequency domain resource sets;

[0241] The first information is used to indicate that the PDCCHs corresponding to the at least two frequency domain resource sets are associated.

[0242] In a possible implementation manner, different control resource sets CORESET are frequency division multiplexing FDM; the at least two frequency domain resource sets include a first frequency domain resource set and a second frequency domain resource set; the first frequency domain resource set corresponds to a first PDCCH candidate set, and the second frequency domain resource set corresponds to a second PDCCH candidate set;

[0243] The first information is used to indicate that a PDCCH candidate in the first PDCCH candidate set is associated with a PDCCH candidate in the second PDCCH candidate set.

[0244] In one possible implementation, the first information is used to indicate that the i-th PDCCH candidate in the first PDCCH candidate set is associated with the i-th PDCCH candidate in the second PDCCH candidate set, where i is a positive integer less than or equal to P, and P is the number of PDCCH candidates included in the search space.

[0245] In a possible implementation manner, the first PDCCH candidate set includes Q first sub-PDCCH candidate sets, and the second PDCCH candidate set includes Q second sub-PDCCH candidate sets;

[0246] The first information is used to indicate that an i-th first sub-PDCCH candidate set in the first PDCCH candidate set is associated with an i-th second sub-PDCCH candidate set in the second PDCCH candidate set.

[0247] In a possible implementation manner, the at least two frequency domain resource sets include a first frequency domain resource set and a second frequency domain resource set, the first frequency domain resource set corresponds to T first PDCCH candidate sets, the second frequency domain resource set corresponds to T second PDCCH candidate sets, and T is an integer greater than or equal to 1;

[0248] The first information is used to indicate that the i-th first PDCCH candidate set among the T first PDCCH candidate sets is associated with the i-th second PDCCH candidate set among the T second PDCCH candidate sets, and i is a positive integer less than or equal to T.

[0249] In a possible implementation manner, the i-th first PDCCH candidate set includes S PDCCH candidates, the i-th second PDCCH candidate set includes S PDCCH candidates, and S is an integer greater than or equal to 1;

[0250] The first information is also used to indicate that the jth PDCCH candidate in the i-th first PDCCH candidate set is associated with the j-th PDCCH candidate in the i-th second PDCCH candidate set, where j is an integer less than or equal to S.

[0251] In a possible implementation manner, the first search space is associated with a first frequency domain resource set, and the second search space is associated with a second frequency domain resource set;

[0252] The first information is used to indicate that the PDCCH candidates in the first search space are associated with the PDCCH candidates in the second search space.

[0253] In a possible implementation manner, a period of the first search space includes K 1 PDCCH candidate sets, a period of the second search space includes K 2 PDCCH candidate sets, the K 1 is an integer greater than or equal to 1, the K 2 is an integer greater than or equal to 1;

[0254] The first information is used to indicate that the K 1 The i-th PDCCH candidate set in the PDCCH candidate sets is 2The i-th PDCCH candidate set in the PDCCH candidate sets has an associated relationship, i≤K 1 , i≤K 2 .

[0255] In a possible implementation manner, in the time domain, the K 1 PDCCH candidate sets are arranged in sequence, and the K 2 The PDCCH candidate sets are arranged in sequence.

[0256] In a possible implementation manner, the first information is used to indicate that a first PDCCH candidate set in the first search space is associated with a second PDCCH candidate set in the second search space;

[0257] In the time domain, the second PDCCH candidate set is a PDCCH candidate set that is subsequent to the first PDCCH candidate set and is closest to the first PDCCH candidate set.

[0258] Figure 7 This is a schematic diagram of the structure of the terminal device provided in the embodiment of the present application. Figure 7 The terminal device 20 may include: a transceiver 21, a memory 22, and a processor 23. The transceiver 21 may include: a transmitter and / or a receiver. The transmitter may also be referred to as a transmitter, a transmitter, a transmission port, a transmission interface, or similar descriptions, and the receiver may also be referred to as a receiver, a receiver, a reception port, a reception interface, or similar descriptions. Exemplarily, the transceiver 21, the memory 22, and the processor 23 are interconnected via a bus 24.

[0259] The memory 22 is used to store program instructions;

[0260] The processor 23 is used to execute the program instructions stored in the memory, so as to enable the terminal device 20 to execute any of the communication methods shown above.

[0261] The transceiver 21 is used to perform the transceiver function of the terminal device 20 in the above communication method.

[0262] An embodiment of the present application provides a computer-readable storage medium, in which computer-executable instructions are stored. When the computer-executable instructions are executed by a processor, they are used to implement the above-mentioned communication method.

[0263] The embodiment of the present application may also provide a computer program product, which can be executed by a processor. When the computer program product is executed, the communication method executed by any of the terminal devices shown above can be implemented.

[0264] The terminal device, computer-readable storage medium and computer program product of the embodiments of the present application can execute the communication method executed by the above-mentioned terminal device. The specific implementation process and beneficial effects thereof are as mentioned above and will not be repeated here.

[0265] All or part of the steps of implementing the above-mentioned method embodiments can be completed by hardware related to program instructions. The aforementioned program can be stored in a readable memory. When the program is executed, the steps of the above-mentioned method embodiments are executed; and the aforementioned memory (storage medium) includes: read-only memory (English: read-only memory, abbreviated: ROM), RAM, flash memory, hard disk, solid state drive, magnetic tape (English: magnetic tape), floppy disk (English: floppy disk), optical disc (English: optical disc) and any combination thereof.

[0266] The present application embodiment is described with reference to the flowchart and / or block diagram of the method, device (system) and computer program product according to the embodiment of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, and the combination of the process and / or box in the flowchart and / or block diagram can be realized by computer program instructions. These computer program instructions can be provided to the processing unit of a general-purpose computer, a special-purpose computer, an embedded processor or other programmable data processing device to produce a machine, so that the instructions executed by the processing unit of the computer or other programmable data processing device produce a device for realizing the function specified in one process or multiple processes in the flowchart and / or one box or multiple boxes in the block diagram.

[0267] These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory produce a manufactured product including an instruction device that implements the functions specified in one or more processes in the flowchart and / or one or more boxes in the block diagram.

[0268] These computer program instructions may also be loaded onto a computer or other programmable data processing device so that a series of operational steps are executed on the computer or other programmable device to produce a computer-implemented process, whereby the instructions executed on the computer or other programmable device provide steps for implementing the functions specified in one or more processes in the flowchart and / or one or more boxes in the block diagram.

[0269] Obviously, those skilled in the art can make various changes and modifications to the embodiments of the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the embodiments of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

[0270] In the present application, the term "include" and its variations may refer to non-restrictive inclusion; the term "or" and its variations may refer to "and / or". The terms "first", "second", etc. in this application are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. In the present application, "plurality" refers to two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B may mean: A exists alone, A and B exist at the same time, and B exists alone. The character " / " generally indicates that the previously associated objects are in an "or" relationship.

Claims

1. A communication method, characterized in that: include: The terminal device obtains first information, where the first information is used to indicate an association relationship between physical downlink control channels PDCCHs sent by N transceiver points, where N is an integer greater than or equal to 2; the association relationship means that the sent PDCCHs are the same PDCCHs or PDCCHs carrying the same control information or PDCCHs scheduling the same PDSCH; the first information is used to indicate an association relationship between search spaces; The terminal device receives the PDCCH according to the first information.

2. According to the method according to claim 1, the first information is used to indicate that PDCCH candidates with the same PDCCH candidate index number have an associated relationship at the same aggregation level in the search space with an associated relationship.

3. According to the method of claim 1, the first information is carried by RRC signaling.

4. The method according to claim 1, wherein: The number of PDCCH candidates at the same aggregation level in the associated search spaces is the same.

5. The method according to claim 1, wherein: The search spaces with associated relationships have the same period.

6. The method according to claim 1, wherein: The search spaces with an associated relationship have the same number of consecutive time slots in one cycle.

7. The method according to claim 1, characterized in that The multiple search spaces include a first search space and a second search space, the first search space includes M1 PDCCH candidate sets in one cycle, and the second search space includes M2 PDCCH candidate sets in one cycle; The first information is used to indicate that the i-th PDCCH candidate set in the first search space is associated with the i-th PDCCH candidate set in the second search space, i≤M1, i≤M2.

8. The method according to claim 7, characterized in that In the time domain, the M1 PDCCH candidate sets are arranged in sequence, and the M2 PDCCH candidate sets are arranged in sequence.

9. The method according to claim 1, characterized in that: One search space is associated with at least two frequency domain resource sets; The first information is used to indicate that the PDCCHs corresponding to the at least two frequency domain resource sets are associated.

10. The method according to claim 9, characterized in that The different control resource sets CORESET are frequency division multiplexing FDM; the at least two frequency domain resource sets include a first frequency domain resource set and a second frequency domain resource set; the first frequency domain resource set corresponds to a first PDCCH candidate set, and the second frequency domain resource set corresponds to a second PDCCH candidate set; The first information is used to indicate that a PDCCH candidate in the first PDCCH candidate set is associated with a PDCCH candidate in the second PDCCH candidate set.

11. The method according to claim 10, characterized in that The first information is used to indicate that the i-th PDCCH candidate in the first PDCCH candidate set is associated with the i-th PDCCH candidate in the second PDCCH candidate set, where i is a positive integer less than or equal to P, and P is the number of PDCCH candidates included in the search space.

12. The method according to claim 10, characterized in that The first PDCCH candidate set includes Q first sub-PDCCH candidate sets, and the second PDCCH candidate set includes Q second sub-PDCCH candidate sets; The first information is used to indicate that the i-th first sub-PDCCH candidate set in the first PDCCH candidate set is associated with the i-th second sub-PDCCH candidate set in the second PDCCH candidate set.

13. The method according to claim 9, characterized in that The at least two frequency domain resource sets include a first frequency domain resource set and a second frequency domain resource set, the first frequency domain resource set corresponds to T first PDCCH candidate sets, the second frequency domain resource set corresponds to T second PDCCH candidate sets, and T is an integer greater than or equal to 1; The first information is used to indicate that the i-th first PDCCH candidate set among the T first PDCCH candidate sets is associated with the i-th second PDCCH candidate set among the T second PDCCH candidate sets, and i is a positive integer less than or equal to T.

14. The method according to claim 13, characterized in that The i-th first PDCCH candidate set includes S PDCCH candidates, and the i-th second PDCCH candidate set includes S PDCCH candidates, where S is an integer greater than or equal to 1; The first information is also used to indicate that the jth PDCCH candidate in the i-th first PDCCH candidate set is associated with the j-th PDCCH candidate in the i-th second PDCCH candidate set, where j is an integer less than or equal to S.

15. The method according to claim 1, characterized in that The first search space is associated with a first frequency domain resource set, and the second search space is associated with a second frequency domain resource set; The first information is used to indicate that the PDCCH candidates in the first search space are associated with the PDCCH candidates in the second search space.

16. The method according to claim 15, characterized in that One period of the first search space includes K1 PDCCH candidate sets, and one period of the second search space includes K2 PDCCH candidate sets, where K1 is an integer greater than or equal to 1, and K2 is an integer greater than or equal to 1; The first information is used to indicate that the i-th PDCCH candidate set among the K1 PDCCH candidate sets is associated with the i-th PDCCH candidate set among the K2 PDCCH candidate sets, i≤K1, i≤K2.

17. The method according to claim 16, characterized in that In the time domain, the K1 PDCCH candidate sets are arranged in sequence, and the K2 PDCCH candidate sets are arranged in sequence.

18. The method according to claim 15, characterized in that The first information is used to indicate that a first PDCCH candidate set in the first search space is associated with a second PDCCH candidate set in the second search space; In the time domain, the second PDCCH candidate set is a PDCCH candidate set that is subsequent to the first PDCCH candidate set and is closest to the first PDCCH candidate set.

19. A communication device, characterized in that: It includes a processing module and a receiving module, wherein: The processing module is used to obtain first information, where the first information is used to indicate an association relationship between physical downlink control channels PDCCHs sent by N transceiver points, where N is an integer greater than or equal to 2; the association relationship means that the sent PDCCHs are the same PDCCHs or PDCCHs carrying the same control information or PDCCHs scheduling the same PDSCH; the first information is used to indicate an association relationship between search spaces; The receiving module is used to receive the PDCCH according to the first information.

20. A terminal device, characterized in that: include: Transceivers, processors, memory; The memory stores computer-executable instructions; The processor executes the computer-executable instructions stored in the memory, so that the processor performs the communication method according to any one of claims 1 to 18.

21. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, which are used to implement the communication method according to any one of claims 1 to 18 when the computer-executable instructions are executed by a processor.

Images