Transmission method and apparatus, communication device, and readable storage medium

Abstract

The application discloses a transmission method, device, communication equipment and readable storage medium, and belongs to the wireless technical field. The transmission method comprises the following steps: a terminal receives at least two PDCCHs; the at least two PDCCHs satisfy at least one of the following conditions: the at least two PDCCHs are repeatedly transmitted PDCCHs, there is an association relationship between the search spaces corresponding to the at least two PDCCHs, the at least two PDCCHs schedule the same at least one PDSCH and / or PUSCH; the at least two PDCCHs comprise a first PDCCH and at least one second PDCCH; the bit sequence of the first PDCCH is scrambled by a first sequence related to the first PDCCH before modulation, and the generation of the first sequence related to the first PDCCH is related to a first parameter related to the first PDCCH; the bit sequence of the second PDCCH is scrambled by a first sequence related to the second PDCCH before modulation, and the generation of the first sequence related to the second PDCCH is related to a first parameter related to the second PDCCH; and the first parameters related to the first PDCCH and the second PDCCH are different. Therefore, the terminal can correctly understand the received PDCCH.

Description

Technical Field

[0001] This application belongs to the field of wireless technology, specifically relating to a transmission method, apparatus, communication device, and readable storage medium. Background Technology

[0002] Among related technologies, the Physical Downlink Control Channel (PDCCH) repetition technique across time slots is not supported. PDCCH repetition refers to two or more PDDCHs associating with the same PDSCH transmission resources. When some terminals that do not support PDCCH repetition receive multiple repetitive PDCCHs, it is possible that only the content scheduled by one PDCCH can be correctly demodulated and decoded, while the content scheduled by the remaining PDCCHs cannot be correctly received. In this situation, how to ensure that terminals supporting and / or not supporting PDCCH repetition correctly understand the received PDCCH is a pressing problem that needs to be solved. Summary of the Invention

[0003] The purpose of this application is to provide a transmission method, apparatus, communication device, and readable storage medium to solve the problem of how to enable a terminal to correctly demodulate the received PDCCH.

[0004] To solve the above-mentioned technical problems, this application is implemented as follows:

[0005] Firstly, a transmission method is provided for use in a terminal, including:

[0006] The terminal receives at least two Physical Downlink Control Channels (PDCCHs);

[0007] Wherein, the at least two PDCCHs satisfy at least one of the following: the at least two PDCCHs are repeatedly transmitted PDCCHs, there is an association between the search spaces corresponding to the at least two PDCCHs, and the at least two PDCCHs schedule at least one PDSCH and / or PUSCH that is the same;

[0008] The at least two PDCCHs include a first PDCCH and at least one second PDCCH;

[0009] The bit sequence of the first PDCCH is scrambled by a first sequence related to the first PDCCH before modulation, and the generation of the first sequence related to the first PDCCH is related to a first parameter related to the first PDCCH; the bit sequence of the second PDCCH is scrambled by a first sequence related to the second PDCCH before modulation, and the generation of the first sequence related to the second PDCCH is related to a first parameter related to the second PDCCH.

[0010] The first parameters associated with the first PDCCH and the second PDCCH are different.

[0011] Optionally, the association between the search spaces corresponding to the at least two PDCCHs includes at least one of the following:

[0012] The search spaces corresponding to at least two PDCCHs have a linking relationship;

[0013] The search space sets corresponding to the at least two PDCCHs are linked.

[0014] Optionally, the method further includes,

[0015] The terminal determines the time domain resources of at least one scheduled PDSCH and / or PUSCH based on the reception parameters of the first PDCCH.

[0016] Alternatively, the time-domain resources of the at least one PDSCH and / or PUSCH are at least related to the reception parameters of the first PDCCH.

[0017] Optionally, the at least two PDCCHs satisfy any of the following:

[0018] The at least two PDCCHs are located in different time units, and the first PDCCH is any one of the following among the at least two PDCCHs: the first PDCCH, the last PDCCH, and the kth PDCCH; wherein, k is configured by higher layer signaling;

[0019] The control resource set CORESET numbers associated with the at least two PDCCHs are all different, and the first PDCCH satisfies any of the following: the CORESET number associated with the first PDCCH is the smallest; the CORESET number associated with the first PDCCH is the largest; the first PDCCH is the PDCCH corresponding to the k-th CORESET number when the CORESET numbers associated with the at least two PDCCHs are sorted in ascending order; the first PDCCH is the PDCCH corresponding to the k-th CORESET number when the CORESET numbers associated with the at least two PDCCHs are sorted in descending order; wherein, k is configured by higher layer signaling.

[0020] The first PDCCH of the at least two PDCCHs satisfies any of the following: the first PDCCH is the earliest in time and has the smallest associated CORESET number; the first PDCCH is the earliest in time and has the largest associated CORESET number; the first PDCCH is the latest in time and has the smallest associated CORESET number; or the first PDCCH is the latest in time and has the largest associated CORESET number.

[0021] Optionally, the scrambling of the bit sequences of the first PDCCH and the second PDCCH satisfies the following:

[0022]

[0023] Where b(0), b(1), ..., b(M-1) represent the bit sequence before scrambling of the first PDCCH or the second PDCCH. This represents the scrambled bit sequence of the first PDCCH or the second PDCCH, and the Used for modulation; M represents the number of bits in the bit sequence of the first PDCCH or the second PDCCH;

[0024] c(i) represents the first sequence associated with the first PDCCH or the second PDCCH; the generator of c(i) is initialized by the first parameter associated with the first PDCCH or the second PDCCH.

[0025] Optionally, the first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas:

[0026]

[0027] Wherein, the second parameters related to the first PDCCH and the second PDCCH are different, and the third parameters related to the first PDCCH and the second PDCCH are the same; p1 and p2 are positive integers; p2≥p1; mod represents the modulo symbol.

[0028] Optionally, the second parameter related to the first PDCCH is determined according to a pre-agreed agreement or higher-level configuration, and / or the second parameter related to the second PDCCH is determined according to a pre-agreed agreement or higher-level configuration;

[0029] or,

[0030] The second parameter associated with the first PDCCH and the second PDCCH satisfies at least one of the following:

[0031] If the search space corresponding to the at least two PDCCHs is a common search space, then the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first radio network temporary identifier RNTI.

[0032] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0033] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to the first PDCCH is equal to the first RNTI, the second parameter related to the second PDCCH is not equal to the first RNTI, and the second parameter related to the second PDCCH is related to the first RNTI.

[0034] Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs.

[0035] Optionally, the second parameter related to the second PDCCH is related to the first RNTI and satisfies at least one of the following:

[0036] The second parameter is equal to the sum of the first RNTI and C1, where C1 is a non-zero integer;

[0037] The second parameter is equal to the first RNTI and sum.

[0038] Optionally, the first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas:

[0039]

[0040] Wherein, at least one of the second and fourth parameters related to the first PDCCH and the second PDCCH is different, and the third parameter related to the first PDCCH and the second PDCCH is the same; p1 and p2 are positive integers; p2≥p1; mod represents the modulo symbol.

[0041] Optionally, the second and / or fourth parameters related to the first PDCCH are determined according to a pre-agreed agreement or higher-level configuration, and / or the second and / or fourth parameters related to the second PDCCH are determined according to a pre-agreed agreement or higher-level configuration;

[0042] or,

[0043] The second and fourth parameters related to the first and second PDCCHs satisfy at least one of the following:

[0044] If the search spaces corresponding to the at least two PDCCHs are common search spaces, then the fourth parameters related to the first PDCCH and the second PDCCH are both equal to 0, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0045] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the fourth parameter related to the first PDCCH and the second PDCCH is equal to 0, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0046] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to the first PDCCH and the second PDCCH is equal to the first RNTI, and the fourth parameter related to the first PDCCH is equal to 0, and the fourth parameter related to the second PDCCH is equal to 1.

[0047] Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs.

[0048] Optionally, the first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas:

[0049]

[0050] Wherein, at least one of the second and third parameters related to the first PDCCH and the second PDCCH is different; p1 and p2 are positive integers; mod represents the modulo sign.

[0051] Optionally, the second and / or third parameters related to the first PDCCH are determined according to a pre-agreed agreement or higher-level configuration, and / or the second and / or third parameters related to the second PDCCH are determined according to a pre-agreed agreement or higher-level configuration;

[0052] or,

[0053] The second and third parameters related to the first and second PDCCHs satisfy at least one of the following:

[0054] If the search spaces corresponding to the at least two PDCCHs are common search spaces, then the third parameters related to the first PDCCH and the second PDCCH are both equal to the fifth parameter, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI;

[0055] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the third parameter related to the first PDCCH and the second PDCCH is equal to the fifth parameter, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0056] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to both the first PDCCH and the second PDCCH is equal to the first RNTI, and the third parameter related to the first PDCCH is equal to the fifth parameter, and the third parameter related to the second PDCCH is equal to the fifth parameter. sum;

[0057] Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs; the fifth parameter is configured by a higher layer, or the fifth parameter is equal to the identifier ID of the cell where the terminal is located.

[0058] Optionally, the first high-level parameter is the pdcch-DMRS-ScramblingID parameter;

[0059] And / or,

[0060] The first RNTI satisfies at least one of the following:

[0061] If the search space corresponding to the at least two PDCCHs is a Type 0 common search space, then the first RNTI is the System Information Radio Network Temporary Identifier SI-RNTI;

[0062] If the search space corresponding to the at least two PDCCHs is a Type0A common search space, then the first RNTI is a SI-RNTI;

[0063] If the search space corresponding to the at least two PDCCHs is a Type 1 common search space, then the first RNTI is any one of the following: Random Access Radio Network Temporary Identifier RA-RNTI, Message B Radio Network Temporary Identifier MsgB-RNTI, Temporary Cell Radio Network Temporary Identifier TC-RNTI;

[0064] If the search space corresponding to the at least two PDCCHs is a Type 2 common search space, then the first RNTI is a paging radio network temporary identifier (P-RNTI).

[0065] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, then the first RNTI is a C-RNTI.

[0066] Optionally, the at least two PDCCHs satisfy at least one of the following:

[0067] The search spaces corresponding to at least two PDCCHs have the same search space set type;

[0068] The search spaces corresponding to the at least two PDCCHs have the same DCI format;

[0069] The search spaces corresponding to the at least two PDCCHs have the same length;

[0070] The search spaces corresponding to the at least two PDCCHs have the same listening opportunity in the next time unit;

[0071] The nth listening opportunity of the search space corresponding to the at least two PDCCHs is related, where n is a positive integer.

[0072] Secondly, a transmission method is provided, applied to network-side devices, including:

[0073] The network-side device sends at least two PDCCHs to the terminal;

[0074] Wherein, the at least two PDCCHs satisfy at least one of the following: the at least two PDCCHs are repeatedly transmitted PDCCHs, there is an association between the search spaces corresponding to the at least two PDCCHs, and the at least two PDCCHs schedule at least one PDSCH and / or PUSCH that is the same;

[0075] The at least two PDCCHs include a first PDCCH and at least one second PDCCH;

[0076] The bit sequence of the first PDCCH is scrambled by a first sequence related to the first PDCCH before modulation, and the generation of the first sequence related to the first PDCCH is related to a first parameter related to the first PDCCH; the bit sequence of the second PDCCH is scrambled by a first sequence related to the second PDCCH before modulation, and the generation of the first sequence related to the second PDCCH is related to a first parameter related to the second PDCCH.

[0077] The first parameters associated with the first PDCCH and the second PDCCH are different.

[0078] Optionally, the association between the search spaces corresponding to the at least two PDCCHs includes at least one of the following:

[0079] The search spaces corresponding to at least two PDCCHs have a linking relationship;

[0080] The search space sets corresponding to the at least two PDCCHs are linked.

[0081] Optionally, the method further includes,

[0082] The terminal determines the time domain resources of at least one scheduled PDSCH and / or PUSCH based on the reception parameters of the first PDCCH.

[0083] Alternatively, the time-domain resources of the at least one PDSCH and / or PUSCH are at least related to the reception parameters of the first PDCCH.

[0084] Optionally, the at least two PDCCHs satisfy any of the following:

[0085] The at least two PDCCHs are located in different time units, and the first PDCCH is any one of the following among the at least two PDCCHs: the first PDCCH, the last PDCCH, and the kth PDCCH; wherein, k is configured by higher layer signaling;

[0086] The control resource set CORESET numbers associated with the at least two PDCCHs are all different, and the first PDCCH satisfies any of the following: the CORESET number associated with the first PDCCH is the smallest; the CORESET number associated with the first PDCCH is the largest; the first PDCCH is the PDCCH corresponding to the k-th CORESET number when the CORESET numbers associated with the at least two PDCCHs are sorted in ascending order; the first PDCCH is the PDCCH corresponding to the k-th CORESET number when the CORESET numbers associated with the at least two PDCCHs are sorted in descending order; wherein, k is configured by higher layer signaling.

[0087] The first PDCCH of the at least two PDCCHs satisfies any of the following: the first PDCCH is the earliest in time and has the smallest associated CORESET number; the first PDCCH is the earliest in time and has the largest associated CORESET number; the first PDCCH is the latest in time and has the smallest associated CORESET number; or the first PDCCH is the latest in time and has the largest associated CORESET number.

[0088] Optionally, the scrambling of the bit sequences of the first PDCCH and the second PDCCH satisfies the following:

[0089]

[0090] Where b(0), b(1), ..., b(M-1) represent the bit sequence before scrambling of the first PDCCH or the second PDCCH. This represents the scrambled bit sequence of the first PDCCH or the second PDCCH, and the Used for modulation; M represents the number of bits in the bit sequence of the first PDCCH or the second PDCCH;

[0091] c(i) represents the first sequence associated with the first PDCCH or the second PDCCH; the generator of c(i) is initialized by the first parameter associated with the first PDCCH or the second PDCCH.

[0092] Optionally, the first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas:

[0093]

[0094] Wherein, the second parameters related to the first PDCCH and the second PDCCH are different, and the third parameters related to the first PDCCH and the second PDCCH are the same; p1 and p2 are positive integers; p2≥p1; mod represents the modulo symbol.

[0095] Optionally, the second parameter related to the first PDCCH is determined according to a pre-agreed agreement or higher-level configuration, and / or the second parameter related to the second PDCCH is determined according to a pre-agreed agreement or higher-level configuration;

[0096] or,

[0097] The second parameter associated with the first PDCCH and the second PDCCH satisfies at least one of the following:

[0098] If the search space corresponding to the at least two PDCCHs is a common search space, then the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first radio network temporary identifier RNTI.

[0099] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0100] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to the first PDCCH is equal to the first RNTI, the second parameter related to the second PDCCH is not equal to the first RNTI, and the second parameter related to the second PDCCH is related to the first RNTI.

[0101] Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs.

[0102] Optionally, the second parameter related to the second PDCCH is related to the first RNTI and satisfies at least one of the following:

[0103] The second parameter is equal to the sum of the first RNTI and C1, where C1 is a non-zero integer;

[0104] The second parameter is equal to the first RNTI and sum.

[0105] Optionally, the first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas:

[0106]

[0107] Wherein, at least one of the second and fourth parameters related to the first PDCCH and the second PDCCH is different, and the third parameter related to the first PDCCH and the second PDCCH is the same; p1 and p2 are positive integers; p2≥p1; mod represents the modulo symbol.

[0108] Optionally, the second and / or fourth parameters related to the first PDCCH are determined according to a pre-agreed agreement or higher-level configuration, and / or the second and / or fourth parameters related to the second PDCCH are determined according to a pre-agreed agreement or higher-level configuration;

[0109] or,

[0110] The second and fourth parameters related to the first and second PDCCHs satisfy at least one of the following:

[0111] If the search spaces corresponding to the at least two PDCCHs are common search spaces, then the fourth parameters related to the first PDCCH and the second PDCCH are both equal to 0, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0112] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the fourth parameter related to the first PDCCH and the second PDCCH is equal to 0, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0113] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to the first PDCCH and the second PDCCH is equal to the first RNTI, and the fourth parameter related to the first PDCCH is equal to 0, and the fourth parameter related to the second PDCCH is equal to 1.

[0114] Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs.

[0115] Optionally, the first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas:

[0116]

[0117] Wherein, at least one of the second and third parameters related to the first PDCCH and the second PDCCH is different; p1 and p2 are positive integers; mod represents the modulo sign.

[0118] Optionally, the second and / or third parameters related to the first PDCCH are determined according to a pre-agreed agreement or higher-level configuration, and / or the second and / or third parameters related to the second PDCCH are determined according to a pre-agreed agreement or higher-level configuration;

[0119] or,

[0120] The second and third parameters related to the first and second PDCCHs satisfy at least one of the following:

[0121] If the search spaces corresponding to the at least two PDCCHs are common search spaces, then the third parameters related to the first PDCCH and the second PDCCH are both equal to the fifth parameter, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI;

[0122] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the third parameter related to the first PDCCH and the second PDCCH is equal to the fifth parameter, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0123] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to both the first PDCCH and the second PDCCH is equal to the first RNTI, and the third parameter related to the first PDCCH is equal to the fifth parameter, and the third parameter related to the second PDCCH is equal to the fifth parameter. sum;

[0124] Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs; the fifth parameter is configured by a higher layer, or the fifth parameter is equal to the identifier ID of the cell where the terminal is located.

[0125] Optionally, the first high-level parameter is the pdcch-DMRS-ScramblingID parameter;

[0126] And / or,

[0127] The first RNTI satisfies at least one of the following:

[0128] If the search space corresponding to the at least two PDCCHs is a Type 0 common search space, then the first RNTI is the System Information Radio Network Temporary Identifier SI-RNTI;

[0129] If the search space corresponding to the at least two PDCCHs is a Type0A common search space, then the first RNTI is a SI-RNTI;

[0130] If the search space corresponding to the at least two PDCCHs is a Type 1 common search space, then the first RNTI is any one of the following: Random Access Radio Network Temporary Identifier RA-RNTI, Message B Radio Network Temporary Identifier MsgB-RNTI, Temporary Cell Radio Network Temporary Identifier TC-RNTI;

[0131] If the search space corresponding to the at least two PDCCHs is a Type 2 common search space, then the first RNTI is a paging radio network temporary identifier (P-RNTI).

[0132] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, then the first RNTI is a C-RNTI.

[0133] Optionally, the at least two PDCCHs satisfy at least one of the following:

[0134] The search spaces corresponding to at least two PDCCHs have the same search space set type;

[0135] The search spaces corresponding to the at least two PDCCHs have the same DCI format;

[0136] The search spaces corresponding to the at least two PDCCHs have the same length;

[0137] The search spaces corresponding to the at least two PDCCHs have the same listening opportunity in the next time unit;

[0138] The nth listening opportunity of the search space corresponding to the at least two PDCCHs is related, where n is a positive integer.

[0139] Thirdly, a transmission device is provided for use in a terminal, comprising:

[0140] The receiving module is used to receive at least two PDCCHs;

[0141] Wherein, the at least two PDCCHs satisfy at least one of the following: the at least two PDCCHs are repeatedly transmitted PDCCHs, there is an association between the search spaces corresponding to the at least two PDCCHs, and the at least two PDCCHs schedule at least one PDSCH and / or PUSCH that is the same;

[0142] The at least two PDCCHs include a first PDCCH and at least one second PDCCH;

[0143] The bit sequence of the first PDCCH is scrambled by a first sequence related to the first PDCCH before modulation, and the generation of the first sequence related to the first PDCCH is related to a first parameter related to the first PDCCH; the bit sequence of the second PDCCH is scrambled by a first sequence related to the second PDCCH before modulation, and the generation of the first sequence related to the second PDCCH is related to a first parameter related to the second PDCCH.

[0144] The first parameters associated with the first PDCCH and the second PDCCH are different.

[0145] Fourthly, a transmission device is provided for use in network-side equipment, comprising:

[0146] The sending module is used to send at least two PDCCHs to the terminal;

[0147] Wherein, the at least two PDCCHs satisfy at least one of the following: the at least two PDCCHs are repeatedly transmitted PDCCHs, there is an association between the search spaces corresponding to the at least two PDCCHs, and the at least two PDCCHs schedule at least one PDSCH and / or PUSCH that is the same;

[0148] The at least two PDCCHs include a first PDCCH and at least one second PDCCH;

[0149] The bit sequence of the first PDCCH is scrambled by a first sequence related to the first PDCCH before modulation, and the generation of the first sequence related to the first PDCCH is related to a first parameter related to the first PDCCH; the bit sequence of the second PDCCH is scrambled by a first sequence related to the second PDCCH before modulation, and the generation of the first sequence related to the second PDCCH is related to a first parameter related to the second PDCCH.

[0150] The first parameters associated with the first PDCCH and the second PDCCH are different.

[0151] Fifthly, a communication device is provided, including a processor, a memory, and a program or instructions stored in the memory and executable on the processor, wherein the program or instructions, when executed by the processor, implement the steps of the method described in the first aspect, or the steps of the method described in the second aspect.

[0152] In a sixth aspect, a readable storage medium is provided, on which a program or instructions are stored, which, when executed by a processor, implement the steps of the method described in the first aspect, or the steps of the method described in the second aspect.

[0153] In a seventh aspect, a computer program product is provided, including computer instructions that, when executed by a processor, implement the steps of the method described in the first aspect, or the steps of the method described in the second aspect.

[0154] The solution implemented in this application allows for the scrambling of the first and second PDCCHs using different scrambling sequences when receiving at least two PDCCHs, enabling the terminal to correctly understand the received PDCCHs. Specifically, new terminals that support the PDCCH retransmission protected in this application (referred to as first-type new terminals) can correctly distinguish and parse the first and second PDCCHs. However, for older terminals (legacy UEs) or new terminals that do not support the PDCCH retransmission protected in this application (referred to as second-type new terminals, such as terminals with weaker capabilities), the protocol stipulates that they can only correctly parse the first PDCCH, but not the second PDCCH. Attached Figure Description

[0155] Figure 1 This is a schematic diagram of a PDCCH that is repeatedly transmitted between time slots in an embodiment of this application;

[0156] Figure 2 This is a flowchart of a transmission method provided in an embodiment of this application;

[0157] Figure 3 This is a flowchart of another transmission method provided in an embodiment of this application;

[0158] Figure 4 This is a schematic diagram of the structure of a transmission device provided in an embodiment of this application;

[0159] Figure 5 This is a schematic diagram of another transmission device provided in an embodiment of this application;

[0160] Figure 6 This is a schematic diagram of the structure of a communication device provided in an embodiment of this application. Detailed Implementation

[0161] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0162] The terms "first," "second," etc., used in the specification and claims of this application are used to distinguish similar objects and not to describe a specific order or sequence. It should be understood that such use of data can be interchanged where appropriate so that embodiments of this application can be implemented in orders other than those illustrated or described herein, and the objects distinguished by "first," "second," etc., are generally of the same class and the number of objects is not limited; for example, a first object can be one or more. Furthermore, in the specification and claims, "and / or" indicates at least one of the connected objects, and the character " / " generally indicates that the preceding and following objects are in an "or" relationship.

[0163] In some embodiments, the terminal device may be referred to as User Equipment (UE). This terminal device can be a Personal Communication Service (PCS) telephone, cordless phone, Session Initiation Protocol (SIP) phone, Wireless Local Loop (WLL) station, Personal Digital Assistant (PDA), etc. It can also be a smartphone, tablet, PDA, Mobile Station (MS), Mobile Terminal, etc. The terminal device can communicate with one or more network devices via a Radio Access Network (RAN). For example, the terminal device can be a mobile phone (or "cellular" phone) or a computer with a terminal device. It can also be a portable, pocket-sized, handheld, computer-embedded, or vehicle-mounted mobile device that exchanges voice and / or data with the radio access network. Terminal devices can also be handheld devices with wireless communication capabilities, computing devices or other processing devices connected to a wireless modem, vehicle-mounted devices, wearable devices, drone devices, satellite terminals, terminal devices in future evolved networks, etc., and the implementation of this application is not limited.

[0164] Network equipment is a device that provides wireless communication functions for terminal devices, including but not limited to: evolved Node Bs (eNBs or e-NodeBs), macro base stations, micro base stations (also known as "small base stations"), pico base stations, base transceiver stations (BTSs), base band units (BBUs), access points (APs), transmission points (TPs), low-altitude base stations, satellite base stations, satellites, or new generation Node Bs (gNodeBs), as well as future 6G network equipment, etc., which are not limited in implementation in this application.

[0165] Optionally, the scenarios applicable to the embodiments of this application include, but are not limited to, terrestrial network scenarios, multi-TRP scenarios, and non-terrestrial network (NTN) scenarios.

[0166] To facilitate understanding of the embodiments of this application, the following will be described first.

[0167] To improve the performance of cell edge users and provide a more balanced quality of service within the coverage area, a multi-transmission reception point (TRP) cooperative transmission scheme has been introduced into communication systems. Multi-TRP cooperative transmission uses multiple TRPs to perform non-coherent joint transmission (NC-JT), repetitive transmission / reception, or single-frequency network (SFN) transmission. This can improve both the throughput and transmission reliability of edge users, thereby better supporting enhanced mobile broadband (eMBB) services and ultra-reliable low-latency communications (URLLC) services.

[0168] Multi-TRP technology introduces a PDCCH repetition function. A PDCCH repetition is defined by an explicit link between two search space sets. The two linked search space sets can be associated with control resource sets (CORESETs) with different Transmission Configuration Indicator (TCI) states, thereby achieving beam diversity in PDCCH transmission. Related technologies only support PDCCH repetition within time slots, and only support PDCCH repetition within the UE-specific Search Space (USS) or Type 3 Common Search Space (CSS). Furthermore, by restricting the configuration of the two linked search space sets, a one-to-one mapping can be achieved between listening occasions and between candidate PDCCHs of the two linked search space sets. The two linked PDCCH candidates have the same aggregation level, the same coded bits, and the same Downlink Control Information (DCI) payload.

[0169] The intra-slot PDCCH repetition method for multi-TRP cooperative transmission has the following problems:

[0170] - Halved PDCCH candidate number: In existing technologies, regardless of whether PDCCH repetition technology is used, the maximum number of blind detections of PDCCH candidates supported per serving cell per time slot is the same. Compared to not using PDCCH repetition technology, since two repeatedly transmitted PDCCHs carry the same payload, the actual number of PDCCH candidates that a UE can listen to in a time slot is halved after using PDCCH repetition technology, severely reducing scheduling flexibility;

[0171] - Control Channel Element (CCE) Number Halved: Similar to PDCCH candidate, in existing technologies, regardless of whether PDCCH repetition technology is used, the maximum number of blind detections of CCEs supported per time slot per serving cell is the same. Compared to not using PDCCH repetition technology, since two repeatedly transmitted PDCCHs carry the same payload, using PDCCH repetition technology halves the actual number of PDCCH CCEs that the UE can listen to in a time slot, severely reducing scheduling flexibility.

[0172] To address the aforementioned issues with intra-slot PDCCH repetition, this paper proposes a method for PDCCH repetition between different time units, where multiple repeatedly transmitted PDCCHs are located in different time units. These time units include, but are not limited to, time slots, subframes, and symbol sets. For example, a typical embodiment uses a time slot as the time unit; therefore, the PDCCH repetition between different time units is termed inter-slot PDCCH repetition.

[0173] However, there may be backward compatibility issues with PDCCH repetition between different time units. That is, when some terminals, such as traditional terminals, receive multiple PDCCHs that are repeatedly transmitted, only the content scheduled by one PDCCH can be correctly demodulated and decoded, while the content scheduled by the remaining PDCCHs cannot be correctly received.

[0174] Note that inter-slot PDCCH repetition can support two or more PDCCH repetitions; that is, if the number of repetitions of a PDCCH repetition is M, then M≥2. A PDCCH repetition can schedule one PDSCH / PUSCH transmission or multiple PDSCH / PUSCH transmissions (i.e., a PDCCH repetition can schedule PDSCH / PUSCH repetitions).

[0175] The following section uses inter-slot PDCCH repetition as an example to detail the backward compatibility issues of PDCCH repetition between different time units. For simplicity, in... Figure 1The illustrated embodiment only demonstrates the case of two inter-slot PDCCH repetitions, where the two repeated PDCCHs only schedule one PDSCH transmission. Figure 1 As shown in (a) and (b), the two PDCCHs that are transmitted repeatedly, namely rep#1 and rep#2, are located in slot n and slot n+1, respectively, and the two PDCCHs are scheduled to use the same Physical Downlink Shared Channel (PDSCH).

[0176] In existing technology, the PDSCH scheduled by the PDCCH is located in time slot K based on the time slot n where the PDCCH (or DCI) is located, and the parameter K0 determined by the DCI indication or higher-layer configuration. S ,in,

