Threshold value, resource determination method, device, network equipment and storage medium

Abstract

The present application proposes a threshold value, resource determination method, apparatus, network device, and storage medium. The threshold value determination method includes: determining a first threshold value according to a preset rule; the first threshold value is the threshold value for each time span in a time span pattern. The resource determination method includes using the threshold value of the time span to determine resources that should be retained or discarded; the resources include: a candidate set, or all candidate sets in a search space, or all candidate sets in a search space within a current time span, or candidate sets of all search spaces within a time span.

Description

Technical Field

[0001] The present application relates to the field of communications, and specifically to a threshold value, a resource determination method, an apparatus, a network device, and a storage medium. Background Art

[0002] Currently, the demands on the fourth-generation mobile communication technology (4G), Long-Term Evolution (LTE), Long-Term Evolution Advance (LTE-Advance / LTE-A), and the fifth-generation mobile communication technology (5G) are increasing. Current development trends indicate that both 4G and 5G systems are developing features that support enhanced mobile broadband, ultra-high reliability, ultra-low latency transmission, and massive connections.

[0003] To support ultra-high reliability and ultra-low latency transmission, transmission must be performed at a lower bit rate within a shorter transmission interval. This shorter transmission interval can be a single or multiple OFDM (Orthogonal Frequency Division Multiplexing) symbols. For the Physical Downlink Control Channel (PDCCH), existing technologies reduce the waiting time after data arrival by providing multiple transmission opportunities within a time slot, ensuring low-latency transmission and high-reliability transmission through high aggregation levels. Since the current NR R15 (New Radio Release 15) system's blind detection threshold (Maximum number of Blind Decode, BD threshold) and / or the non-overlapping control resource unit number threshold (Maximum number of non-overlapping CCEs for channel estimation, CCE threshold for short) are insufficient when supporting R16 URLLC services, especially when the number of CCEs (Control Channel Element, control channel element) in multiple occasion positions is difficult to support a high aggregation level, it is necessary to increase the corresponding threshold value. When increasing the corresponding threshold value, it is necessary to determine how long the time unit is used to define the increased threshold value. If there are two or more threshold values of two time units, how to determine the actual number of blind detections and / or the number of control resource units.

[0004] Currently, the blind detection number threshold and / or the non-overlapping control resource unit number threshold for channel estimation in the NR R15 system may not be consistent with the actual number of candidate sets. The actual number of candidate sets may exceed the aforementioned thresholds, and it is necessary to determine the candidate sets to be discarded. Summary of the Invention

[0005] In order to solve at least one of the above technical problems, the embodiments of the present application provide the following solution.

[0006] This embodiment of the present application provides a method for determining a threshold value, including:

[0007] According to a preset rule, a first threshold value is determined; the first threshold value is a threshold value of each time span in the time span pattern.

[0008] This embodiment of the present application provides a resource determination method, including:

[0009] Using the time span threshold, determine the resources that should be retained or discarded;

[0010] The resources include: candidate sets, or all candidate sets in a search space, or all candidate sets of a search space in a current time span, or candidate sets of all search spaces in a time span.

[0011] The present invention provides a threshold value determination device, including:

[0012] A first threshold value determining module is configured to determine a first threshold value according to a preset rule; the first threshold value is a threshold value of each time span in the time span pattern.

[0013] An embodiment of the present application provides a resource determination device, including:

[0014] Resource determination module: used to determine the resources that should be retained or discarded using the time span threshold;

[0015] The resources include: candidate sets, or all candidate sets of the search space within the current time span, or candidate sets of all search spaces within the time span.

[0016] An embodiment of the present application provides a network device, wherein the base station includes: a processor and a memory;

[0017] The memory is used to store instructions;

[0018] The processor is configured to read the instruction to execute the method applied to the base station in the embodiment of the present application.

[0019] An embodiment of the present application provides a storage medium storing a computer program. When the computer program is executed by a processor, any one of the methods provided in the embodiments of the present application is implemented.

[0020] The threshold value determination method of the embodiment of the present application determines the threshold value of each time span in the time span pattern, so that the threshold value of the user equipment (UE) in the new system can be improved, and different numbers of threshold values are supported for different user equipment capabilities, ensuring that UEs with different capabilities process different amounts of resources, and increasing scheduling flexibility without increasing system complexity. The resource determination method of the embodiment of the present application can ensure that the terminal does not exceed the threshold value in each time slot, does not increase the terminal processing complexity, is suitable for scenarios that allow over-booking within a time slot or time span, and can also increase configuration and scheduling flexibility without exceeding the UE capability. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] Figure 1 Flowchart of the threshold configuration method.

[0022] Figure 2 Flowchart of the threshold configuration method.

[0023] Figure 3 Flowchart of the threshold configuration method.

[0024] Figure 4 Flowchart of the threshold configuration method.

[0025] Figure 5 Flowchart of the threshold configuration method.

[0026] Figure 6 Flowchart of the threshold configuration method.

[0027] Figure 7 Flowchart of the threshold configuration method.

[0028] Figure 8 Flowchart of the threshold configuration method.

[0029] Figures 9A-9C This is a schematic diagram of repeatedly transmitting the same transport block in consecutive available time slots according to an embodiment of the present application;

[0030] Figure 10 This is a schematic diagram of the structure of the terminal according to an embodiment of the present application.

[0031] Figure 11 This is a schematic diagram of the structure of the communication system according to an embodiment of the present application. DETAILED DESCRIPTION

[0032] To make the purpose, technical solutions and advantages of this application more clear, the embodiments of this application will be described in detail below with reference to the accompanying drawings. It should be noted that, unless there is a conflict, the embodiments and features in the embodiments of this application can be combined with each other in any way.

[0033] like Figure 1 As shown, the present application provides a method for determining a threshold value, characterized by comprising:

[0034] Step S11: determining a first threshold value according to a preset rule; the first threshold value is a threshold value of each time span in the time span pattern.

[0035] In the embodiment of the present application, the time span pattern is a pattern composed of all spans within a certain time range, wherein the certain time unit may be a time slot.

[0036] In the embodiment of the present application, the first threshold values of different time spans may be the same or different.

[0037] In an embodiment of the present application, a time span pattern is determined based on a time span parameter set reported by a user device and system high-layer signaling. Specifically, a time span parameter set is also referred to as a combination in this application. Furthermore, the span pattern is determined based on the combination reported by the user device and system high-layer signaling.

[0038] In one embodiment, Figure 2 As shown, determining the first threshold value includes:

[0039] Step S21: Determine a second threshold value; the second threshold value is a threshold value corresponding to each element in the time span parameter set reported by the user equipment;

[0040] Step S22: Determine the first threshold value according to the second threshold value.

[0041] In the embodiment of the present application, each element in the time span parameter set is represented by (X, Y), where X and Y are two natural numbers, X represents the time span starting point interval, and Y represents the time span duration.

[0042] In this embodiment of the present application, the time span parameter set reported by the UE may include a set consisting of multiple (X, Y) combinations, where (X, Y) may take at least one of (1, 1), (2, 1), (2, 2), (4, 1), (4, 2), (4, 3), (7, 1), (7, 2), and (7, 3). The UE reports the (X, Y) set, and possible (X, Y) combinations are {(7, 3)}, {(4, 3) and (7, 3)}, {(2, 2) and (4, 3) and (7, 3)}, etc.

[0043] In one embodiment, determining the second threshold value according to a preset rule includes:

[0044] According to the capability level of the user equipment, a second threshold value corresponding to the capability level of the user equipment is determined.

[0045] In the embodiment of the present application, the user equipment has a fixed capability level. Typically, the user equipment has two capability levels: capability level 1 (Capability 1) and capability level 2 (Capability 2).

[0046] In one embodiment, determining the second threshold value according to a preset rule includes:

[0047] Determine, according to an element of a time span parameter set, a maximum number of time spans that can be determined by the element;

[0048] Calculate an average threshold value of each time span according to the maximum value of the number of time spans and the time slot threshold value;

[0049] The threshold value corresponding to the element is determined according to the average threshold value of each time span.

[0050] In this embodiment of the present application, based on the minimum X in the time span parameter set, the quotient obtained by dividing the time slot length by the minimum X value is the largest integer value less than the quotient, which is the maximum number of time spans that can be determined based on the elements of the time span parameter set. For example, if the time span parameter set is {(4, 3), (7, 3)}, the maximum time span value calculated based on this time span parameter set is the largest integer less than 14 / 4, that is, 3.

[0051] In one embodiment, the first threshold value corresponding to the time span where the search space or monitoring opportunity of the first L symbols in the time slot is located is greater than the first threshold values corresponding to the remaining time spans, and L is a positive integer.

[0052] In the embodiment of the present application, the value of L is 3. The first three symbols in the time slot are case 1-1.

