A method and apparatus for use in a node for multi-carrier transmission in wireless communication

By optimizing the counting and detection methods for PDCCH candidates in multi-carrier scenarios, the problem of inflexible spectrum utilization is solved, receiving performance is improved, and terminal complexity is reduced.

CN123075679APending Publication Date: 2026-11-10SHANGHAI CODUS TECHNOLOGY CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202510593233.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-05-08
Publication Date
2026-11-10

AI Technical Summary

Technical Problem

Existing carrier aggregation methods in 4G and 5G systems limit spectrum flexibility, especially the utilization of fragmented spectrum, and in multi-carrier scenarios, the joint monitoring and counting of PDCCH candidates fails to effectively support frequency domain diversity gain.

Method used

In multi-carrier scenarios, by establishing a connection between PDCCH candidates in the search space set and carrier frequency domain information, optimizing the counting method, improving the priority of joint detection by setting an index, and adjusting the calculation of the maximum PDCCH candidate and non-overlapping CCE, reception performance can be ensured.

Benefits of technology

It improves the utilization efficiency of spectrum resources, enhances the receiving performance in multi-carrier scenarios, and reduces the receiving complexity of terminals.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN123075679A_ABST
    Figure CN123075679A_ABST
Patent Text Reader

Abstract

This application discloses a method and apparatus for multi-carrier transmission in a node used in wireless communication. The node receives a first information block, which indicates a first search space set and a second search space set; the first search space set and the second search space set are associated; the first search space set includes a first PDCCH candidate, and the second search space set includes a second PDCCH candidate; the total number of times the first PDCCH candidate and the second PDCCH candidate are counted depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers. This application optimizes the counting of PDCCH candidates under multi-carrier transmission to improve blind detection efficiency, thereby improving overall transmission efficiency and performance.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This application relates to signal transmission methods and apparatus in wireless communication systems, and more particularly to multi-carrier transmission methods and apparatus. Background Technology

[0002] The application scenarios of future wireless communication systems are becoming increasingly diversified, and different application scenarios place different performance requirements on the system. To meet the diverse performance needs of various application scenarios, research on New Radio (NR) (or 5G) was initiated at the 3GPP (3rd Generation Partner Project) RAN (Radio Access Network) #72 plenary meeting. With the widespread application of 5G, new business models and application scenarios are constantly emerging, and the existing 5G standard cannot fully meet the new demands. Therefore, 3GPP is preparing to begin preliminary research on 6G.

[0003] With the diversification of application scenarios and the emergence of new business models, the demand for more flexible and effective use of spectrum resources is increasing day by day. Therefore, 6G needs to explore new ways of using spectrum resources. Summary of the Invention

[0004] Both 4G and 5G systems support carrier aggregation (CA), which allows different frequency domain resources to be used together, increasing overall bandwidth, transmission rate, and throughput. However, in existing 4G and 5G systems, each component carrier (CC) corresponds to a cell, and it does not support two or more component carriers corresponding to the same cell. This approach in existing 4G and 5G systems greatly limits the spectrum flexibility in carrier aggregation, especially limiting the use of many fragmented spectrum resources. As spectrum resources (especially low-frequency spectrum resources) become increasingly valuable, 6G networks need to find a more flexible and efficient way to utilize spectrum resources. Having multiple carriers or spectrum distributed across multiple bands corresponding to the same cell, thus supporting uplink and downlink transmissions distributed across multiple carriers, is considered a more efficient means for 6G networks to utilize spectrum resources.

[0005] Currently, in the M-TRP (Multiple Transmitter-Receiver) scenario of Release 17, search space sets from different TRPs can be configured to be associated. This allows for joint monitoring of PDCCH (Physical Downlink Control Channel) candidates within the search space sets to obtain spatial diversity gain. These search space sets are often orthogonal in the time domain to ensure that the terminal receives signals through different beams at different times. In the multi-carrier scenario of this application, how to achieve joint monitoring when multiple search space sets are located on multiple carriers, and the corresponding PDCCH candidate counting method, will be a problem that needs to be solved.

[0006] To address the aforementioned scenarios and corresponding problems, this application discloses a solution. It should be noted that while this application is initially intended for multi-carrier scenarios, it can also be applied to other non-multi-carrier scenarios. Furthermore, adopting a unified design scheme for different scenarios (such as other non-multi-carrier scenarios, including but not limited to sensing integration, artificial intelligence, capacity enhancement systems, short-range communication systems, NTN (Non-Terrestrial Network), IoT (Internet of Things), and URLLC (Ultra-Reliable Low-Latency Communication) networks) helps reduce hardware complexity and cost. Where there is no conflict, embodiments and features in any node of this application can be applied to any other node. Where there is no conflict, embodiments and features in any embodiment of this application can be arbitrarily combined with each other.

[0007] Specifically, the interpretation of terms, nouns, functions, and variables in this application (unless otherwise specified) can be found in the definitions of the TS38 and TS37 series of 3GPP (3rd Generation Partnership Project) Technical Specifications (TS). Where necessary, reference can be made to TS23.273, TS38.211, TS38.212, TS38.213, TS38.214, TS38.215, TS38.300, TS38.304, TS38.305, TS38.321, TS38.331, TS37.355, TS38.355, TS38.423, and TS38.455 in the 3GPP technical specifications to aid in understanding this application.

[0008] As an example, the interpretation of terms in this application is based on the definitions in the 3GPP specification protocol TS38 series.

[0009] As an example, the interpretation of terms in this application is based on the definitions in the 3GPP specification protocol TS37 series.

[0010] As an example, the interpretation of terms in this application is based on the definitions in the 3GPP specification protocol TS23 series.

[0011] As an example, the interpretation of the terms used in this application is based on the definitions in 3GPP specification protocol Rel-17.

[0012] As an example, the interpretation of the terms used in this application is based on the definitions in 3GPP specification protocol Rel-18.

[0013] This application discloses a method for use in a first node for multi-carrier transmission in wireless communication, comprising:

[0014] Receive a first information block, which indicates a first search space set and a second search space set;

[0015] The first search space set and the second search space set are associated; the first search space set includes a first PDCCH candidate, and the second search space set includes a second PDCCH candidate; the total number of times the first PDCCH candidate and the second PDCCH candidate are counted depends on whether the first PDCCH candidate and the second PDCCH candidate are located in two different carriers.

[0016] As an example, the problem to be solved by this application includes: how to determine the number of blind detections to be counted when PDCCH candidates in two search space sets located in two carriers can be jointly detected to obtain frequency domain diversity gain.

[0017] As an example, the problems to be solved by this application include: In the traditional M-TRP, PDCCH candidates in the search space set with a larger search space ID are counted twice, resulting in the search space set with a larger search space ID having a lower priority when allocating PDCCH candidates and non-overlapping CCEs (Control Resource Elements), and being more likely to be discarded because the total number of PDCCH candidates or the total number of non-overlapping CCEs exceeds the terminal's capacity; the design of the above method obviously does not take into account multi-carrier scenarios and needs to be redesigned.

[0018] As an example, the features of the above method include: establishing a connection between the count of PDCCH candidates in the search space set and the frequency domain information of the carrier to which the PDCCH candidates belong, and then optimizing the counting method based on the frequency domain information, so as to better adapt to the scenario of joint detection of two frequency division multiplexing search space sets while ensuring performance.

[0019] According to one aspect of this application, the above method is characterized in that the first PDCCH candidate and the second PDCCH candidate carry the same DCI (Downlink Control Information).

[0020] According to one aspect of this application, the above method is characterized in that when the first PDCCH candidate and the second PDCCH candidate are located in two different carriers, the first PDCCH candidate and the second PDCCH candidate are counted a total of 3 times; when the first PDCCH candidate and the second PDCCH candidate are located in the same carrier, the first PDCCH candidate and the second PDCCH candidate are counted a total of 2 times.

[0021] As an example, the features of the above method include: when the first PDCCH candidate and the second PDCCH candidate are located in two different carriers, the first PDCCH candidate and the second PDCCH candidate are counted a total of 3 times, which is equivalent to the first PDCCH candidate and the second PDCCH candidate being assumed to be jointly detected to improve transmission performance; when the first PDCCH candidate and the second PDCCH candidate are located in the same carrier, the first PDCCH candidate and the second PDCCH candidate are counted a total of 2 times, which is equivalent to the first PDCCH candidate and the second PDCCH candidate not increasing the number of blind detections, thereby reducing the reception complexity of the terminal.

[0022] As an example, the features of the above method include: when the first search space set of the first PDCCH candidate and the second search space set of the second PDCCH candidate are located on two carriers respectively, joint detection is used to improve the reception performance.

[0023] According to one aspect of this application, the above method is characterized in that both the first search space set and the second search space set are set with a first index, which is used for the allocation of the maximum number of PDCCH candidates and the maximum number of non-overlapping CCEs for the first search space set and the second search space set.

[0024] As an example, the features of the above method include: when the first search space set and the second search space set are located on two carriers respectively and are used for joint detection, by configuring the first index, the priority of the first search space set and the second search space set as a joint search space set in the allocation of PDCCH candidates and non-overlapping CCEs is increased, thereby ensuring reception performance and avoiding the joint search space set from being discarded.

[0025] According to one aspect of this application, the above method is characterized in that the number of PDCCH candidates that the first node needs to monitor in the downlink active BWP (Bandwidth Part) of a scheduling cell is not greater than a first integer, the first integer depending on the equivalent number of scheduling cells of the first node, the equivalent number of scheduling cells depending on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers respectively.