[0177] If the UE is configured with the higher-layer parameter ca-SlotOffset, then,

[0178]

[0179] otherwise,

[0180] Where, μ PDSCH and μ PDCCH These are the subcarrier spacing configurations for PDSCH and PDCCH, respectively. μ offset,PDCCH μ offset,PDSCH All of these are determined based on high-level parameters.

[0181] Similarly, based on the time slot n where the PDCCH (or DCI) is located, and parameter K2 determined according to the DCI indication or higher-layer configuration, the PUSCH scheduled by the PDCCH is located in time slot K. S ,in,

[0182] If the UE is configured with the higher-layer parameter ca-SlotOffset, then,

[0183]

[0184] otherwise,

[0185] Where, μ PUSCH and μ PDCCH These are the subcarrier spacing configurations for PUSCH and PDCCH, respectively. μ offset,PDCCH μ offset,PUSCH All of these are determined based on high-level parameters.

[0186] Since the DCI content in all M inter-slot PDCCH repetitions needs to be identical, the K0 or K2 values ​​in the M DCIs must remain consistent. However, because different PDCCHs (or DCIs) reside in different time slots (n), the time slots of the PDCCH / PUSCH scheduled by the M DCIs will also be different according to existing technology. This is clearly inconsistent with the purpose of PDCCH repetitions, which can schedule one or more identical PDSCH / PUSCH transmissions.

[0187] Therefore, for inter-slot PDCCH repetition, the method for determining the time-domain resources of PDSCH / PUSCH needs to be enhanced. This application proposes that "the at least two PDCCHs include a first PDCCH and at least one second PDCCH," and that "the terminal determines the time-domain resources of at least one scheduled PDSCH and / or PUSCH based at least on the reception parameters of the first PDCCH; or, the time-domain resources of the at least one scheduled PDSCH and / or PUSCH are at least related to the reception parameters of the first PDCCH." In short, the first PDCCH can be understood as a reference PDCCH, and the UE supporting PDCCH repetition determines the time-slot resources of the PDSCH / PUSCH scheduled for the PDCCH repetition based on the reception time slot n of the reference PDCCH.

[0188] exist Figure 1 In (a), a UE supporting PDCCH repetition interprets the first PDCCH in a PDCCH repetition as the reference PDCCH (i.e., the first PDCCH); while Figure 1 In (b), a UE that supports PDCCH repetition understands the last PDCCH in a PDCCH repetition as the reference PDCCH (i.e., the first PDCCH). Therefore, for a UE that supports PDCCH repetition, regardless of which PDCCH in multiple PDCCH repetitions is used as the reference PDCCH, as long as the terminal and the base station have a consistent understanding of the reference PDCCH, the PDCCH repetition can correctly schedule PDSCH / PUSCH.

[0189] However, for legacy UEs that do not support inter-slot PDCCH repetition, the M PDCCH repetitions are identical. Therefore, a legacy UE may attempt to listen to M PDCCHs and, based on the time slot n of the M listened PDCCHs and the K0 indicated by the PDCCHs, determine the location in the M time slots Ks (e.g., ...). Listening to PDSCH in )

[0190] But if Figure 1 As shown in (a) and (b), regardless of which PDCCH is the reference PDCCH, the base station will only transmit the PDSCH in one time slot. Therefore, for legacy UEs, there will be a situation where only the PDSCH scheduled by one PDCCH can be correctly demodulated and decoded, while the PDSCHs scheduled by the remaining PDCCHs cannot be correctly received (because the base station did not transmit them at all). Since legacy UEs do not understand the inter-slot PDCCH repetition technology, the above situation will lead to abnormal behavior of legacy UEs, and may even cause the terminal to fail to communicate correctly.

[0191] The transmission method, apparatus, communication device, and readable storage medium provided in this application will be described in detail below with reference to the accompanying drawings and through specific embodiments and application scenarios.

[0192] Please see Figure 2 , Figure 2 This is a flowchart of a transmission method provided in an embodiment of this application. This method is applied to a terminal, such as... Figure 2 As shown, the method includes the following steps:

[0193] Step 21: The terminal receives at least two PDCCHs.

[0194] Wherein, the at least two PDCCHs satisfy at least one of the following: the at least two PDCCHs are repeatedly transmitted PDCCHs, there is an association between the search spaces corresponding to the at least two PDCCHs, and the at least two PDCCHs schedule at least one physical downlink shared channel (PDSCH) and / or physical uplink shared channel (PUSCH) that are the same;

[0195] The at least two PDCCHs include a first PDCCH and at least one second PDCCH;

[0196] The bit sequence of the first PDCCH is scrambled by a first sequence related to the first PDCCH before modulation, and the generation of the first sequence related to the first PDCCH is related to a first parameter related to the first PDCCH; the bit sequence of the second PDCCH is scrambled by a first sequence related to the second PDCCH before modulation, and the generation of the first sequence related to the second PDCCH is related to a first parameter related to the second PDCCH.

[0197] The first parameters associated with the first PDCCH and the second PDCCH are different.

[0198] In this embodiment of the application, the at least two PDCCHs can satisfy at least one of the following: the at least two PDCCHs are repeatedly transmitted PDCCHs, there is an association between the search spaces corresponding to the at least two PDCCHs, and the at least two PDCCHs schedule at least one PDSCH and / or Physical Uplink Shared Channel (PUSCH) that are the same.

[0199] Optionally, the search spaces corresponding to the at least two PDCCHs are associated with each other, which may include at least one of the following: the search spaces corresponding to the at least two PDCCHs are linked; the search space set corresponding to the at least two PDCCHs is linked.

[0200] Optionally, the at least one PDSCH and / or PUSCH that is scheduled the same by the at least two PDCCHs may include at least one of the following: a PDSCH that is scheduled the same by the at least two PDCCHs; a PUSCH that is scheduled the same by the at least two PDCCHs; multiple PDSCHs that are scheduled the same by the at least two PDCCHs (such as including PDSCH repetition and / or multiple PDSCHs); multiple PUSCHs that are scheduled the same by the at least two PDCCHs (such as including PUSCH repetition and / or multiple PUSCHs).

[0201] Optionally, the at least two PDCCHs include a first PDCCH and at least one second PDCCH; wherein, the bit sequence of the first PDCCH is scrambled with a first sequence associated with the first PDCCH before modulation, and the generation of the first sequence associated with the first PDCCH is related to a first parameter associated with the first PDCCH; the bit sequence of the second PDCCH is scrambled with a first sequence associated with the second PDCCH before modulation, and the generation of the first sequence associated with the second PDCCH is related to a first parameter associated with the second PDCCH; the first parameters associated with the first PDCCH and the second PDCCH are different. That is, the first PDCCH and the second PDCCH use different scrambling methods during the encoding process.

[0202] Optionally, after receiving at least two PDCCHs, the terminal may determine the time-domain resources of at least one scheduled PDSCH and / or PUSCH based at least on the reception parameters of the first PDCCH; or, the time-domain resources of the at least one scheduled PDSCH and / or PUSCH are at least related to the reception parameters of the first PDCCH.

[0203] In some embodiments, the first PDCCH is referred to as the reference PDCCH, or the DCI carried in the first PDCCH is referred to as the reference DCI. Correspondingly, the second PDCCH is not the reference PDCCH, or the DCI carried in the second PDCCH is not the reference DCI.

[0204] After receiving at least two PDCCHs, the terminal determines the time-domain resources of one or more scheduled PDSCHs and / or PUSCHs based at least on the reception parameters of the first PDCCH (i.e., the reference PDCCH). This relationship can also be expressed as follows: the time-domain resources of the one or more scheduled PDSCHs and / or PUSCHs are at least related to the reception parameters of the first PDCCH (i.e., the reference PDCCH).

[0205] Therefore, in some embodiments, the reference PDCCH refers to the PDCCH that can be used to determine the starting time unit (e.g., time slot) of the PDSCH / PUSCH that it schedules.

[0206] In some embodiments, the reception parameter of the first PDCCH is the time slot n where the first PDCCH is located, or the time slot n where the DCI carried by the first PDCCH is located. The terminal determines the time-domain resources of one or more scheduled PDSCHs and / or PUSCHs based on the reception parameter of the first PDCCH (such as the time slot n where the first PDCCH is located), combined with other parameters of the DCI indication or higher-layer configuration. The time-domain resources of the one or more PDSCHs and / or PUSCHs may include at least one of the following: the time slot K where the scheduled PDSCH and / or PUSCH is located. S The time slot K where the first PDSCH and / or PUSCH of the at least two scheduled PDSCHs and / or PUSCHs is located. S .

[0207] For example, the terminal determines the temporal resources (such as time slot K) of one or more scheduled PDSCHs and / or PUSCHs based on at least the reception parameters of the first PDCCH (such as the time slot n where the first PDCCH is located, or the time slot n where the DCI carried by the first PDCCH is located) according to any of the following methods. S ): Among them, one or more of the parameters or variables K, α, and β are determined according to pre-agreed upon, DCI instructions, and / or higher-level configuration. In some embodiments, K is also referred to as K0 for PDSCH scheduling and K2 for PUSCH scheduling.

[0208] It should be noted that the first sequence can be understood as a scrambling sequence, and the first parameter can be understood as a parameter related to the scrambling sequence.

[0209] According to the scheme of this application embodiment, when receiving at least two PDCCHs, different scrambling sequences can be used to scramble the first PDCCH and the second PDCCH. For new terminals that support the PDCCH retransmission protected in this application (which can be referred to as first-type new terminals), they can correctly distinguish and parse the first PDCCH and the second PDCCH. However, for old terminals (legacy UEs), or new terminals that do not support the PDCCH retransmission protected in this application (which can be referred to as second-type new terminals, such as terminals with weaker capabilities), the protocol stipulates that they can only correctly parse the first PDCCH, but cannot parse the second PDCCH. Note that there is only one first PDCCH, and the time domain resources of one or more scheduled PDSCHs and / or PUSCHs can be determined based on the reception parameters of the first PDCCH; while there are one or more second PDCCHs, and the time domain resources of one or more scheduled PDSCHs and / or PUSCHs cannot be determined based on the reception parameters of the second PDCCH. Therefore, by restricting legacy UEs or newer UEs to only parse the first PDCCH and not the second, these UEs can obtain scheduled PDSCH / PUSCH resources through correct parsing of the first PDCCH while avoiding abnormal terminal behavior caused by erroneously receiving the second PDCCH. For example, if a terminal erroneously receives the second PDCCH, it will determine the transmission slots for the PDSCH / PUSCH based on the reception parameters of the second PDCCH and attempt to receive the PDSCH / PUSCH in these slots. However, the base station does not actually transmit the PDSCH / PUSCH in these slots, leading to abnormal terminal behavior.

[0210] For example, taking the terminal as a legacy terminal, the solution of this application embodiment can use a process consistent with the PDCCH generation process of the legacy terminal to generate the first PDCCH, so that the legacy terminal can obtain the PDSCH / PUSCH scheduled by it according to the indication carried by the first PDCCH; at the same time, a process inconsistent with the PDCCH generation process of the legacy terminal is used to generate the second PDCCH. In this case, the legacy terminal will not parse the second PDCCH, thereby avoiding affecting the behavior of the legacy terminal and enabling the legacy terminal to correctly demodulate the received PDCCH.

[0211] In this embodiment, the at least two PDCCHs can have different forms. The at least two PDCCHs can satisfy any of the following:

[0212] (1) The at least two PDCCHs are located in different time units, and the first PDCCH is any one of the following among the at least two PDCCHs: the first PDCCH, the last PDCCH, and the kth PDCCH; the k is configured by higher layer signaling; the time unit includes, but is not limited to, time units such as slot, frame, and subframe;

[0213] Each of the above options has its own advantages and disadvantages:

[0214] In the first scenario, "the first PDCCH is the first of the at least two PDCCHs," the advantage is that when the channel quality is good, the terminal can correctly demodulate and decode the DCI payload (such as K, including K0 and K2) it carries upon receiving the first PDCCH (i.e., the first PDCCH). Furthermore, by combining the reception parameters of the first PDCCH (such as the time slot n where the first PDCCH is located), the terminal can immediately determine the time domain resources of the scheduled PDSCH / PUSCH (such as the starting time slot K of the PDSCH / PUSCH). S This facilitates the terminal in optimizing the PDSCH / PUSCH reception process, such as reducing data buffering overhead and planning computing resources in advance.

[0215] The advantage of the second case, "the first PDCCH is the last of the at least two PDCCHs", is that the DCI overhead is smaller (because the range of values ​​for relevant parameters (such as K) in the DCI payload carried by the first PDCCH is smaller).

[0216] The advantage of the third case, "the first PDCCH is the kth PDCCH among the at least two PDCCHs; the k is configured by higher-layer signaling," is that it gives the base station the flexibility to configure the value of k according to the channel environment. Therefore, it is possible to obtain the advantages of the first and second cases at the same time based on the configuration.

[0217] (2) The CORESET numbers associated with the at least two PDCCHs are all different, and the first PDCCH satisfies any of the following: the CORESET number associated with the first PDCCH is the smallest, the CORESET number associated with the first PDCCH is the largest, the first PDCCH is the PDCCH corresponding to the kth CORESET number when the CORESET numbers associated with the at least two PDCCHs are sorted in ascending order, or the first PDCCH is the PDCCH corresponding to the kth CORESET number when the CORESET numbers associated with the at least two PDCCHs are sorted in descending order; where k is configured by higher layer signaling.

[0218] (3) The first PDCCH of the at least two PDCCHs satisfies any one of the following: the first PDCCH is the earliest in time and the PDCCH with the smallest associated CORESET number; the first PDCCH is the earliest in time and the PDCCH with the largest associated CORESET number; the first PDCCH is the latest in time and the PDCCH with the smallest associated CORESET number; the first PDCCH is the latest in time and the PDCCH with the largest associated CORESET number.

[0219] In some cases, the at least two PDCCHs are located in at least two time units, and one or more PDCCHs exist in different time units. For example, both inter-slot PDCCH repetition and intra-slot PDCCH repetition are supported simultaneously. In this case, the first PDCCH is determined jointly based on the time order and CORESET order (i.e., frequency domain order) of the PDCCHs in the at least two PDCCHs.

[0220] Optionally, the scrambling of the bit sequences of the first PDCCH and the second PDCCH can satisfy the following:

[0221]