[0053] In one embodiment, determining the first threshold value according to a preset rule includes:

[0054] The first threshold value is determined according to the total threshold value in the time slot and the number of time spans in the time slot.

[0055] In one embodiment, the first threshold value is determined based on the total threshold value in the time slot and the number of time spans in the time slot, wherein the first threshold value of the search space of the first L symbols in the time slot or the time span in which the monitoring opportunity is located is determined as follows:

[0056] Determining a third threshold value based on the total threshold value in the time slot and the number of time spans in the time slot; the third threshold value is the maximum threshold value that can be obtained for each time span when the total threshold value in the time slot is evenly distributed to each time span;

[0057] The remaining number in the time slot is allocated to the search space of the first L symbols in the time slot or the threshold value of the time span where the monitoring opportunity is located to obtain the first threshold value; the remaining number is the remaining number after deducting the product of the third threshold value and the number of time spans in the time slot from the total threshold value; L is a positive integer.

[0058] In this embodiment of the present application, the third threshold is the largest integer less than the total threshold in the time slot divided by the number of time spans. For example, if the total threshold of the time slot is 50 and the number of time spans is 6, the third threshold is the largest integer less than 50 / 6, that is, 8.

[0059] In one embodiment, the first threshold value of the search space of the first L symbols in the time slot or the time span of the monitoring opportunity is determined as follows:

[0060] The first threshold value corresponding to the search space of the first L symbols in the time slot or the time span where the monitoring opportunity is located is equal to the sum of the threshold value of the time slot and the second threshold value, and L is a positive integer.

[0061] In the embodiment of the present application, the value of L is 3. The first three symbols in the time slot are case 1-1.

[0062] In one embodiment, the first threshold value of the search space of the first L symbols in the time slot or the time span of the monitoring opportunity is determined as follows:

[0063] The first threshold value corresponding to the search space of the first L symbols in the time slot or the time span where the monitoring opportunity is located is equal to the sum of the threshold value of the time slot and the third threshold value, and L is a positive integer.

[0064] In the embodiment of the present application, the value of L is 3. The first three symbols in the time slot are case 1-1.

[0065] In one embodiment, determining the first threshold value includes:

[0066] According to the length of the time span, a corresponding offset value is added to the second threshold value to obtain the first threshold value.

[0067] In the embodiment of the present application, the offset value is obtained according to setting or calculation.

[0068] In one embodiment, determining the first threshold value includes:

[0069] When the actual number of time spans in the time slot is less than the maximum number of time spans, the offset value is added to the second threshold value to obtain the first threshold value.

[0070] In the embodiment of the present application, the offset value is obtained according to setting or calculation.

[0071] In one embodiment, the preset rule includes at least one of the following:

[0072] If the time span parameter set includes the element (7, 3), and the actual time span pattern is the same as the time span pattern obtained using the element (7, 3), then the second threshold value corresponding to the element (7, 3) is used to determine the first threshold value;

[0073] If the time span parameter set includes the element (4, 3), and the actual time span pattern is the same as the time span pattern obtained using the element (4, 3), then the first threshold value is determined using the second threshold value corresponding to the element (4, 3);

[0074] If the actual time span pattern has only one time span, the first threshold value is determined using the threshold value of the time slot;

[0075] If the actual time span pattern is other than the above cases, the first threshold value is determined by using the second threshold value corresponding to the element (2, 2).

[0076] In one embodiment, determining the first threshold value according to the second threshold value includes:

[0077] If the actual time span pattern of the portion of the time span in the time slot is the same as the time span pattern obtained using the element (7, 3), the second threshold value corresponding to the element (7, 3) is used to determine the first threshold value;

[0078] If the actual time span pattern of some time spans in the time slot is the same as the time span pattern obtained using the element (2,2), the second threshold value corresponding to the element (2,2) is used to determine the first threshold value.

[0079] In one embodiment, determining the first threshold value according to a preset rule includes:

[0080] The first threshold is configured through high-layer signaling. Further, the first threshold is configured for each span independently, or the same first threshold is configured for all spans.

[0081] In one embodiment, the offset value is at least one integer between -N and N, where N is a positive integer.

[0082] In one embodiment, N is a subset of {2, 4, 6, 8, 10, 16, 24, 32, 36, 42, 48, 56, 64}.

[0083] In one implementation, the threshold value is a blind detection times threshold or a non-overlapping control resource unit quantity threshold.

[0084] This application provides a resource determination method, such as Figure 3 Shown, including:

[0085] Step S31: using the time span threshold, determine the resources that should be retained or discarded.

[0086] The resources include: candidate sets, or all candidate sets in a search space, or all candidate sets of a search space in a current time span, or candidate sets of all search spaces in a time span.

[0087] In the embodiment of the present application, the resources that should be retained are the resources that are targeted for monitoring, and the resources that should be discarded are the resources that exceed a threshold and therefore need to be abandoned for monitoring.

[0088] In one embodiment, determining resources to be retained or discarded using a time span threshold includes:

[0089] If the sum of the threshold values of all time spans in the same time slot is greater than the threshold value of the time slot, then according to the sorting of all time spans in the time slot, the candidate set of the time span indexed by the critical value and all time spans thereafter is determined as the candidate set to be discarded; or the candidate set of all time spans before the time span indexed by the critical value is determined as the candidate set to be retained;

[0090] The cumulative sum of the threshold values from the first-ranked time span in the current time slot to the time span indexed by the critical value exceeds the threshold value of the time slot for the first time.

[0091] In one embodiment, determining resources to be retained or discarded using a time span threshold includes:

[0092] If the number of resources within a time span is greater than the threshold value of this time span, the part of the resources exceeding the threshold value of this time span is determined to be resources that should be discarded; or the part of the candidate set that does not exceed the threshold value of this time span is determined to be retained resources.

[0093] In one embodiment, when the resource is a candidate set, a method of discarding or retaining includes one of the following:

[0094] The aggregation level of the part of the candidate set that exceeds the time span threshold is ranked higher than the aggregation level of the part of the candidate set that does not exceed the time span threshold;

[0095] The aggregation level of the part of the candidate set that exceeds the time span threshold is ranked lower than the aggregation level of the part of the candidate set that does not exceed the time span threshold;

[0096] Each aggregation level discards or retains a certain number of candidate sets in turn until it does not exceed the span threshold of this event. The certain number is the same number that is preset or configured, or a numerical pattern corresponding to each aggregation level.

[0097] In an embodiment of the present application, the numerical pattern corresponding to each aggregation level is a pattern of the number of candidate sets retained or discarded each time for each aggregation level, for example, 0, 1, 1, 2, 2 for AL = 16, 8, 4, 2, 1 means that 0, 1, 1, 2, 2 candidate sets are retained or discarded for aggregation levels 16, 8, 4, 2, 1 each time.

[0098] In one embodiment, Figure 4 As shown, before determining the resources to be retained or discarded using the time span threshold, the following steps are also included:

[0099] Step S41: If the sum of the threshold values of all time spans within the same time slot is greater than the threshold value of the time slot, then the average threshold value of all time spans within the time slot is calculated based on the threshold value of the time slot;

[0100] Step S42: re-determine the threshold value of each time span in the time slot according to the average threshold value of all time spans in the time slot.

[0101] In one embodiment, Figure 5 As shown, before determining the resources to be retained or discarded using the time span threshold, the following steps are also included:

[0102] Step S51: If the sum of the threshold values of all time spans in a time slot is greater than the threshold value of the time slot, the threshold value of each time span in the time slot is re-determined through high-layer signaling configuration so that the sum of the threshold values of each re-determined time span is not greater than the threshold value of the time slot.

[0103] In one embodiment, Figure 6 As shown, before determining the resources to be retained or discarded using the time span threshold, the following steps are also included:

[0104] Step S61: re-determine the threshold value of at least one time span as the sum of the threshold value of the time slot and the threshold value of the time span.

[0105] In an embodiment of the present application, the threshold value of at least one time span is re-determined as the sum of the threshold value of the time slot and the threshold value of the time span, indicating that the threshold value of at least one time span is re-determined as the sum of the threshold value of the time slot and the threshold value of the original time span.

[0106] In one embodiment, Figure 7 As shown, before determining the resources to be retained or discarded using the time span threshold, the following steps are also included:

[0107] Step S71: If the time span threshold is different from the threshold configured for each time span by higher layer signaling, the time span threshold is re-determined to be the smaller one of the original time span threshold and the threshold configured for each time span by higher layer signaling.

[0108] In one embodiment, the resources that should be retained or discarded are determined using the time span threshold, including: first determining the resources that should be retained or discarded according to the time slot threshold, and then determining the resources that should be retained or discarded according to the time span threshold.