[0026] As an example, the features of the above method include: when the first search space set and the second search space set are located on two carriers and are used for joint detection, changing the definition of the maximum number of scheduled cells in the formula for calculating the maximum PDCCH candidate in the existing system, and increasing the number of maximum PDCCH candidates under joint detection.

[0027] As an example, the features of the above method include: compared with the traditional method of calculating the maximum PDCCH candidate, here two carriers that can support joint detection of PDCCH candidates are added as a new scheduling carrier to the formula for calculating the maximum PDCCH candidate, thereby increasing the number of blind detections to ensure reception performance.

[0028] According to one aspect of this application, the above method is characterized in that the first integer depends on the equivalent number of scheduled cells of the first node, the equivalent number of scheduled cells depending on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers respectively.

[0029] As an example, the features of the above method include: when the first search space set and the second search space set are located on two carriers and are used for joint detection, changing the definition of the number of scheduled cells in the formula for calculating the maximum PDCCH candidate in the existing system, and increasing the number of maximum PDCCH candidates under joint detection.

[0030] As an example, the features of the above method include: compared with the traditional method of calculating the maximum PDCCH candidate, here multiple simultaneously scheduled carriers are added as a new scheduled carrier to the formula for calculating the maximum PDCCH candidate, thereby increasing the number of blind detections to ensure reception performance.

[0031] According to one aspect of this application, the above method is characterized in that the number of non-overlapping CCEs that the first node needs to monitor in a downlink active BWP of a scheduling cell is no greater than a second integer, the second integer depending on the equivalent number of scheduling cells of the first node, the equivalent number of scheduling cells depending on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers respectively.

[0032] As an example, the features of the above method include: when the first search space set and the second search space set are located on two carriers and are used for joint detection, changing the definition of the number of scheduled cells in the formula for calculating the maximum non-overlapping CCE in the existing system, and increasing the number of maximum non-overlapping CCEs under joint detection.

[0033] As an example, the features of the above method include: compared with the traditional method of calculating the maximum non-overlapping CCE, here multiple simultaneously scheduled carriers are added as a new carrier to the formula for calculating the maximum non-overlapping CCE, thereby increasing the number of blind detections to ensure reception performance.

[0034] According to one aspect of this application, the above method is characterized in that the second integer depends on the equivalent number of scheduled cells of the first node, the equivalent number of scheduled cells depending on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers respectively.

[0035] As an example, the features of the above method include: when the first search space set and the second search space set are located on two carriers and are used for joint detection, changing the definition of the number of scheduled cells in the formula for calculating the maximum non-overlapping CCE in the existing system, and increasing the number of maximum non-overlapping CCEs under joint detection.

[0036] As an example, the features of the above method include: compared with the traditional method of calculating the maximum non-overlapping CCE, here multiple simultaneously scheduled carriers are added as a new scheduled carrier to the formula for calculating the maximum non-overlapping CCE, thereby increasing the number of blind detections to ensure reception performance.

[0037] According to one aspect of this application, the above method is characterized by comprising:

[0038] Receive the first DCI;

[0039] Receive the first signal;

[0040] Both the first PDCCH candidate and the second PDCCH candidate carry the first DCI, the first DCI schedules the first signal, and the first signal is mapped onto multiple carriers.

[0041] According to one aspect of this application, the above method is characterized by comprising:

[0042] Receive the first DCI;

[0043] Send the first signal;

[0044] Both the first PDCCH candidate and the second PDCCH candidate carry the first DCI, the first DCI schedules the first signal, and the first signal is mapped onto multiple carriers.

[0045] As an example, the features of the above method include: the first node is a user equipment.

[0046] As an example, the features of the above method include: the first node is a terminal.

[0047] As an example, the features of the above method include: the first node includes a Handset.

[0048] This application discloses a method for use in a second node for multi-carrier transmission in wireless communication, comprising:

[0049] Send a first information block, which indicates a first search space set and a second search space set;

[0050] The first search space set and the second search space set are associated; the first search space set includes a first PDCCH candidate, and the second search space set includes a second PDCCH candidate; the total number of times the first PDCCH candidate and the second PDCCH candidate are counted depends on whether the first PDCCH candidate and the second PDCCH candidate are located in two different carriers.

[0051] According to one aspect of this application, the above method is characterized in that the first PDCCH candidate and the second PDCCH candidate carry the same DCI.

[0052] According to one aspect of this application, the above method is characterized in that when the first PDCCH candidate and the second PDCCH candidate are located in two different carriers, the first PDCCH candidate and the second PDCCH candidate are counted a total of 3 times; when the first PDCCH candidate and the second PDCCH candidate are located in the same carrier, the first PDCCH candidate and the second PDCCH candidate are counted a total of 2 times.

[0053] According to one aspect of this application, the above method is characterized in that both the first search space set and the second search space set are set with a first index, which is used for the allocation of the maximum number of PDCCH candidates and the maximum number of non-overlapping CCEs for the first search space set and the second search space set.

[0054] According to one aspect of this application, the above method is characterized in that the receiver of the first information block includes a first node, the number of PDCCH candidates that the first node needs to monitor in a downlink active BWP of a scheduling cell is not greater than a first integer, the first integer depends on the equivalent number of scheduling cells of the first node, the equivalent number of scheduling cells depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers respectively.

[0055] According to one aspect of this application, the above method is characterized in that the first integer depends on the equivalent number of scheduled cells of the first node, the equivalent number of scheduled cells depending on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers respectively.

[0056] According to one aspect of this application, the above method is characterized in that the receiver of the first information block includes a first node, the number of non-overlapping CCEs that the first node needs to monitor in a downlink active BWP of a scheduling cell is no greater than a second integer, the second integer depends on the equivalent number of scheduling cells of the first node, the equivalent number of scheduling cells depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers respectively.

[0057] According to one aspect of this application, the above method is characterized in that the second integer depends on the equivalent number of scheduled cells of the first node, the equivalent number of scheduled cells depending on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers respectively.

[0058] According to one aspect of this application, the above method is characterized by comprising:

[0059] Send the first DCI;

[0060] Send the first signal;

[0061] Both the first PDCCH candidate and the second PDCCH candidate carry the first DCI, the first DCI schedules the first signal, and the first signal is mapped onto multiple carriers.

[0062] According to one aspect of this application, the above method is characterized by comprising:

[0063] Send the first DCI;

[0064] Receive the first signal;

[0065] Both the first PDCCH candidate and the second PDCCH candidate carry the first DCI, the first DCI schedules the first signal, and the first signal is mapped onto multiple carriers.

[0066] As an example, the features of the above method include: the second node includes the cell corresponding to the plurality of carriers.

[0067] As an example, the features of the above method include: the second node controlling the plurality of carriers.

[0068] As an example, the features of the above method include: the second node includes a core network.

[0069] As an example, the features of the above method include: the second node includes a base station.

[0070] As an example, the features of the above method include: the second node is a base station.

[0071] As an example, the features of the above method include: the second node is an eNB.

[0072] As an example, the features of the above method include: the second node is a gNB.

[0073] As an example, the features of the above method include: the second node is a network device, which includes at least one of a core network device and an access network device.

[0074] As an example, the features of the above method include: the second node is a device that provides wireless communication function services, can communicate with terminal devices, and is usually located on the network side.

[0075] As an example, the features of the above method include: the base station in this application includes a core network.

[0076] As an example, the features of the above method include: the base station in this application includes core network equipment.

[0077] As an example, the features of the above method include: the second node includes an eNB.

[0078] This application discloses a first node for multi-carrier transmission in wireless communication, comprising:

[0079] A first receiver receives a first information block, the first information block indicating a first search space set and a second search space set;

[0080] The first search space set and the second search space set are associated; the first search space set includes a first PDCCH candidate, and the second search space set includes a second PDCCH candidate; the total number of times the first PDCCH candidate and the second PDCCH candidate are counted depends on whether the first PDCCH candidate and the second PDCCH candidate are located in two different carriers.

[0081] This application discloses a second node used for multi-carrier transmission in wireless communication, comprising:

[0082] A first transmitter sends a first information block, the first information block indicating a first search space set and a second search space set;

[0083] The first search space set and the second search space set are associated; the first search space set includes a first PDCCH candidate, and the second search space set includes a second PDCCH candidate; the total number of times the first PDCCH candidate and the second PDCCH candidate are counted depends on whether the first PDCCH candidate and the second PDCCH candidate are located in two different carriers.

[0084] As an example, compared with conventional solutions, this application has the following advantages, but is not limited to:

[0085] The count of PDCCH candidates in the search space set is linked with the frequency domain information of the carrier to which the PDCCH candidates belong. The counting method is then optimized based on the frequency domain information, which is more suitable for scenarios where two frequency division multiplexing search space sets are jointly detected while ensuring performance.

[0086] By setting a first index, the priority of the first search space set and the second search space set as a joint search space set in the allocation of PDCCH candidates and non-overlapping CCEs is increased, thereby ensuring reception performance and preventing the joint search space set from being discarded.

[0087] By changing the calculation method of the maximum number of PDCCH candidates and the maximum number of non-overlapping CCEs, the upper limit of blind detection is increased, thereby ensuring reception performance. Attached Figure Description

[0088] Other features, objects, and advantages of this application will become more apparent from the following detailed description of non-limiting embodiments with reference to the accompanying drawings:

[0089] Figure 1 A flowchart of the first node transmission according to an embodiment of this application is shown;

[0090] Figure 2 A schematic diagram of a network architecture according to an embodiment of this application is shown;

[0091] Figure 3 A schematic diagram of an embodiment of a wireless protocol architecture for the user plane and control plane according to an embodiment of this application is shown;

[0092] Figure 4 A schematic diagram of a first communication device and a second communication device according to an embodiment of this application is shown;

[0093] Figure 5 A flowchart illustrating a transmission between a first node and a second node according to an embodiment of this application is shown.

[0094] Figure 6 A flowchart of a first signal according to an embodiment of this application is shown;

[0095] Figure 7 A flowchart of a first signal according to another embodiment of this application is shown;

[0096] Figure 8 A schematic diagram of a first PDCCH candidate and a second PDCCH candidate according to an embodiment of this application is shown;

[0097] Figure 9 A schematic diagram of a first PDCCH candidate and a second PDCCH candidate according to another embodiment of this application is shown;

[0098] Figure 10 A structural block diagram of a processing apparatus for a first node according to an embodiment of this application is shown;

[0099] Figure 11 A structural block diagram of a processing apparatus for a second node according to an embodiment of this application is shown. Detailed Implementation

[0100] The technical solutions of this application will be further described in detail below with reference to the accompanying drawings. It should be noted that, unless otherwise specified, the embodiments and features in the embodiments of this application can be arbitrarily combined with each other. Considering performance, flexibility, complexity, overhead, and compatibility, those skilled in the art are motivated to flexibly combine the embodiments in different drawings without conflict, including but not limited to the accompanying drawings. Figure 1 Examples and appendices Figure 5 -Appendix Figure 11 The embodiments in the appendix Figure 5 Examples and appendices Figure 6 -Appendix Figure 11 Examples, etc.

[0101] Example 1

[0102] Example 1 illustrates a flowchart of a first node transmission according to an embodiment of this application, as shown in the attached diagram. Figure 1 As shown. In the appendix Figure 1 In the diagram, each box represents a step.

[0103] The first node receives a first information block in step 101, the first information block indicating a first search space set and a second search space set;

[0104] In Example 1, the first search space set and the second search space set are associated; the first search space set includes a first PDCCH candidate, and the second search space set includes a second PDCCH candidate; the total number of times the first PDCCH candidate and the second PDCCH candidate are counted depends on whether the first PDCCH candidate and the second PDCCH candidate are located in two different carriers.

[0105] As one example, the first node is a user equipment (UE).

[0106] As one example, the first node is a terminal.

[0107] As an example, the first PDCCH candidate and the second PDCCH candidate carry the same DCI.

[0108] As an example, the first PDCCH candidate and the second PDCCH candidate support carrying the same DCI.

[0109] As an example, the first PDCCH candidate and the second PDCCH candidate can carry the same DCI.

[0110] As one embodiment, the first information block includes RRC (Radio Resource Control) signaling.

[0111] As an example, the first information block includes one or more RRC IEs (Information Elements).

[0112] As an example, the first information block includes one or more fields in an RRC IE.

[0113] As one example, the first information block is transmitted via higher-level signaling.

[0114] As an example, the first information block is transmitted via RRC signaling.

[0115] As an example, the first information block includes a SearchSpace IE.

[0116] As one example, the first information block includes PDCCH-Config IE.

[0117] As an example, the first search space set is a Search Space Set, and the second search space set is a Search Space Set.

[0118] As an example, the SearchSpaceId of the first search space set and the SearchSpaceId of the second search space set are configured independently.

[0119] As an example, the SearchSpaceId of the first search space set and the SearchSpaceId of the second search space set are different.

[0120] As an example, the first information block indicates the CORESET (Control Resource Set) associated with the first search space set.

[0121] As one embodiment, the first information block indicates the temporal resources occupied by the first search space set.

[0122] As one embodiment, the first information block indicates the DCI format supported by the first search space set.

[0123] As one embodiment, the first information block indicates the CORESET associated with the second search space set.

[0124] As one embodiment, the first information block indicates the temporal resources occupied by the second search space set.

[0125] As one embodiment, the first information block indicates the DCI format supported by the second search space set.

[0126] As one embodiment, the first information block includes a first information set and a second information set, wherein the first information set and the second information set respectively indicate the first search space set and the second search space set.

[0127] As one embodiment, the first search space set and the second search space set are configured with the same searchSpaceLinkingId, which indicates that the first search space set and the second search space set are associated.

[0128] As one embodiment, the first information block indicates that the first search space set and the second search space set are associated.

[0129] As an example, the first PDCCH candidate and the second PDCCH candidate are two different PDCCH candidates.

[0130] As an example, the first PDCCH candidate is a PDCCH candidate, and the second PDCCH candidate is a PDCCH candidate.

[0131] As an example, the first PDCCH candidate and the second PDCCH candidate adopt the same aggregation level.

[0132] As an example, the first PDCCH candidate and the second PDCCH candidate can correspond to two repeated transmissions of a PDCCH.

[0133] As an example, the number of times counted refers to the number of blind detections recorded.

[0134] As an example, the number of times it is counted refers to the number of PDCCH candidates that are counted for PDCCH monitoring.

[0135] As an example, the number of times it is counted refers to the number of PDCCH candidates monitored for PDCCH in the search space set.

[0136] As an example, the carrier in this application corresponds to a CC (Component Carrier).

[0137] As an example, the carrier in this application corresponds to a Carrier.

[0138] As an example, the carrier in this application corresponds to an Operation Band.

[0139] As an example, when the first PDCCH candidate and the second PDCCH candidate are located in two different carriers, the first PDCCH candidate and the second PDCCH candidate are counted once; when the first PDCCH candidate and the second PDCCH candidate are located in the same carrier, the first PDCCH candidate and the second PDCCH candidate are counted twice.

[0140] As an example, when the first PDCCH candidate and the second PDCCH candidate are located in two different carriers, the first PDCCH candidate and the second PDCCH candidate are located in two BWPs of two different carriers.

[0141] As an example, when the first PDCCH candidate and the second PDCCH candidate are located in the same carrier, the first PDCCH candidate and the second PDCCH candidate are located in one BWP in the same carrier.

[0142] As an example, when the first PDCCH candidate and the second PDCCH candidate are located in two different carriers, the first PDCCH candidate and the second PDCCH candidate belong to the same cell.

[0143] As an example, the first search space set and the second search space set belong to the same BWP.

[0144] As one example, the first search space set and the second search space set belong to the same cell.

[0145] As an example, the first search space set and the second search space set occupy the same temporal domain resources.

[0146] As one embodiment, the first search space set and the second search space set overlap in the time domain.

[0147] As an example, at least one time-domain symbol is simultaneously occupied by both the first search space set and the second search space set.

[0148] As an example, the first PDCCH candidate occupies a positive integer number of REs (Resource Elements).

[0149] As an example, the second PDCCH candidate occupies a positive integer number of REs greater than 1.

[0150] As an example, the first PDCCH candidate and the second PDCCH candidate occupy the same number of REs.

[0151] As an example, the first PDCCH candidate and the second PDCCH candidate correspond to the same aggregation level.

[0152] Example 2

[0153] Example 2 illustrates a schematic diagram of a network architecture according to an embodiment of this application, as shown in the attached diagram. Figure 2 As shown.

[0154] Appendix Figure 2 Network architecture 200 is described. Network architecture 200 refers to the network architectures of LTE (Long-Term Evolution), LTE-A (Long-Term Evolution Advanced), 5G systems, 5G-Advanced, and future 6G systems. The network architectures of LTE, LTE-A, 5G systems, 5G-Advanced, and future 6G systems are referred to as EPS (Evolved Packet System). The 5G NR or LTE network architecture may be referred to as 5GS (5G System) / EPS or some other suitable terminology; the 6G network architecture may be referred to as 6GS (6G System) / EPS or some other suitable terminology.

[0155] The network architecture 200 may include one or more UEs 201, a RAN (Radio Access Network) 202, a core network 210, an HSS (Home Subscriber Server) / UDM (Unified Data Management) 220, and an Internet service 230. The network architecture 200 may interconnect with other access networks, but these entities / interfaces are not shown for simplicity.