[0222] Where b(0), b(1), ..., b(M-1) represent the bit sequence before scrambling of the first PDCCH or the second PDCCH. This represents the scrambled bit sequence of the first PDCCH or the second PDCCH, and the Used for modulation; M represents the number of bits in the bit sequence of the first PDCCH or the second PDCCH; c(i) represents the first sequence (i.e., scrambling sequence) associated with the first PDCCH or the second PDCCH; the generator of c(i) is initialized by the first parameter associated with the first PDCCH or the second PDCCH, i.e., the initial value of the scrambling sequence c. init The first parameter is used. The bit sequences of the first PDCCH and the second PDCCH can be scrambled using the above formulas respectively. Since the first parameters related to the first PDCCH and the second PDCCH are different, by using the above formulas for scrambling, different methods of updating the scrambling sequence can be used to scramble the first PDCCH and the second PDCCH.

[0223] In one embodiment, based on the initialization value c init Generate sequence c(i); where,

[0224] c(n) = [x1(n+N)] c )+x2(n+N c )]mod2

[0225] x1(n+31)=[x1(n+3)+x1(n)]mod2

[0226] x2(n+31)=[x2(n+3)+x2(n+2)+x2(n+1)+x2(n)]mod2

[0227] And, n = 0, 1, ..., M PN -1, M PN It is equal to the length of the output sequence c(i);

[0228] N C =1600;

[0229] The first m-sequence x1(n) is initialized as x1(0) = 1, x1(n) = 0, n = 1, 2, ..., 30;

[0230] The second m-sequence x2(n) is based on c init Initialization, where,

[0231] In this embodiment of the application, the first parameter related to the first PDCCH and the second PDCCH can be obtained by any of the following methods, as explained below.

[0232] Method 1

[0233] In this method, the first parameters related to the first PDCCH and the second PDCCH can be obtained from the following formulas:

[0234]

[0235] Wherein, the second parameters related to the first PDCCH and the second PDCCH are different, and the third parameters related to the first PDCCH and the second PDCCH are the same; p1 and p2 are positive integers; p2≥p1; mod represents the modulo symbol.

[0236] In one alternative implementation, p1 equals 16 and p2 equals 31. In this case,

[0237] First parameter = (Second parameter × 2) 16 + third parameter) mod 2 31

[0238] Optionally, the second parameter related to the first PDCCH is determined according to a pre-agreed agreement or higher-level configuration, and / or the second parameter related to the second PDCCH is determined according to a pre-agreed agreement or higher-level configuration. In this way, through pre-agreed agreement or higher-level configuration, it is ensured that the second parameter related to the first PDCCH and the second PDCCH are different.

[0239] Optionally, the second parameter related to the first PDCCH and the second PDCCH may satisfy at least one of the following:

[0240] (a) If the search spaces corresponding to the at least two PDCCHs are a common search space, then the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI. It can be seen that the first parameters corresponding to the first PDCCH and the second PDCCH are different.

[0241] In some embodiments, for legacy UEs or newer UEs (i.e., newer UEs that do not support the PDCCH retransmission protected in this case), if the search space corresponding to the PDCCH is a common search space, then the second parameter associated with the PDCCH is equal to 0. Note that the first RNTI is not equal to 0. Therefore, the legacy UE or the newer UE can correctly parse the first PDCCH, but cannot parse the second PDCCH.

[0242] (b) If the search space corresponding to the at least two PDCCHs is a UE-specific search space, and the higher layer has not configured a first higher layer parameter, then the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI. It can be seen that the first parameters corresponding to the first PDCCH and the second PDCCH are different.

[0243] In some embodiments, for legacy UEs or newer UEs (i.e., newer UEs that do not support the PDCCH retransmission protected in this case), if the search space corresponding to the PDCCH is a UE-specific search space and the higher layer does not configure the first higher layer parameter, then the second parameter related to the PDCCH is equal to 0. Note that the first RNTI is not equal to 0. Therefore, the legacy UE or the newer UE can correctly parse the first PDCCH, but cannot parse the second PDCCH.

[0244] (c) If the search space corresponding to the at least two PDCCHs is a UE-specific search space, and the higher layer has configured a first higher layer parameter, then the second parameter related to the first PDCCH is equal to the first RNTI, the second parameter related to the second PDCCH is not equal to the first RNTI, and the second parameter related to the second PDCCH is related to the first RNTI. It is evident that the first parameters corresponding to the first PDCCH and the second PDCCH are different.

[0245] In some embodiments, for legacy UEs or newer UEs (i.e., newer UEs that do not support the PDCCH retransmission protected in this case), if the search space corresponding to the PDCCH is a UE-specific search space and the higher layer has configured a first higher layer parameter, then the second parameter associated with the PDCCH is equal to the first RNTI. Therefore, the legacy UE or the newer UE can correctly parse the first PDCCH, but cannot parse the second PDCCH.

[0246] Optionally, in (c) above, the second parameter related to the second PDCCH and the first RNTI can satisfy at least one of the following:

[0247] (1) The second parameter is equal to the sum of the first RNTI and C1, where C1 is a non-zero integer;

[0248] (2) The second parameter is equal to the first RNTI and sum.

[0249] Through the above configuration, on the one hand, it can be ensured that in the above situation (c), the second parameter related to the second PDCCH is different from the first RNTI, and the second parameter related to the first PDCCH is different from the second parameter related to the second PDCCH. On the other hand, when the value range of the first RNTI of all terminals is within the interval [A, B-1], and A>=1, In this case, the second parameter associated with the second PDCCH is different from the second parameter associated with the first PDCCH of any terminal, thus avoiding confusion between the second PDCCH of one terminal and the first PDCCH of another terminal.

[0250] Note that the first RNTI value of all terminals is within the interval [A, B-1], and A >= 1. This includes several possibilities: 1) The protocol stipulates that the first RNTI value of all terminals is within the interval [A, B-1]. For example, when p1 = 16 and p2 = 31, The protocol stipulates that the first RNTI value range of all terminals is within the interval [1, 2, ..., 16383]; or, 2) the base station determines, based on implementation, that the first RNTI value range of all currently scheduled terminals is within the interval [A, B-1]. For example, when p1 = 16 and p2 = 31, the protocol stipulates that the first RNTI value range of all terminals is [1, 2, ..., C-1], where C can be greater than... However, the base station implements scheduling to ensure that the value range of the first RNTI of all currently scheduled terminals is within the interval [A,B-1], such as within the interval [1,2,…,16383].

[0251] In (a) to (c) above, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs.

[0252] Optionally, the first high-level parameter is the pdcch-DMRS-ScramblingID parameter.

[0253] In some embodiments of (a) to (c) above, the third parameter is denoted as n. ID Optional, n ID Configured by high-level personnel, or, Among them, the The identifier ID is the cell where the terminal is located.

[0254] Method 2

[0255] In this second method, the first parameters related to the first PDCCH and the second PDCCH can be obtained from the following formulas:

[0256]

[0257] Wherein, at least one of the second and fourth parameters related to the first PDCCH and the second PDCCH is different, and the third parameter related to the first PDCCH and the second PDCCH is the same; p1 and p2 are positive integers; p2≥p1; mod represents the modulo symbol.

[0258] For example, the difference between at least one of the second and fourth parameters related to the first PDCCH and the second PDCCH can be any of the following: the second parameters related to the first PDCCH and the second PDCCH are different, and the fourth parameters related to the first PDCCH and the second PDCCH are the same; the second parameters related to the first PDCCH and the second PDCCH are the same, and the fourth parameters related to the first PDCCH and the second PDCCH are different; the second parameters related to the first PDCCH and the second PDCCH are different, and the fourth parameters related to the first PDCCH and the second PDCCH are different.

[0259] In one alternative implementation, p1 equals 16 and p2 equals 31. In this case,

[0260] First parameter = (Second parameter × 2) 16 +Fourth parameter × 2 30 + third parameter) mod 2 31

[0261] Optionally, the second and / or fourth parameters related to the first PDCCH are determined according to a pre-agreed agreement or higher-level configuration, and / or the second and / or fourth parameters related to the second PDCCH are determined according to a pre-agreed agreement or higher-level configuration. Through pre-agreed agreements or higher-level configuration, it is ensured that at least one of the second and fourth parameters related to the first and second PDCCHs is different.

[0262] Optionally, the second and fourth parameters related to the first and second PDCCHs can satisfy at least one of the following:

[0263] (d) If the search spaces corresponding to the at least two PDCCHs are a common search space, then the fourth parameters related to the first PDCCH and the second PDCCH are both equal to 0, and the second parameter related to the first PDCCH is equal to 0, while the second parameter related to the second PDCCH is equal to the first RNTI. It is evident that the first parameters corresponding to the first PDCCH and the second PDCCH are different.

[0264] In some embodiments, for legacy UEs or newer UEs (i.e., newer UEs that do not support the PDCCH retransmission protected in this case), if the search space corresponding to the PDCCH is a common search space, then the fourth parameters related to both the first and second PDCCHs are equal to 0, and the second parameter related to the first PDCCH is also equal to 0. Therefore, the legacy UE or the newer UE can correctly parse the first PDCCH, but cannot parse the second PDCCH.

[0265] (e) If the search space corresponding to the at least two PDCCHs is a UE-specific search space, and the higher layer has not configured a first higher layer parameter, then the fourth parameter related to both the first PDCCH and the second PDCCH is equal to 0, and the second parameter related to the first PDCCH is equal to 0, while the second parameter related to the second PDCCH is equal to the first RNTI. It is evident that the first parameters corresponding to the first PDCCH and the second PDCCH are different.

[0266] In some embodiments, for legacy UEs or newer UEs (i.e., newer UEs that do not support the PDCCH retransmission protected in this case), if the search space corresponding to the PDCCH is a UE-specific search space and the higher layer does not configure the first higher layer parameter, then the fourth parameter related to both the first and second PDCCHs is equal to 0, and the second parameter related to the first PDCCH is also equal to 0. Therefore, the legacy UE or the newer UE can correctly parse the first PDCCH, but cannot parse the second PDCCH.

[0267] (f) If the search space corresponding to the at least two PDCCHs is a UE-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to both the first PDCCH and the second PDCCH is equal to the first RNTI, and the fourth parameter related to the first PDCCH is equal to 0, and the fourth parameter related to the second PDCCH is equal to 1. It is evident that the first parameters corresponding to the first PDCCH and the second PDCCH are different.

[0268] Optionally, when the first RNTI value of all terminals is within the interval [A, B-1], and A >= 1, In this case, the first parameter associated with the second PDCCH is different from the first parameter associated with the first PDCCH of any terminal, thus avoiding confusion between the second PDCCH of one terminal and the first PDCCH of another terminal.

[0269] For example, when p1 = 16 and p2 = 31, for the first PDCCH,

[0270] First parameter = (n RNTI ×2 16 + third parameter) mod 2 31

[0271] For the second PDCCH,

[0272] First parameter = (n RNTI ×2 16 +2 30 + third parameter) mod 2 31

[0273] Where, n RNTI This is the first RNTI.

[0274] If the first RNTI value of all terminals is within the interval [A, B-1], and A >= 1, When, n RNTI Belongs to the interval [1,2] 14 -1]; and the range of the third parameter is the interval.

[0275] For the first PDCCH, when n RNTI =1, when the third parameter =0, the first parameter takes the minimum value (1×2). 16 +0)mod2 31 =65536; when When, the first parameter takes the maximum value of ((2) 14 -1)×2 16 +2 16 -1)mod 2 31 =(2 30 -1)mod 2 31 .

[0276] For the second PDCCH, when n RNTI =1, when the third parameter =0, the first parameter takes the minimum value (1×2). 16 +2 30 +0)mod 2 31 ;when When, the first parameter takes the maximum value of ((2) 14 -1)×2 16 +2 30 +2 16 -1)mod 2 31 =(2 31 -1)mod 2 31 .

[0277] It can be seen that the first parameter related to the second PDCCH (>=2) 30 The first parameter (<=2) is different from the first parameter associated with the first PDCCH of any terminal. 30 -1), thus avoiding the situation where the second PDCCH of one terminal and the first PDCCH of another terminal are confused.

[0278] Similarly, if the value range of the first RNTI of all terminals is within the interval [A, B-1], there are several possibilities: 1) the protocol stipulates that the value range of the first RNTI of all terminals is within the interval [A, B-1]; or, 2) the base station determines, based on the implementation, that the value range of the first RNTI of all currently scheduled terminals is within the interval [A, B-1].

[0279] In some embodiments, for legacy UEs or newer UEs (i.e., newer UEs that do not support the PDCCH retransmission protected in this case), if the search space corresponding to the PDCCH is a UE-specific search space and the higher layer has configured the first higher layer parameter, then the second parameters related to both the first and second PDCCHs are equal to the first RNTI, and the fourth parameter related to the first PDCCH is equal to 0. Therefore, the legacy UE or the newer UE can correctly parse the first PDCCH, but cannot parse the second PDCCH.

[0280] In (d) to (f) above, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs.

[0281] Optionally, the first high-level parameter is the pdcch-DMRS-ScramblingID parameter.

[0282] In some embodiments, as described in (d) to (f) above, the third parameter is denoted as n. ID Optional, n ID Configured by high-level personnel, or, Among them, the The identifier ID is the cell where the terminal is located.

[0283] Method 3

[0284] Under this method, the first parameters related to the first PDCCH and the second PDCCH can be obtained from the following formulas:

[0285]

[0286] Wherein, at least one of the second and third parameters related to the first PDCCH and the second PDCCH is different; p1 and p2 are positive integers; mod represents the modulo sign.

[0287] Optionally, the difference between at least one of the second and third parameters related to the first PDCCH and the second PDCCH can be any of the following: the second parameters related to the first PDCCH and the second PDCCH are different, and the third parameters related to the first PDCCH and the second PDCCH are the same; the second parameters related to the first PDCCH and the second PDCCH are the same, and the third parameters related to the first PDCCH and the second PDCCH are different; or the second parameters related to the first PDCCH and the second PDCCH are different, and the third parameters related to the first PDCCH and the second PDCCH are different.

[0288] In one alternative implementation, p1 equals 16 and p2 equals 31. In this case:

[0289] First parameter = (Second parameter × 2) 16 + third parameter) mod 2 31

[0290] Optionally, the second and / or third parameters related to the first PDCCH are determined according to a pre-agreed agreement or higher-level configuration, and / or the second and / or third parameters related to the second PDCCH are determined according to a pre-agreed agreement or higher-level configuration. Through pre-agreed agreement or higher-level configuration, it is ensured that at least one of the second and third parameters related to the first and second PDCCHs is different.