[0109] In one embodiment, the resources that should be retained or discarded are determined using the time span threshold, including: first determining the resources that should be retained or discarded according to the time span threshold, and then determining the resources that should be retained or discarded according to the time slot threshold.

[0110] In one embodiment, first determining the resources to be retained or discarded according to the time span threshold, and then determining the resources to be retained or discarded according to the time slot threshold, includes:

[0111] Determine the resources that should be retained or discarded according to the time span threshold;

[0112] If the reserved resources still exceed the time slot threshold, then according to the sorting of all time spans in the time slot, determine the candidate sets of all time spans after the time span indexed by the critical value as the candidate sets that should be discarded, and determine the partial candidate sets of the time span indexed by the critical value as the candidate sets that should be discarded; or determine the candidate sets of all time spans before the time span indexed by the critical value as the candidate sets that should be retained, and determine the partial candidate sets of the time span indexed by the critical value as the candidate sets that should be retained;

[0113] The cumulative sum of the threshold values from the first-ranked time span in the current time slot to the time span indexed by the critical value exceeds the threshold value of the time slot for the first time.

[0114] In one embodiment, when the resources include all candidate sets of the search space within the current time span, determining the resources to be retained or discarded using a threshold value of the time span includes:

[0115] If there is no time slot threshold value, then according to the order of the search spaces within the time span, the candidate set of the search space indexed by the critical value and all the search spaces thereafter is determined as the candidate set to be discarded; or the candidate set of all the search spaces before the search space indexed by the critical value is determined as the candidate set to be retained;

[0116] The cumulative sum of the threshold values from the search space ranked first in the time span to the search space indexed by the critical value exceeds the threshold value of the time span for the first time.

[0117] In one embodiment, the candidate set is a candidate set for PDCCH channel blind detection corresponding to a BD (Blind detection) threshold, or a non-overlapping CCE used for channel estimation.

[0118] In one implementation, the threshold value of the time span is the threshold value determined by the threshold value determination method provided in the embodiment of the present application.

[0119] In an embodiment of the present application, the time span parameter set is represented by {(X, Y)}, where X is the time span starting point interval and Y is the time span length. For R16 URLLC terminals, the maximum number of blind detection times (BD threshold for short) and / or the maximum number of non-overlapping CCEs for channel estimation (CCE threshold for short) are increased relative to R15 to increase the threshold value. Moreover, the BD threshold and / or CCE threshold are defined, for example, at the granularity of the span, that is, the increase of the BD threshold and / or CCE threshold of each span is considered. The following description only takes the CCE threshold as an example. Similarly, the BD threshold can also be used in the following method.

[0120] Implementation Method 1

[0121] In one example, a time span pattern can be determined as follows: a span pattern in a time slot is determined using a candidate (X, Y) set reported by the UE, a PDCCH CORESET, and a search space. Spans in the span pattern are not allowed to overlap, and the interval between two span start points is no less than X symbols. Span duration = Maximum (configured maximum CORESET duration, minimum Y reported by the UE), that is, the Y value is related to the span duration. Only the last span in the span pattern can have a shorter duration. The number of spans does not exceed floor(14 / X), that is, the value obtained by rounding down 14 / X, where X is the minimum X among the values reported by the UE. For example, (X, Y) includes at least one of the following: (1, 1), (2, 1), (2, 2), (4, 1), (4, 2), (4, 3), (7, 1), (7, 2), and (7, 3). For example, the (X, Y) set of candidates reported by the UE includes at least one of the following: {(7, 3), (4, 3)}, {(7, 3), (2, 2)}, (4, 3) and (7, 3).

[0122] The CCE threshold value M corresponding to each (X, Y) in the time span parameter set is determined in a predefined manner, where M represents the number threshold value of CCEs corresponding to each element in the time span parameter set. For example, as shown in Table 1 or Table 2 or Table 3, the following table is only a specific embodiment of the present application and is not used to limit the present application. In addition, the CCE threshold value M corresponding to each span in the span pattern can also be determined by predefinition or DCI (Downlink Control Information) dynamic notification or RRC (Radio Resource Control) configuration. Using M K Indicates the span threshold value, K is the span number in the span pattern, that is, the first threshold value.

[0123] Table 1

[0124] X Y M 2 2 16 4 3 36 7 3 56

[0125] Table 2

[0126] X Y M 1 1 16 2 2 16 4 3 36 7 3 56

[0127] Table 3

[0128] X Y M 1 1 16 2 1 16 2 2 16 4 1 16 4 2 24 4 3 36 7 1 36 7 2 48 7 3 56

[0129] When considering different UE capabilities, M can be defined based on span only for UE Capability 2. M represents the CCE threshold corresponding to the element (X, Y) of the candidate set reported by the UE, that is, the maximum number of non-overlapping CCEs used for channel estimation. This is determined using Table 1, Table 2, or Table 3. A UE with Capability 1 may not support the per-span CCE threshold and only supports the per-slot CCE threshold for R15.

[0130] In one embodiment, for the same element (X, Y), the M values corresponding to the two capabilities of the UE may be different. Furthermore, two tables may be defined for the UE's Capability1 and the UE's Capability2, respectively, to define the M value; or one table may be defined for one capability, and an offset may be defined for the other capability. For example, Table 1, Table 2, or Table 3 may be used to define the M value for the UE's Capability1. For the UE's Capability2, the CCE threshold is M+offset, and the offset value may be the same or different for different elements (X, Y). The offset value may also be determined by predefinition or DCI notification or RRC configuration. In this embodiment, different maximum CCE numbers can be supported for different UE capabilities, ensuring that different UE capabilities handle different numbers of CCE thresholds.

[0131] Implementation 1.1

[0132] When assuming M K It is obtained based on the span's M and / or time slot threshold. M can be determined by the following equation K Value:

[0133] M K _per_span=floor(M_per_slot / Max_Num_of_span)=floor(M_per_slot / floor(14 / X));

[0134] That is, the threshold value of the time slot is evenly divided according to the maximum number of spans in the time slot. Where X is the smallest X in the time span parameter set reported by the UE. For example, M_per_slot = 112. K _per_span represents the M value based on the span or (X, Y) definition, M_per_slot represents the M value based on the slot definition, and Max_Num_of_span represents the maximum number of spans in a slot, for example, determined by floor(14 / X). Alternatively, the maximum number of spans is floor(14 / maximum(X, configured maximum CORESET duration)), where X is the minimum X in the UE-reported time span parameter set, and M is divided equally according to the maximum number of spans in the time slot. K_per_span = floor(M_per_slot / Max_Num_of_span) = floor(M_per_slot / floor(14 / maximum(X, configured maximum CORESET duration))), where X is the minimum X in the UE-reported time span parameter set. CORESET duration is the core set duration.

[0135] Implementation 1.2

[0136] Assume M K It is obtained based on the span's M and / or time slot threshold. The M of the span at different slot positions k The values are not all the same. For example, the search space containing the first three symbols in the slot / case1-1 or the span of monitoring occasions (monitoring opportunities) k The value is greater than the M of other spans k Case 1-1 indicates that the configured search space is concentrated on the first three symbols of the slot.

[0137] In one embodiment, M can be defined by a table similar to Table 1, Table 2, and Table 3. Two M values are defined, corresponding to the span containing case 1-1 and the remaining spans, respectively. M is obtained according to the M in the table. K .

[0138] In one embodiment, M can be defined using a table similar to Table 1, Table 2, and Table 3, where one M value is defined. The remaining capacity in M_per_slot is allocated to M of the span containing case 1-1 to obtain Mk. For example, Mk corresponding to the span containing case 1-1 = M_per_span + (M_per_slot - Max_Num_of_span * floor(M_per_slot / Max_Num_of_span)). For another example, Mk = M_per_span + (M_per_slot - Num_of_span * floor(M_per_slot / Max_Num_of_span)); where Num_of_span represents the actual number of spans in the slot. Max_Num_of_span = floor(14 / maximum(X, configured maximum CORESET duration)).

[0139] Implementation 1.3

[0140] Determine M based on the Y value based on implementation methods 1.1 and 1.2. KTaking (4,1), (4,2), (4,3) as an example, the M_per_span determined by the method in implementation 1.1 is the same. Therefore, further, M K =floor(M_per_slot / Max_Num_of_span)+offset, where offset takes different values for Y=1, 2, and 3. For example, taking (4,1) as the benchmark, (4,2) and (4,3) are added with a positive offset. For another example, taking (4,3) as the benchmark, (4,1) and (4,2) are added with a negative offset. The embodiment of the present application determines the CCE threshold (Mk) of each span by equal or unequal division, and is applicable to different scenarios, such as pure URLLC (Ultra-Reliable Low Latency Communication) scenarios, or eMBB (enhanced Mobile Broadband) and URLLC coexistence scenarios.