[0156] As attached Figure 2As shown, the network architecture 200 provides packet switching services; however, those skilled in the art will readily understand that the various concepts presented throughout this application can be extended to networks providing circuit-switched services or other cellular networks. The RAN 202 includes Node B 203 and other nodes 204. Node B 203 provides user and control plane protocol termination toward the UE 201. Node B 203 may be connected to other nodes 204 via an Xn interface (e.g., backhaul). Node B 203 may also be referred to as eNB (evolved Node B), gNB, base station, base transceiver station, wireless base station, wireless transceiver, transceiver function, Basic Service Set (BSS), Extended Service Set (ESS), TRP (Transmitter Receiver Point), or some other suitable term. Node B 203 provides UE 201 with an access point to the core network 210; the core network 210 is a 5GC (5G Core network) / EPC (Evolved Packet Core), or the core network 210 is a 6GC (6G Core network). Examples of the UE 201 include cellular phones, smartphones, Session Initiation Protocol (SIP) phones, laptops, personal digital assistants (PDAs), satellite radios, GPS devices, multimedia devices, video devices, digital audio players (e.g., MP3 players), cameras, game consoles, drones, aircraft, narrowband physical network devices, machine-type communication devices, land vehicles, automobiles, wearable devices, or any other similar functional devices. Those skilled in the art may also refer to the UE 201 as a mobile station, subscriber station, mobile unit, subscriber unit, radio unit, remote unit, mobile device, radio device, wireless communication device, remote device, mobile subscriber station, access terminal, mobile terminal, radio terminal, remote terminal, handheld device, user agent, mobile client, client, or any other suitable term. The Node B 203 is connected to the core network 210 via an S1 / NG interface.The core network 210 includes an MME (Mobility Management Entity) / AMF (Authentication Management Field) / SMF (Session Management Function) 211, other MMEs / AMFs / SMFs 214, an S-GW (Service Gateway) / UPF (User Plane Function) 212, and a P-GW (Packet Data Network Gateway) / UPF 213. The MME / AMF / SMF 211 is the control node that handles signaling between the UE 201 and the core network 210. Generally, the MME / AMF / SMF 211 provides bearer and connection management. All user IP (Internet Protocol) packets are transmitted through the S-GW / UPF 212, which is itself connected to the P-GW / UPF 213. The P-GW provides UE IP address allocation and other functions. The P-GW / UPF 213 is connected to the Internet service 230. The Internet service 230 includes carrier-compliant Internet Protocol services, specifically including the Internet, intranet, IMS (IP Multimedia Subsystem), and packet-switched streaming services.

[0157] As an example, the first node in this application includes the UE 201.

[0158] As an example, the second node in this application includes node B 203.

[0159] As an example, node B 203 is a macrocell base station.

[0160] As an example, node B 203 is a microcell base station.

[0161] As an example, node B 203 is a pico cell base station.

[0162] As an example, node B 203 is a femtocell.

[0163] As an example, node B 203 is a base station device that supports multi-carrier transmission.