[0291] Optionally, the second and third parameters related to the first and second PDCCHs can satisfy at least one of the following:

[0292] (h) If the search space corresponding to the at least two PDCCHs is a common search space, then the third parameter related to the first PDCCH and the second PDCCH is equal to the fifth parameter, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0293] The fifth parameter is denoted as n. ID Optional, n ID Configured by high-level personnel, or, Among them, the The identifier ID is the cell where the terminal is located.

[0294] It can be seen that, for the first PDCCH,

[0295]

[0296] For the second PDCCH,

[0297]

[0298] Where, n RNTI This is the first RNTI.

[0299] It is evident that the first parameter of the first PDCCH and the second PDCCH are different.

[0300] In some embodiments, for legacy UEs or newer UEs (i.e., newer UEs that do not support the PDCCH retransmission protected in this case), if the search space corresponding to the PDCCH is a common search space, then the third parameter related to the first PDCCH is equal to the fifth parameter, and the second parameter related to the first PDCCH is equal to 0. Therefore, the legacy UE or the newer UE can correctly parse the first PDCCH, but cannot parse the second PDCCH.

[0301] (g) If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure a first higher layer parameter, then the third parameter related to both the first PDCCH and the second PDCCH is equal to the fifth parameter, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI. It is evident that the first parameters corresponding to the first PDCCH and the second PDCCH are different.

[0302] In some embodiments, for legacy UEs or newer UEs (i.e., newer UEs that do not support the PDCCH retransmission protected in this case), if the search space corresponding to the PDCCH is a UE-specific search space and the higher layer does not configure the first higher layer parameter, then the third parameter related to the first PDCCH is equal to the fifth parameter, and the second parameter related to the first PDCCH is equal to 0. Therefore, the legacy UE or the newer UE can correctly parse the first PDCCH, but cannot parse the second PDCCH.

[0303] (k) If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to both the first PDCCH and the second PDCCH is equal to the first RNTI, and the third parameter related to the first PDCCH is equal to the fifth parameter, and the third parameter related to the second PDCCH is equal to the fifth parameter and... sum.

[0304] It can be seen that, for the first PDCCH,

[0305]

[0306] For the second PDCCH,

[0307]

[0308] Where, n RNTI This is the first RNTI.

[0309] It is evident that the first parameter of the first PDCCH and the second PDCCH are different.

[0310] Optionally, when the first RNTI value of all terminals is within the interval [A, B-1], and A >= 1, In this case, the first parameter associated with the second PDCCH is different from the first parameter associated with the first PDCCH of any terminal, thus avoiding confusion between the second PDCCH of one terminal and the first PDCCH of another terminal.

[0311] For example, if the first RNTI value of all terminals is within the interval [A, B-1], and A >= 1, When, n RNTI Belongs to the interval And n ID The range of values ​​is an interval.

[0312] For the first PDCCH, when n RNTI =1, n ID When = 0, the first parameter takes the minimum value. when When, the first parameter takes the maximum value of

[0313] For the second PDCCH, when n RNTI =1, n ID When = 0, the first parameter takes the minimum value. when When, the first parameter takes the maximum value of

[0314] It can be seen that the first parameter related to the second PDCCH The first parameter is different from the first PDCCH associated with any terminal. Therefore, it can avoid the situation where the second PDCCH of one terminal and the first PDCCH of another terminal are confused.

[0315] Similarly, if the value range of the first RNTI of all terminals is within the interval [A, B-1], there are several possibilities: 1) the protocol stipulates that the value range of the first RNTI of all terminals is within the interval [A, B-1]; or, 2) the base station determines, based on the implementation, that the value range of the first RNTI of all currently scheduled terminals is within the interval [A, B-1].

[0316] In some embodiments, for legacy UEs or newer UEs (i.e., newer UEs that do not support the PDCCH retransmission protected in this case), if the search space corresponding to the PDCCH is a UE-specific search space and the higher layer has configured the first higher layer parameter, then the second parameter related to the first PDCCH is equal to the first RNTI, and the third parameter related to the first PDCCH is equal to the fifth parameter. Therefore, the legacy UE or the newer UE can correctly parse the first PDCCH, but cannot parse the second PDCCH.

[0317] In (h) to (k) above, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs. The fifth parameter is configured by a higher layer, or the fifth parameter is equal to the identifier ID of the cell where the terminal is located.

[0318] Optionally, for (a) to (k), the first RNTI may satisfy at least one of the following:

[0319] ①If the search space corresponding to the at least two PDCCHs is a Type 0 common search space, then the first RNTI is a System Information Radio Network Temporary Identifier (SI-RNTI);

[0320] ②If the search space corresponding to the at least two PDCCHs is a Type0A common search space, then the first RNTI is SI-RNTI;

[0321] ③ If the search space corresponding to the at least two PDCCHs is a Type 1 common search space, then the first RNTI is any one of the following: Random Access RNTI (RA-RNTI), Message B RNTI (MsgB-RNTI), or Temporary Cell RNTI (TC-RNTI).

[0322] ④ If the search space corresponding to the at least two PDCCHs is a Type 2 common search space, then the first RNTI is a paging radio network temporary identifier (Paging RNTI, P-RNTI);

[0323] ⑤ If the search space corresponding to the at least two PDCCHs is a terminal-dedicated search space, then the first RNTI is a cell radio network temporary identifier (Cell RNTI, C-RNTI).

[0324] Thus, for Type0-PDCCH CSS (scheduling SIB1), Type0A-PDCCH CSS (scheduling other SIBs), Type1-PDCCH CSS (scheduling Msg 2 and Msg 4), Type2-PDCCH CSS (scheduling paging messages), and / or the terminal-specific search space, the corresponding first PDCCH and second PDCCH can use different scrambling sequences during the encoding process. This allows older terminals (legacy UEs) or new terminals of the second type (i.e., new terminals that do not support the PDCCH repetition transmission protected in this case) to correctly parse the first PDCCH, but not the second PDCCH.

[0325] Optionally, in order to reduce the blind detection complexity of the terminal receiving the at least two PDCCHs, the at least two PDCCHs may satisfy at least one of the following:

[0326] (1) The search spaces corresponding to the at least two PDCCHs have the same search space set type (e.g., The two linked SS sets have the same SS set type (USS / CSS));

[0327] (2) The search spaces corresponding to the at least two PDCCHs have the same downlink control information (DCI) format (e.g., The two linked SS sets have the same DCI formats to monitor);

[0328] (3) The search spaces corresponding to the at least two PDCCHs have the same length;

[0329] (4) The search spaces corresponding to the at least two PDCCHs have the same number of monitoring opportunities in the next time unit (e.g., The two SS sets have the same number of monitoring occasions within aslot);

[0330] (5) The nth monitoring occasion of the search space corresponding to the at least two PDCCHs is related (e.g., n-th monitoring occasion of one SS set is linked to n-th monitoring occasion of the other SS set), where n is a positive integer.

[0331] The following examples illustrate this application.

[0332] Figure 1 In the diagrams (a) and (b), we can see the schematic diagrams of method (a) above, that is:

[0333] First parameter = (Second parameter × 2) 16 + third parameter) mod 2 31

[0334] Furthermore, the search space corresponding to the at least two PDCCHs is the common search space (CSS).

[0335] In one embodiment, let C be... init n is the first parameter. RNTI n is the second parameter. ID As the third parameter, p1 = 16, p2 = 31, then,

[0336] C init =(n RNTI ×2 16 +n ID )mod 2 31

[0337] The search space corresponding to the at least two PDCCHs is a common search space (CSS). Assuming that two PDCCHs with the same common search space (CSS), namely rep#1 and rep#2, are repeatedly transmitted, located in slot n and slot n+1 respectively, and these two PDCCHs schedule the same PDSCH on slot n+1, then: ... Figure 1 As shown in (a), if PDCCH(rep#1) is a reference PDCCH, then n related to PDCCH(rep#1) RNTI The value is equal to 0; however, for non-reference PDCCH, i.e., PDCCH(rep#2), the related n is 0. RNTI The associated RNTI (i.e., the corresponding RNTI). Or, as... Figure 1As shown in (b), if PDCCH(rep#2) is a reference PDCCH, then n related to PDCCH(rep#2) RNTI The value is equal to 0; while for non-reference PDCCH, i.e., PDCCH(rep#1), the related n is 0. RNTI For the associated RNTI. Where n RNTI The initialization value C used to determine the generator of the scrambling sequence associated with PDCCH(rep#1 / rep#2) is... init , such as C init =(n RNTI ×2 16 +n ID )mod 2 31 n ID These are configuration parameters for higher-level systems.

[0338] Optionally, if the search space corresponding to the two PDCCHs that are repeatedly transmitted is Type0-PDCCH CSS or Type0A-PDCCH CSS, then the corresponding RNTI is SI-RNTI;

[0339] Alternatively, if the search space corresponding to the two PDCCHs that are repeatedly transmitted is Type1-PDCCH CSS, then the corresponding RNTI is any one of the following: RA-RNTI, MsgB-RNTI, TC-RNTI;

[0340] Alternatively, if the search space corresponding to the two PDCCHs that are repeatedly transmitted is Type2-PDCCH CSS, then the corresponding RNTI is P-RNTI;

[0341] Alternatively, if the search space corresponding to the two PDCCHs that are repeatedly transmitted is a terminal-specific search space, then the corresponding RNTI is a C-RNTI.

[0342] Thus, when the candidate PDCCH is the reference PDCCH (used to determine the starting time slot of the PDSCH timing), n RNTI=0, which is consistent with the PDCCH generation process of the legacy UE. Therefore, the legacy UE can find the PDSCH scheduled by it based on the DCI indication carried by the reference PDCCH. However, when the candidate PDCCH is not the reference PDCCH, the generation process of the PDCCH is different from that of the legacy UE. The legacy UE will not parse the PDCCH, and thus the aforementioned subsequent compatibility issues will not occur.

[0343] For new UEs, they can understand that reference PDCCH and non-reference PDCCH use different PDCCH generation processes, and therefore can correctly receive the two types of PDCCH.

[0344] In summary, the solution in this application can effectively solve the backward compatibility problem in inter-slot PDCCH CSS repetition technology, and while improving the PDCCH CSS coverage capability of new terminals, it can also enable traditional terminals to correctly receive PDCCH CSS.

[0345] Furthermore, it should be noted that in the PDCCH generation process, except for the scrambling step, all other steps of the reference PDCCH and non-reference PDCCH are consistent. Therefore, the signals at the input and output of the channel encoder / decoder are exactly the same for the reference PDCCH and non-reference PDCCH. As a result, the new terminal can perform soft combining during decoding, thereby improving decoding performance.

[0346] Please see Figure 3 , Figure 3 This is a flowchart illustrating a transmission method provided in an embodiment of this application. This method is applied to a network-side device, such as... Figure 3 As shown, the method includes the following steps:

[0347] Step 31: The network-side device sends at least two PDCCHs to the terminal.

[0348] In this embodiment of the application, the at least two PDCCHs satisfy at least one of the following: the at least two PDCCHs are repeatedly transmitted PDCCHs, there is an association between the search spaces corresponding to the at least two PDCCHs, and the at least two PDCCHs schedule at least one PDSCH and / or PUSCH that is the same.

[0349] The at least two PDCCHs include a first PDCCH and at least one second PDCCH; the bit sequence of the first PDCCH is scrambled with a first sequence associated with the first PDCCH before modulation, and the generation of the first sequence associated with the first PDCCH is related to a first parameter associated with the first PDCCH; the bit sequence of the second PDCCH is scrambled with a first sequence associated with the second PDCCH before modulation, and the generation of the first sequence associated with the second PDCCH is related to a first parameter associated with the second PDCCH; the first parameters associated with the first PDCCH and the second PDCCH are different.

[0350] Optionally, the search spaces corresponding to the at least two PDCCHs are associated with each other, which may include at least one of the following: the search spaces corresponding to the at least two PDCCHs are linked; the search space set corresponding to the at least two PDCCHs is linked.

[0351] Optionally, the at least one PDSCH and / or PUSCH that is scheduled the same by the at least two PDCCHs may include at least one of the following: a PDSCH that is scheduled the same by the at least two PDCCHs; a PUSCH that is scheduled the same by the at least two PDCCHs; multiple PDSCHs that are scheduled the same by the at least two PDCCHs (such as including PDSCH repetition and / or multiple PDSCHs); multiple PUSCHs that are scheduled the same by the at least two PDCCHs (such as including PUSCH repetition and / or multiple PUSCHs).

[0352] Optionally, the time-domain resources of at least one scheduled PDSCH and / or PUSCH are at least related to the reception parameters of the first PDCCH.

[0353] In some embodiments, the first PDCCH is referred to as the reference PDCCH, or the DCI carried in the first PDCCH is referred to as the reference DCI. Correspondingly, the second PDCCH is not the reference PDCCH, or the DCI carried in the second PDCCH is not the reference DCI.

[0354] It should be noted that the first sequence can be understood as a scrambling sequence, and the first parameter can be understood as a parameter related to the scrambling sequence.

[0355] According to the scheme of this application embodiment, when sending at least two PDCCHs as described above, different scrambling sequences can be used to scramble the first PDCCH and the second PDCCH. For new terminals that support the PDCCH retransmission protected in this application (which can be referred to as first-type new terminals), they can correctly distinguish and parse the first PDCCH and the second PDCCH. However, for old terminals (legacy UEs), or new terminals that do not support the PDCCH retransmission protected in this application (which can be referred to as second-type new terminals, such as terminals with weaker capabilities), the protocol stipulates that they can only correctly parse the first PDCCH, but cannot parse the second PDCCH. Note that there is only one first PDCCH, and the time domain resources of one or more scheduled PDSCHs and / or PUSCHs can be determined based on the reception parameters of the first PDCCH; while there are one or more second PDCCHs, and the time domain resources of one or more scheduled PDSCHs and / or PUSCHs cannot be determined based on the reception parameters of the second PDCCH. Therefore, by restricting legacy UEs or newer UEs to only parse the first PDCCH and not the second, these UEs can obtain scheduled PDSCH / PUSCH resources through correct parsing of the first PDCCH while avoiding abnormal terminal behavior caused by erroneously receiving the second PDCCH. For example, if a terminal erroneously receives the second PDCCH, it will determine the transmission slots for the PDSCH / PUSCH based on the reception parameters of the second PDCCH and attempt to receive the PDSCH / PUSCH in these slots. However, the base station does not actually transmit the PDSCH / PUSCH in these slots, leading to abnormal terminal behavior.