[0141] In one embodiment of the present application, after M is determined according to (X, Y), if the actual number of spans is less than the maximum number of spans, the total number of CCEs determined by summing up the spans in the slot is less than M_per_slot, then M k Adding additional offsets increases scheduling flexibility without exceeding UE capabilities.

[0142] In one embodiment of the present application, M is increased so that M k The corresponding X and / or Y is greater than the M value corresponding to the remaining (X, Y) except the current (X, Y). For example, the actual M is determined based on at least one of the base station configuration, the actual number of spans, and the span interval. K For example, if M_for_(2,2)=16, when the actual number of spans is less than the maximum number of spans (for example, floor(14 / 2)=7), when the actual number of spans is 2, M K Use the M value of (7,3) or (7,2) or (7,1), for example, M_for_(7,3) = 56. For example, when the actual number of spans is 1, M K Use the value of M in M_per_slot, for example, M_per_slot=112. For another example, when the actual number of spans is 3, M K Use the M value of (4,3) or (4,2) or (4,1), for example, M_for_(4,3) = 36. For example, when the actual number of spans is 5, M KThe M value of (2,2) or (2,1) is still used and does not increase. For example, when the actual number of spans is 2, but the span interval is 2 symbols, then M K The M value of (2,2) or (2,1) is still used and does not increase. In the above embodiment, M_for_(X,Y) is used to represent the M value corresponding to the time span parameter set element reported by the UE.

[0143] In one embodiment of the present application, for the time span parameter set {(2,2) and (4,3) and (7,3)} reported by the UE, the M of span K It can be determined as follows: For UE reporting capability {(2,2) and (4,3) and (7,3)}, the span M K The determination method is: if the actual span pattern is the same as the span pattern obtained by (7,3), it means that the actual span pattern can also be determined by the elements (4,3) or (2,2), such as Figure 8 As shown, use M_for_(7,3) to determine the span M K , or the actual span pattern is the same as the span pattern obtained by (4,3), which means that the actual span pattern can also be determined by the element (2,2), then M_for_(4,3) is used to determine the M of the span K If the actual spanpattern has only one span, use M_per_slot to determine the span's M. K In other cases (i.e. the number of spans is greater than 3, or the span interval is less than 4, etc.), use M for (2, 2) to determine the span M. K . Figure 8 MO stands for Monitoring Occasion. K The values of can be the same or not. For example, if the UE reports {(4,3)and(7,3)}, the span M K It can be determined as follows: For UE reporting capability {(4,3) and (7,3)}, the span M K The determination method is: if the actual span pattern is the same as the span pattern obtained by (7,3), it means that the actual span pattern can also be determined by the element (4,3), then use M_for_(7,3) to determine the M of the span KIf the actual span pattern has only one span, use M_per_slot to determine the span's M K In other cases (i.e. the number of spans is greater than 2, or the span interval is less than 7, etc.), use M_for_(4,3) to determine the M of the span. K For example, if the UE reports {(7,3)}, the span M K It can be determined as follows: If the UE reported capability is {(7,3)}, the span M K The determination method is: if the actual span pattern has only one span, use M_per_slot to determine the span's M K In other cases (i.e. the number of spans is greater than 1), use M_for_(7,3) to determine the M of the span. K .

[0144] In one embodiment of the present application, when M for different K is allowed K When the values are different, an exemplary method is: for the time span parameter set reported by the UE is: {(2,2)and(4,3)and(7,3)}, the M of span K It can be determined as follows: If the actual span pattern of part of the span in the slot (for example, the first half of the slot) is the same as the span pattern obtained by (7,3), it means that the actual span pattern can also be determined by the elements (2,2) or (4,3), then use M_for_(7,3) to determine the M of the part of the span. K ; When the actual span pattern of part of the span (for example, the second half of the slot) is the same as the span pattern obtained by (2,2), use M_for_(2,2) to determine the M of the part of the span K .

[0145] In one embodiment of the present application, after M is determined based on (X, Y), when the actual span duration is greater than Y (i.e., when the CORESET duration is greater than Y), MK is obtained by adding an offset to M. Because M_per_span is defined based on M_for_(X, Y), when the actual span duration is greater than Y, insufficient CCEs may be used in the actual span. Increasing the offset can improve scheduling flexibility.

[0146] In one embodiment of the present application, the offset value is at least one integer between -N and N, for example, N is a subset of the set {2, 4, 6, 8, 10, 16, 24, 32, 36, 42, 48, 56, 64}. The offset can be determined by pre-defined, dynamic notification, or semi-static configuration.

[0147] The present invention provides a threshold value determination method that determines the CCE threshold for each span by equal or unequal division. This method is applicable to different scenarios, such as pure URLLC scenarios or eMBB and URLLC coexistence scenarios. Furthermore, when the actual number of spans is small or the actual span duration is long, a certain amount of CCE threshold adjustment is allowed to be increased, thereby increasing scheduling flexibility without exceeding UE capabilities.

[0148] The above-mentioned implementation of the present application can also be used to determine the BD threshold of blind detection, and the calculation method is the same.

[0149] Implementation Method 2

[0150] In this embodiment, the resources to be discarded or retained can be determined with span as the granularity. This embodiment adopts the span definition in embodiment 1 and takes the CCE threshold per span as an example, but is not limited thereto.

[0151] The CCE threshold per slot (M_per_slot) and the CCE threshold per span (M_per_span, i.e., the M of span) are defined at the same time. K ), when the sum of the number of CCEs of each span in a slot (∑M_per_span) is not equal to M_per_slot, for example, when ∑M_per_span>M_per_slot, the processing method includes one of the following:

[0152] Implementation 2.1

[0153] Recalculate M_per_span and ensure that the sum is no greater than M_per_slot. You can re-divide the M_per_slot value to obtain a new, smaller M_per_span. For example, if M_per_span = 16 and M_per_slot = 80, and there are 6 spans in a slot, then ∑M_per_span = 96 > 80, so recalculate the new M_per_span = floor(80 / 6) = 13. Furthermore, you can choose to align to one of the values in the set {1, 2, 4, 8, 12, 16, 20, 24, 32, 36, 40, 48, 56, 64} using the closest alignment principle. The new M_per_span is 12, and the candidate set (candidate) is discarded based on the recalculated M_per_span.

[0154] Implementation 2.2

[0155] Discard some spans. For example, when the total number of CCEs accumulated in span index order does not exceed M_per_slot, the UE monitors the current span. When the total number of CCEs accumulated in the current span exceeds M_per_slot, the UE no longer monitors the occasions in the current span and subsequent spans, ensuring that the total sum does not exceed M_per_slot. That is, the M_per_span value remains unchanged, and the number of candidate sets corresponding to the span is reduced.

[0156] Implementation 2.3

[0157] The base station divides M_per_slot into M_1, M_2, ..., M_n according to the number of spans, where n is the number of spans. M_per_span is compared with M_1, M_2, ..., M_n. When M_per_span <= M_i, it is compared with M_per_span; when M_per_span > M_i, it determines the candidate set to be discarded or retained according to Mi_i.

[0158] Implementation 2.4

[0159] The upper limit M of each span configured by the base station K , ensure that the M of each span is configured K The sum of M_per_slot does not exceed M_per_slot. For example, the configured M K It is always no greater than M determined based on (X, Y) reported by UE. K Determine which candidate sets need to be discarded or retained.

[0160] In this embodiment, the method described in this embodiment determines whether to drop or retain a candidate set based on span granularity, thereby ensuring that the terminal's CCE threshold for each slot is not exceeded, without increasing terminal processing complexity. This is suitable for scenarios where overbooking within a slot or span is allowed, thereby increasing configuration and scheduling flexibility without exceeding UE capabilities.

[0161] Implementation 3

[0162] In this embodiment, retention or discard is determined based on the granularity of candidate set, search space, and span. This embodiment adopts the span definition in embodiment 1 and takes the CCE threshold per span as an example, but is not limited thereto.

[0163] When only the M_per_span limit is applied and no M_per_slot limit is applied, the terminal performs candidate dropping at the span granularity. That is, the terminal accumulates candidates in ascending order of SS index to determine whether the candidate exceeds the M_per_span. If the candidate does not exceed the M_per_span, it is considered as the actual valid candidate. If the candidate exceeds the M_per_span, all or part of the candidate sets in the current search space are discarded. For example, when discarding part of the candidate set, the corresponding candidates are discarded in order from small to large (or from large to small) in the order of aggregation level until the M_per_span is not exceeded, or the same number of candidate sets (or configured or preset discarding value pattern (such as 0,1,1,2,2 for AL=16,8,4,2,1)) are discarded in sequence at each aggregation level until the M_per_span is not exceeded.