[0164] As one embodiment, the node B 203 is a test device (e.g., a transceiver device simulating part of the base station's functions, a signaling tester).

[0165] As an example, the UE 201 includes a mobile phone.

[0166] As an example, the UE 201 is a user equipment that supports multi-carrier transmission.

[0167] As an example, the UE 201 is a vehicle including a car.

[0168] As an example, the wireless link from the UE 201 to the node B 203 is an uplink, which is used to perform uplink transmissions.

[0169] As an example, the radio link from the node B 203 to the UE 201 is a downlink, which is used to perform downlink transmissions.

[0170] As an example, the wireless link between the node B 203 and the UE 201 includes a cellular link.

[0171] As an example, the node B 203 and the UE 201 are connected via the Uu air interface.

[0172] As an example, the UE 201 supports a 5G system.

[0173] As an example, the node B 203 supports a 5G system.

[0174] As an example, the UE 201 supports at least a 6G system.

[0175] As an example, the node B 203 supports at least a 6G system.

[0176] As an example, the sender of the first information block in this application includes the node B 203.

[0177] As an example, the recipient of the first information block in this application includes the UE 201.

[0178] As an example, the sender of the first DCI in this application includes the node B 203.

[0179] As an example, the recipient of the first DCI in this application includes the UE 201.

[0180] As an example, the sender of the first signal in this application includes the node B 203.

[0181] As an example, the receiver of the first signal in this application includes the UE 201.

[0182] As an example, the receiver of the first signal in this application includes the node B 203.

[0183] As an example, the sender of the first signal in this application includes the UE 201.

[0184] Example 3

[0185] Example 3 illustrates a schematic diagram of an embodiment of a wireless protocol architecture for the user plane and control plane according to an embodiment of this application, as shown in the attached diagram. Figure 3 As shown.

[0186] Figure 3 This is a schematic diagram illustrating an embodiment of a wireless protocol architecture for the user plane 350 and the control plane 300. Figure 3The wireless protocol architecture for the control plane 300 between the first communication node device (UE or RSU in V2X, onboard equipment or onboard communication module) and the second node device (gNB, UE or RSU in V2X, onboard equipment or onboard communication module), or between two UEs, is illustrated using three layers: Layer 1 (L1), Layer 2 (L2), and Layer 3 (L3). L1 is the lowest layer and implements various PHY (Physical layer) signal processing functions. L1 will be referred to as PHY 301 in this document. L2305 sits above PHY 301 and is responsible for the link between the first and second node devices, or between two UEs, via PHY 301. L2305 includes a MAC (Medium Access Control) sublayer 302, an RLC (Radio Link Control) sublayer 303, and a PDCP (Packet Data Convergence Protocol) sublayer 304, which terminate at the second node device. The PDCP sublayer 304 provides multiplexing between different radio bearers and logical channels. It also provides security through encrypted data packets and supports cross-cell mobility between the second communication node devices and the first communication node device. The RLC sublayer 303 provides upper-layer packet segmentation and reassembly, retransmission of lost packets, and packet reordering to compensate for out-of-order reception due to HARQ (Hybrid Automatic Repeat Quest). The MAC sublayer 302 provides multiplexing between logical and transport channels. It is also responsible for allocating various radio resources (e.g., resource blocks) within a cell among the first communication node devices. MAC sublayer 302 is also responsible for HARQ operations. RRC sublayer 306 in L3 of control plane 300 is responsible for acquiring radio resources (i.e., radio bearers) and configuring the lower layers using RRC signaling between the second and first communication node devices. The radio protocol architecture of user plane 350 includes layers 1 (L1) and 2 (L2). The radio protocol architecture for the first and second communication node devices in user plane 350 is largely the same as the corresponding layers and sublayers in control plane 300 for physical layer 351, PDCP sublayer 354 in L2355, RLC sublayer 353 in L2355, and MAC sublayer 352 in L2355. However, PDCP sublayer 354 also provides header compression for upper layer data packets to reduce radio transmission overhead.The L2355 in the user plane 350 also includes an SDAP (Service Data Adaptation Protocol) sublayer 356, which is responsible for mapping between QoS (Quality of Service) streams and Data Radio Bearers (DRBs) to support service diversity. Although not illustrated, the first communication node device may have several upper layers above the L2355, including a network layer (e.g., the IP (Internet Protocol) layer) terminating at the P-GW on the network side and an application layer terminating at the other end of the connection (e.g., a remote UE, server, etc.).

[0187] As an example, Appendix Figure 3 The wireless protocol architecture described herein is applicable to the first node in this application.

[0188] As an example, Appendix Figure 3 The wireless protocol architecture described herein is applicable to the second node in this application.

[0189] As an example, the higher layer mentioned in this application refers to the layer above the physical layer.

[0190] As an example, in this application, the first information block is generated in MAC302 or MAC352.

[0191] As an example, in this application, the first information block is generated in the RRC306.

[0192] As an example, in this application, the first signal is generated by MAC302 or MAC352.

[0193] As an example, in this application, the first signal is generated in the PHY301 or PHY351.

[0194] As an example, in this application, the first DCI is generated in the PHY301 or PHY351.

[0195] Example 4

[0196] Example 4 illustrates a schematic diagram of a first communication device and a second communication device according to an embodiment of this application, as shown in the attached diagram. Figure 4 As shown. (Attached) Figure 4 This is a block diagram of a first communication device 410 and a second communication device 450 communicating with each other in an access network.

[0197] The first communication device 410 includes a controller / processor 475, a memory 476, a receiver processor 470, a transmitter processor 416, a multi-antenna receiver processor 472, a multi-antenna transmitter processor 471, a transmitter / receiver 418, and an antenna 420.

[0198] The second communication device 450 includes a controller / processor 459, a memory 460, a data source 467, a transmitting processor 468, a receiving processor 456, a multi-antenna transmitting processor 457, a multi-antenna receiving processor 458, a transmitter / receiver 454, and an antenna 452.

[0199] In the transmission from the first communication device 410 to the second communication device 450, at the first communication device 410, upper-layer data packets from the core network are provided to the controller / processor 475. The controller / processor 475 implements L2 functionality. In the DL, the controller / processor 475 provides header compression, encryption, packet segmentation and reordering, multiplexing between logical and transport channels, and radio resource allocation to the second communication device 450 based on various priority metrics. The controller / processor 475 is also responsible for HARQ operation, retransmission of lost packets, and signaling to the second communication device 450. The transmit processor 416 and the multi-antenna transmit processor 471 implement various signal processing functions for L1 (i.e., the physical layer). Transmit processor 416 performs encoding and interleaving to facilitate forward error correction (FEC) at the second communication device 450, and mapping of signal clusters based on various modulation schemes (e.g., Binary Phase Shift Keying (BPSK), Quadrature Phase Shift Keying (QPSK), M-PSK, and M-Quadrature Amplitude Modulation (M-QAM)). Multi-antenna transmit processor 471 performs digital spatial precoding on the encoded and modulated symbols, including codebook-based precoding and non-codebook-based precoding, and beamforming processing, generating one or more parallel streams. The transmit processor 416 then maps each parallel stream to a subcarrier, multiplexes the modulated symbols with a reference signal (e.g., a pilot) in the time and / or frequency domains, and then uses an inverse fast fourier transform (IFFT) to generate a physical channel carrying the time-domain multicarrier symbol stream. The multi-antenna transmit processor 471 then performs transmit analog precoding / beamforming operations on the time-domain multicarrier symbol stream. Each transmitter 418 converts the baseband multicarrier symbol stream provided by the multi-antenna transmit processor 471 into an RF stream, which is then provided to a different antenna 420.

[0200] In the transmission from the first communication device 410 to the second communication device 450, at the second communication device 450, each receiver 454 receives a signal through its corresponding antenna 452. Each receiver 454 recovers the information modulated onto the radio frequency carrier and converts the radio frequency stream into a baseband multicarrier symbol stream, which is then provided to the receiver processor 456. The receiver processor 456 and the multi-antenna receiver processor 458 implement various L1 signal processing functions. The multi-antenna receiver processor 458 performs receive analog precoding / beamforming operations on the baseband multicarrier symbol stream from the receiver 454. The receiver processor 456 uses a Fast Fourier Transform (FFT) to convert the baseband multicarrier symbol stream after the receive analog precoding / beamforming operations from the time domain to the frequency domain. In the frequency domain, the physical layer data signal and the reference signal are demultiplexed by the receiver processor 456, where the reference signal is used for channel estimation, and the data signal is recovered in the multi-antenna receiver processor 458 after multi-antenna detection to recover any parallel stream destined for the second communication device 450. Symbols on each parallel stream are demodulated and recovered in the receive processor 456, generating soft decisions. The receive processor 456 then decodes and deinterleaves the soft decisions to recover the upper-layer data and control signals transmitted by the first communication device 410 over the physical channel. The upper-layer data and control signals are then provided to the controller / processor 459. The controller / processor 459 implements L2 functionality. The controller / processor 459 may be associated with a memory 460 storing program code and data. The memory 460 may be referred to as computer-readable media. In the DL, the controller / processor 459 provides multiplexing, packet reassembly, decryption, header decompression, and control signal processing between the transmission and logical channels to recover upper-layer packets from the core network. The upper-layer packets are then provided to all protocol layers above L2. Various control signals may also be provided to L3 for L3 processing. The controller / processor 459 is also responsible for error detection using Acknowledgement (ACK) and / or Negative Acknowledgement (NACK) protocols to support HARQ operation.

[0201] In the transmission from the second communication device 450 to the first communication device 410, at the second communication device 450, a data source 467 is used to provide upper-layer data packets to the controller / processor 459. The data source 467 represents all protocol layers above L2. Similar to the transmission functions at the first communication device 410 described in the DL, the controller / processor 459 implements header compression, encryption, packet segmentation and reordering, and multiplexing between logical and transport channels based on the radio resource allocation of the first communication device 410, implementing L2 functions for the user plane and control plane. The controller / processor 459 is also responsible for HARQ operations, retransmission of lost packets, and signaling to the first communication device 410. Transmit processor 468 performs modulation mapping and channel coding processing, while multi-antenna transmit processor 457 performs digital multi-antenna spatial precoding, including codebook-based and non-codebook-based precoding, and beamforming processing. Subsequently, transmit processor 468 modulates the generated parallel stream into a multi-carrier / single-carrier symbol stream. After analog precoding / beamforming operations in multi-antenna transmit processor 457, the stream is provided to different antennas 452 via transmitter 454. Each transmitter 454 first converts the baseband symbol stream provided by multi-antenna transmit processor 457 into a radio frequency symbol stream before providing it to antenna 452.

[0202] In the transmission from the second communication device 450 to the first communication device 410, the function at the first communication device 410 is similar to the receiving function at the second communication device 450 described in the transmission from the first communication device 410 to the second communication device 450. Each receiver 418 receives radio frequency signals through its corresponding antenna 420, converts the received radio frequency signals into baseband signals, and provides the baseband signals to the multi-antenna receiving processor 472 and the receiving processor 470. The receiving processor 470 and the multi-antenna receiving processor 472 jointly implement the L1 function. The controller / processor 475 implements the L2 function. The controller / processor 475 may be associated with a memory 476 storing program code and data. The memory 476 may be referred to as computer-readable media. The controller / processor 475 provides multiplexing, packet reassembly, decryption, header decompression, and control signal processing between the transmission and logical channels to recover upper-layer data packets from the second communication device 450. The upper-layer data packets from the controller / processor 475 may be provided to the core network. The controller / processor 475 is also responsible for error detection using ACK and / or NACK protocols to support HARQ operation.

[0203] As one embodiment, the second communication device 450 includes: at least one processor and at least one memory, the at least one memory including computer program code; the at least one memory and the computer program code are configured to be used with the at least one processor. The second communication device 450 receives at least a first information block, the first information block indicating a first search space set and a second search space set; the first search space set and the second search space set are associated; the first search space set includes a first PDCCH candidate, and the second search space set includes a second PDCCH candidate; the total number of times the first PDCCH candidate and the second PDCCH candidate are counted depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers; the first PDCCH candidate and the second PDCCH candidate carry the same DCI.

[0204] As one embodiment, the second communication device 450 includes: a memory storing a computer-readable instruction program that produces actions when executed by at least one processor, the actions including: receiving a first information block, the first information block indicating a first search space set and a second search space set.

[0205] As one embodiment, the first communication device 410 includes at least one processor and at least one memory, the at least one memory including computer program code; the at least one memory and the computer program code are configured to be used with the at least one processor. The first communication device 410 transmits at least a first information block, the first information block indicating a first search space set and a second search space set; the first search space set and the second search space set are associated; the first search space set includes a first PDCCH candidate, and the second search space set includes a second PDCCH candidate; the total number of times the first PDCCH candidate and the second PDCCH candidate are counted depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers; the first PDCCH candidate and the second PDCCH candidate carry the same DCI.

[0206] As one embodiment, the first communication device 410 includes: a memory storing a computer-readable instruction program that produces actions when executed by at least one processor, the actions including: sending a first information block that indicates a first search space set and a second search space set.

[0207] As an example, the first node in this application includes the second communication device 450.

[0208] As an example, the second node in this application includes the first communication device 410.

[0209] As an example, at least one of {the antenna 420, the transmitter 418, the transmitter processor 416, the multi-antenna transmitter processor 471, the controller / processor 475, and the memory 476} is used to transmit the first information block; at least one of {the antenna 452, the receiver 454, the receiver processor 456, the multi-antenna receiver processor 458, the controller / processor 459, the memory 460, and the data source 467} is used to receive the first information block.

[0210] As an example, at least one of {the antenna 420, the transmitter 418, the transmitter processor 416, the multi-antenna transmitter processor 471, the controller / processor 475, and the memory 476} is used to transmit a first signal; and at least one of {the antenna 452, the receiver 454, the receiver processor 456, the multi-antenna receiver processor 458, the controller / processor 459, the memory 460, and the data source 467} is used to receive the first signal.

[0211] As an example, at least one of {the antenna 452, the transmitter 454, the transmitter processor 468, the multi-antenna transmitter processor 457, the controller / processor 459, the memory 460, and the data source 467} is used to transmit a first signal; at least one of {the antenna 420, the receiver 418, the receiver processor 470, the multi-antenna receiver processor 472, the controller / processor 475, and the memory 476} is used to receive the first signal.

[0212] As an example, at least one of {the antenna 420, the transmitter 418, the transmitter processor 416, the multi-antenna transmitter processor 471, the controller / processor 475, and the memory 476} is used to transmit the first DCI; at least one of {the antenna 452, the receiver 454, the receiver processor 456, the multi-antenna receiver processor 458, the controller / processor 459, the memory 460, and the data source 467} is used to receive the first DCI.

[0213] Example 5

[0214] Example 5 illustrates a flowchart of a transmission between a first node and a second node according to an embodiment of this application, as shown in the attached diagram. Figure 5 As shown. In the appendix Figure 5 In this system, the first node U1 and the second node N2 communicate via a wireless link.

[0215] For the first node U1, the first information block is received in step S510;

[0216] For the second node N2, the first information block is sent in step S520;

[0217] In embodiment 5, the first information block indicates a first search space set and a second search space set; the first search space set and the second search space set are associated; the first search space set includes a first PDCCH candidate, and the second search space set includes a second PDCCH candidate; the total number of times the first PDCCH candidate and the second PDCCH candidate are counted depends on whether the first PDCCH candidate and the second PDCCH candidate are located in two different carriers.

[0218] As an example, the first node U1 is the first node in this application.

[0219] As an example, the second node N2 is the second node in this application.

[0220] As one embodiment, the air interface between the second node N2 and the first node U1 includes a wireless interface between the base station equipment and the user equipment.

[0221] As one embodiment, the air interface between the second node N2 and the first node U1 includes a wireless interface between the relay node device and the user equipment.

[0222] As one embodiment, the air interface between the second node N2 and the first node U1 includes a wireless interface between user equipment and user equipment.

[0223] As one example, the second node N2 and the first node U1 communicate via the Uu interface.

[0224] As one example, the second node N2 is the maintenance base station of the serving cell of the first node U1.

[0225] Typically, when the first PDCCH candidate and the second PDCCH candidate are located on two different carriers, the first PDCCH candidate and the second PDCCH candidate are counted a total of 3 times; when the first PDCCH candidate and the second PDCCH candidate are located on the same carrier, the first PDCCH candidate and the second PDCCH candidate are counted a total of 2 times.

[0226] As an example, the fact that the first PDCCH candidate and the second PDCCH candidate are counted a total of 3 times means that one of the first PDCCH candidates and the second PDCCH candidate is counted a total of 1 time, and the other PDCCH candidate is counted a total of 2 times.

[0227] As an example, the fact that the first PDCCH candidate and the second PDCCH candidate are counted a total of 3 times means that: the number of times the PDCCH candidate of one of the search space sets is counted is equal to M, and the number of times the PDCCH candidate of the other search space set is counted is equal to twice M, where M is configured by RRC signaling and M is a positive integer greater than 1.

[0228] As an example, the fact that the first PDCCH candidate and the second PDCCH candidate are counted a total of 2 times means that the first PDCCH candidate and the second PDCCH candidate are each counted once.

[0229] As an example, the fact that the first PDCCH candidate and the second PDCCH candidate are counted a total of 2 times means that: the number of times the PDCCH candidate is counted in one of the search space sets is equal to M, and the number of times the PDCCH candidate is counted in the other search space set is also equal to M, where M is configured by RRC signaling and M is a positive integer greater than 1.

[0230] As an example, the first PDCCH candidate and the second PDCCH candidate being located on two different carriers is equivalent to the first search space set and the second search space set being located on two different carriers.

[0231] As an example, when the first PDCCH candidate and the second PDCCH candidate are located in two different carriers, the first search space set and the second search space set participate in the allocation of the maximum number of PDCCH candidates and the maximum number of non-overlapping CCEs as a whole search space set.

[0232] As a sub-implementation of this embodiment, when the first search space set and the second search space set participate in the allocation of PDCCH candidate allocation and the allocation of non-overlapping CCE numbers, there will be no scenario where one of the first search space set and the second search space set is allocated.

[0233] As a sub-implementation of this embodiment, when the first search space set and the second search space set participate in the allocation of PDCCH candidate allocation and the allocation of the number of non-overlapping CCEs, there will only be a scenario where both the first search space set and the second search space set are allocated, or neither of them is allocated.

[0234] As an example, the first PDCCH candidate and the second PDCCH candidate being located on the same carrier is equivalent to the first search space set and the second search space set being located on the same carrier.

[0235] As an example, when the first PDCCH candidate and the second PDCCH candidate are located in the same carrier, the first search space set and the second search space set participate as two independent search space sets in the allocation of the maximum number of PDCCH candidates and the maximum number of non-overlapping CCEs.

[0236] As a sub-implementation of this embodiment, when the first search space set and the second search space set participate in the allocation of PDCCH candidate allocation and the allocation of the number of non-overlapping CCEs, there may be a scenario where one of the first search space set and the second search space set is allocated.

[0237] As a sub-implementation of this embodiment, the first search space set and the second search space set independently participate in the allocation of PDCCH candidate allocation and the allocation of the number of non-overlapping CCEs.

[0238] Typically, both the first search space set and the second search space set are set with a first index, which is used for the allocation of the maximum number of PDCCH candidates and the maximum number of non-overlapping CCEs for the first search space set and the second search space set.

[0239] As an example, the first index is indicated by the first information block.

[0240] As an example, the first index is a non-negative integer.

[0241] As an example, the first index is enabled when the first PDCCH candidate and the second PDCCH candidate are located on two different carriers.

[0242] As an example, the first index is enabled when the first PDCCH candidate and the second PDCCH candidate are counted a total of 3 times.

[0243] As an example, the first index is equal to the smaller of the SearchSpaceId of the first search space set and the SearchSpaceId of the first search space set.

[0244] As an example, the first index is equal to the SearchSpaceId used by the overall search space set when the first search space set and the second search space set are considered as a whole.

[0245] Typically, the number of PDCCH candidates that the first node needs to monitor in a downlink active BWP of a scheduling cell is no greater than a first integer, which depends on the equivalent number of scheduling cells of the first node, and the equivalent number of scheduling cells depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers respectively.

[0246] As an example, the first integer is equal to the first value rounded down, and the first value depends on the equivalent number of scheduled cells of the first node.

[0247] As a sub-example of this embodiment, the first value is linearly related to the equivalent number of scheduled cells of the first node.

[0248] As a sub-implementation of this embodiment, the equivalent number of scheduling cells corresponds to

[0249] As a sub-implementation of this embodiment, the equivalent number of scheduling cells corresponds to

[0250] As a sub-implementation of this embodiment, when the first PDCCH candidate and the second PDCCH candidate are located in the same carrier, the number of equivalent scheduling cells is equal to N; when the first PDCCH candidate and the second PDCCH candidate are located in two different carriers, the number of equivalent scheduling cells is equal to N+1; where N is a positive real number.

[0251] As a supplementary embodiment of this sub-example, the value of N depends on the actual number of scheduled cells configured for the first node.

[0252] As a supplementary embodiment of this sub-example, the value of N is equal to the actual number of scheduled cells configured by the first node.

[0253] As a supplementary embodiment of this sub-example, the value of N depends on the maximum number of CCs used for PDCCH monitoring indicated by the first node.

[0254] As a supplementary embodiment of this sub-example, the value of N is equal to the maximum number of CCs for PDCCH monitoring indicated by the first node.

[0255] As an example, the first integer depends on the maximum number of PDCCH candidates monitored by the first node in each time slot of a DL BWP in a serving cell, given an SCS.

[0256] As an example, the first integer depends on the first node being in a span of a DL BWP in a serving cell, and given the SCS (Subcarrier Spacing) and the maximum number of PDCCH candidates monitored under a given combination.

[0257] Typically, the first integer depends on the equivalent number of scheduled cells of the first node, which depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers.

[0258] As an example, the equivalent number of scheduled cells corresponds to a given SCS.

[0259] As an example, the equivalent number of scheduled cells corresponds to a given μ.

[0260] As an example, the first integer is equal to the first value rounded down, and the first value depends on the equivalent number of scheduled cells of the first node.

[0261] As a sub-example of this embodiment, the first value is linearly related to the equivalent number of scheduled cells of the first node.

[0262] As a sub-implementation of this embodiment, the equivalent number of scheduled cells corresponds to or

[0263] As a sub-implementation of this embodiment, the equivalent number of scheduled cells corresponds to

[0264] As a sub-implementation of this embodiment, when the first PDCCH candidate and the second PDCCH candidate are located in the same carrier, the equivalent number of scheduled cells is equal to X; when the first PDCCH candidate and the second PDCCH candidate are located in two different carriers, the equivalent number of scheduled cells is equal to X+1; where X is a positive real number.

[0265] As a supplementary embodiment of this sub-example, the value of X depends on the number of scheduled cells configured for the first node.

[0266] As an additional embodiment of this sub-example, the value of X is equal to the number of scheduled cells under a given SCS configured by the first node.

[0267] Typically, the number of non-overlapping CCEs that the first node needs to monitor in a downlink active BWP of a scheduling cell is no greater than a second integer, which depends on the equivalent number of scheduling cells of the first node, and the equivalent number of scheduling cells depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers respectively.

[0268] As an example, the second integer is equal to the second value rounded down, and the second value depends on the equivalent number of scheduled cells of the first node.

[0269] As a sub-example of this embodiment, the second value is linearly related to the equivalent number of scheduled cells of the first node.

[0270] As a sub-implementation of this embodiment, the equivalent number of scheduling cells corresponds to

[0271] As a sub-implementation of this embodiment, the equivalent number of scheduling cells corresponds to

[0272] As a sub-implementation of this embodiment, when the first PDCCH candidate and the second PDCCH candidate are located in the same carrier, the number of equivalent scheduling cells is equal to N; when the first PDCCH candidate and the second PDCCH candidate are located in two different carriers, the number of equivalent scheduling cells is equal to N+1; where N is a positive real number.

[0273] As a supplementary embodiment of this sub-example, the value of N depends on the actual number of scheduled cells configured for the first node.

[0274] As a supplementary embodiment of this sub-example, the value of N is equal to the actual number of scheduled cells configured by the first node.

[0275] As a supplementary embodiment of this sub-example, the value of N depends on the maximum number of CCs used for PDCCH monitoring indicated by the first node.

[0276] As a supplementary embodiment of this sub-example, the value of N is equal to the maximum number of CCs for PDCCH monitoring indicated by the first node.

[0277] As one example, the second integer depends on the maximum number of non-overlapping CCEs monitored by the first node in each time slot of a DL BWP in a serving cell, given an SCS.

[0278] As an example, the second integer depends on the first node in a span of a DL BWP in a serving cell, and the maximum number of non-overlapping CCEs monitored given the SCS and the combination.

[0279] Typically, the second integer depends on the equivalent number of scheduled cells of the first node, which depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers.

[0280] As an example, the equivalent number of scheduled cells corresponds to a given SCS.

[0281] As an example, the equivalent number of scheduled cells corresponds to a given μ.

[0282] As an example, the second integer is equal to the second value rounded down, and the second value depends on the equivalent number of scheduled cells of the first node.

[0283] As a sub-example of this embodiment, the second value is linearly related to the equivalent number of scheduled cells of the first node.

[0284] As a sub-implementation of this embodiment, the equivalent number of scheduled cells corresponds to or

[0285] As a sub-implementation of this embodiment, the equivalent number of scheduled cells corresponds to

[0286] As a sub-implementation of this embodiment, when the first PDCCH candidate and the second PDCCH candidate are located in the same carrier, the equivalent number of scheduled cells is equal to X; when the first PDCCH candidate and the second PDCCH candidate are located in two different carriers, the equivalent number of scheduled cells is equal to X+1; where X is a positive real number.

[0287] As a supplementary embodiment of this sub-example, the value of X depends on the number of scheduled cells configured for the first node.

[0288] As an additional embodiment of this sub-example, the value of X is equal to the number of scheduled cells under a given SCS configured by the first node.

[0289] Example 6

[0290] Example 6 illustrates a flowchart of a first signal according to an embodiment of this application, as shown in the attached diagram. Figure 6 As shown. In the appendix Figure 6 In this process, the first node U3 and the second node N4 communicate via a wireless link.

[0291] For the first node U3, the first DCI is received in step S610; the first signal is received in step S611.

[0292] For the second node N4, the first DCI is sent in step S620; the first signal is sent in step S621.

[0293] In Embodiment 6, both the first PDCCH candidate and the second PDCCH candidate carry the first DCI, the first DCI schedules the first signal, and the first signal is mapped onto multiple carriers.

[0294] As an example, step S610 includes detecting the first DCI in at least one of the first PDCCH candidate and the second PDCCH candidate.

[0295] As an example, step S610 includes monitoring the first DCI in at least one of the first search space set and the second search space set.

[0296] As an example, the physical layer channel occupied by the first signal includes PDSCH (Physical Downlink Shared Channel).

[0297] As an example, the transmission channel occupied by the first signal includes DL-SCH (Downlink Shared Channel).

[0298] As an example, the first signal is generated by a TB (transmission block).

[0299] As an example, the first PDCCH candidate and the second PDCCH candidate correspond to two repeated transmissions of the first DCI.

[0300] As an example, the frequency domain resources occupied by the first signal belong to multiple carriers.

[0301] As an example, step S610 is located after step S510 in Example 5.

[0302] As an example, step S620 is located after step S520 in Example 5.

[0303] Example 7

[0304] Example 7 illustrates a flowchart of a first signal according to another embodiment of this application, as shown in the attached diagram. Figure 7 As shown. In the appendix Figure 7 In this process, the first node U7 and the second node N8 communicate via a wireless link.

[0305] For the first node U5, the first DCI is received in step S710; the first signal is sent in step S711.

[0306] For the second node N6, the first DCI is sent in step S720; the first signal is received in step S721.

[0307] In embodiment 7, both the first PDCCH candidate and the second PDCCH candidate carry the first DCI, the first DCI schedules the first signal, and the first signal is mapped onto multiple carriers.

[0308] As an example, step S710 includes detecting the first DCI in at least one of the first PDCCH candidate and the second PDCCH candidate.

[0309] As an example, step S710 includes monitoring the first DCI in at least one of the first search space set and the second search space set.

[0310] As an example, the physical layer channel occupied by the first signal includes PUSCH (Physical Uplink Shared Channel).

[0311] As an example, the transmission channel occupied by the first signal includes UL-SCH (Uplink Shared Channel).

[0312] As an example, the first signal is generated by a TB (transmission block).

[0313] As an example, the first PDCCH candidate and the second PDCCH candidate correspond to two repeated transmissions of the first DCI.

[0314] As an example, the frequency domain resources occupied by the first signal belong to multiple carriers.

[0315] As an example, step S710 is located after step S510 in Example 5.

[0316] As an example, step S720 is located after step S520 in Example 5.

[0317] Example 8

[0318] Example 8 illustrates a schematic diagram of a first PDCCH candidate and a second PDCCH candidate according to an embodiment of this application, as shown in the attached diagram. Figure 8 As shown. In the appendix Figure 8 In this configuration, the first PDCCH candidate belongs to a first search space set, which belongs to a first carrier; the second PDCCH candidate belongs to a second search space set, which belongs to a second carrier; and the first search space set and the second search space set are configured to be associated.

[0319] As an example, the first PDCCH candidate and the second PDCCH candidate are counted a total of 3 times.

[0320] As one embodiment, the first search space set and the second search space set are combined into a joint search space set.

[0321] As an example, the first search space set and the second search space set are not independently assigned PDCCH candidates and non-overlapping CCEs.

[0322] As an example, the first search space set and the second search space set are configured with the same number of PDCCH candidates.

[0323] As an example, the PDCCH candidates in the first search space set and the PDCCH candidates in the second search space set are in one-to-one correspondence.

[0324] As an example, the index of the first PDCCH candidate in all PDCCH candidates included in the first search space set is the same as the index of the second PDCCH candidate in all PDCCH candidates included in the second search space set.

[0325] As an example, both the first search space set and the second search space set are configured with M1 PDCCH candidates, where M1 is a positive integer greater than 1, and the joint search space set composed of the first search space set and the second search space set includes 3 times M1 PDCCH candidates.

[0326] As an example, both the first search space set and the second search space set are configured with M2 non-overlapping CCEs, where M2 is a positive integer greater than 1, and the joint search space set composed of the first search space set and the second search space set includes 3 times M2 of non-overlapping CCEs.

[0327] Example 9

[0328] Example 9 illustrates a schematic diagram of another first PDCCH candidate and a second PDCCH candidate according to an embodiment of this application, as shown in the attached diagram. Figure 9 As shown. In the appendix Figure 9 In this context, the first PDCCH candidate belongs to a first search space set, the second PDCCH candidate belongs to a second search space set, and both the first search space set and the second search space set belong to the same carrier; the first search space set and the second search space set are configured to be associated.

[0329] As an example, the first PDCCH candidate and the second PDCCH candidate are counted a total of 2 times.

[0330] As an example, the first PDCCH candidate and the second PDCCH candidate are counted together once.

[0331] As an example, the first PDCCH candidate and the second PDCCH candidate are each counted once.

[0332] As an example, the first PDCCH candidate is counted once, and the first PDCCH candidate and the second PDCCH candidate are jointly counted once.

[0333] As one embodiment, the first search space set and the second search space set are combined into a joint search space set.

[0334] As an example, the first search space set will be independently assigned PDCCH candidates and non-overlapping CCEs, while the second search space set will not be independently assigned PDCCH candidates and non-overlapping CCEs.

[0335] As an example, the first search space set is independently assigned PDCCH candidates and non-overlapping CCEs, and the second search space set is independently assigned PDCCH candidates and non-overlapping CCEs.

[0336] As an example, the first search space set and the second search space set are configured with the same number of PDCCH candidates.

[0337] As an example, the PDCCH candidates in the first search space set and the PDCCH candidates in the second search space set are in one-to-one correspondence.

[0338] As an example, the index of the first PDCCH candidate in all PDCCH candidates included in the first search space set is the same as the index of the second PDCCH candidate in all PDCCH candidates included in the second search space set.

[0339] As an example, both the first search space set and the second search space set are configured with M1 PDCCH candidates, where M1 is a positive integer greater than 1, and the first search space set and the second search space set together include 2 times M1 PDCCH candidates.

[0340] As one embodiment, both the first search space set and the second search space set are configured with M2 non-overlapping CCEs, where M2 is a positive integer greater than 1, and the first search space set and the second search space set together include 2 times M2 of non-overlapping CCEs.

[0341] Example 10

[0342] Example 10 illustrates a structural block diagram of a processing apparatus for a first node according to an embodiment of this application, as shown in the attached diagram. Figure 10 As shown. In the appendix Figure 10 In the first node, the processing device 1000 includes a first receiver 1001 and a first transceiver 1002.

[0343] First receiver 1001 receives first information block, the first information block indicating a first search space set and a second search space set;

[0344] In Example 10, the first search space set and the second search space set are associated; the first search space set includes a first PDCCH candidate, and the second search space set includes a second PDCCH candidate; the total number of times the first PDCCH candidate and the second PDCCH candidate are counted depends on whether the first PDCCH candidate and the second PDCCH candidate are located in two different carriers.

[0345] As an example, the first PDCCH candidate and the second PDCCH candidate carry the same DCI.

[0346] As an example, when the first PDCCH candidate and the second PDCCH candidate are located in two different carriers, the first PDCCH candidate and the second PDCCH candidate are counted a total of 3 times; when the first PDCCH candidate and the second PDCCH candidate are located in the same carrier, the first PDCCH candidate and the second PDCCH candidate are counted a total of 2 times.

[0347] As one embodiment, both the first search space set and the second search space set are set with a first index, which is used for the allocation of the maximum number of PDCCH candidates and the maximum number of non-overlapping CCEs for the first search space set and the second search space set.

[0348] As an example, the number of PDCCH candidates that the first node needs to monitor in a downlink active BWP of a scheduling cell is no greater than a first integer, the first integer depends on the equivalent number of scheduling cells of the first node, and the equivalent number of scheduling cells depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers respectively.

[0349] As an example, the first integer depends on the equivalent number of scheduled cells of the first node, which depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers.

[0350] As an example, the number of non-overlapping CCEs that the first node needs to monitor in a downlink active BWP of a scheduling cell is no greater than a second integer, the second integer depending on the equivalent number of scheduling cells of the first node, the equivalent number of scheduling cells depending on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers respectively.

[0351] As one embodiment, the second integer depends on the equivalent number of scheduled cells of the first node, which depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers.

[0352] As an example, the first receiver 1001 receives the first DCI, and the first transceiver 1002 receives the first signal; both the first PDCCH candidate and the second PDCCH candidate carry the first DCI, the first DCI schedules the first signal, and the first signal is mapped onto multiple carriers.

[0353] As one embodiment, the first receiver 1001 receives the first DCI, and the first transceiver 1002 transmits the first signal; both the first PDCCH candidate and the second PDCCH candidate carry the first DCI, the first DCI schedules the first signal, and the first signal is mapped onto multiple carriers.

[0354] As an example, the first node 1000 is a user equipment.

[0355] As an example, the first node 1000 is a Handset.

[0356] As an example, the first node 1000 is a terminal.

[0357] As an example, the first receiver 1001 includes at least one of the following in embodiment 4: the antenna 452, the receiver 454, the receiver processor 456, the multi-antenna receiver processor 458, the controller / processor 459, the memory 460, and the data source 467.

[0358] As an example, the first transceiver 1002 includes at least one of the following in embodiment 4: the antenna 452, the receiver / transmitter 454, the receiving processor 456, the transmitting processor 468, the multi-antenna receiving processor 458, the multi-antenna transmitting processor 457, the controller / processor 459, the memory 460, and the data source 467.

[0359] Example 11

[0360] Example 11 illustrates a structural block diagram of a processing apparatus for a second node according to an embodiment of this application, as shown in the attached diagram. Figure 11 As shown. In the appendix Figure 11 In the second node, the processing device 1100 includes a first transmitter 1101 and a second transceiver 1102.

[0361] The first transmitter 1101 transmits a first information block, the first information block indicating a first search space set and a second search space set;

[0362] In Example 11, the first search space set and the second search space set are associated; the first search space set includes a first PDCCH candidate, and the second search space set includes a second PDCCH candidate; the total number of times the first PDCCH candidate and the second PDCCH candidate are counted depends on whether the first PDCCH candidate and the second PDCCH candidate are located in two different carriers.

[0363] As an example, the first PDCCH candidate and the second PDCCH candidate carry the same DCI.

[0364] As an example, when the first PDCCH candidate and the second PDCCH candidate are located in two different carriers, the first PDCCH candidate and the second PDCCH candidate are counted a total of 3 times; when the first PDCCH candidate and the second PDCCH candidate are located in the same carrier, the first PDCCH candidate and the second PDCCH candidate are counted a total of 2 times.

[0365] As one embodiment, both the first search space set and the second search space set are set with a first index, which is used for the allocation of the maximum number of PDCCH candidates and the maximum number of non-overlapping CCEs for the first search space set and the second search space set.

[0366] As an example, the receiver of the first information block includes a first node, and the number of PDCCH candidates that the first node needs to monitor in a downlink active BWP of a scheduling cell is no greater than a first integer, the first integer depends on the equivalent number of scheduling cells of the first node, and the equivalent number of scheduling cells depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers respectively.

[0367] As an example, the first integer depends on the equivalent number of scheduled cells of the first node, which depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers.

[0368] As an example, the receiver of the first information block includes a first node, the number of non-overlapping CCEs that the first node needs to monitor in a downlink active BWP of a scheduling cell is no greater than a second integer, the second integer depends on the equivalent number of scheduling cells of the first node, the equivalent number of scheduling cells depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers respectively.

[0369] As one embodiment, the second integer depends on the equivalent number of scheduled cells of the first node, which depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers.

[0370] As one embodiment, the first transmitter 1101 transmits a first DCI, and the second transceiver 1102 transmits a first signal; both the first PDCCH candidate and the second PDCCH candidate carry the first DCI, the first DCI schedules the first signal, and the first signal is mapped onto multiple carriers.

[0371] As one embodiment, the first transmitter 1101 transmits a first DCI, and the second transceiver 1102 receives a first signal; both the first PDCCH candidate and the second PDCCH candidate carry the first DCI, the first DCI schedules the first signal, and the first signal is mapped onto multiple carriers.

[0372] As one embodiment, the second node 1100 is a base station device.

[0373] As one embodiment, the second node 1100 is a user equipment.

[0374] As an example, the second node 1100 is a TRP.

[0375] As an example, the first transmitter 1101 includes at least one of the following in embodiment 4: the antenna 420, the transmitter 418, the transmission processor 416, the multi-antenna transmission processor 471, the controller / processor 475, and the memory 476.

[0376] As one embodiment, the second transceiver 1102 includes at least one of the following in embodiment 4: the antenna 420, the transmitter / receiver 418, the receiving processor 470, the transmitting processor 416, the multi-antenna receiving processor 472, the multi-antenna transmitting processor 471, the controller / processor 475, and the memory 476.

[0377] Those skilled in the art will understand that all or part of the steps in the above methods can be implemented by a program instructing related hardware, and the program can be stored in a computer-readable storage medium, such as a read-only memory, hard disk, or optical disk. Optionally, all or part of the steps in the above embodiments can also be implemented using one or more integrated circuits. Correspondingly, each module unit in the above embodiments can be implemented in hardware or in the form of software functional modules. This application is not limited to any specific combination of software and hardware. The user equipment, terminal, and UE in this application include, but are not limited to, drones, communication modules on drones, remote-controlled aircraft, aircraft, small aircraft, mobile phones, tablets, laptops, vehicle-mounted communication equipment, vehicles, RSUs, wireless sensors, internet cards, IoT terminals, RFID (Radio Frequency Identification) terminals, NB-IoT (Narrow Band Internet of Things) terminals, MTC (Machine Type Communication) terminals, eMTC (enhanced MTC) terminals, data cards, internet cards, vehicle-mounted communication equipment, low-cost mobile phones, low-cost tablets, and other wireless communication devices. The base stations or system equipment in this application include, but are not limited to, macrocell base stations, microcell base stations, small cell base stations, home base stations, relay base stations, eNB (evolved Node B), gNB, TRP, GNSS (Global Navigation Satellite System), relay satellites, satellite base stations, airborne base stations, RSUs, unmanned aerial vehicles, and test equipment, such as transceivers or signaling testers that simulate some functions of a base station, and other wireless communication equipment.

[0378] Those skilled in the art will understand that the present invention can be practiced in other specified forms without departing from its core or essential characteristics. Therefore, the embodiments disclosed herein should in any way be considered descriptive rather than restrictive. The scope of the invention is defined by the appended claims rather than the foregoing description, and all modifications within their equivalent meaning and scope are considered to be included therein.

Claims

1. A first node used for multi-carrier transmission in wireless communication, characterized in that... include: A first receiver receives a first information block, the first information block indicating a first search space set and a second search space set; The first search space set and the second search space set are associated; the first search space set includes a first PDCCH candidate, and the second search space set includes a second PDCCH candidate; the total number of times the first PDCCH candidate and the second PDCCH candidate are counted depends on whether the first PDCCH candidate and the second PDCCH candidate are located in two different carriers.

2. The first node according to claim 1, characterized in that, When the first PDCCH candidate and the second PDCCH candidate are located in two different carriers, the first PDCCH candidate and the second PDCCH candidate are counted a total of 3 times; When the first PDCCH candidate and the second PDCCH candidate are located on the same carrier, the first PDCCH candidate and the second PDCCH candidate are counted a total of 2 times.

3. The first node according to claim 1 or 2, characterized in that, Both the first search space set and the second search space set are set with a first index, which is used for the allocation of the maximum number of PDCCH candidates and the maximum number of non-overlapping CCEs for the first search space set and the second search space set.

4. The first node according to any one of claims 1 to 3, characterized in that, The number of PDCCH candidates that the first node needs to monitor in a downlink active BWP of a scheduling cell is no greater than a first integer, which depends on the equivalent number of scheduling cells of the first node. The equivalent number of scheduling cells depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers.

5. The first node according to claim 4, characterized in that, The first integer depends on the equivalent number of scheduled cells of the first node, which depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers.

6. The first node according to any one of claims 1 to 5, characterized in that, The number of non-overlapping CCEs that the first node needs to monitor in a downlink active BWP of a scheduling cell is no greater than a second integer, which depends on the equivalent number of scheduling cells of the first node. The equivalent number of scheduling cells depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers.

7. The first node according to claim 6, characterized in that, The second integer depends on the equivalent number of scheduled cells of the first node, which depends on whether the first PDCCH candidate and the second PDCCH candidate are located on two different carriers.

8. The first node according to any one of claims 1 to 7, characterized in that... include: The first receiver receives the first DCI; The first transceiver receives the first signal or sends the first signal; Both the first PDCCH candidate and the second PDCCH candidate carry the first DCI, the first DCI schedules the first signal, and the first signal is mapped onto multiple carriers.

9. A second node used for multi-carrier transmission in wireless communication, characterized in that... include: A first transmitter sends a first information block, the first information block indicating a first search space set and a second search space set; The first search space set and the second search space set are associated; the first search space set includes a first PDCCH candidate, and the second search space set includes a second PDCCH candidate; the total number of times the first PDCCH candidate and the second PDCCH candidate are counted depends on whether the first PDCCH candidate and the second PDCCH candidate are located in two different carriers.

10. A method for a first node used in multi-carrier transmission for wireless communication, characterized in that... include: Receive a first information block, which indicates a first search space set and a second search space set; The first search space set and the second search space set are associated; the first search space set includes a first PDCCH candidate, and the second search space set includes a second PDCCH candidate; the total number of times the first PDCCH candidate and the second PDCCH candidate are counted depends on whether the first PDCCH candidate and the second PDCCH candidate are located in two different carriers.

11. A method for a second node used in multi-carrier transmission for wireless communication, characterized in that... include: Send a first information block, which indicates a first search space set and a second search space set; The first search space set and the second search space set are associated; the first search space set includes a first PDCCH candidate, and the second search space set includes a second PDCCH candidate; the total number of times the first PDCCH candidate and the second PDCCH candidate are counted depends on whether the first PDCCH candidate and the second PDCCH candidate are located in two different carriers.