[0356] In this embodiment, the at least two PDCCHs can have different forms. The at least two PDCCHs can satisfy any of the following:

[0357] (1) The at least two PDCCHs are located in different time units, and the first PDCCH is any one of the following among the at least two PDCCHs: the first PDCCH, the last PDCCH, and the kth PDCCH; the k is configured by higher layer signaling; the time unit can be selected as, but is not limited to, time units such as slot, frame, and subframe;

[0358] (2) The CORESET numbers associated with the at least two PDCCHs are all different, and the first PDCCH satisfies any of the following: the CORESET number associated with the first PDCCH is the smallest, the CORESET number associated with the first PDCCH is the largest, the first PDCCH is the PDCCH corresponding to the kth CORESET number when the CORESET numbers associated with the at least two PDCCHs are sorted in ascending order, or the first PDCCH is the PDCCH corresponding to the kth CORESET number when the CORESET numbers associated with the at least two PDCCHs are sorted in descending order; where k is configured by higher layer signaling.

[0359] (3) The first PDCCH of the at least two PDCCHs satisfies any one of the following: the first PDCCH is the earliest in time and the PDCCH with the smallest associated CORESET number; the first PDCCH is the earliest in time and the PDCCH with the largest associated CORESET number; the first PDCCH is the latest in time and the PDCCH with the smallest associated CORESET number; the first PDCCH is the latest in time and the PDCCH with the largest associated CORESET number.

[0360] Optionally, the scrambling of the bit sequences of the first PDCCH and the second PDCCH can satisfy the following:

[0361]

[0362] Where b(0), b(1), ..., b(M-1) represent the bit sequence before scrambling of the first PDCCH or the second PDCCH. This represents the scrambled bit sequence of the first PDCCH or the second PDCCH, and the Used for modulation; M represents the number of bits in the bit sequence of the first PDCCH or the second PDCCH; c(i) represents the first sequence (i.e., scrambling sequence) associated with the first PDCCH or the second PDCCH; the generator of c(i) is initialized by the first parameter associated with the first PDCCH or the second PDCCH, i.e., the initial value of the scrambling sequence c. init The first parameter is used. The bit sequences of the first PDCCH and the second PDCCH can be scrambled using the formulas described above.

[0363] Optionally, the first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas:

[0364]

[0365] Wherein, the second parameters related to the first PDCCH and the second PDCCH are different, and the third parameters related to the first PDCCH and the second PDCCH are the same; p1 and p2 are positive integers; p2≥p1; mod represents the modulo symbol.

[0366] Optionally, the second parameter related to the first PDCCH is determined according to a pre-agreed agreement or higher-level configuration, and / or the second parameter related to the second PDCCH is determined according to a pre-agreed agreement or higher-level configuration;

[0367] Alternatively, the second parameter related to the first PDCCH and the second PDCCH satisfies at least one of the following:

[0368] If the search space corresponding to the at least two PDCCHs is a common search space, then the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI;

[0369] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0370] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to the first PDCCH is equal to the first RNTI, the second parameter related to the second PDCCH is not equal to the first RNTI, and the second parameter related to the second PDCCH is related to the first RNTI.

[0371] Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs.

[0372] Optionally, the second parameter related to the second PDCCH is related to the first RNTI and satisfies at least one of the following:

[0373] The second parameter is equal to the sum of the first RNTI and C1, where C1 is a non-zero integer;

[0374] The second parameter is equal to the first RNTI and sum.

[0375] Optionally, the first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas:

[0376]

[0377] Wherein, at least one of the second and fourth parameters related to the first PDCCH and the second PDCCH is different, and the third parameter related to the first PDCCH and the second PDCCH is the same; p1 and p2 are positive integers; p2≥p1; mod represents the modulo symbol.

[0378] Optionally, the second and / or fourth parameters related to the first PDCCH are determined according to a pre-agreed agreement or higher-level configuration, and / or the second and / or fourth parameters related to the second PDCCH are determined according to a pre-agreed agreement or higher-level configuration;

[0379] Alternatively, the second and fourth parameters related to the first and second PDCCHs satisfy at least one of the following:

[0380] If the search spaces corresponding to the at least two PDCCHs are common search spaces, then the fourth parameters related to the first PDCCH and the second PDCCH are both equal to 0, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0381] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the fourth parameter related to the first PDCCH and the second PDCCH is equal to 0, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0382] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to the first PDCCH and the second PDCCH is equal to the first RNTI, and the fourth parameter related to the first PDCCH is equal to 0, and the fourth parameter related to the second PDCCH is equal to 1.

[0383] Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs.

[0384] Optionally, the first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas:

[0385]

[0386] Wherein, at least one of the second and third parameters related to the first PDCCH and the second PDCCH is different; p1 and p2 are positive integers; mod represents the modulo sign.

[0387] Optionally, the second and / or third parameters related to the first PDCCH are determined according to a pre-agreed agreement or higher-level configuration, and / or the second and / or third parameters related to the second PDCCH are determined according to a pre-agreed agreement or higher-level configuration;

[0388] Alternatively, the second and third parameters related to the first and second PDCCHs satisfy at least one of the following:

[0389] If the search spaces corresponding to the at least two PDCCHs are common search spaces, then the third parameters related to the first PDCCH and the second PDCCH are both equal to the fifth parameter, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI;

[0390] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the third parameter related to the first PDCCH and the second PDCCH is equal to the fifth parameter, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0391] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to both the first PDCCH and the second PDCCH is equal to the first RNTI, and the third parameter related to the first PDCCH is equal to the fifth parameter, and the third parameter related to the second PDCCH is equal to the fifth parameter. sum;

[0392] Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs; the fifth parameter is configured by a higher layer, or the fifth parameter is equal to the identifier ID of the cell where the terminal is located.

[0393] Optionally, the first high-level parameter is the pdcch-DMRS-ScramblingID parameter;

[0394] And / or, the first RNTI satisfies at least one of the following:

[0395] If the search space corresponding to the at least two PDCCHs is a Type 0 common search space, then the first RNTI is the System Information Radio Network Temporary Identifier SI-RNTI;

[0396] If the search space corresponding to the at least two PDCCHs is a Type0A common search space, then the first RNTI is a SI-RNTI;

[0397] If the search space corresponding to the at least two PDCCHs is a Type 1 common search space, then the first RNTI is any one of the following: Random Access Radio Network Temporary Identifier RA-RNTI, Message B Radio Network Temporary Identifier MsgB-RNTI, Temporary Cell Radio Network Temporary Identifier TC-RNTI;

[0398] If the search space corresponding to the at least two PDCCHs is a Type 2 common search space, then the first RNTI is a paging radio network temporary identifier (P-RNTI).

[0399] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, then the first RNTI is a C-RNTI.

[0400] Optionally, the at least two PDCCHs satisfy at least one of the following:

[0401] The search spaces corresponding to at least two PDCCHs have the same search space set type;

[0402] The search spaces corresponding to the at least two PDCCHs have the same DCI format;

[0403] The search spaces corresponding to the at least two PDCCHs have the same length;

[0404] The search spaces corresponding to the at least two PDCCHs have the same listening opportunity in the next time unit;

[0405] The nth listening opportunity of the search space corresponding to the at least two PDCCHs is related, where n is a positive integer.

[0406] It should be noted that the transmission method provided in this application can be executed by a transmission device or a control module within that transmission device. This application uses the example of a transmission device executing the transmission method to illustrate the transmission device provided in this application.

[0407] Please see Figure 4 , Figure 4 This is a schematic diagram of a transmission device provided in an embodiment of this application. This device is applied to a terminal, such as... Figure 4As shown, the transmission device 40 includes:

[0408] Receiver module 41 is used to receive at least two PDCCHs;

[0409] Wherein, the at least two PDCCHs satisfy at least one of the following: the at least two PDCCHs are repeatedly transmitted PDCCHs, there is an association between the search spaces corresponding to the at least two PDCCHs, and the at least two PDCCHs schedule at least one PDSCH and / or PUSCH that is the same;

[0410] The at least two PDCCHs include a first PDCCH and at least one second PDCCH;

[0411] The bit sequence of the first PDCCH is scrambled by a first sequence related to the first PDCCH before modulation, and the generation of the first sequence related to the first PDCCH is related to a first parameter related to the first PDCCH; the bit sequence of the second PDCCH is scrambled by a first sequence related to the second PDCCH before modulation, and the generation of the first sequence related to the second PDCCH is related to a first parameter related to the second PDCCH.

[0412] The first parameters associated with the first PDCCH and the second PDCCH are different.

[0413] Optionally, the association between the search spaces corresponding to the at least two PDCCHs includes at least one of the following:

[0414] The search spaces corresponding to at least two PDCCHs have a linking relationship;

[0415] The search space sets corresponding to the at least two PDCCHs are linked.

[0416] Optionally, the scrambling of the bit sequences of the first PDCCH and the second PDCCH satisfies the following:

[0417]

[0418] Where b(0), b(1), ..., b(M-1) represent the bit sequence before scrambling of the first PDCCH or the second PDCCH. This represents the scrambled bit sequence of the first PDCCH or the second PDCCH, and the Used for modulation; M represents the number of bits in the bit sequence of the first PDCCH or the second PDCCH;

[0419] c(i) represents the first sequence associated with the first PDCCH or the second PDCCH; the generator of c(i) is initialized by the first parameter associated with the first PDCCH or the second PDCCH.

[0420] Optionally, the transmission device 40 also includes,

[0421] The determining module is configured to determine the time-domain resources of at least one scheduled PDSCH and / or PUSCH based at least on the received parameters of the first PDCCH.

[0422] Alternatively, the time-domain resources of the at least one PDSCH and / or PUSCH are at least related to the reception parameters of the first PDCCH.

[0423] Optionally, the at least two PDCCHs satisfy any of the following:

[0424] The at least two PDCCHs are located in different time units, and the first PDCCH is any one of the following among the at least two PDCCHs: the first PDCCH, the last PDCCH, and the kth PDCCH; wherein, k is configured by higher layer signaling;

[0425] The control resource set CORESET numbers associated with the at least two PDCCHs are all different, and the first PDCCH satisfies any of the following: the CORESET number associated with the first PDCCH is the smallest; the CORESET number associated with the first PDCCH is the largest; the first PDCCH is the PDCCH corresponding to the k-th CORESET number when the CORESET numbers associated with the at least two PDCCHs are sorted in ascending order; the first PDCCH is the PDCCH corresponding to the k-th CORESET number when the CORESET numbers associated with the at least two PDCCHs are sorted in descending order; wherein, k is configured by higher layer signaling.

[0426] The first PDCCH of the at least two PDCCHs satisfies any of the following: the first PDCCH is the earliest in time and has the smallest associated CORESET number; the first PDCCH is the earliest in time and has the largest associated CORESET number; the first PDCCH is the latest in time and has the smallest associated CORESET number; or the first PDCCH is the latest in time and has the largest associated CORESET number.

[0427] Optionally, the first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas:

[0428]

[0429] Wherein, the second parameters related to the first PDCCH and the second PDCCH are different, and the third parameters related to the first PDCCH and the second PDCCH are the same; p1 and p2 are positive integers; p2≥p1; mod represents the modulo symbol.

[0430] Optionally, the second parameter related to the first PDCCH is determined according to a pre-agreed agreement or higher-level configuration, and / or the second parameter related to the second PDCCH is determined according to a pre-agreed agreement or higher-level configuration;

[0431] Alternatively, the second parameter related to the first PDCCH and the second PDCCH satisfies at least one of the following:

[0432] If the search space corresponding to the at least two PDCCHs is a common search space, then the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first radio network temporary identifier RNTI.

[0433] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0434] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to the first PDCCH is equal to the first RNTI, the second parameter related to the second PDCCH is not equal to the first RNTI, and the second parameter related to the second PDCCH is related to the first RNTI.

[0435] Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs.

[0436] Optionally, the second parameter related to the second PDCCH is related to the first RNTI and satisfies at least one of the following:

[0437] The second parameter is equal to the sum of the first RNTI and C1, where C1 is a non-zero integer;

[0438] The second parameter is equal to the first RNTI and sum.

[0439] Optionally, the first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas:

[0440]

[0441] Wherein, at least one of the second and fourth parameters related to the first PDCCH and the second PDCCH is different, and the third parameter related to the first PDCCH and the second PDCCH is the same; p1 and p2 are positive integers; p2≥p1; mod represents the modulo symbol.

[0442] Optionally, the second and / or fourth parameters related to the first PDCCH are determined according to a pre-agreed agreement or higher-level configuration, and / or the second and / or fourth parameters related to the second PDCCH are determined according to a pre-agreed agreement or higher-level configuration;

[0443] Alternatively, the second and fourth parameters related to the first and second PDCCHs satisfy at least one of the following:

[0444] If the search spaces corresponding to the at least two PDCCHs are common search spaces, then the fourth parameters related to the first PDCCH and the second PDCCH are both equal to 0, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0445] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the fourth parameter related to the first PDCCH and the second PDCCH is equal to 0, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0446] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to the first PDCCH and the second PDCCH is equal to the first RNTI, and the fourth parameter related to the first PDCCH is equal to 0, and the fourth parameter related to the second PDCCH is equal to 1.

[0447] Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs.

[0448] Optionally, the first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas:

[0449]

[0450] Wherein, at least one of the second and third parameters related to the first PDCCH and the second PDCCH is different; p1 and p2 are positive integers; mod represents the modulo sign.

[0451] Optionally, the second and / or third parameters related to the first PDCCH are determined according to a pre-agreed agreement or higher-level configuration, and / or the second and / or third parameters related to the second PDCCH are determined according to a pre-agreed agreement or higher-level configuration;

[0452] Alternatively, the second and third parameters related to the first and second PDCCHs satisfy at least one of the following:

[0453] If the search spaces corresponding to the at least two PDCCHs are common search spaces, then the third parameters related to the first PDCCH and the second PDCCH are both equal to the fifth parameter, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI;

[0454] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the third parameter related to the first PDCCH and the second PDCCH is equal to the fifth parameter, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0455] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to both the first PDCCH and the second PDCCH is equal to the first RNTI, and the third parameter related to the first PDCCH is equal to the fifth parameter, and the third parameter related to the second PDCCH is equal to the fifth parameter. sum;

[0456] Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs; the fifth parameter is configured by a higher layer, or the fifth parameter is equal to the identifier ID of the cell where the terminal is located.