[0164] In this embodiment, M can be determined according to M_per_span K , then according to M K Determine the candidate sets to discard or keep.

[0165] Implementation 4

[0166] In this embodiment, retention or discard is determined based on the granularity of candidate set, search space, and span. This embodiment adopts the span definition in embodiment 1 and takes the CCE threshold per span as an example, but is not limited thereto.

[0167] When both the M_per_span limit and the M_per_slot limit exist, that is, when both the per-slot CCE threshold (M_per_slot) and the per-span CCE threshold (M_per_span) are defined, the following method can be used to determine the candidate set for discarding:

[0168] Implementation 4.1

[0169] For the first span in the time slot, which may contain at least one of the first three symbols of the slot, the total threshold is determined according to M_per_slot + M_per_span, and candidate dropping is performed; for the remaining spans, candidate dropping is performed according to M_per_span.

[0170] Implementation 4.2

[0171] First, the candidate set to be discarded or retained is determined according to M_per_slot, and slot-level candidate dropping is performed. Then, the candidate set to be discarded or retained is determined according to M_per_span, and span-level candidate dropping is performed to ensure that the candidate set does not exceed the time slot threshold or the time span threshold. For example, CSS0 has 4 candidates and is located in the first span, CSS1 has 4 candidates and is located in the first span, USS1 has 6 candidates and is located in the first span, and USS2 has 36 candidates and is located in 3 spans, with 12 candidates in each span. Assuming M_per_span = 16 and M_per_slot = 40, slot-level candidate dropping is performed first according to M_per_slot. Taking search space granularity dropping as an example, USS2 is discarded. Then, span-level candidate dropping is performed according to M_per_span, and CSS1, CSS2, and USS1 are not dropped.

[0172] For another example, CSS0 has 4 candidates and is located in the first span, CSS1 has 4 candidates and is located in the first span, USS1 has 6 candidates and is located in the first span, and USS2 has 24 candidates and is located in two spans, with 12 candidates in each span. Assuming M_per_span = 16 and M_per_slot = 40, slot-level candidate dropping is first performed according to M_per_slot. Taking search space granularity as an example, no search spaces are dropped. Span-level candidate dropping is then performed according to M_per_span. In the first span, CSS1, CSS2, and USS1 are not dropped, while the 12 candidates of USS2 are dropped. In the second span, the candidates of USS2 are not dropped. The above USS represents the number of the dedicated search space (UE-specific search space), and CSS represents the search space number of the common search space (Common Search Space).

[0173] Furthermore, the granularity for retaining or discarding candidate sets for a time slot and for retaining or discarding candidate sets for a time span can be the same or different. Optional granularities include the entire search space, the entire search space within a time span, or candidate sets within a search space. For example, within a time slot, candidates can be discarded at the SS granularity, while within a time span, candidates can be discarded at the candidate set granularity to ensure that not all candidate sets for a USS within a time span are discarded. Alternatively, retention or discard can be determined at the candidate set granularity for both the time slot and the time span.

[0174] Implementation 4.3

[0175] First, candidates are dropped at the time span level according to M_per_span, then at the time slot level according to M_per_slot, ensuring that candidates do not exceed their respective thresholds at both the slot and span levels. For example, CSS0 has 4 candidates in the first span, CSS1 has 4 candidates in the first span, USS1 has 6 candidates in the first span, and USS2 has 36 candidates in 3 spans, with 12 candidates in each span. Assuming M_per_span = 16 and M_per_slot = 40, span-level candidate dropping is performed first according to M_per_span. Taking search space granularity as an example, USS2 in the first span is dropped. The second and third spans, after checking, do not exceed the M_per_span threshold and therefore do not need to be dropped. Next, slot-level candidate dropping is performed according to M_per_slot. Since the sum of candidates across all search spaces does not exceed M_per_slot, no further dropping is required. For example, CSS0 has 4 candidates in the first span, CSS1 has 4 candidates in the first span, USS1 has 6 candidates in the first span, and USS2 has 24 candidates in two spans, with 12 candidates in each span. Assuming M_per_span = 16 and M_per_slot = 40, span-level candidate dropping is first performed according to M_per_span. Taking search space granularity dropping as an example, USS2 is dropped in the first span, and the second span does not exceed the M_per_span threshold, so no dropping is required. Next, slot-level candidate dropping is performed according to M_per_slot. Since the sum of candidates across all search spaces does not exceed M_per_slot, no further dropping is required.For another example: CSS0 has 4 candidates and is located in the first span, CSS1 has 4 candidates and is located in the first span, USS1 has 6 candidates and is located in the first span, and USS2 has 48 candidates and is located in 4 spans, with 12 candidates in each span. Assuming M_per_span = 16 and M_per_slot = 40, span-level candidate dropping is first performed according to M_per_span. Taking search space granularity dropping as an example, USS2 in the first span is dropped. The second, third, and fourth spans are judged to be within the M_per_span threshold and therefore do not need to be dropped. Slot-level candidate dropping is then performed according to M_per_slot. Since the sum of candidates across all search spaces exceeds M_per_slot, further candidate dropping is required. The rules can be the same as those in Example 2, or further combined with the candidate-level dropping described in Example 3. Furthermore, at this time, the first span has CSS1, CSS2, and USS1, and the total number of candidates is 14; the second span has USS2 and the total number of candidates is 12; the third span has USS2 and the total number of candidates is 12; the second span has USS2 and the total number of candidates is 12, that is, there are 50 candidates in the slot, which exceeds M_per_slot. For example, method 2 in embodiment 2 is used to discard the last span; or further combined with embodiment 3, some candidates are discarded for the third span to meet the M_per_slot threshold, that is, there are 2 candidates remaining in the third span.

[0176] Furthermore, the granularity for determining whether to discard or retain candidate sets within a span can be the entire search space, the entire search space within a span, or the candidate set within the search space. When the per-slot threshold is exceeded, candidate dropping can be performed at the span, candidate, or SS granularity. After the slot threshold is exceeded, candidate dropping can be performed again for each span to ensure that the per-slot threshold is not exceeded, thereby minimizing UE processing complexity.

[0177] Implementation 4.4

[0178] RRC configures an upper limit for each span, ensuring that the sum of the configured upper limits for each span is no greater than the per-slot threshold, and performs drop operations at the span granularity. An exemplary method for performing span-level candidate dropping according to M_per_span is shown in Implementation 4.3.

[0179] The span-granularity-based candidate dropping determination method described in this embodiment ensures that the terminal's CCE threshold for each slot is not exceeded, without increasing terminal processing complexity. This method is suitable for scenarios where overbooking within a slot or span is permitted. This method increases configuration and scheduling flexibility without exceeding UE capabilities.

[0180] Implementation 5

[0181] The terminal receives the configuration information and, according to the configuration information, repeatedly sends the same PUSCH (Physical Uplink Shared Channel) / TB (Transport Block) once or multiple times in the same time slot, or repeatedly sends the same PUSCH / TB once or multiple times in multiple consecutively available time slots. When a repeated transmission encounters a slot boundary or an uplink / downlink transmission direction switching point, the repeated transmission will be divided into multiple actual repeated transmissions. Among them, the PUSCH or transport block TB mentioned refers to the information carried on the physical uplink shared channel. The configuration information is obtained by any of the following methods: RRC signaling, or DCI signaling.

[0182] The available multiple time slots refer to uplink transmissions in consecutive time slots where the transmission direction of the subframe format is U (Up) or F (Flexible). The uplink / downlink transmission direction switching point occurs when the uplink transmission encounters a symbol in the time slot where the transmission direction is D (Down) or F (Flexible), which means that there is a collision with the uplink transmission direction. In this case, the uplink transmission will not be performed on these symbols.

[0183] In the embodiments of the present application, only uplink transmission is used as an example for illustration. It can be understood that the technical solution can also be used for downlink and other physical layer channels of 4G or 5G, such as control channels, random access channels, and data channels.

[0184] like Figure 9AAs shown, when the same transport block is repeatedly transmitted on consecutive available time slots, that is, when it is repeatedly transmitted on time slot n and time slot n+1, the PUSCH of the second nominal repetition #2 is divided into the second actual repetition transmission and the third actual repetition transmission because it crosses the time slot boundary and the uplink and downlink transmission direction switching point. Referring to DMRS configuration table 4, taking the first repetition as an example, the time domain position of DMRS (Demodulation Reference Signal) is the first symbol and the fourth symbol of the time domain length of the first repetition. Then, after the second nominal repetition crosses the slot boundary, the DMRS is located at the time domain position corresponding to the second actual repetition transmission, and there is no DMRS on the third actual repetition transmission, which makes the PUSCH sent the third time unable to be decoded.

[0185] To solve this problem, we propose two methods:

[0186] Method 5.1: When a nominal retransmission is divided into multiple actual retransmissions due to a slot boundary or a switching point between uplink and downlink transmission directions, the configured DMRS information is determined based on the PUSCH of the actual retransmission. Figure 9B As shown, since the time domain length of the second actual repeated transmission is 4 symbols, according to Table 4 below, the DMRS is located in the first symbol of the time domain length of the second actual repeated transmission. Similarly, the time domain length of the third actual repeated transmission is 2 symbols. According to Table 4 below, the DMRS is located in the first symbol of the time domain length of the third actual repeated transmission.

[0187] Method 5.2: When a nominal retransmission is divided into multiple actual retransmissions due to a slot boundary or subframe format switching, the configured DMRS information is determined based on the PUSCH of the nominal retransmission and the PUSCH of the actual retransmission. Figure 9C As shown, the DMRS determined based on the PUSCH of the nominal repetition transmission is located in the time domain symbol of the actual second repetition transmission, and there is no DMRS on the actual third repetition transmission. In this case, only the actual third repetition transmission needs to be reconfigured with DMRS. According to the actual time domain length of the third repetition transmission, look up Table 4 to obtain the DMRS located in the first symbol of the time domain length of the third actual repetition transmission. Finally, the DMRS for the actual second repetition transmission is located in the first and fourth symbols of the time domain length of the second actual repetition transmission, and the DMRS for the actual third repetition transmission is located in the first symbol of the time domain length of the third actual repetition transmission.

[0188] That is, if the DMRS time domain position determined based on the PUSCH of the nominal repeated transmission exists in whole or in part in the time domain position of an actual repeated transmission, then the DMRS does not need to be reconfigured for the actual repeated transmission. If the DMRS time domain position determined based on the PUSCH of the nominal repeated transmission does not exist in the time domain position of an actual repeated transmission, then the DMRS needs to be reconfigured for the actual repeated transmission.

[0189] Furthermore, if the DMRS determined based on the PUSCH of the nominal repeated transmission is located on a segment that is divided into multiple actual repeated transmissions, and no actual repeated transmission does not have DMRS, then there is no need to re-acquire the DMRS configuration. DMRS configuration information is obtained based on the nominal repeated transmission PUSCH. In other words, if the DMRS determined based on the second nominal repeated transmission PUSCH is located at the time domain position of the second and third actual repeated transmissions, then there is no need to re-acquire the DMRS configuration. DMRS configuration information is obtained based on the second nominal repeated transmission PUSCH.

[0190] Table 4: DMRS positions for single-layer DMRS within a timeslot and PUSCH without intra-slot hopping enabled

[0191]

[0192] In one embodiment of the present application, intra-slot refers to a time slot; PUSCH mapping type A refers to PUSCH mapping type A; PUSCH mapping type B refers to PUSCH mapping type B; DM-RS positions refers to DMRS positions; and dmrs-AdditionalPosition refers to DMRS additional positions.

[0193] Furthermore, after a certain nominal repetition transmission is divided into multiple actual repetition transmissions, how to determine the RV patterns of these multiple repetition transmissions of PUSCH? There are the following two methods.

[0194] Method 5.3: The RV (Redundancy Version) pattern of multiple repeated transmissions of PUSCH is determined in sequence according to the actual number of repeated transmissions. Figure 9BAs shown, the RV pattern configured by the base station is {0, 2, 3, 1}. For the second nominal retransmission, RV ID = 2. This nominal retransmission is then divided into the second and third actual retransmissions. Based on the order of the RV pattern, the second actual retransmission has RV ID = 2, the third actual retransmission has RV ID = 3, and the fourth retransmission has RV ID = 1. The RV IDs for these four transmissions are {0, 2, 3, 1}, in that order.

[0195] Method 5.3: When the target code rate of the PUSCH for the third actual retransmission is greater than the predefined target code rate A, or when the duration of the PUSCH for the third actual retransmission is less than threshold B, the RV id corresponding to the PUSCH for the third actual retransmission is 0. The RV pattern is then RV id = 2 for the second actual retransmission and RV id = 0 for the third actual retransmission. Furthermore, the fourth retransmission is determined based on the previous retransmission, which can include two methods:

[0196] Method A: Determine based on the first actual repeated transmission, that is, based on the order of RVid = 0 for the third actual repeated transmission, then the RV id for the fourth repeated transmission is 2. Therefore, the RV ids of these four transmissions are {0, 2, 0, 2} in sequence.

[0197] Method B: Determine based on the first nominal repeated transmission, that is, based on the order of the second nominal repeated transmission RVid = 2, then the RV id of the fourth repeated transmission = 3. Therefore, the RV ids of these four transmissions are {0, 2, 0, 3} in sequence.

[0198] The predefined target code rate is notified by RRC (Radio Resource Control) or DCI (Downlink Control Information), or is obtained according to the target code rate in the MCS index; the threshold B is an integer greater than or equal to 1, and is also notified by RRC or DCI.

[0199] Implementation Method 6

[0200] The terminal receives the configuration information and, based on the configuration information, transmits the same PUSCH (Physical Uplink Shared Channel) / TB (Transport Block) one or more times in the same timeslot, or one or more times across multiple consecutively available timeslots. Further consideration is required regarding how to obtain the time domain resource information corresponding to the multiple transmission repetitions.

[0201] Method 6.1: The start and length indicator value SLIVi of the i-th repetition transmission and / or the time slot index where the i-th repetition transmission is located. Alternatively, the start and length indicator value SLIVi of the i-th repetition transmission and / or the time slot index starting from the second repetition transmission.

[0202] The time domain start symbol (Si) and time domain duration (Li) of the i-th repetition can be obtained through SLIV, where i is an integer, 0<i≤Q, and Q is an integer greater than or equal to 1.

[0203] The time domain resource information is configured by a higher layer;

[0204] Furthermore, the time domain resource information is jointly indicated by a high-layer configuration and a high-layer control signaling. Alternatively, the time domain resource information is jointly indicated by a high-layer configuration and a dynamic control signaling.

[0205] Furthermore, the time slot index of the first repeated transmission is determined by the timing (slot offset K2), wherein the timing refers to the time from sending the DCI downlink to sending the PUSCH uplink.

[0206] Furthermore, the time slot index for the i-th repeated transmission can be obtained implicitly. The high-level configuration of the time domain resource allocation is shown in Table 5. In Table 5, Entry represents the entry number; PUSCH mapping type represents the PUSCH mapping type, 1 st SLIV is the start and length indicator value of the first repeated transmission, 2 nd SLIV represents the start and length indicator for the second repeated transmission, Slot Index represents the slot index, Type represents the type, and Value represents the value. If no slot index is configured for the i-th repeated transmission, it indicates that it is in the same slot as the previous or previous repeated transmissions. Alternatively, if no slot index is configured for the i-th repeated transmission, it indicates that it is in the same slot as the first repeated transmission. For example, if entry = 0 in Table 2, and no value is configured for slot index 2 for the second repeated transmission, it indicates that the second repeated transmission is in the same slot as the first repeated transmission, that is, both are in slot index #2.

[0207] For example, if entry = 1 and slot index 2 has a configured value for the second repetition, this means that the second repetition is not in the same slot as the first repetition. The slot index is obtained based on the configured value. That is, the first repetition is in slot index #1, and the second repetition is in slot index #3.

[0208] Table 5

[0209]

[0210] It should be noted that the time domain resource allocation parameters configured by the high-level layer also include other control fields, which will not be described in detail here.

[0211] The present application provides a threshold value determination device, comprising:

[0212] A first threshold value determining module is configured to determine a first threshold value according to a preset rule; the first threshold value is a threshold value of each time span in the time span pattern.

[0213] In one embodiment, the first threshold value determining module is further configured to:

[0214] Determine a second threshold value; the second threshold value is a threshold value corresponding to each element in the time span parameter set reported by the user equipment;

[0215] The first threshold is determined according to the second threshold.

[0216] In one embodiment, the first threshold value determining module is further configured to:

[0217] According to the capability level of the user equipment, a second threshold value corresponding to the capability level of the user equipment is determined.

[0218] In one embodiment, the first threshold value determining module is further configured to:

[0219] Determine, according to an element of a time span parameter set, a maximum number of time spans that can be determined by the element;

[0220] Calculate an average threshold value of each time span according to the maximum value of the number of time spans and the time slot threshold value;

[0221] The threshold value corresponding to the element is determined according to the average threshold value of each time span.

[0222] In one embodiment, the first threshold value corresponding to the time span where the search space or monitoring opportunity of the first L symbols in the time slot is located is greater than the first threshold values corresponding to the remaining time spans; L is a positive integer.

[0223] In one embodiment, the first threshold value determining module is further configured to:

[0224] The first threshold value is determined according to the total threshold value in the time slot and the number of time spans in the time slot.