[0457] Optionally, the first high-level parameter is the pdcch-DMRS-ScramblingID parameter;

[0458] And / or, the first RNTI satisfies at least one of the following:

[0459] If the search space corresponding to the at least two PDCCHs is a Type 0 common search space, then the first RNTI is the System Information Radio Network Temporary Identifier SI-RNTI;

[0460] If the search space corresponding to the at least two PDCCHs is a Type0A common search space, then the first RNTI is a SI-RNTI;

[0461] If the search space corresponding to the at least two PDCCHs is a Type 1 common search space, then the first RNTI is any one of the following: Random Access Radio Network Temporary Identifier RA-RNTI, Message B Radio Network Temporary Identifier MsgB-RNTI, Temporary Cell Radio Network Temporary Identifier TC-RNTI;

[0462] If the search space corresponding to the at least two PDCCHs is a Type 2 common search space, then the first RNTI is a paging radio network temporary identifier (P-RNTI).

[0463] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, then the first RNTI is a C-RNTI.

[0464] Optionally, the at least two PDCCHs satisfy at least one of the following:

[0465] The search spaces corresponding to at least two PDCCHs have the same search space set type;

[0466] The search spaces corresponding to the at least two PDCCHs have the same DCI format;

[0467] The search spaces corresponding to the at least two PDCCHs have the same length;

[0468] The search spaces corresponding to the at least two PDCCHs have the same listening opportunity in the next time unit;

[0469] The nth listening opportunity of the search space corresponding to the at least two PDCCHs is related, where n is a positive integer.

[0470] The transmission device 40 of this application embodiment can achieve the above-mentioned... Figure 2 The various processes of the method embodiments shown can achieve the same technical effect, and will not be described again here to avoid repetition.

[0471] Please see Figure 5 , Figure 5 This is a schematic diagram of a transmission device provided in an embodiment of this application. This device is applied to network-side equipment, such as... Figure 5 As shown, the transmission device 50 includes:

[0472] The sending module 51 is used to send at least two PDCCHs to the terminal;

[0473] Wherein, the at least two PDCCHs satisfy at least one of the following: the at least two PDCCHs are repeatedly transmitted PDCCHs, there is an association between the search spaces corresponding to the at least two PDCCHs, and the at least two PDCCHs schedule at least one PDSCH and / or PUSCH that is the same;

[0474] The at least two PDCCHs include a first PDCCH and at least one second PDCCH;

[0475] The bit sequence of the first PDCCH is scrambled by a first sequence related to the first PDCCH before modulation, and the generation of the first sequence related to the first PDCCH is related to a first parameter related to the first PDCCH; the bit sequence of the second PDCCH is scrambled by a first sequence related to the second PDCCH before modulation, and the generation of the first sequence related to the second PDCCH is related to a first parameter related to the second PDCCH.

[0476] The first parameters associated with the first PDCCH and the second PDCCH are different.

[0477] Optionally, the association between the search spaces corresponding to the at least two PDCCHs includes at least one of the following:

[0478] The search spaces corresponding to at least two PDCCHs have a linking relationship;

[0479] The search space sets corresponding to the at least two PDCCHs are linked.

[0480] Optionally, the scrambling of the bit sequences of the first PDCCH and the second PDCCH satisfies the following:

[0481]

[0482] Where b(0), b(1), ..., b(M-1) represent the bit sequence before scrambling of the first PDCCH or the second PDCCH. This represents the scrambled bit sequence of the first PDCCH or the second PDCCH, and the Used for modulation; M represents the number of bits in the bit sequence of the first PDCCH or the second PDCCH;

[0483] c(i) represents the first sequence associated with the first PDCCH or the second PDCCH; the generator of c(i) is initialized by the first parameter associated with the first PDCCH or the second PDCCH.

[0484] Optionally, the time-domain resources of the at least one PDSCH and / or PUSCH are at least related to the reception parameters of the first PDCCH.

[0485] Optionally, the at least two PDCCHs satisfy any of the following:

[0486] The at least two PDCCHs are located in different time units, and the first PDCCH is any one of the following among the at least two PDCCHs: the first PDCCH, the last PDCCH, and the kth PDCCH; wherein, k is configured by higher layer signaling;

[0487] The CORESET numbers associated with the at least two PDCCHs are all different, and the first PDCCH satisfies any of the following: the CORESET number associated with the first PDCCH is the smallest; the CORESET number associated with the first PDCCH is the largest; the first PDCCH is the PDCCH corresponding to the k-th CORESET number when the CORESET numbers associated with the at least two PDCCHs are sorted in ascending order; the first PDCCH is the PDCCH corresponding to the k-th CORESET number when the CORESET numbers associated with the at least two PDCCHs are sorted in descending order; wherein, k is configured by higher layer signaling.

[0488] The first PDCCH of the at least two PDCCHs satisfies any of the following: the first PDCCH is the earliest in time and has the smallest associated CORESET number; the first PDCCH is the earliest in time and has the largest associated CORESET number; the first PDCCH is the latest in time and has the smallest associated CORESET number; or the first PDCCH is the latest in time and has the largest associated CORESET number.

[0489] Optionally, the first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas:

[0490]

[0491] Wherein, the second parameters related to the first PDCCH and the second PDCCH are different, and the third parameters related to the first PDCCH and the second PDCCH are the same; p1 and p2 are positive integers; p2≥p1; mod represents the modulo symbol.

[0492] Optionally, the second parameter related to the first PDCCH is determined according to a pre-agreed agreement or higher-level configuration, and / or the second parameter related to the second PDCCH is determined according to a pre-agreed agreement or higher-level configuration;

[0493] Alternatively, the second parameter related to the first PDCCH and the second PDCCH satisfies at least one of the following:

[0494] If the search space corresponding to the at least two PDCCHs is a common search space, then the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI;

[0495] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0496] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to the first PDCCH is equal to the first RNTI, the second parameter related to the second PDCCH is not equal to the first RNTI, and the second parameter related to the second PDCCH is related to the first RNTI.

[0497] Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs.

[0498] Optionally, the second parameter related to the second PDCCH is related to the first RNTI and satisfies at least one of the following:

[0499] The second parameter is equal to the sum of the first RNTI and C1, where C1 is a non-zero integer;

[0500] The second parameter is equal to the first RNTI and sum.

[0501] Optionally, the first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas:

[0502]

[0503] Wherein, at least one of the second and fourth parameters related to the first PDCCH and the second PDCCH is different, and the third parameter related to the first PDCCH and the second PDCCH is the same; p1 and p2 are positive integers; p2≥p1; mod represents the modulo symbol.

[0504] Optionally, the second and / or fourth parameters related to the first PDCCH are determined according to a pre-agreed agreement or higher-level configuration, and / or the second and / or fourth parameters related to the second PDCCH are determined according to a pre-agreed agreement or higher-level configuration;

[0505] Alternatively, the second and fourth parameters related to the first and second PDCCHs satisfy at least one of the following:

[0506] If the search spaces corresponding to the at least two PDCCHs are common search spaces, then the fourth parameters related to the first PDCCH and the second PDCCH are both equal to 0, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0507] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the fourth parameter related to the first PDCCH and the second PDCCH is equal to 0, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0508] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to the first PDCCH and the second PDCCH is equal to the first RNTI, and the fourth parameter related to the first PDCCH is equal to 0, and the fourth parameter related to the second PDCCH is equal to 1.

[0509] Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs.

[0510] Optionally, the first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas:

[0511]

[0512] Wherein, at least one of the second and third parameters related to the first PDCCH and the second PDCCH is different; p1 and p2 are positive integers; mod represents the modulo sign.

[0513] Optionally, the second and / or third parameters related to the first PDCCH are determined according to a pre-agreed agreement or higher-level configuration, and / or the second and / or third parameters related to the second PDCCH are determined according to a pre-agreed agreement or higher-level configuration;

[0514] Alternatively, the second and third parameters related to the first and second PDCCHs satisfy at least one of the following:

[0515] If the search spaces corresponding to the at least two PDCCHs are common search spaces, then the third parameters related to the first PDCCH and the second PDCCH are both equal to the fifth parameter, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI;

[0516] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the third parameter related to the first PDCCH and the second PDCCH is equal to the fifth parameter, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI.

[0517] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to both the first PDCCH and the second PDCCH is equal to the first RNTI, and the third parameter related to the first PDCCH is equal to the fifth parameter, and the third parameter related to the second PDCCH is equal to the fifth parameter. sum;

[0518] Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs; the fifth parameter is configured by a higher layer, or the fifth parameter is equal to the identifier ID of the cell where the terminal is located.

[0519] Optionally, the first high-level parameter is the pdcch-DMRS-ScramblingID parameter;

[0520] And / or, the first RNTI satisfies at least one of the following:

[0521] If the search space corresponding to the at least two PDCCHs is a Type 0 common search space, then the first RNTI is the System Information Radio Network Temporary Identifier SI-RNTI;

[0522] If the search space corresponding to the at least two PDCCHs is a Type0A common search space, then the first RNTI is a SI-RNTI;

[0523] If the search space corresponding to the at least two PDCCHs is a Type 1 common search space, then the first RNTI is any one of the following: Random Access Radio Network Temporary Identifier RA-RNTI, Message B Radio Network Temporary Identifier MsgB-RNTI, Temporary Cell Radio Network Temporary Identifier TC-RNTI;

[0524] If the search space corresponding to the at least two PDCCHs is a Type 2 common search space, then the first RNTI is a paging radio network temporary identifier (P-RNTI).

[0525] If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, then the first RNTI is a C-RNTI.

[0526] Optionally, the at least two PDCCHs satisfy at least one of the following:

[0527] The search spaces corresponding to at least two PDCCHs have the same search space set type;

[0528] The search spaces corresponding to the at least two PDCCHs have the same DCI format;

[0529] The search spaces corresponding to the at least two PDCCHs have the same length;

[0530] The search spaces corresponding to the at least two PDCCHs have the same listening opportunity in the next time unit;

[0531] The nth listening opportunity of the search space corresponding to the at least two PDCCHs is related, where n is a positive integer.

[0532] The transmission device 50 of this application embodiment can achieve the above-mentioned... Figure 3 The various processes of the method embodiments shown can achieve the same technical effect, and will not be described again here to avoid repetition.

[0533] Optional, such as Figure 6 As shown, this application embodiment also provides a communication device 60, including a processor 61, a memory 62, and a program or instructions stored in the memory 62 and executable on the processor 61. For example, when the communication device 60 is a terminal, the program or instructions executed by the processor 61 implement the above-mentioned... Figure 2 The various processes of the transmission method embodiments shown can achieve the same technical effect. When the communication device 60 is a network-side device, the program or instructions executed by the processor 61 implement the above. Figure 3 The various processes of the transmission method embodiments shown can achieve the same technical effect, and will not be described again here to avoid repetition.

[0534] This application also provides a computer program product, including computer instructions. When the computer instructions are executed by a processor, they can implement the various processes of the above-described transmission method embodiments and achieve the same technical effects. To avoid repetition, they will not be described again here.

[0535] This application also provides a readable storage medium storing a program or instructions. When the program or instructions are executed by a processor, they can implement the various processes of the above-described transmission method embodiments and achieve the same technical effects. To avoid repetition, they will not be described again here.

[0536] Computer-readable media include both permanent and non-permanent, removable and non-removable media, which can store information using any method or technology. Information can be computer-readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transferable medium that can be used to store information accessible by a computing device. As defined herein, computer-readable media does not include transient computer-readable media, such as modulated data signals and carrier waves.

[0537] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element.

[0538] The sequence numbers of the embodiments in this application are for descriptive purposes only and do not represent the superiority or inferiority of the embodiments.