[0225] In one embodiment, the first threshold value determination module is further configured to determine the first threshold value based on the total threshold value in the time slot and the number of time spans in the time slot, wherein the first threshold value of the search space of the first L symbols in the time slot or the time span in which the monitoring opportunity is located is determined as follows:

[0226] Determining a third threshold value based on the total threshold value in the time slot and the number of time spans in the time slot; the third threshold value is the maximum threshold value that can be obtained for each time span when the total threshold value in the time slot is evenly distributed to each time span;

[0227] The remaining number in the time slot is allocated to the search space of the first L symbols in the time slot or the threshold value of the time span where the monitoring opportunity is located to obtain the first threshold value; the remaining number is the remaining number after deducting the product of the third threshold value and the number of time spans in the time slot from the total threshold value; L is a positive integer.

[0228] In one embodiment, the first threshold value of the search space of the first L symbols in the time slot or the time span of the monitoring opportunity is determined as follows:

[0229] The first threshold value corresponding to the search space of the first L symbols in the time slot or the time span where the monitoring opportunity is located is equal to the sum of the threshold value of the time slot and the second threshold value, and L is a positive integer.

[0230] In one embodiment, the first threshold value of the search space of the first L symbols in the time slot or the time span of the monitoring opportunity is determined as follows:

[0231] The first threshold value corresponding to the search space of the first L symbols in the time slot or the time span where the monitoring opportunity is located is equal to the sum of the threshold value of the time slot and the third threshold value, and L is a positive integer.

[0232] In one embodiment, the first threshold value determining module is further configured to: add a corresponding offset value to the second threshold value according to a time span length to obtain the first threshold value.

[0233] In one embodiment, the first threshold value determining module is further configured to: when the actual number of time spans in the time slot is less than the maximum number of time spans, add an offset value to the second threshold value to obtain the first threshold value.

[0234] In one embodiment, the preset rule includes at least one of the following:

[0235] If the time span parameter set includes the element (7, 3), and the actual time span pattern is the same as the time span pattern obtained using the element (7, 3), then the second threshold value corresponding to the element (7, 3) is used to determine the first threshold value;

[0236] If the time span parameter set includes the element (4, 3), and the actual time span pattern is the same as the time span pattern obtained using the element (4, 3), then the first threshold value is determined using the second threshold value corresponding to the element (4, 3);

[0237] If the actual time span pattern has only one time span, the first threshold value is determined using the threshold value of the time slot;

[0238] If the actual time span pattern is other than the above cases, the first threshold value is determined by using the second threshold value corresponding to the element (2, 2).

[0239] In one embodiment, the first threshold value determining module is further configured to:

[0240] If the actual time span pattern of the portion of the time span in the time slot is the same as the time span pattern obtained using the element (7, 3), the second threshold value corresponding to the element (7, 3) is used to determine the first threshold value;

[0241] If the actual time span pattern of some time spans in the time slot is the same as the time span pattern obtained using the element (2,2), the second threshold value corresponding to the element (2,2) is used to determine the first threshold value.

[0242] In one implementation, the first threshold value determining module is further configured to: configure the first threshold value through higher layer signaling.

[0243] In one embodiment, the first threshold value determining module is further configured to independently configure the first threshold value for each time span, or configure the same first threshold value for all time spans.

[0244] In one embodiment, the offset value is at least one integer between -N and N, where N is a positive integer.

[0245] In one implementation, the threshold value is a blind detection times threshold or a non-overlapping control resource unit quantity threshold.

[0246] The present application also provides a resource determination device, comprising:

[0247] Resource determination module: used to determine the resources that should be retained or discarded using the time span threshold;

[0248] The resources include: candidate sets, or all candidate sets of the search space within the current time span, or candidate sets of all search spaces within the time span.

[0249] The functions of each module in each device in the embodiments of the present application can be found in the corresponding description in the above method embodiments, and will not be repeated here.

[0250] In one embodiment, the resource determination module is further configured to:

[0251] If the sum of the threshold values of all time spans in the same time slot is greater than the threshold value of the time slot, then according to the sorting of all time spans in the time slot, the candidate set of the time span indexed by the critical value and all time spans thereafter is determined as the candidate set to be discarded; or the candidate set of all time spans before the time span indexed by the critical value is determined as the candidate set to be retained;

[0252] The cumulative sum of the threshold values from the first-ranked time span in the current time slot to the time span indexed by the critical value exceeds the threshold value of the time slot for the first time.

[0253] In one embodiment, if the number of resources within a time span is greater than the threshold value of the time span, the portion of resources that exceeds the threshold value of the time span is determined to be resources that should be discarded; or the portion of the candidate set that does not exceed the threshold value of the time span is determined to be retained resources.

[0254] In one embodiment, when the resource is a candidate set, a method of discarding or retaining includes one of the following:

[0255] The aggregation level of the part of the candidate set that exceeds the time span threshold is ranked higher than the aggregation level of the part of the candidate set that does not exceed the time span threshold;

[0256] The aggregation level of the part of the candidate set that exceeds the time span threshold is ranked lower than the aggregation level of the part of the candidate set that does not exceed the time span threshold;

[0257] Each aggregation level discards or retains a certain number of candidate sets in turn until it does not exceed the span threshold of this event. The certain number is the same number that is preset or configured, or a numerical pattern corresponding to each aggregation level.

[0258] In one embodiment, before determining the resources to be retained or discarded using the time span threshold, the method further includes:

[0259] If the sum of the threshold values of all time spans in the same time slot is greater than the threshold value of the time slot, the average threshold value of all time spans in the time slot is calculated based on the threshold value of the time slot;

[0260] The threshold value of each time span in the time slot is re-determined according to the average threshold value of all time spans in the time slot.

[0261] In one embodiment, before determining the resources to be retained or discarded using the time span threshold, the method further includes:

[0262] If the sum of the threshold values of all time spans within a time slot is greater than the threshold value of the time slot, the threshold value of each time span in the time slot is re-determined through high-layer signaling configuration so that the sum of the threshold values of each re-determined time span is not greater than the threshold value of the time slot.

[0263] In one embodiment, before determining the resources to be retained or discarded using the time span threshold, the method further includes:

[0264] The threshold value for at least one time span is re-determined as the sum of the threshold value for the time slot and the threshold value for the time span.

[0265] In one embodiment, the at least one time span is a time span in the current time slot, or a time span including one of the first L symbols in the current time slot; L is a positive integer.

[0266] In one embodiment, before determining the resources to be retained or discarded using the time span threshold, the method further includes:

[0267] If the time span threshold is different from the threshold configured for each time span by the higher layer signaling, the time span threshold is re-determined to be the smaller one of the original time span threshold and the threshold configured for each time span by the higher layer signaling.

[0268] In one embodiment, determining resources to be retained or discarded using a time span threshold includes:

[0269] First, the resources that should be retained or discarded are determined according to the time slot threshold, and then the resources that should be retained or discarded are determined according to the time span threshold.

[0270] Alternatively, a time span threshold is used to determine which resources should be retained or discarded, including:

[0271] First, the resources that should be retained or discarded are determined according to the time span threshold, and then the resources that should be retained or discarded are determined according to the time slot threshold.

[0272] In one embodiment, first determining the resources to be retained or discarded according to the time span threshold, and then determining the resources to be retained or discarded according to the time slot threshold, includes:

[0273] Determine the resources that should be retained or discarded according to the time span threshold;

[0274] If the reserved resources still exceed the time slot threshold, then according to the sorting of all time spans in the time slot, determine the candidate sets of all time spans after the time span indexed by the critical value as the candidate sets that should be discarded, and determine the partial candidate sets of the time span indexed by the critical value as the candidate sets that should be discarded; or determine the candidate sets of all time spans before the time span indexed by the critical value as the candidate sets that should be retained, and determine the partial candidate sets of the time span indexed by the critical value as the candidate sets that should be retained;

[0275] The cumulative sum of the threshold values from the first-ranked time span in the current time slot to the time span indexed by the critical value exceeds the threshold value of the time slot for the first time.

[0276] In one embodiment, when the resources include all candidate sets of the search space within the current time span, determining the resources to be retained or discarded using a threshold value of the time span includes:

[0277] If there is no time slot threshold value, then according to the order of the search spaces within the time span, the candidate set of the search space indexed by the critical value and all the search spaces thereafter is determined as the candidate set to be discarded; or the candidate set of all the search spaces before the search space indexed by the critical value is determined as the candidate set to be retained;

[0278] The cumulative sum of the threshold values from the search space ranked first in the time span to the search space indexed by the critical value exceeds the threshold value of the time span for the first time.

[0279] In one embodiment, the candidate set is a candidate set for PDCCH channel blind detection corresponding to a BD threshold, or a non-overlapping CCE used for channel estimation.