[0539] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) and includes several instructions to cause a service classification device (which may be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in the various embodiments of this application.

[0540] The above description is only a preferred embodiment of this application. It should be noted that for those skilled in the art, several improvements and modifications can be made without departing from the principle of this application, and these improvements and modifications should also be considered within the scope of protection of this application.

Claims

1. A transmission method, characterized in that, include: The terminal receives at least two Physical Downlink Control Channels (PDCCHs); Wherein, the at least two PDCCHs satisfy at least one of the following: the at least two PDCCHs are repeatedly transmitted PDCCHs, there is an association between the search spaces corresponding to the at least two PDCCHs, and the at least two PDCCHs schedule at least one physical downlink shared channel (PDSCH) and / or physical uplink shared channel (PUSCH) that are the same; The at least two PDCCHs include a first PDCCH and at least one second PDCCH; The bit sequence of the first PDCCH is scrambled by a first sequence related to the first PDCCH before modulation, and the generation of the first sequence related to the first PDCCH is related to a first parameter related to the first PDCCH; the bit sequence of the second PDCCH is scrambled by a first sequence related to the second PDCCH before modulation, and the generation of the first sequence related to the second PDCCH is related to a first parameter related to the second PDCCH. The first parameters associated with the first PDCCH and the second PDCCH are different.

2. The method according to claim 1, characterized in that, The relationship between the search spaces corresponding to the at least two PDCCHs includes at least one of the following: The search spaces corresponding to at least two PDCCHs have a linking relationship; The search space sets corresponding to the at least two PDCCHs are linked.

3. The method according to claim 1, characterized in that, The method also includes, The terminal determines the time domain resources of at least one scheduled PDSCH and / or PUSCH based on the reception parameters of the first PDCCH. or, The time-domain resources of the at least one PDSCH and / or PUSCH are at least related to the reception parameters of the first PDCCH.

4. The method according to claim 1, characterized in that, The at least two PDCCHs satisfy any of the following: The at least two PDCCHs are located in different time units, and the first PDCCH is any one of the following among the at least two PDCCHs: the first PDCCH, the last PDCCH, and the kth PDCCH; wherein, k is configured by higher layer signaling; The control resource set CORESET numbers associated with the at least two PDCCHs are all different, and the first PDCCH satisfies any of the following: the CORESET number associated with the first PDCCH is the smallest; the CORESET number associated with the first PDCCH is the largest; the first PDCCH is the PDCCH corresponding to the k-th CORESET number when the CORESET numbers associated with the at least two PDCCHs are sorted in ascending order; the first PDCCH is the PDCCH corresponding to the k-th CORESET number when the CORESET numbers associated with the at least two PDCCHs are sorted in descending order; wherein, k is configured by higher layer signaling. The first PDCCH of the at least two PDCCHs satisfies any of the following: the first PDCCH is the earliest in time and has the smallest associated CORESET number; the first PDCCH is the earliest in time and has the largest associated CORESET number; the first PDCCH is the latest in time and has the smallest associated CORESET number; or the first PDCCH is the latest in time and has the largest associated CORESET number.

5. The method according to claim 1, characterized in that, The scrambling of the bit sequences of the first PDCCH and the second PDCCH satisfies the following: Where b(0), b(1), ..., b(M-1) represent the bit sequence before scrambling of the first PDCCH or the second PDCCH. This represents the scrambled bit sequence of the first PDCCH or the second PDCCH, and the Used for modulation; M represents the number of bits in the bit sequence of the first PDCCH or the second PDCCH; c(i) represents the first sequence associated with the first PDCCH or the second PDCCH; the generator of c(i) is initialized by the first parameter associated with the first PDCCH or the second PDCCH.

6. The method according to claim 1, characterized in that, The first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas: Wherein, the second parameters related to the first PDCCH and the second PDCCH are different, and the third parameters related to the first PDCCH and the second PDCCH are the same; p1 and p2 are positive integers; p2≥p1; mod represents the modulo symbol.

7. The method according to claim 6, characterized in that, The second parameter related to the first PDCCH is determined according to a pre-agreed agreement or higher-level configuration, and / or the second parameter related to the second PDCCH is determined according to a pre-agreed agreement or higher-level configuration; or, The second parameter associated with the first PDCCH and the second PDCCH satisfies at least one of the following: If the search space corresponding to the at least two PDCCHs is a common search space, then the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first radio network temporary identifier RNTI. If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI. If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to the first PDCCH is equal to the first RNTI, the second parameter related to the second PDCCH is not equal to the first RNTI, and the second parameter related to the second PDCCH is related to the first RNTI. Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs.

8. The method according to claim 7, characterized in that, The second parameter related to the second PDCCH is related to the first RNTI and satisfies at least one of the following: The second parameter is equal to the sum of the first RNTI and C1, where C1 is a non-zero integer; The second parameter is equal to the first RNTI and sum.

9. The method according to claim 1, characterized in that, The first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas: Wherein, at least one of the second and fourth parameters related to the first PDCCH and the second PDCCH is different, and the third parameter related to the first PDCCH and the second PDCCH is the same; p1 and p2 are positive integers; p2≥p1; mod represents the modulo symbol.

10. The method according to claim 9, characterized in that, The second and / or fourth parameters related to the first PDCCH are determined according to a pre-agreed agreement or higher-level configuration, and / or the second and / or fourth parameters related to the second PDCCH are determined according to a pre-agreed agreement or higher-level configuration; or, The second and fourth parameters related to the first and second PDCCHs satisfy at least one of the following: If the search spaces corresponding to the at least two PDCCHs are common search spaces, then the fourth parameters related to the first PDCCH and the second PDCCH are both equal to 0, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI. If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the fourth parameter related to the first PDCCH and the second PDCCH is equal to 0, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI. If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to the first PDCCH and the second PDCCH is equal to the first RNTI, and the fourth parameter related to the first PDCCH is equal to 0, and the fourth parameter related to the second PDCCH is equal to 1. Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs.

11. The method according to claim 1, characterized in that, The first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas: Wherein, at least one of the second and third parameters related to the first PDCCH and the second PDCCH is different; p1 and p2 are positive integers; mod represents the modulo sign.

12. The method according to claim 11, characterized in that, The second and / or third parameters related to the first PDCCH are determined according to a pre-agreed agreement or higher-level configuration, and / or the second and / or third parameters related to the second PDCCH are determined according to a pre-agreed agreement or higher-level configuration; or, The second and third parameters related to the first and second PDCCHs satisfy at least one of the following: If the search spaces corresponding to the at least two PDCCHs are common search spaces, then the third parameters related to the first PDCCH and the second PDCCH are both equal to the fifth parameter, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI; If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the third parameter related to the first PDCCH and the second PDCCH is equal to the fifth parameter, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI. If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to both the first PDCCH and the second PDCCH is equal to the first RNTI, and the third parameter related to the first PDCCH is equal to the fifth parameter, and the third parameter related to the second PDCCH is equal to the fifth parameter. sum; Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs; The fifth parameter is configured by a higher layer, or the fifth parameter is equal to the identifier ID of the cell where the terminal is located.

13. The method according to claim 7, 10, or 12, characterized in that, The first high-level parameter is the pdcch-DMRS-ScramblingID parameter; And / or, The first RNTI satisfies at least one of the following: If the search space corresponding to the at least two PDCCHs is a Type 0 common search space, then the first RNTI is the System Information Radio Network Temporary Identifier SI-RNTI; If the search space corresponding to the at least two PDCCHs is a Type0A common search space, then the first RNTI is a SI-RNTI; If the search space corresponding to the at least two PDCCHs is a Type 1 common search space, then the first RNTI is any one of the following: Random Access Radio Network Temporary Identifier RA-RNTI, Message B Radio Network Temporary Identifier MsgB-RNTI, Temporary Cell Radio Network Temporary Identifier TC-RNTI; If the search space corresponding to the at least two PDCCHs is a Type 2 common search space, then the first RNTI is a paging radio network temporary identifier (P-RNTI). If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, then the first RNTI is a C-RNTI.

14. The method according to claim 1, characterized in that, The at least two PDCCHs satisfy at least one of the following: The search spaces corresponding to at least two PDCCHs have the same search space set type; The search spaces corresponding to the at least two PDCCHs have the same DCI format; The search spaces corresponding to the at least two PDCCHs have the same length; The search spaces corresponding to the at least two PDCCHs have the same listening opportunity in the next time unit; The nth listening opportunity of the search space corresponding to the at least two PDCCHs is related, where n is a positive integer.

15. A transmission method, characterized in that, include: The network-side device sends at least two PDCCHs to the terminal; Wherein, the at least two PDCCHs satisfy at least one of the following: the at least two PDCCHs are repeatedly transmitted PDCCHs, there is an association between the search spaces corresponding to the at least two PDCCHs, and the at least two PDCCHs schedule at least one PDSCH and / or PUSCH that is the same; The at least two PDCCHs include a first PDCCH and at least one second PDCCH; The bit sequence of the first PDCCH is scrambled by a first sequence related to the first PDCCH before modulation, and the generation of the first sequence related to the first PDCCH is related to a first parameter related to the first PDCCH; the bit sequence of the second PDCCH is scrambled by a first sequence related to the second PDCCH before modulation, and the generation of the first sequence related to the second PDCCH is related to a first parameter related to the second PDCCH. The first parameters associated with the first PDCCH and the second PDCCH are different.

16. The method according to claim 15, characterized in that, The scrambling of the bit sequences of the first PDCCH and the second PDCCH satisfies the following: Where b(0), b(1), ..., b(M-1) represent the bit sequence before scrambling of the first PDCCH or the second PDCCH. This represents the scrambled bit sequence of the first PDCCH or the second PDCCH, and the Used for modulation; M represents the number of bits in the bit sequence of the first PDCCH or the second PDCCH; c(i) represents the first sequence associated with the first PDCCH or the second PDCCH; the generator of c(i) is initialized by the first parameter associated with the first PDCCH or the second PDCCH.

17. The method according to claim 15, characterized in that, The time-domain resources of the at least one PDSCH and / or PUSCH are at least related to the reception parameters of the first PDCCH.

18. The method according to claim 15, characterized in that, The at least two PDCCHs satisfy any of the following: The at least two PDCCHs are located in different time units, and the first PDCCH is any one of the following among the at least two PDCCHs: the first PDCCH, the last PDCCH, and the kth PDCCH; wherein, k is configured by higher layer signaling; The CORESET numbers associated with the at least two PDCCHs are all different, and the first PDCCH satisfies any of the following: the CORESET number associated with the first PDCCH is the smallest; the CORESET number associated with the first PDCCH is the largest; the first PDCCH is the PDCCH corresponding to the k-th CORESET number when the CORESET numbers associated with the at least two PDCCHs are sorted in ascending order; the first PDCCH is the PDCCH corresponding to the k-th CORESET number when the CORESET numbers associated with the at least two PDCCHs are sorted in descending order; wherein, k is configured by higher layer signaling. The first PDCCH of the at least two PDCCHs satisfies any of the following: the first PDCCH is the earliest in time and has the smallest associated CORESET number; the first PDCCH is the earliest in time and has the largest associated CORESET number; the first PDCCH is the latest in time and has the smallest associated CORESET number; or the first PDCCH is the latest in time and has the largest associated CORESET number.

19. The method according to claim 15, characterized in that, The first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas: Wherein, the second parameters related to the first PDCCH and the second PDCCH are different, and the third parameters related to the first PDCCH and the second PDCCH are the same; p1 and p2 are positive integers; p2≥p1; mod represents the modulo symbol.

20. The method according to claim 19, characterized in that, The second parameter related to the first PDCCH is determined according to a pre-agreed agreement or higher-level configuration, and / or the second parameter related to the second PDCCH is determined according to a pre-agreed agreement or higher-level configuration; or, The second parameter associated with the first PDCCH and the second PDCCH satisfies at least one of the following: If the search space corresponding to the at least two PDCCHs is a common search space, then the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI; If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI. If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to the first PDCCH is equal to the first RNTI, the second parameter related to the second PDCCH is not equal to the first RNTI, and the second parameter related to the second PDCCH is related to the first RNTI. Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs.

21. The method according to claim 15, characterized in that, The first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas: Wherein, at least one of the second and fourth parameters related to the first PDCCH and the second PDCCH is different, and the third parameter related to the first PDCCH and the second PDCCH is the same; p1 and p2 are positive integers; p2≥p1; mod represents the modulo symbol.

22. The method according to claim 21, characterized in that, The second and / or fourth parameters related to the first PDCCH are determined according to a pre-agreed agreement or higher-level configuration, and / or the second and / or fourth parameters related to the second PDCCH are determined according to a pre-agreed agreement or higher-level configuration; or, The second and fourth parameters related to the first and second PDCCHs satisfy at least one of the following: If the search spaces corresponding to the at least two PDCCHs are common search spaces, then the fourth parameters related to the first PDCCH and the second PDCCH are both equal to 0, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI. If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the fourth parameter related to the first PDCCH and the second PDCCH is equal to 0, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI. If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to the first PDCCH and the second PDCCH is equal to the first RNTI, and the fourth parameter related to the first PDCCH is equal to 0, and the fourth parameter related to the second PDCCH is equal to 1. Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs.

23. The method according to claim 15, characterized in that, The first parameters related to the first PDCCH and the second PDCCH are obtained by the following formulas: Wherein, at least one of the second and third parameters related to the first PDCCH and the second PDCCH is different; p1 and p2 are positive integers; mod represents the modulo sign.

24. The method according to claim 23, characterized in that, The second and / or third parameters related to the first PDCCH are determined according to a pre-agreed agreement or higher-level configuration, and / or the second and / or third parameters related to the second PDCCH are determined according to a pre-agreed agreement or higher-level configuration; or, The second and third parameters related to the first and second PDCCHs satisfy at least one of the following: If the search spaces corresponding to the at least two PDCCHs are common search spaces, then the third parameters related to the first PDCCH and the second PDCCH are both equal to the fifth parameter, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI; If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer does not configure the first higher layer parameter, then the third parameter related to the first PDCCH and the second PDCCH is equal to the fifth parameter, and the second parameter related to the first PDCCH is equal to 0, and the second parameter related to the second PDCCH is equal to the first RNTI. If the search space corresponding to the at least two PDCCHs is a terminal-specific search space, and the higher layer has configured the first higher layer parameter, then the second parameter related to both the first PDCCH and the second PDCCH is equal to the first RNTI, and the third parameter related to the first PDCCH is equal to the fifth parameter, and the third parameter related to the second PDCCH is equal to the fifth parameter. sum; Wherein, the at least two PDCCHs are associated with the same RNTI, and the first RNTI is the RNTI associated with the at least two PDCCHs; The fifth parameter is configured by a higher layer, or the fifth parameter is equal to the identifier ID of the cell where the terminal is located.

25. A transmission device, characterized in that, include: The receiving module is used to receive at least two PDCCHs; Wherein, the at least two PDCCHs satisfy at least one of the following: the at least two PDCCHs are repeatedly transmitted PDCCHs, there is an association between the search spaces corresponding to the at least two PDCCHs, and the at least two PDCCHs schedule at least one PDSCH and / or PUSCH that is the same; The at least two PDCCHs include a first PDCCH and at least one second PDCCH; The bit sequence of the first PDCCH is scrambled by a first sequence related to the first PDCCH before modulation, and the generation of the first sequence related to the first PDCCH is related to a first parameter related to the first PDCCH; the bit sequence of the second PDCCH is scrambled by a first sequence related to the second PDCCH before modulation, and the generation of the first sequence related to the second PDCCH is related to a first parameter related to the second PDCCH. The first parameters associated with the first PDCCH and the second PDCCH are different.

26. A transmission device, characterized in that, include: The sending module is used to send at least two PDCCHs to the terminal; Wherein, the at least two PDCCHs satisfy at least one of the following: the at least two PDCCHs are repeatedly transmitted PDCCHs, there is an association between the search spaces corresponding to the at least two PDCCHs, and the at least two PDCCHs schedule at least one PDSCH and / or PUSCH that is the same; The at least two PDCCHs include a first PDCCH and at least one second PDCCH; The bit sequence of the first PDCCH is scrambled by a first sequence related to the first PDCCH before modulation, and the generation of the first sequence related to the first PDCCH is related to a first parameter related to the first PDCCH; the bit sequence of the second PDCCH is scrambled by a first sequence related to the second PDCCH before modulation, and the generation of the first sequence related to the second PDCCH is related to a first parameter related to the second PDCCH. The first parameters associated with the first PDCCH and the second PDCCH are different.

27. A communication device, characterized in that, It includes a processor, a memory, and a program or instructions stored in the memory and executable on the processor, wherein the program or instructions, when executed by the processor, implement the steps of the method as claimed in any one of claims 1 to 14, or implement the steps of the method as claimed in any one of claims 15 to 24.

28. A readable storage medium, characterized in that, The readable storage medium stores a program or instructions that, when executed by a processor, implement the steps of the method as claimed in any one of claims 1 to 14, or implement the steps of the method as claimed in any one of claims 15 to 24.

29. A computer program product, characterized in that, Includes computer instructions that, when executed by a processor, implement the steps of the method as claimed in any one of claims 1 to 14, or implement the steps of the method as claimed in any one of claims 15 to 24.

Images