[0280] In one implementation, the threshold value of the time span is a threshold value determined according to the threshold value determination method provided in the embodiment of the present application.

[0281] Figure 10 This is a schematic diagram of the structure of the terminal in the embodiment of the present application. Figure 10 As shown, the terminal 130 provided in the embodiment of the present application includes: a memory 1303 and a processor 1304. The terminal 130 may also include an interface 1301 and a bus 1302. The interface 1301, the memory 1303, and the processor 1304 are connected via the bus 1302. The memory 1303 is used to store instructions. The processor 1304 is configured to read the instructions to execute the technical solution of the above-mentioned method embodiment applied to the terminal. The implementation principles and technical effects are similar and will not be repeated here.

[0282] Figure 11 This is a schematic diagram of the structure of the communication system of the embodiment of the present application. Figure 11As shown, the system includes: the terminal 130 of the above embodiment, and the base station 140 of the above embodiment. The communication system of the embodiment of the present application includes but is not limited to: a Long Term Evolution (LTE) system, an LTE Frequency Division Duplex (FDD) system, an LTE Time Division Duplex (TDD) system, a Universal Mobile Telecommunication System (UMTS), or a 5G system.

[0283] The above description is merely an exemplary embodiment of the present application and is not intended to limit the scope of protection of the present application.

[0284] In general, various embodiments of the present application may be implemented in hardware or dedicated circuits, software, logic, or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software that can be executed by a controller, microprocessor, or other computing device, although the present application is not limited thereto.

[0285] Embodiments of the present application may be implemented by executing computer program instructions by a data processor of a mobile device, for example, in a processor entity, or by hardware, or by a combination of software and hardware. The computer program instructions may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages.

[0286] The block diagram of any logical flow in the accompanying drawings of the present application may represent program steps, or may represent interconnected logical circuits, modules and functions, or may represent a combination of program steps and logical circuits, modules and functions. The computer program may be stored on a memory. The memory may be of any type suitable for the local technical environment and may be implemented using any suitable data storage technology. The memory in the embodiment of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM) or a flash memory, etc. The volatile memory may be a random access memory (RAM), which is used as an external cache. RAM can include various forms, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct rambus random access memory (DRRAM). The memory of the systems and methods described herein includes, but is not limited to, these and any other suitable types of memory.

[0287] The processor of the embodiment of the present application can be any type suitable for the local technical environment, such as but not limited to a general-purpose computer, a special-purpose computer, a microprocessor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable logic device (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, or a processor based on a multi-core processor architecture. The general-purpose processor can be a microprocessor or any conventional processor, etc. The above-mentioned processor can implement or execute the steps of the disclosed methods in the embodiment of the present application. The software module can be located in a mature storage medium in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.

[0288] The above description of exemplary embodiments of the present application has been provided by way of exemplary and non-limiting examples. However, various modifications and adaptations to the above embodiments will be apparent to those skilled in the art, when considered in conjunction with the accompanying drawings and the appended claims, without departing from the scope of the present application. Therefore, the proper scope of the present application will be determined by reference to the appended claims.

Claims

1. A method for determining a threshold value, characterized in that: include: Determining a first threshold value according to a preset rule; The first threshold value is a threshold value of each time span in the time span pattern; Determining a first threshold value according to a preset rule includes: determining a second threshold value; The second threshold value is a threshold value corresponding to each element in the time span parameter set reported by the user equipment, and the threshold value is a threshold value of the number of control resource elements CCE; determining the first threshold value according to the second threshold value; The preset rule includes the following manner: when the actual span pattern is obtained from a plurality of elements in a combination, the first threshold value is determined by using the maximum second threshold value corresponding to the plurality of elements.

2. The method according to claim 1, characterized in that Determining the second threshold value according to a preset rule includes: According to the capability level of the user equipment, a second threshold value corresponding to the capability level of the user equipment is determined.

3. The method according to claim 1, characterized in that Determining the second threshold value according to a preset rule includes: Determine, according to an element of a time span parameter set, a maximum number of time spans that can be determined by the element; Calculate an average threshold value of each time span according to the maximum value of the number of time spans and the time slot threshold value; The threshold value corresponding to the element is determined according to the average threshold value of each time span.

4. The method according to claim 1, wherein The first threshold value corresponding to the time span where the search space or monitoring opportunity of the first L symbols in the time slot is located is greater than the first threshold values corresponding to the remaining time spans; L is a positive integer.

5. The method according to claim 1, wherein Determining a first threshold value according to a preset rule includes: The first threshold value is determined according to the total threshold value in the time slot and the number of time spans in the time slot.

6. The method according to claim 5, characterized in that The first threshold value of the search space or the time span of the monitoring opportunity for the first L symbols in the time slot is determined as follows: Determining a third threshold value based on the total threshold value in the time slot and the number of time spans in the time slot; the third threshold value is the maximum threshold value that can be obtained for each time span when the total threshold value in the time slot is evenly distributed to each time span; The remaining number in the time slot is allocated to the search space of the first L symbols in the time slot or the threshold value of the time span where the monitoring opportunity is located to obtain the first threshold value; the remaining number is the remaining number after deducting the product of the third threshold value and the number of time spans in the time slot from the total threshold value; L is a positive integer.

7. The method according to claim 5, characterized in that The first threshold value of the search space or the time span of the monitoring opportunity for the first L symbols in the time slot is determined as follows: The first threshold value corresponding to the search space of the first L symbols in the time slot or the time span where the monitoring opportunity is located is equal to the sum of the threshold value of the time slot and the second threshold value, and L is a positive integer.

8. The method according to claim 5, characterized in that The first threshold value of the search space or the time span of the monitoring opportunity for the first L symbols in the time slot is determined as follows: The first threshold value corresponding to the search space of the first L symbols in the time slot or the time span where the monitoring opportunity is located is equal to the sum of the threshold value of the time slot and the third threshold value, and L is a positive integer.

9. The method according to claim 1, characterized in that Determining the first threshold includes: According to the length of the time span, a corresponding offset value is added to the second threshold value to obtain the first threshold value.

10. The method according to claim 1, characterized in that Determining the first threshold includes: When the actual number of time spans in the time slot is less than the maximum number of time spans, the offset value is added to the second threshold value to obtain the first threshold value.

11. The method according to claim 1, wherein The preset rules also include at least one of the following: If the combination includes elements (7, 3), (4, 3) and (2, 2), and the actual time span pattern is the same as the time span pattern obtained by using the elements (7, 3), (4, 3) or (2, 2), then the first threshold value is determined by using the second threshold value corresponding to the element (7, 3); If the combination includes elements (7,3), (4,3) and (2,2), and the actual time span pattern is the same as the time span pattern obtained using element (4,3) or (2,2), the second threshold value corresponding to element (4,3) is used to determine the first threshold value.

12. The method according to claim 1, characterized in that Determining the first threshold value according to the second threshold value includes: If the actual time span pattern of the portion of the time span in the time slot is the same as the time span pattern obtained using the element (7, 3), the second threshold value corresponding to the element (7, 3) is used to determine the first threshold value; If the actual time span pattern of some time spans in the time slot is the same as the time span pattern obtained using the element (2,2), the second threshold value corresponding to the element (2,2) is used to determine the first threshold value.

13. The method according to claim 1, wherein Determining a first threshold value according to a preset rule includes: The first threshold is configured through higher layer signaling.

14. The method according to claim 13, wherein: Configuring the first threshold through higher layer signaling includes: The first threshold value of each time span is configured independently, or the same first threshold value is configured for all time spans.

15. The method according to claim 1, wherein The threshold value is a blind detection times threshold, or a non-overlapping control resource unit quantity threshold.

16. A threshold value determination device, characterized in that: include: processor and memory; The memory is used to store instructions, and the processor implements the functions described in the following modules when executing the instructions; A first threshold value determination module is configured to determine a first threshold value according to a preset rule; the first threshold value is a threshold value of each time span in the time span pattern; The first threshold value determining module is specifically configured to: Determine a second threshold value; the second threshold value is a threshold value corresponding to each element in the time span parameter set reported by the user equipment, and the threshold value is a threshold value of the number of control resource elements CCE; determining the first threshold value according to the second threshold value; The preset rule includes the following manner: when the actual span pattern is obtained from a plurality of elements in a combination, the first threshold value is determined by using the maximum second threshold value corresponding to the plurality of elements.

17. A network device, characterized in that: The network device includes: a processor and a memory; The memory is used to store instructions; The processor is configured to read the instructions to execute the method of claim 1 .

18. A non-transitory computer-readable storage medium, characterized in that The storage medium stores a computer program, and when the computer program is executed by a processor, the method according to claim 1 is implemented.

Images