CSI report processing method and apparatus

By implementing an independent judgment and priority mechanism for segmented time-domain CSI reports, the conflict problem of discontinuous CPU resource occupation in 5G mobile communication systems is resolved, achieving reasonable allocation of CPU resources and improving the accuracy of CSI reports.

WO2026232952A1PCT designated stage Publication Date: 2026-11-12HONOR DEVICE CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
PCT/CN2026/082007
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2025-05-09
Filing Date
2026-03-06
Publication Date
2026-11-12

AI Technical Summary

Technical Problem

In 5G mobile communication systems, existing CSI reporting processing guidelines cannot effectively support discontinuous use of processing units, which may lead to CPU resource conflicts.

Method used

By independently judging the segmented time-domain CSI reports to determine whether they meet the conditions, CPU resources are dynamically allocated to avoid unnecessary updates and conflicts. The priority mechanism ensures the accuracy of high-priority reports and resource utilization.

Benefits of technology

It effectively avoids the waste and conflict of CPU resources, improves the utilization of CPU resources and the accuracy of CSI reports, especially in the processing of discontinuous occupation periods.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2026082007_12112026_PF_FP_ABST
    Figure CN2026082007_12112026_PF_FP_ABST
Patent Text Reader

Abstract

The present application relates to the field of communications, and provides a CSI report processing method and an apparatus. The processing method comprises: for a first CSI report that occupies a PU in K time-domain segments, determining a processing manner of the first CSI report on the basis of whether a first symbol of the first CSI report in at least one time-domain segment satisfies a first condition, where the first symbol is used to represent a start symbol of the time-domain segment, and K is greater than or equal to 1. The method can support CSI reports that do not continuously occupy processing units, thereby avoiding the problem of conflicts during processing unit occupancy.
Need to check novelty before this filing date? Find Prior Art

Description

CSI Report Processing Methods and Devices

[0001] This application claims priority to Chinese patent application filed on May 9, 2025, with application number 2025106039573 and entitled "Method and Apparatus for Processing CSI Reports", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communications, and more specifically, to a method and apparatus for processing CSI reports. Background Technology

[0003] In the communication process between terminal devices and network devices, Channel State Information (CSI) reporting feedback is a crucial means of ensuring the communication quality of wireless communication links. CSI report feedback refers to the process where the network device sends a reference signal to the terminal device, the terminal device measures and calculates the reference signal, and then feeds back the CSI to the network device through a CSI report. The network device adjusts its modulation and / or coding based on the measured values ​​(CSI) fed back by the terminal device to ensure communication speed. After receiving the reference signal, the terminal device needs to process and calculate it, which requires a certain amount of Channel State Information Processing Unit (CSI Processing Unit, CPU). Since the number of CPUs is limited, when multiple CSI reports need to be processed simultaneously, the terminal device determines which CSI reports will occupy the CPU based on their priority, and then uses the allocated CPU to update the CSI reports.

[0004] In the New Radio (NR) communication standard of the 5th generation (5G) mobile communication system, the time occupied by a CSI report to the processing unit is continuous in the time domain, and the existing CSI processing rules are also based on the fact that the time occupied by a CSI report to the processing unit is continuous.

[0005] If a CSI report's time spent occupying a processing unit is discontinuous, existing CSI processing guidelines cannot be directly applied, potentially leading to conflicts during processing unit occupancy. Therefore, designing a new CSI report processing guideline to support CSI reports with discontinuous processing unit occupancy and avoid conflicts during occupancy has become a pressing issue. Summary of the Invention

[0006] This application provides a method and apparatus for processing CSI reports. The method can support CSI reports that occupy processing units discontinuously, thus avoiding conflict issues when occupying processing units.

[0007] In a first aspect, a method for processing CSI reports is provided, comprising: for a first CSI report occupying a PU in K segmented time domains, determining the processing mode of the first CSI report based on whether the first symbol of the first CSI report in at least one segmented time domain satisfies a first condition; wherein the first symbol is used to represent the starting symbol of the segmented time domain, and K is greater than or equal to 1.

[0008] In the above technical solution, for the first CSI report occupying the PU in K segmented time domains, when K equals 1, the first CSI report is a CSI report of continuous PU occupation; when K is greater than 1, the first CSI report is a CSI report of discontinuous PU occupation. Therefore, the above technical solution not only supports CSI reports of continuous PU occupation (K=1) but also supports CSI reports of discontinuous PU occupation (K>1). Furthermore, for CSI reports of discontinuous PU occupation, the processing method of the first CSI report is determined based on whether the first symbol of the first CSI report in at least one segmented time domain satisfies the first condition. The first symbol is used to represent the starting symbol of the segmented time domain. That is, at the starting symbol of at least one segmented time domain, it is determined whether the first CSI report satisfies the first condition, thereby determining the processing method of the first CSI report. This avoids the PU occupation conflict problem that can easily be caused by directly determining the processing method of the first CSI report only once at the beginning of PU occupation.

[0009] For example, when K > 1, the above technical solution does not determine that the first CSI report can occupy PU in all segment time domains and update the first CSI report simply because it only makes a judgment once when PU occupancy begins. Instead, it determines the processing method of the first CSI report based on whether the first symbol of the first CSI report in at least one segment time domain among the K segment time domains meets the first condition. Taking into account that the first CSI report may or may not meet the first condition at the first symbol in different segment time domains, the above technical solution ensures the reasonable allocation of PU resources and avoids potential PU occupancy conflicts by independently judging the first symbol of the first CSI report in at least one segment time domain.

[0010] Optionally, if the first symbol in any segmented time domain does not satisfy the first condition in the first CSI report, the first CSI report is not updated.

[0011] In the above technical solution, if the first symbol of the first CSI report does not meet the first condition in any of the K segmented time domains, the first CSI report will not be updated. This solution is more concise in its implementation logic. It is understandable that if the first symbol of the first CSI report does not meet the first condition in any segmented time domain, continuing to update the first CSI report may lead to a decrease in its accuracy or affect the updates of other higher-priority CSI reports. Therefore, through this judgment mechanism, if the first symbol of the first CSI report does not meet the first condition in any segmented time domain, the first CSI report will not be updated. This effectively avoids updating to an unreliable CSI report. Simultaneously, it also avoids the unnecessary occupation of processing units during the process of updating to an unreliable CSI report, which helps save PU resources and improve the resource utilization rate of PU resources.

[0012] In conjunction with the first aspect, in some implementations of the first aspect, determining the processing method of the first CSI report based on whether the first symbol of the first CSI report in at least one segmented time domain satisfies the first condition includes: sequentially determining whether the first symbol of the first CSI report in each of the segmented time domains satisfies the first condition from the first segmented time domain to the Kth segmented time domain; if the first symbol of the first CSI report in the kth segmented time domain does not satisfy the first condition, determining that the processing method of the first CSI report is not to update the first CSI report; where k∈{1,2,…,K}.

[0013] In the above technical solution, the first symbol of the first CSI report in each segment time domain is judged sequentially according to the time domain from front to back to determine whether it meets the first condition. If the first symbol of the first CSI report in the kth segment time domain is detected to not meet the first condition, it is immediately determined not to update the first CSI report. This ensures that in the process of sequential judgment, the processing method of the first CSI report is determined to be not to update the first CSI report at the earliest judgment node, that is, when the first symbol of the first CSI report in a certain segment time domain is detected to not meet the first condition for the first time. It is not necessary to complete the judgment of all K segment time domains, which is conducive to quickly and accurately determining the processing method of the first CSI report.

[0014] In conjunction with the first aspect, in some implementations of the first aspect, if the first symbol of the first CSI report in the k-th segment time domain does not satisfy the first condition and k is less than K, then the first symbol of the first CSI report in the k+1-th segment time domain to the K-th segment time domain will no longer be judged as satisfying the first condition.

[0015] In the above technical solution, when the first symbol of the first CSI report in the k-th segment time domain does not meet the first condition, it can be determined that the processing method for the first CSI report is not to update the first CSI report. Since k is less than K, it indicates that there are other segment time domains after the k-th segment time domain. In this case, the judgment process is terminated in advance, and the first symbol of the first CSI report in the (k+1)-th to K-th segment time domains is no longer judged to meet the first condition, avoiding unnecessary judgment operations. Therefore, this technical solution is beneficial to quickly and accurately determine the processing method of the first CSI report while saving the processing resources required by the aforementioned unnecessary judgment operations.

[0016] In conjunction with the first aspect, in some implementations of the first aspect, if the first symbol of the first CSI report in the k-th segment time domain satisfies the first condition, the first CSI report occupies PU in the k-th segment time domain; where k∈{1,2,…,K}.

[0017] In the above technical solution, if the first symbol of the first CSI report in the k-th segment time domain satisfies the first condition, it means that the first CSI report can currently occupy PU in the k-th segment time domain. However, this does not mean that the first CSI report can continuously occupy PU in the subsequent (k+1)-th to k-th segment time domains; it still needs to be judged one by one in the subsequent segment time domains. Therefore, this technical solution realizes dynamic allocation of PU resources based on whether the first symbol of the first CSI report in each segment time domain satisfies the first condition, ensuring that PU is effectively occupied only when the first CSI report satisfies the first condition. This improves the flexibility and accuracy of PU resource allocation and avoids the problem of PU occupation conflicts between the first CSI report and other CSI reports.

[0018] Optionally, if the first symbol in each of the K segmented time domains of the first CSI report satisfies the first condition, the processing method of the first CSI report is to update the first CSI report.

[0019] In the above technical solution, the first CSI report is only allowed to be updated when the first symbol of the first CSI report in each of the K segment time domains meets the first condition. This ensures that the first CSI report can reliably occupy the PU in each segment time domain. Using the PU occupied in each segment time domain for CSI calculation helps to improve the accuracy of the updated first CSI report.

[0020] In conjunction with the first aspect, in some implementations of the first aspect, determining the processing method of the first CSI report based on whether the first symbol in at least one segmented time domain satisfies the first condition includes: determining the processing method of the first CSI report based on the number of times the first symbol in at least one segmented time domain does not satisfy the first condition.

[0021] In the above technical solution, the processing method of the first CSI report is determined by quantifying the number of times the first CSI report does not meet the first condition in the K segmented time domains. This optimizes the use of PU resources and helps to avoid wasting the occupied PU resources.

[0022] Optionally, in the first to the (K-1)th time segment, if the number of times the first CSI report fails to meet the first condition is greater than or equal to the first threshold, the first CSI report is not updated.

[0023] In the above technical solution, by setting a first threshold, the first CSI report is allowed to fail to meet the first condition in certain segment time domains. Only when the number of times the first CSI report fails to meet the first condition in the first to (K-1)th segment time domains is greater than or equal to the first threshold, is it decided not to update the first CSI report. This approach avoids prematurely deciding not to update the first CSI report due to the first symbol failing to meet the first condition in a single segment time domain, thereby reducing the waste of PU resources already occupied by the first CSI report.

[0024] Optionally, if the first CSI report fails to meet the first condition at least once in the K segmented time domains, and at least once includes the case where the first symbol of the first CSI report in the K segmented time domain fails to meet the first condition, the first CSI report is not updated.

[0025] In the above technical solution, considering that the PU needs to perform Uplink Control Information (UCI) encoding and / or Artificial Intelligence (AI) inference in the Kth segment time domain, even if the first symbol of the first CSI report satisfies the first condition in all segments from the 1st to the (K-1th)th segment time domain, if the first symbol of the first CSI report in the Kth segment time domain does not satisfy the first condition, it will be determined not to update the first CSI report. This solution determines whether to update the first CSI report based on the number of times the first CSI report fails to meet the first condition, and also specifically checks whether the first symbol of the first CSI report in the Kth segment time domain satisfies the first condition. This ensures that at critical moments when the PU needs to perform UCI encoding and / or AI inference, the first CSI report update will not fail due to resource conflicts.

[0026] Optionally, if the number of times the first CSI report fails to meet the first condition is less than the first threshold in the first segment time domain to the (K-1)th segment time domain, and the first symbol of the first CSI report in the Kth segment time domain meets the first condition, the processing method of the first CSI report is to update the first CSI report.

[0027] In the above technical solution, if the number of times the first CSI report fails to meet the first condition is less than the first threshold in the first to (K-1)th time segments, it indicates that although there may be a few instances where the first CSI report fails to meet the first condition, the number of such instances is within an acceptable range. Simultaneously, if the first symbol of the first CSI report in the Kth time segment meets the first condition, it indicates that the necessary UCI encoding and / or AI inference for updating the first CSI report can proceed normally. Therefore, updating the first CSI report under these conditions avoids prematurely deciding not to update the first CSI report due to the first symbol failing to meet the first condition in individual time segments, reducing the waste of PU resources already occupied by the first CSI report, while ensuring that the critical operations necessary for updating the first CSI report (such as UCI encoding and / or AI inference) can proceed normally.

[0028] In conjunction with the first aspect, in some implementations of the first aspect, if the number of times the first CSI report fails to meet the first condition in the first segment time domain to the i-th segment time domain is greater than or equal to the first threshold, the first symbol of the first CSI report in the (i+1)-th segment time domain to the K-th segment time domain is no longer judged to meet the first condition; wherein, the first symbol of the first CSI report in the i-th segment time domain fails to meet the first condition, i is less than K.

[0029] In the above technical solution, when the number of times the first CSI report fails to meet the first condition is greater than or equal to the first threshold in the first to the i-th time segment, it can be determined that the processing method for the first CSI report is not to update it. Since i is less than K, it indicates that there are other time segment segments after the i-th time segment. In this case, the judgment process is terminated early, and the first symbol of the first CSI report in the (i+1)-K-th time segment is no longer judged to meet the first condition, avoiding unnecessary judgment operations. Therefore, this technical solution is beneficial for quickly and accurately determining the processing method for the first CSI report while saving processing resources required by the aforementioned unnecessary judgment operations.

[0030] Optionally, the first CSI report is one of N CSI reports, and the first symbol of the k-th segment time domain of the first CSI report is the same as the first symbol of any segment time domain of the N-1 CSI reports, k∈{1,2,…,K};

[0031] If the priority of the first CSI report is among the top M of the N CSI reports, the first symbol of the first CSI report in the k-th segment time domain satisfies the first condition; where 0 ≤ M ≤ N, and M is such that... The maximum value that is true, N PU L represents the total number of PUs that the terminal device can use to process CSI reports, and L represents the number of PUs that are already occupied in the first symbol. The number of PUs required by CSI report n in the k-th segment time domain, where n∈{0,1,…,N-1}.

[0032] In the above technical solution, when the first symbol of the k-th segment time domain of the first CSI report is the same as the first symbol of any segment time domain in the remaining N-1 CSI reports, it indicates that these N CSI reports occupy N starting from the same symbol. PU -L unoccupied PUs. Since the number of unoccupied PUs is limited, these PUs are allocated to the top M priority CSI reports to ensure they can occupy PUs in their corresponding time segments. This means the top M priority CSI reports receive PU resources first, improving the success rate of critical task processing. Based on this, if the first CSI report's priority is among the top M of the N CSI reports, then its first symbol in the k-th time segment is considered to satisfy the first condition, meaning the first CSI report can occupy a PU in the k-th time segment. This priority mechanism achieves a reasonable allocation of PU resources, effectively avoiding conflicts caused by N CSI reports starting to occupy PUs on the same symbol.

[0033] In conjunction with the first aspect, in some implementations of the first aspect, the priority of each of the N CSI reports is determined based on at least one of the serving carrier index, the type of the CSI report, and the report configuration identifier of the CSI report.

[0034] In conjunction with the first aspect, in some implementations of the first aspect, when the k-th segment time domain of the first CSI report is not the 1-th segment time domain, the priority of the first CSI report among the N CSI reports is increased according to a preset rule.

[0035] In the above technical solution, when the k-th segment time domain of the first CSI report is not the 1st segment time domain, it indicates that the first CSI report is not occupying the PU for the first time, that is, the first CSI report has occupied the PU in at least one segment time domain. At this time, according to the preset rules, the priority of the first CSI report in the N CSI reports is increased, which is conducive to increasing the probability that the priority of the first CSI report is in the top M positions of the N CSI reports, thereby increasing the probability that the first symbol in the k-th segment time domain satisfies the first condition, and thus increasing the probability of updating the first CSI report, so as to minimize the waste of PU resources already occupied by the first CSI report.

[0036] Optionally, the preset rule includes: the priority of the first CSI report is higher than the priority of the second CSI report among the N CSI reports, regardless of the priority value; wherein, the first symbol of the first segment time domain of the second CSI report is the same as the first symbol of the kth segment time domain of the first CSI report.

[0037] In the above technical solution, the first CSI report is a CSI report that does not start occupying the PU for the first time, and the second CSI report is a CSI report that starts occupying the PU for the first time. Regardless of the relationship between the priority values ​​of the first CSI report and the second CSI report, the priority of the first CSI report is higher than that of the second CSI report. This makes it more likely that the priority of the first CSI report will be in the top M positions among the N CSI reports, thereby increasing the possibility that the first CSI report can occupy the PU first and reducing the waste of PU resources already occupied by the first CSI report.

[0038] Optionally, the preset rule includes: the priority of the first CSI report is higher than the priority of the third CSI report among the N CSI reports, regardless of the priority value; wherein, the number of segmented time domains occupied by the first CSI report is greater than the number of segmented time domains occupied by the third CSI report.

[0039] In the above technical solution, the first CSI report has occupied more segmented time domains than the third CSI report. Regardless of the relationship between the priority values ​​of the first CSI report and the third CSI report, the priority of the first CSI report is higher than that of the third CSI report. This gives the first CSI report, which has occupied more segmented time domains, a higher priority, thereby reducing the waste of PU resources in the segmented time domains occupied by the first CSI report.

[0040] Optionally, the first symbol includes an OFDM symbol.

[0041] Optionally, the PU includes a first type of PU and / or a second type of PU.

[0042] Optionally, the first type of PU is a CPU, and the second type of PU is an AL / ML PU.

[0043] Secondly, a method for processing CSI reports is provided, comprising: when the second symbols of N CSI reports are the same, determining the processing method of the N CSI reports based on the number of unoccupied PUs during the expected PU occupancy period of the N CSI reports; wherein the second symbol is used to represent the starting symbol of the CSI report.

[0044] In the above technical solution, when the second symbols of N CSI reports are the same, it indicates that the N CSI reports have started to occupy PUs on the same symbol. At this time, the processing method of the N CSI reports is determined according to the number of unoccupied PUs during the expected PU occupation period of the N CSI reports. Whether the CSI reports occupy PUs continuously or discontinuously, they all have an expected PU occupation period. Taking into account the number of unoccupied PUs during the expected PU occupation period of each of the N CSI reports helps to avoid conflicts when the N CSI reports occupy PUs.

[0045] Optionally, if the number of unoccupied PUs during the expected PU occupancy period of the fourth CSI report is greater than or equal to the second threshold, the processing method of the fourth CSI report is to update the fourth CSI report; wherein, the fourth CSI report is any one of the N CSI reports, and the second threshold is used to represent the number of PUs required to be occupied by the fourth CSI report.

[0046] In the above technical solution, if the number of unoccupied PUs is greater than or equal to the number of PUs required during the expected PU occupancy period of the fourth CSI report, it indicates that there are sufficient PUs to support the update of the fourth CSI report during this period. Therefore, in this case, updating the fourth CSI report ensures that the update is performed when there are sufficient unoccupied PUs, avoiding update failure due to insufficient unoccupied PUs.

[0047] Optionally, if the number of unoccupied PUs during the expected PU occupancy period of the fourth CSI report is less than the second threshold, the fourth CSI report is not updated; wherein, the fourth CSI report is any one of the N CSI reports, and the second threshold is used to represent the number of PUs required for the fourth CSI report.

[0048] In the above technical solution, if the number of unoccupied PUs is less than the number of PUs required for the fourth CSI report during its expected PU occupancy period, it indicates that there are not enough PUs to support the update of the fourth CSI report during this period. Therefore, in this case, not updating the fourth CSI report avoids update failure due to insufficient unoccupied PUs and prevents the fourth CSI report from attempting to occupy PUs already occupied by other CSI reports, thus effectively avoiding PU occupancy conflicts.

[0049] In conjunction with the second aspect, in some implementations of the second aspect, determining the processing method of the N CSI reports based on the number of unoccupied PUs during the expected PU occupancy period of the N CSI reports includes: sequentially performing the following steps according to the priority of the N CSI reports from high to low: for the m-th CSI report, determining the processing method of the m-th CSI report based on the number of unoccupied PUs during the expected PU occupancy period of the m-th CSI report; where m∈{1,2,…,N}.

[0050] In the above technical solution, the processing method of the m-th CSI report is determined according to the number of unoccupied PUs during the expected PU occupation period of the m-th CSI report, based on the priority of the N CSI reports from high to low. This is beneficial for prioritizing the allocation of pre-occupied PUs to high-priority CSI reports and enabling priority updates of high-priority CSI reports.

[0051] Optionally, if the number of unoccupied PUs during the expected PU occupancy period of the fourth CSI report is greater than or equal to the second threshold, the fourth CSI report pre-occupies the PUs of the second threshold.

[0052] In the above technical solution, during the expected PU occupancy period of the fourth CSI report, if the number of unoccupied PUs is greater than or equal to the number of PUs required, it indicates that there are a sufficient number of idle PUs during the expected PU occupancy period of the fourth CSI report. In this case, the fourth CSI report pre-occupies a second threshold of PUs to ensure that the update of the fourth CSI report can be completed based on the pre-occupied PUs. Furthermore, the pre-occupancy of the second threshold of PUs by the fourth CSI report also reduces the number of unoccupied PUs, preventing other CSI reports from occupying PUs already pre-occupied by the fourth CSI report, thereby effectively avoiding PU occupancy conflicts between other CSI reports and the fourth CSI report.

[0053] Optionally, the second symbol includes an OFDM symbol.

[0054] Optionally, the PU includes a first type of PU and / or a second type of PU.

[0055] Optionally, the first type of PU is a CPU, and the second type of PU is an AL / ML PU.

[0056] Thirdly, a CSI report processing apparatus is provided, comprising: a first determining module, configured to determine the processing method of a first CSI report occupying a PU in K segmented time domains, based on whether a first symbol of the first CSI report in at least one segmented time domain satisfies a first condition; wherein the first symbol is used to represent the starting symbol of the segmented time domain, and K is greater than or equal to 1.

[0057] It should be understood that the extensions, limitations, explanations and descriptions of the relevant content in the first aspect above also apply to the same content in the third aspect.

[0058] Fourthly, a CSI report processing apparatus is provided, comprising: a second determining module, configured to determine the processing method of N CSI reports based on the number of unoccupied PUs during the expected PU occupancy period of the N CSI reports when the second symbols of the N CSI reports are the same; wherein the second symbol is used to represent the starting symbol of the CSI report.

[0059] It should be understood that the extensions, limitations, explanations and clarifications of the relevant content in the second aspect above also apply to the same content in the fourth aspect.

[0060] Fifthly, a terminal device is provided, comprising: a memory for storing executable program code; and a processor for calling and running the executable program code from the memory, causing the terminal device to execute the CSI report processing method of the first aspect, any implementation thereof, the second aspect, or any implementation thereof.

[0061] In a sixth aspect, a computer-readable storage medium is provided, the computer-readable storage medium storing computer program code, which, when executed by a terminal device, causes the terminal device to perform a CSI report processing method according to the first aspect, any one of the first aspects, the second aspect, or any one of the second aspects.

[0062] In a seventh aspect, a computer program product is provided, the computer program product comprising: computer program code, which, when executed by a terminal device, causes the terminal device to execute the CSI report processing method of the first aspect, any one of the first aspects, the second aspect, or any one of the second aspects. Attached Figure Description

[0063] Figure 1 is a schematic diagram of the architecture of a mobile communication system applicable to an embodiment of this application;

[0064] Figure 2 is a schematic diagram of the CPU usage time reported by CSI under a certain condition;

[0065] Figure 3 is a schematic diagram of the CPU usage time reported by CSI under scenario two;

[0066] Figure 4 is a schematic diagram of the CPU usage time reported by CSI under scenario 3;

[0067] Figure 5 is a schematic diagram of the principle of BM-Case1;

[0068] Figure 6 is a schematic diagram of the principle of BM-Case2;

[0069] Figure 7 is a schematic diagram of APU usage for AI-CSI report segments;

[0070] Figure 8 is a schematic diagram of PU occupancy based on continuous PU occupancy rules;

[0071] Figure 9 is a schematic diagram of a conflict that occurs when two CSI reports occupy a PU;

[0072] Figure 10 is a schematic flowchart of a CSI report processing method provided in an embodiment of this application;

[0073] Figure 11 is a schematic diagram of a first CSI report of K-segment PU occupancy provided in an embodiment of this application;

[0074] Figure 12 is a schematic diagram of multiple CSI reports occupying a PU provided in an embodiment of this application;

[0075] Figure 13 is a schematic diagram of an AI-CSI report occupying PU provided in an embodiment of this application;

[0076] Figure 14 is a schematic diagram of another AI-CSI report occupying PU provided in an embodiment of this application;

[0077] Figure 15 is a schematic diagram of another AI-CSI report occupying PU provided in an embodiment of this application;

[0078] Figure 16 is a schematic flowchart of another CSI report processing method provided in an embodiment of this application;

[0079] Figure 17 is a schematic diagram illustrating the principle of a processing method that determines two CSI reports in descending order of priority, according to an embodiment of this application.

[0080] Figure 18 is a schematic diagram of the structure of a CSI report processing device provided in an embodiment of this application;

[0081] Figure 19 is a schematic diagram of another CSI report processing device provided in an embodiment of this application;

[0082] Figure 20 is a schematic diagram of the structure of a terminal device provided in an embodiment of this application. Detailed Implementation

[0083] In the embodiments of this application, the terms "first," "second," etc., are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Therefore, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of this embodiment, unless otherwise stated, "multiple" means two or more.

[0084] The technical solutions of this application can be applied to various communication systems, such as: Long Term Evolution (LTE) systems, LTE Frequency Division Duplex (FDD) systems, LTE Time Division Duplex (TDD) systems, Universal Mobile Telecommunication System (UMTS), New Radio (NR) in 5th Generation (5G) mobile communication systems, and future mobile communication systems, such as 6th Generation mobile communication systems.

[0085] The technical solutions provided in this application can also be applied to machine-type communication (MTC), long-term evolution-machine (LTE-M) technology, device-to-device (D2D) networks, machine-to-machine (M2M) networks, Internet of Things (IoT) networks, or other networks. Among them, IoT networks may include, for example, vehicle-to-everything (V2X) networks; the communication methods in V2X systems are collectively referred to as vehicle-to-other-device (V2X), where X can represent anything. For example, V2X may include vehicle-to-vehicle (V2V) communication, vehicle-to-infrastructure (V2I) communication, vehicle-to-pedestrian (V2P) communication, or vehicle-to-network (V2N) communication, etc. This application does not limit these applications.

[0086] Figure 1 is a schematic diagram of the architecture of a mobile communication system applicable to an embodiment of this application.

[0087] As shown in Figure 1, the communication system includes a wireless access network 100, a core network 200, and an Internet 300. The wireless access network 100 may include at least one access network device (110a and 110b in Figure 1, collectively referred to as 110), and at least one terminal (120a, 120b, 120c, 120d, 120e, 120f, 120g, 120h, 120i, and 120j in Figure 1, collectively referred to as terminal 120). Terminals 120a-120j are wirelessly connected to access network devices 110a and 110b. Access network devices 110a and 110b are connected to the core network 200 wirelessly or via wired connection. The core network devices in the core network 200 and the access network devices in the wireless access network can be different physical devices, or they can be the same physical device integrating core network logic functions and wireless access network logic functions, or a single physical device integrating some core network device functions and some wireless access network device functions. Terminals can be interconnected via wired or wireless means, and access network devices can be interconnected via wired or wireless means. It should be understood that Figure 1 is only a schematic diagram, and this communication system may also include other network devices, such as wireless relay devices and / or wireless backhaul devices, which are not shown in Figure 1.

[0088] The access network device 110 in the access network of this application embodiment is sometimes also referred to as an access node. The access network device 110 has wireless transceiver capabilities for communicating with the terminal 120. The access network device 110 includes, but is not limited to, base stations, evolved NodeBs (eNodeBs), transmission reception points (TRPs), next-generation NodeBs (gNBs) in 5G mobile communication systems, next-generation base stations in 6th-generation (6G) mobile communication systems, access network devices or modules of access network devices in Open RAN (ORAN) systems, base stations in future mobile communication systems, or access nodes in WiFi systems. The access network device 110 can also be a module or unit capable of implementing some of the functions of a base station. For example, the access network device 110 can be a central unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU), as described below. In the ORAN system, CU can also be called O-CU, DU can also be called open (O)-DU, CU-CP can also be called O-CU-CP, CU-UP can also be called O-CUP-UP, and RU can also be called O-RU. Access network device 110 can be a macro base station (as shown in Figure 1, 110a), a micro base station or indoor station (as shown in Figure 1, 110b), a relay node or donor node, or a wireless controller in a cloud radio access network (CRAN) scenario. Optionally, access network device 110 can also be a server, wearable device, or vehicle-mounted device, etc. For example, the access network device in vehicle to everything (V2X) technology can be a roadside unit (RSU). Multiple access network devices in the communication system can be base stations of the same type or different types. Base stations can communicate with terminals or communicate with terminals through relay stations. Terminals can communicate with multiple base stations in different access technologies. The embodiments of this application do not limit the specific technology or specific device form adopted by access network device 110. In this application, access network equipment is referred to as "network equipment" for short. Unless otherwise specified, network equipment in this application refers to access network equipment.

[0089] A terminal can also be called a terminal device, user equipment (UE), mobile station, mobile terminal, etc. Terminals can be widely used in various communication scenarios, such as device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, smart transportation, or smart cities. Terminals can be mobile phones, tablets, computers with wireless transceiver capabilities, wearable devices, vehicles, drones, helicopters, airplanes, ships, robots, robotic arms, or smart home devices, etc. This application does not limit the device form of the terminal.

[0090] Access network devices and / or terminals can be fixed or mobile. They can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can be deployed in the air on aircraft, balloons, and satellites. This application does not limit the application scenarios of the access network devices and terminals. Furthermore, access network devices and terminals can be deployed in the same or different scenarios; for example, both can be deployed on land; or the access network device can be deployed on land and the terminal on water, and so on.

[0091] Taking a base station as a network device as an example, the roles of a base station and a terminal can be relative. For instance, the helicopter or drone 120i in Figure 1 can be configured as a mobile base station. For terminals 120j that access the wireless access network 100 through 120i, terminal 120i is a base station; however, for the base station, 120i is a terminal. 110a and 120i communicate via a wireless air interface protocol, or they can communicate via a base station-to-base station interface protocol. In this case, relative to 110a, 120i is also a base station. Therefore, both base stations and terminals can be collectively referred to as communication devices. 110a and 110b in Figure 1 can be called communication devices with base station functions, and 120a-120j in Figure 1 can be called communication devices with terminal functions.

[0092] In the embodiments of this application, the communication device with access network device function can be an access network device, or a module (such as a chip, chip system, or software module) in the access network device, or a control subsystem containing access network device function. For example, a control subsystem containing access network device function can be a control center in scenarios where terminals can be applied, such as smart grids, industrial control, intelligent transportation, or smart cities.

[0093] In the embodiments of this application, the communication device with terminal functionality can be a terminal, a module within a terminal (such as a chip, chip system, modem, or software model), or a device that includes terminal functionality. For ease of description, network devices (e.g., base stations) and terminal devices (UEs) will be used as examples in the following embodiments.

[0094] Communication between base stations and terminals, between base stations, and between terminals can be conducted using licensed spectrum, unlicensed spectrum, or both simultaneously. Communication can be conducted using spectrum below 6 GHz, spectrum above 6 GHz, or both simultaneously. The embodiments of this application do not limit the spectrum resources used for wireless communication.

[0095] The technical solutions provided in this application can be applied to wireless communication between communication devices. Wireless communication between communication devices can include: wireless communication between a base station and a terminal, wireless communication between base stations, and wireless communication between terminals. It is understood that in the embodiments of this application, the physical downlink share channel (PDSCH), physical downlink control channel (PDCCH), and physical uplink share channel (PUSCH) are merely examples of downlink data channels, downlink control channels, and uplink data channels, respectively. In different systems and scenarios, data channels and control channels may have different names, and the embodiments of this application do not limit this. In this application, the base station sends downlink signals or downlink information to the terminal, and the downlink information is carried on the downlink channel; the terminal sends uplink signals or uplink information to the base station, and the uplink information is carried on the uplink channel.

[0096] To facilitate understanding of this application, the following terms related to this application are introduced:

[0097] 1. Channel State Information (CSI)

[0098] During the journey of a wireless signal from the transmitter to the receiver through a wireless channel, fading occurs due to scattering, reflection, and energy attenuation with distance. Furthermore, the wireless signal may be interfered with by other signals at the receiver, affecting reception. Signal attenuation and interference characteristics can be characterized using signal attenuation indexing (CSI).

[0099] Specifically, the CSI may include at least one of the following: CSI-RS resource indicator (CRI), rank indicator (RI), precoding matrix indicator (PMI), channel quality indicator (CQI), synchronization signal and physical broadcast channel block (SSB) resource indicator (SSBRI), layer indicator (LI), L1-reference signal received power (RSRP), and L1-signal to interference plus noise ratio (SINR). The CSI may be transmitted by the terminal device to the network device via PUCCH or PUSCH.

[0100] During communication, network devices and terminal devices obtain the Channel Sounding Reference Signal (CSI) by measuring the reference signal, and then perform data transmission and reception based on the obtained CSI. For example, the channel or interference is measured by sending a known sequence of RS. In NR, the downlink channel is typically measured by CSI-RS, and the uplink channel is measured by the channel sounding reference signal (SRS).

[0101] 2. Channel State Information Report Configuration (CSI-ReportConfig)

[0102] This is primarily used to configure parameters related to channel state reporting, such as the reporting type and the measured metrics being reported. Specifically, the reporting configuration identifier (reportConfigId) is the identity (Id) number for this CSI-ReportConfig, used to identify the CSI-ReportConfig; channel measurement resources (resourcesForChannelMeasurement) are used to configure channel state information - reference signal (CSI-RS) resources for channel measurement, and are associated with the resource configuration through CSI-ResourceConfigId; interference measurement resources (CSI-IM-ResourcesForInterference) configure the CSI-RS resources used for interference measurement, and are associated with the resource configuration through CSI-ResourceConfigId.

[0103] Optionally, the parameters for CSI reporting can include CSI reporting type (reportConfigType), CSI reporting quantity (reportQuantity), etc. CSI reporting type can be divided into periodic, semi-persistent (semi-PersistentOnPUCCH or semi-PersistentOnPUSCH), and aperiodic reporting. Network devices can configure different reporting quantities to allow terminal devices to report different CSIs, including CSI-RS resource indicator (CRI), rank indicator (RI), pre-coding matrix indicator (PMI), and channel quality indicator (CQI). Optionally, the reporting quantity configuration can also be none, i.e., the reporting quantity is empty.

[0104] 3. L1 / L2 Triggered Mobility Channel State Information Report Configuration (Layer 1 / Layer 2 Triggered Mobility CSI-ReportConfig, LTM-CSI-ReportConfig)

[0105] LTM-CSI-ReportConfig is a dedicated CSI reporting configuration designed for 5G NR to support fast mobility management. It is mainly used to quickly assist base stations (gNBs) in making cell handover decisions, thereby improving connection stability and handover efficiency in mobile scenarios.

[0106] 4. CSI Report

[0107] CSI reports are sent from the terminal device to the network device. For a CSI report configured with CSI-ReportConfig and whose ReportQuantity is not 'none', the CSI report is used by the network device to obtain the channel state when it sends downlink information to the terminal device. Generally, a CSI report can be associated with one or more sets of reference signal resources used for channel measurement and / or interference measurement. One CSI report corresponds to one transmission resource, that is, the time-frequency resource used by the terminal device to send the CSI.

[0108] CSI reports include three types: periodic CSI reports, semi-continuous CSI reports, and non-periodic CSI reports.

[0109] For periodic CSI reports, the terminal device periodically sends channel state information. For example, the terminal device can send channel state information at intervals of T time units, where the time unit can be a time slot, millisecond, subframe, etc.

[0110] For semi-persistent CSI reporting, the terminal device can periodically send channel state information within a first time period. For example, after receiving a semi-persistent CSI report of an activated Medium Access Control Element (MAC CE) or PDCCH, the terminal device sends channel state information at intervals of T time units. Afterward, after receiving a semi-persistent CSI report of a deactivated MAC CE or PDCCH, the terminal device stops sending channel state information.

[0111] For non-periodic CSI reports, the terminal device reports channel state information after receiving the activation signaling for the non-periodic CSI report, and stops reporting channel state information after the reporting ends.

[0112] 5. Beam and Reference Signal (RS)

[0113] A beam is a communication resource. A beam can be wide, narrow, or other types of beams. The technology used to form a beam can be beamforming technology or other techniques. Beamforming technology can specifically be digital beamforming, analog beamforming, or hybrid digital / analog beamforming. Different beams can be considered different resources. The same or different information can be transmitted through different beams. Optionally, multiple beams with the same or similar communication characteristics can be considered as a single beam. Currently, the beams and beam management described in 5G NR specifically refer to analog beams.

[0114] Beams can correspond to time resources and / or spatial resources and / or frequency domain resources.

[0115] Alternatively, the beam can also correspond to a reference signal resource or beamforming information.

[0116] Optionally, the beam can also correspond to information associated with reference signal resources of the network device. The reference signal can be a channel state information reference signal (CSI-RS), a synchronous signal / physical broadcast channel block (SSB), a demodulation reference signal (DMRS), a phase tracking reference signal (PTRS), a tracking reference signal (TRS), etc. The information associated with the reference signal resource can be a reference signal resource identifier or quasico-location (QCL) information, etc. The reference signal resource identifier corresponds to a transmit / receive beam pair previously established based on measurements of that reference signal resource. Through this reference signal resource index, the terminal device can infer the beam information.

[0117] Optionally, the above-mentioned CSI-RS includes Periodic CSI-RS (P CSI-RS) and Semi-Persistent CSI-RS (SP CSI-RS).

[0118] 6. CSI Processing Unit (CPU)

[0119] When performing CSI measurements, terminal devices require certain computing and storage resources. The 3GPP protocol uses the number of CPUs to characterize the resources required for CSI processing. The terminal device reports the number of CPUs it can support to the network device, or in other words, the maximum number of CPUs it can support. This maximum number of supported CPUs refers to the number of CPUs supported simultaneously; it could be the number of CPUs supported on a single carrier or across all carriers. For example, if a terminal device supports only one CPU, it means that at any given time, only one CPU will be used for CSI processing.

[0120] 7. Artificial Intelligence / Machine Learning Processing Unit (AI / ML PU)

[0121] The AI / ML PU, also known as the APU, is a new module specifically designed to process CSI reports related to AI / ML. It aims to optimize the performance of wireless communication systems by leveraging advanced algorithms and technologies to improve the accuracy and efficiency of channel state information.

[0122] 8. Processing Unit (PU)

[0123] A PU is a processing unit used for CSI measurement and calculation; it is a logical concept, not a physical PU. In the embodiments of this application, a PU may include the CPU and / or APU described above.

[0124] 9. Symbols

[0125] A symbol refers to the basic unit of transmission in the time domain. In the embodiments of this application, a symbol is also called a time-domain symbol. It can be an orthogonal frequency division multiplexing (OFDM) symbol or a single carrier frequency division multiple access (SC-FDMA) symbol. SC-FDMA is also known as orthogonal frequency division multiplexing with transform precoding (OFDM with TP).

[0126] It should be understood that the definitions of the above terms can be referenced from the prior art. However, as technology continues to develop, the above definitions may also change, and the embodiments of this application are not limited thereto.

[0127] As mentioned above, in the existing 5G NR standard, the CPU usage time of a CSI report is continuous in the time domain, and the existing CSI processing rules are also based on this continuous CPU usage time. In other words, in the 5G NR standard, the CPU usage time of a CSI report is continuous, and the CSI processing rules are also based on this continuous time domain. The following explains these CSI processing rules based on the continuous time domain:

[0128] First, we will introduce the CPU usage rules when the CPU usage reported by CSI is in a continuous time domain (referred to as the continuous PU usage rules):

[0129] If the terminal device supports N CPU If N simultaneous CSI calculations are performed, it is said that the terminal has N CPU There are L CSI processing units used to process CSI reports. If, in a given OFDM symbol, L CPUs are already occupied by CSI reports, then the terminal device has N CPUs available. CPU -L unused CPUs. If N CSI reports start at the same OFDM symbol, then... CPU -L unused CPUs each occupy a portion of the CPU, where the CPU size required by CSI report n (n = 0, 1, ..., N-1) is... Then the terminal device does not need to update the CSI reports with the lowest priority NM, where 0≤M≤N, and M is the value that makes NM lower than the highest priority NM. The maximum value that is valid. The priority of CSI reports n (n = 0, 1, ..., N-1) is from high to low, and the highest priority CSI report is called CSI report 0.

[0130] Next, the rules regarding CPU usage time are introduced when the CPU usage time of CSI reports is in a continuous time domain:

[0131] In the existing protocol, regardless of the type of CSI report, its CPU usage time is continuous, that is, the CPU time domain occupied by the CSI report is a continuous time domain.

[0132] For example, for a CSI report configured by CSI-ReportConfig and whose ReportQuantity is not 'none', or for a CSI report configured by LTM-CSI-ReportConfig, the OFDM symbols used by the CPU include the following three cases:

[0133] Case 1: For periodic or semi-persistent CSI reports (excluding initial semi-persistent CSI reports carried on PUSCH triggered by PDCCH and semi-persistent reports with codebook set to typeII-Doppler-r18 or typeII-Doppler-PortSelection-r18), the CPU time is: starting from the first symbol of the earliest reference signal with the most recent reference signal timing no later than the CSI reference resource, until the last symbol of the uplink channel carrying the CSI report.

[0134] Figure 2 illustrates one possible scenario regarding CPU usage time in a CSI report. The arrows corresponding to the CSI reference resources in Figure 2 represent a specific moment in time, and the uplink channel can be either PUSCH or PUCCH. Figure 2 exemplarily demonstrates the same set of reference signals associated with the CSI report received by the terminal device at different times prior to the moment corresponding to the CSI reference resource. These same sets of reference signals received by the terminal device at different times are represented in Figure 2 as: the first set of reference signals, the second set of reference signals, and the third set of reference signals.

[0135] As can be seen from Figure 2, the CPU usage time starts from the first symbol of the third reference signal set and ends with the last symbol of the uplink channel.

[0136] Scenario 2: For a non-periodic CSI report triggered by PDCCH or an initial semi-persistent CSI report triggered by PDCCH and carried by PUSCH, the CPU time is from the first symbol after the PDCCH used to trigger the CSI report to the last symbol of the uplink channel carrying the CSI report.

[0137] Figure 3 illustrates the CPU usage time of a CSI report under scenario two. The arrows corresponding to the CSI reference resources in Figure 3 represent moments in time; the uplink channel can be either PUSCH or PUCCH. Figure 3 exemplarily shows the same set of reference signals associated with the CSI report received by the terminal device at different times before the moment corresponding to the CSI reference resource. The PDCCH triggers the CSI report between the moment the terminal device receives the second set of reference signals and the moment it receives the third set of reference signals. As can be seen from Figure 3, the CPU usage time starts from the first symbol after the PDCCH and continues until the last symbol of the uplink channel.

[0138] Scenario 3: For semi-persistent CSI reports carried by PUSCH with codebook types 'typeII-Doppler-r18' or 'typeII-Doppler-Port Selection-r18', the CPU usage time is: from the Kth... p The first symbol of the nearest P / SP CSI-RS timing (no later than the CSI reference resource), up to the last symbol of the uplink channel carrying the CSI report, where K p ∈{1,2,4} is indicated by the terminal capability.

[0139] Figure 4 shows a schematic diagram of CPU usage time reported by CSI under scenario three. Figure 4 illustrates K. p The CPU occupancy time is 2. In Figure 4, the first symbol of the second nearest P / SP CSI-RS timing is the first symbol of the second reference signal set. As can be seen from Figure 3, the CPU occupancy time starts from the first symbol of the second reference signal set and ends with the last symbol of the uplink channel.

[0140] As communication systems evolve, the required reference signals and feedback overhead increase significantly. Therefore, Revision 19 (Rel-19) of 5G Evolution introduced CSI reports based on AI models / functions. It's important to note that AI models are divided into terminal-side models and network-side models. However, since the processing unit occupancy considered in this application's embodiments is a terminal-side concept, it only relates to the terminal-side model. This does not mean that a particular use case can only have a terminal-side model.

[0141] Currently, AI use cases related to the Processing Unit (PU) are mainly divided into AI beam management and AI-based CSI feedback enhancement. AI in beam management includes two use cases: Beam Management Case 1 (BM-Case 1) and Beam Management Case 2 (BM-Case 2). AI-based CSI feedback enhancement includes two use cases: AI-based CSI prediction and AI-based CSI compression. The following sections will introduce these four use cases in detail:

[0142] BM-Case1 refers to spatial domain downlink beam prediction of reference signal set A based on the measurement results of reference signal (beam) set Set B.

[0143] Figure 5 is a schematic diagram of one principle of BM-Case1. The network device sends a first set of reference signals (Example shown as Set B in Figure 5) to the terminal device. After measuring Set B, the terminal device uses the measured signal quality (L1-RSRP) value of Set B as input or part of the input to its AI model. The AI ​​model is then used to predict the signal quality (L1-RSRP) of a second set of reference signals (denoted as Set A). A CSI report based on BM-Case1 can include the prediction results of the signal quality prediction for the second set of reference signals.

[0144] For BM-Case 1, Set B is a smaller set than Set A. For example, Set B contains 4 reference signals, denoted as CSI-RS#[2, 4, 6, 8], and Set A contains 8 reference signals, denoted as CSI-RS#[1, 2, 3, 4, 5, 6, 7, 8]. After measuring Set B, the terminal device obtains RSRP#[2, 4, 6, 8], and then uses the measured RSRP#[2, 4, 6, 8] as input to the AI ​​model, outputting the predicted RSRP values ​​of the 8 reference signals in Set A, or the probability that each reference signal in Set A has the largest RSRP measurement value in Set A, i.e., the predicted probability. Obviously, for traditional CSI reporting, without using the AI ​​model, the network device needs to send the entire Set A to the terminal device, which increases the resource overhead of its reference signals.

[0145] BM-Case2 refers to: performing time-based downlink beam prediction on SetA based on historical measurement results of Set B.

[0146] Figure 6 is a schematic diagram of one principle of BM-Case2. Specifically, measurements are taken on Set B over the past M transmission occasions (exemplarily shown in the figure as Set B with 4 transmission occasions). The historical measurements of Set B are used as input or part of the input to the AI ​​model for prediction. The AI ​​model outputs the prediction results of the reference signal within Set A at the next N time points (predicted signal quality values ​​and / or predicted probabilities). The CSI report based on BM-Case2 can include the prediction results of the reference signal within Set A at the next N time points.

[0147] AI-based CSI prediction (AI-CSI prediction) is somewhat similar to BM-Case2 mentioned above. It is based on measuring the reference signal at the past M time points, using the measurement results (such as the channel matrix and the singular value vector of the channel) as the input of the AI ​​model, and then predicting the CSI at the next M time points. In other words, the AI ​​model outputs the prediction results of the reference signal at the next M time points.

[0148] AI-based CSI compression (AI-CSI compression) refers to the following: After the terminal device measures one or more past reference signals from the network device, it inputs them into an AI model for compression. Then, the compression result of the current or predicted CSI is reported in the CSI report. The network device then uses the network-side CSI reconstruction model to decompress the compressed CSI.

[0149] In the current 3GPP standard discussions, there are four AI use cases / functions related to the Processing Unit (PU): BM-Case 1, BM-Case 2, AI-CSI compression, and AI-CSI prediction. Each AI function may have one or more corresponding CSI reports. However, if the terminal does not support a certain AI function, it will not have the corresponding CSI report. Whether or not a terminal has a CSI report for a particular AI function depends on the terminal's capabilities, and this application does not specifically limit this. For ease of description, the CSI report corresponding to the AI ​​function will be referred to as an AI-CSI report in the following text.

[0150] Similar to traditional CSI reports, updating AI-CSI reports also requires processing unit (PU) and involves PU occupancy time. The following describes the PU occupancy and occupancy time of AI-CSI reports:

[0151] The AI ​​functions described above all involve measuring reference signals from one or more past transmission points, using the measurement results as input or part of the input to an AI model, and then reporting the output of the AI ​​model in a CSI report. Because AI model processing may differ from traditional CSI processing, a new processing unit module called AI / ML PU (APU) has been introduced for AI-CSI reporting.

[0152] However, it remains inconclusive whether an AI-CSI report needs to utilize both the APU and traditional CPU simultaneously. For example, some AI-CSI reports may only utilize the APU, not the CPU. Some AI-CSI reports utilize only the CPU, not the APU. Still others utilize both the CPU and APU. Furthermore, the CPU usage may differ depending on the AI ​​function. For instance, an AI-CSI report based on BM-Case2 may utilize both the CPU and APU, while an AI-CSI report based on AI-CSI prediction may only utilize the APU. However, this embodiment is merely an example; in actual implementations, the APU and / or CPU usage for different types of AI-CSI reports can be selected according to actual needs.

[0153] Judging from the PU occupancy time of AI-CSI reports, except for AI-CSI reports based on BM-Case2, other types of AI-CSI reports are likely to still occupy PU continuously. This is because for AI-CSI reports other than those based on BM-Case2, the PU occupancy time may only be tens of milliseconds. However, for AI-CSI reports based on BM-Case2, the terminal uses measurements from the past M time points to predict the future N time points. The interval between each prediction result is at most 160 milliseconds. If the interval between the input Set B is also on the order of 160 milliseconds, and if the continuous occupancy rule (continuous occupancy from beginning to end) is adopted as described above, it may occupy hundreds or even thousands of milliseconds of PU, resulting in a huge waste of PU resources. For example, the interval between two Sets B is 160 milliseconds, but the actual measurement and calculation time only takes a few milliseconds (e.g., 1-5 milliseconds). This results in the PU being occupied for a large amount of time (e.g., 155-159 milliseconds) without performing relevant calculations. Therefore, for AI-CSI reports, continuously occupying the PU will result in a significant waste of resources.

[0154] To address this, a non-continuous APU occupancy scheme has been proposed in related technologies. Taking non-continuous APU occupancy as an example, Figure 7 illustrates a segmented APU occupancy scheme for CSI reports. As shown in Figure 7, the CSI report occupies the APU in four segments: APU Occupancy 1, APU Occupancy 2, APU Occupancy 3, and APU Occupancy 4. Taking BM-Case 2 as an example, in BM-Case 2, it measures reference signal sets from the past M time points (illustratively shown as reference signal sets 1 to 4 in the figure). However, the measurement and calculation time required for each reference signal set corresponds to Z′ symbols, meaning the APU needs to be occupied for Z′ symbols to complete the required measurement and calculation. Therefore, for K... p The occupancy time of the second nearest reference signal set is from the first symbol of each reference signal set to the Z′ symbols after its last symbol. For the most recent segment (exemplarily shown in the figure as APU occupancy 4), the occupancy time is from the first symbol of the fourth reference signal set to the last symbol of the uplink channel. This reduces the waste of many PU resources, and PU resources not occupied by this CSI report can be occupied by other CSI reports.

[0155] However, this application's research reveals that if the aforementioned discontinuous occupancy scheme is ultimately introduced, existing CSI processing guidelines cannot be directly applied, potentially leading to conflicts when occupies processing units. This conflict issue is explained below:

[0156] If the above-mentioned continuous PU occupancy rule is adopted, it implicitly expresses reserved occupancy. That is, if a CSI report occupies W symbols, starting from OFDM symbol a, and the CSI report is in the top M priority range, then the CSI report will occupy the PU from OFDM symbol a until after W symbols. For example, as shown in Figure 8, Figure 8 is a schematic diagram of PU occupancy based on continuous PU occupancy rules. In this diagram, the vertical axis represents N. CPU =6, where the horizontal axis represents OFDM symbols (i.e., the time axis). Assuming four CSI reports begin occupying a PU from the third OFDM symbol, and three PUs are already occupied, then N... CPU -L=3. For 4 CSI reports, the number of PUs required from highest to lowest priority are 2, 1, 1, and 2 respectively. The top two CSI reports are allowed to occupy PUs. Specifically, CSI report 0 occupies 2 PUs, a total of 6 symbols (illustrated as symbols 3 to 8 in the diagram); CSI report 1 occupies 1 PU, a total of 8 symbols (illustrated as symbols 3 to 10 in the diagram).

[0157] As shown in Figure 8, for continuous PU occupancy rules, as long as no new CSI report starts occupancy after the third OFDM symbol, the occupied PU will necessarily be non-incremental over time, thus the existing CSI processing rules are feasible. However, if the PU occupancy is non-continuous, the existing CSI processing rules cannot be directly applied. The following explanation, in conjunction with Figure 9, further clarifies this:

[0158] Figure 9 is a schematic diagram of a conflict that occurs when two CSI reports occupy a PU.

[0159] For example, as shown in Figure 9, a CSI report that occupies PUs in two segments (illustratively shown as CSI report 2 in the figure) requires 3 PUs, starting from the 3rd OFDM symbol. At the 3rd OFDM symbol, it applies the aforementioned continuous PU occupancy rule to determine that the occupancy condition is met. Therefore, CSI report 2 will occupy 10 OFDM symbols: the 3rd to 7th OFDM symbols and the 12th to 16th OFDM symbols. However, at the 8th OFDM symbol, another CSI report (illustratively shown as CSI report 3 in the figure) begins to occupy PUs, requiring 4 PUs. CSI report 3 also satisfies the aforementioned continuous PU occupancy rule at the 8th OFDM symbol. However, at this time, the 12th to 15th OFDM symbols have already been pre-occupied by CSI report 2, so CSI report 3 does not have enough PUs to occupy, resulting in an occupancy conflict.

[0160] It should be noted that the "2" and "3" in CSI Report 2 and CSI Report 3 shown in Figure 9 are only for distinguishing different CSI reports and have nothing to do with the priority of the CSI reports themselves.

[0161] Based on this, this application provides a CSI report processing method. This method proposes a new CSI report processing criterion that supports CSI reports with discontinuous PU occupancy, resolving conflicts caused by discontinuous PU occupancy in CSI reports. Specifically, this application embodiment can be applied to the scenario shown in Figure 1, and the CSI report processing method can be applied to terminal 120 in this scenario. The CSI report processing method in this application embodiment is described in detail below:

[0162] Figure 10 is a schematic flowchart of a CSI report processing method provided in an embodiment of this application.

[0163] For example, as shown in Figure 10, the processing method for this CSI report includes:

[0164] S101: For the first CSI report occupying PU in K segmented time domains, determine the processing method of the first CSI report based on whether the first symbol of the first CSI report in at least one segmented time domain satisfies the first condition; wherein, the first symbol is used to represent the starting symbol of the segmented time domain, and K is greater than or equal to 1.

[0165] In this context, a segmented time domain refers to dividing a large time interval or data transmission cycle into several smaller, discontinuous time segments. Each segmented time domain can include at least one symbol, which can be used to represent a certain time length. Each segmented time domain has its own first symbol, which is used to indicate the start symbol of that segmented time domain. This start symbol can be understood as the first symbol of that segmented time domain, or as the starting point of PU occupancy for that segmented time domain. The first CSI report of PU occupancy for the K segmented time domains can also be called the first CSI report of PU occupancy for the K segments.

[0166] Optionally, the first symbol mentioned above includes the OFDM symbol. For example, the OFDM symbol can be used as the first symbol.

[0167] It should be noted that the embodiments of this application only take OFDM symbol as the first symbol as an example. In specific implementation, the first symbol can also be SC-FDMA symbol. The embodiments of this application do not specifically limit the specific form of the first symbol.

[0168] When K equals 1, the first CSI report is actually a CSI report of continuous PU occupancy. When K is greater than 1, the K segmented time domains are not continuous, and the first CSI report is actually a CSI report of discontinuous PU occupancy. In other words, the first CSI report can be a CSI report of either continuous or discontinuous PU occupancy.

[0169] For a CSI report, whether it indicates continuous or discontinuous PU usage is usually known. This can be determined through the CSI report's configuration information or its type. For example, as mentioned above, an AI-CSI report based on BM-Case2 might be a CSI report indicating discontinuous PU usage, while a traditional CSI report, i.e., a CSI report unrelated to AI, is typically a CSI report indicating continuous PU usage.

[0170] For a CSI report, it is usually known which time domain segments need to occupy PU, for example, it can be determined through the configuration information of the CSI report.

[0171] Figure 11 is a schematic diagram of a first CSI report of K-segment PU occupancy provided in an embodiment of this application.

[0172] For example, as shown in Figure 11, the vertical axis represents the number of PUs in the terminal, N PU =1, the horizontal axis represents symbols (i.e., the time axis). In Figure 11, K=4, the first CSI report occupies PU in 4 segmented time domains: the first segmented time domain starts from the 1st symbol and ends at the 3rd symbol; the second segmented time domain starts from the 6th symbol and ends at the 8th symbol; the third segmented time domain starts from the 11th symbol and ends at the 13th symbol; and the fourth segmented time domain starts from the 16th symbol and ends at the 20th symbol. Therefore, it can be seen that the starting symbol of the first segmented time domain is the 1st symbol, the starting symbol of the second segmented time domain is the 6th symbol, the starting symbol of the third segmented time domain is the 11th symbol, and the starting symbol of the fourth segmented time domain is the 16th symbol.

[0173] For example, the first CSI report can be any one of N CSI reports, all of which are preparing to occupy a PU in the same symbol. Since the number of unoccupied PUs in the same symbol is limited, the terminal device needs to determine which of the N CSI reports can occupy a PU and which cannot, thereby determining the processing method for each CSI report. Based on this, each of the N CSI reports can be considered the first CSI report, and the processing method for the first CSI report can be determined based on whether the first CSI report satisfies a first condition in at least one segmented time domain.

[0174] In a specific implementation, the processing method of the first CSI report is determined based on whether the first CSI report satisfies the first condition at at least one segmented time domain first symbol. This can be understood as: determining the processing method of the first CSI report based on whether the first CSI report satisfies the first condition at at least one segmented time domain first symbol. It can also be understood as: determining the processing method of the first CSI report based on whether the first condition is satisfied within at least one segmented time domain first symbol.

[0175] For example, the first condition mentioned above can be understood as a preset occupancy condition, used to determine whether there are enough PUs available for the first CSI report to occupy in each segment time domain. For instance, if the first symbol of the first CSI report in a certain segment time domain satisfies the first condition, it means that there are enough PUs available for the first CSI report to occupy in that segment time domain, and the first CSI report can occupy PUs in that segment time domain. Conversely, if the first symbol of the first CSI report in a certain segment time domain does not satisfy the first condition, it means that there are not enough PUs available for the first CSI report to occupy in that segment time domain, and the first CSI report cannot occupy PUs in that segment time domain.

[0176] The processing methods for the first CSI report include at least a first processing method, which is not to update the first CSI report. It is understood that updating the first CSI report requires sufficient PU (Power Processing Unit). If the first CSI report cannot occupy PU in a certain time segment, it may not be able to be updated, thus confirming that the processing method for the first CSI report is the first processing method. It should be noted that this is only one possible implementation of the first processing method for the first CSI report, and is not a limitation in specific implementations.

[0177] Optionally, the processing method of the first CSI report may also include a second processing method, which is to update the first CSI report.

[0178] In this embodiment, the first CSI report can be either a continuously occupied PU or a discontinuously occupied PU. Therefore, the processing method for this CSI report supports both continuously occupied PU and discontinuously occupied PU CSI reports. Furthermore, for discontinuously occupied PU CSI reports, at the start symbol of at least one segment in the time domain, it is determined whether the first CSI report meets a first condition, thereby determining the processing method for the first CSI report. This avoids the PU occupation conflict problem that can easily occur if the processing method for the first CSI report is directly determined by only performing a single judgment when preparing to start occupying the PU.

[0179] For example, referring to Figure 9, for CSI report 2 which occupies PU in two segments, the CSI report processing method in this embodiment does not determine that CSI report 2 occupies PU in both segment time domains (i.e., the 3rd to 7th OFDM symbols and the 12th to 16th OFDM symbols) simply because the starting symbol (3rd OFDM symbol) of the first segment time domain meets the first condition (also called the occupancy condition), and thus determine that the processing method for CSI report 2 is to update CSI report 2. Instead, it determines the processing method for CSI report 2 based on whether the starting symbol of each segment time domain in the two segment time domains meets the first condition. By making independent judgments at the starting symbol of each segment time domain, the reasonable allocation of PU resources is ensured, and potential PU occupancy conflicts are avoided.

[0180] In some embodiments, if the first symbol of the first CSI report does not satisfy the first condition in any segmented time domain, the first CSI report is not updated. That is, as long as the first symbol of the first CSI report does not satisfy the first condition in any of the K segmented time domains, the first CSI report is not updated.

[0181] It is understandable that if the first symbol of the first CSI report in a certain segment time domain does not meet the first condition, it means that the first CSI report does not meet the condition of occupying PU in that segment time domain. In other words, the first CSI report cannot occupy PU normally in that segment time domain. Continuing to update the first CSI report may lead to a decrease in its accuracy or affect the update of other higher priority CSI reports.

[0182] For example, referring to Figure 11, the first CSI report in Figure 11 occupies the PU in 4 segments. In the 4 segment time domains, if the first CSI report does not meet the first condition at the first symbol in any segment time domain, for example, if the first CSI report does not meet the first condition at the 6th symbol (the first symbol of the 2nd segment time domain), then the first CSI report is not updated, and the terminal does not update the first CSI report.

[0183] In this embodiment, if the first symbol of the first CSI report does not meet the first condition in any segment time domain, the first CSI report will not be updated. This can effectively avoid updating to obtain an unreliable CSI report. At the same time, this also avoids the invalid occupation of the processing unit during the process of updating to obtain an unreliable CSI report, which is conducive to saving PU resources and improving the resource utilization rate of PU resources.

[0184] In some embodiments, the above-mentioned method of determining the processing method of the first CSI report based on whether the first symbol of the first CSI report in at least one segmented time domain satisfies the first condition includes the following steps S1011 to S1012:

[0185] S1011: From the first segment time domain to the Kth segment time domain, sequentially determine whether the first symbol of the first CSI report in each segment time domain satisfies the first condition.

[0186] Specifically, the terminal, following a sequential time-domain order from front to back, starting from the first segment of the time domain, sequentially determines whether the first symbol of the first CSI report in each segment of the time domain satisfies the first condition. In other words, it determines whether the first CSI report satisfies the first condition at the first symbol of each segment of the time domain.

[0187] For example, referring to Figure 11, K=4, the first CSI report in Figure 11 occupies PU in 4 segments. The terminal judges in the following order in the time domain whether the first symbol (the first symbol) of the first CSI report in the first segment time domain satisfies the first condition, whether the first symbol (the sixth symbol) of the first CSI report in the second segment time domain satisfies the first condition, whether the first symbol (the eleventh symbol) of the first CSI report in the third segment time domain satisfies the first condition, and whether the first symbol (the sixteenth symbol) of the first CSI report in the fourth segment time domain satisfies the first condition.

[0188] S1012: If the first symbol of the first CSI report in the k-th segment time domain does not satisfy the first condition, determine that the processing method of the first CSI report is not to update the first CSI report; where k∈{1,2,…,K}.

[0189] Specifically, if the first symbol of the first CSI report in the k-th segment time domain does not meet the first condition, it means that the first CSI report cannot occupy the PU in the k-th segment time domain. Therefore, the relevant calculations required to update the first CSI report cannot be completed in the k-th segment time domain, which will affect the normal update of the first CSI report. Therefore, it is determined that the first CSI report should not be updated to avoid invalid updates of the first CSI report.

[0190] For example, referring to Figure 11, when k=2, if the first CSI report does not meet the first condition in the first symbol (sixth symbol) of the second segment time domain, then the processing method for the first CSI report occupying the PU in the fourth segment is to not update the first CSI report.

[0191] In this embodiment, the first CSI report is judged sequentially from front to back in the time domain to determine whether the first symbol of each segment time domain meets the first condition. If the first CSI report is detected not to meet the first condition at the first symbol of the kth segment time domain, it is immediately determined not to update the first CSI report. This ensures that during the sequential judgment process, the processing method of the first CSI report is determined to be not to update the first CSI report at the earliest judgment node, that is, when the first symbol of the first CSI report in a certain segment time domain is first detected not to meet the first condition. It is not necessary to complete the judgment of all K segment time domains, which is conducive to quickly and accurately determining the processing method of the first CSI report.

[0192] In some embodiments, if the first symbol in the first CSI report in the k-th segment time domain does not satisfy the first condition and k is less than K, then the first symbol in the first CSI report in the (k+1)-th to K-th segment time domains will no longer be judged to satisfy the first condition.

[0193] It is understandable that when the first symbol of the first CSI report in the k-th segment time domain does not meet the first condition, it can be determined that the processing method for the first CSI report is not to update the first CSI report. Since k is less than K, it means that there are other segment time domains after the k-th segment time domain. In this case, the judgment process is terminated in advance, and the first symbol of the first CSI report in the segment time domain after the k-th segment time domain is no longer judged to meet the first condition.

[0194] For example, referring to Figure 11, if the first symbol (the 6th symbol) of the first CSI report in the second segment time domain does not meet the first condition, then the first symbol (the 11th symbol) of the first CSI report in the third segment time domain will no longer be evaluated for whether the first condition is met, and the first symbol (the 16th symbol) of the first CSI report in the fourth segment time domain will no longer be evaluated for whether the first condition is met. If the first symbol (the 11th symbol) of the first CSI report in the third segment time domain does not meet the first condition, then the first symbol (the 16th symbol) of the first CSI report in the fourth segment time domain will no longer be evaluated for whether the first condition is met.

[0195] In the above embodiments, when the first symbol of the first CSI report in the k-th segment time domain does not meet the first condition, the judgment process is terminated in advance. The first symbol of the first CSI report in the k+1-th segment time domain to the k-th segment time domain is no longer judged to meet the first condition, avoiding unnecessary judgment operations. This is beneficial to quickly and accurately determine the processing method of the first CSI report while saving the processing resources required by the above unnecessary judgment operations.

[0196] In some embodiments, if the first symbol of the first CSI report in the k-th segment time domain satisfies the first condition, the first CSI report occupies PU in the k-th segment time domain; where k∈{1,2,…,K}.

[0197] Understandably, if the first symbol of the first CSI report in the k-th segment time domain satisfies the first condition, it means that the first CSI report meets the condition of occupying a PU in the k-th segment time domain, and therefore the first CSI report occupies a PU in the k-th segment time domain. In specific implementation, the terminal can allocate a PU in the k-th segment time domain to the first CSI report, so that the first CSI report can occupy a PU in the k-th segment time domain and complete the relevant CSI calculation through the PU occupied in the k-th segment time domain.

[0198] For example, referring to Figure 11, if the first CSI report satisfies the first condition at the first symbol (sixth symbol) of the second segment time domain, then the first CSI report can occupy the PU in the second segment time domain, that is, the first CSI report can occupy the PU from the sixth symbol to the eighth symbol. If the first CSI report satisfies the first condition at the first symbol (sixteenth symbol) of the fourth segment time domain, then the first CSI report can occupy the PU in the fourth segment time domain, that is, the first CSI report can occupy the PU from the sixteenth symbol to the twentyth symbol.

[0199] For example, if the first symbol of the first CSI report in the k-th segment time domain does not satisfy the first condition, it means that the first CSI report does not meet the condition of occupying PU in the k-th segment time domain, and therefore the first CSI report does not occupy PU in the k-th segment time domain. For example, referring to Figure 11, if the first symbol of the first CSI report in the 3rd segment time domain (the 11th symbol) does not satisfy the first condition, then the first CSI report cannot occupy PU in the 3rd segment time domain, that is, the first CSI report does not occupy PU from the 11th symbol to the 13th symbol.

[0200] In the above embodiments, when the first symbol of the first CSI report in the k-th segment time domain satisfies the first condition, it indicates that the first CSI report can currently occupy PU in the k-th segment time domain. However, this does not mean that the first CSI report can continuously occupy PU in the subsequent (k+1)-th to k-th segment time domains; it is still necessary to judge each subsequent segment time domain individually. Therefore, the above embodiments realize the dynamic allocation of PU resources based on whether the first symbol of the first CSI report in each segment time domain satisfies the first condition, ensuring that the PU is effectively occupied only when the first CSI report satisfies the first condition. This improves the flexibility and accuracy of PU resource allocation and avoids the problem of PU occupation conflicts between the first CSI report and other CSI reports.

[0201] In some embodiments, if the first symbol in each of the K segmented time domains of the first CSI report satisfies the first condition, the first CSI report is processed by updating the first CSI report.

[0202] In this case, the first CSI report satisfies the first condition at the first symbol of each segment time domain in the K segment time domains. That is, the first CSI report satisfies the first condition at the first symbol of each segment time domain, indicating that the first CSI report can occupy the PU in each segment time domain. Therefore, the terminal determines that the processing method of the first CSI report is to update the first CSI report.

[0203] For example, referring to Figure 11, if the first symbol (the first symbol) of the first CSI report in the first segment time domain satisfies the first condition, the first symbol (the sixth symbol) of the first CSI report in the second segment time domain satisfies the first condition, the first symbol (the eleventh symbol) of the first CSI report in the third segment time domain satisfies the first condition, and the first symbol (the sixteenth symbol) of the first CSI report in the fourth segment time domain also satisfies the first condition, then the processing method for the first CSI report is to update the first CSI report.

[0204] In the above embodiments, the first CSI report is only allowed to be updated when the first symbol of the first CSI report in each of the K segment time domains meets the first condition. This ensures that the first CSI report can reliably occupy the PU in each segment time domain. Using the PU occupied in each segment time domain for CSI calculation helps to improve the accuracy of the updated first CSI report.

[0205] In the embodiments described above, for a first CSI report occupying PU in K segmented time domains, if the first symbol of the first CSI report in any of the K segmented time domains does not satisfy the first condition, the first CSI report will not be updated, thereby avoiding PU occupation conflicts between different CSI reports. To further avoid wasting the PU resources already occupied by the first CSI report while avoiding PU occupation conflicts, this application embodiment also provides another method to determine the processing mode of the first CSI report, which is described in detail below:

[0206] In some embodiments, determining the processing method of the first CSI report based on whether the first symbol in at least one segmented time domain satisfies the first condition includes: determining the processing method of the first CSI report based on the number of times the first symbol in at least one segmented time domain does not satisfy the first condition. The number of times refers to the number of segmented time domains in which the first symbol in the first CSI report does not satisfy the first condition.

[0207] It is understandable that when K is greater than 1, the number of times the first symbol in the first segment time domain of the first CSI report does not meet the first condition may be multiple. For example, the first symbol in the second segment time domain of the first CSI report does not meet the first condition, and the first symbol in the third segment time domain of the first CSI report also does not meet the first condition. In this case, the number of times the first condition is not met is 2.

[0208] Optionally, the terminal can determine the processing method of the first CSI report based on whether the number of times the first symbol in multiple segment time domains fails to meet the first condition is greater than a first threshold.

[0209] Optionally, the first threshold can be configured or predefined by the network. For example, the first threshold can be 1, 2 or 3. This application embodiment does not specifically limit the value of the first threshold.

[0210] In some embodiments, in the first to the (K-1)th segment time domains, if the number of times the first CSI report fails to meet the first condition is greater than or equal to the first threshold, the first CSI report is processed by not updating the first CSI report.

[0211] Optionally, the terminal can sequentially determine whether the first symbol of the first CSI report in each segment time domain, from the first segment time domain to the (K-1)th segment time domain, satisfies the first condition. If the first symbol of the first CSI report in the k ∈ {1,2,…,K-1} segment time domain does not satisfy the first condition, and the number of times the first condition is not satisfied up to the kth segment time domain is greater than or equal to the first threshold, the processing method for the first CSI report is determined to be not to update the first CSI report.

[0212] For example, if the first threshold is set to 2 (refer to Figure 11), and K = 4, then from the first segment time domain to the (4-1)th segment time domain, it is sequentially determined whether the first symbol of the first CSI report in each segment time domain satisfies the first condition. If the first symbol (the first symbol) of the first CSI report in the first segment time domain satisfies the first condition, then the first CSI report occupies the PU in the first segment time domain, and then it continues to determine whether the first symbol of the first CSI report in the second segment time domain satisfies the first condition. If the first symbol (the sixth symbol) of the first CSI report in the second segment time domain does not satisfy the first condition, since the number of times the first condition is not satisfied is 1, and the first threshold has not yet been reached, the terminal will not directly decide not to update the first CSI report, but will continue to determine whether the first symbol (the eleventh symbol) of the first CSI report in the third segment time domain satisfies the first condition. If the first CSI report does not meet the first condition in the first symbol (11th symbol) of the third segment time domain, since the number of times the first condition is not met is 2 up to the third segment time domain, which has reached the above-mentioned first threshold, the terminal can determine that the processing method for the first CSI report is not to update the first CSI report.

[0213] In this embodiment, by setting a first threshold, the first CSI report is allowed to fail to meet a first condition in certain segment time domains. Only when the number of times the first CSI report fails to meet the first condition in the first to (K-1)th segment time domains is greater than or equal to the first threshold is it decided not to update the first CSI report. This approach avoids prematurely deciding not to update the first CSI report due to the first symbol failing to meet the first condition in a single segment time domain, thereby reducing the waste of PU resources already occupied by the first CSI report.

[0214] In some embodiments, if the number of times the first CSI report fails to meet the first condition in the first segment time domain to the i-th segment time domain is greater than or equal to the first threshold, the first symbol of the first CSI report in the (i+1)-th segment time domain to the K-th segment time domain will no longer be judged to meet the first condition; wherein, the first symbol of the first CSI report in the i-th segment time domain fails to meet the first condition, i is less than K.

[0215] Understandably, if the first symbol of the first CSI report in the i-th segment time domain does not meet the first condition, and the number of times the first condition is not met in the 1st to the i-th segment time domain is greater than or equal to the first threshold, it can be determined that the processing method for the first CSI report is not to update the first CSI report. If i is less than K, it means that there are other segment time domains after the i-th segment time domain. In this case, the judgment process is terminated in advance, and the first symbol of the first CSI report in the segment time domains after the i-th segment time domain is no longer judged to meet the first condition.

[0216] Optionally, the terminal can sequentially determine whether the first symbol of the first CSI report in each segment time domain, from the first segment time domain to the Kth segment time domain, satisfies the first condition. If the first symbol of the first CSI report in the i-th segment time domain does not satisfy the first condition, and the number of times the first CSI report fails to satisfy the first condition up to the i-th segment time domain is greater than or equal to the first threshold, then the terminal will no longer determine whether the first symbol of the first CSI report in the (i+1)-th segment time domain to the Kth segment time domain satisfies the first condition.

[0217] For example, the first threshold is set to 2. Referring to Figure 11, if the first symbol (the first symbol) of the first CSI report in the first segment time domain meets the first condition, the first symbol (the sixth symbol) of the first CSI report in the second segment time domain does not meet the first condition, and the first symbol (the eleventh symbol) of the first CSI report in the third segment time domain does not meet the first condition, since the number of times the first condition is not met up to the third segment time domain is 2, which has reached the above-mentioned first threshold, then the first symbol of the first CSI report in the fourth segment time domain will no longer be judged as meeting the first condition.

[0218] In this embodiment, when the number of times the first CSI report fails to meet the first condition in the first segment time domain to the i-th (i < K) segment time domain is greater than or equal to the first threshold, it can be determined that the processing method for the first CSI report is not to update the first CSI report, and there are other segment time domains after the i-th segment time domain. In this case, the judgment process is terminated in advance, and the first symbol of the first CSI report in the (i+1)-th segment time domain to the K-th segment time domain is no longer judged to meet the first condition, avoiding unnecessary judgment operations. This is beneficial for quickly and accurately determining the processing method of the first CSI report while saving the processing resources required by the aforementioned unnecessary judgment operations.

[0219] In some embodiments, the first CSI report fails to meet the first condition at least once in the K segment time domains, and at least once includes the case where the first symbol of the first CSI report in the K segment time domain fails to meet the first condition. In such cases, the first CSI report is not updated.

[0220] It is understandable that the Kth segment time domain is the last of the K segment time domains. In the Kth segment time domain, the PU needs to perform UCI encoding and / or AI inference. Therefore, the first symbol of the first CSI report in the last segment time domain satisfying the first condition is a necessary condition for updating the first CSI report. Based on this, if the first symbol of the first CSI report in the Kth segment time domain does not satisfy the first condition, the terminal can determine not to update the first CSI report.

[0221] In one possible scenario, the first CSI report failing to meet the first condition at least once across the K segmented time domains could mean either the first CSI report fails to meet the first condition at the first symbol of any segmented time domain from the 1st to the (K-1)th segmented time domain, or it could mean the first CSI report fails to meet the first condition at the first symbol of the Kth segmented time domain. Even if the first CSI report meets the first condition at the first symbols of all segments from the 1st to the (K-1)th segmented time domains, if the first CSI report fails to meet the first condition at the first symbol of the Kth segmented time domain, the terminal will still determine not to update the first CSI report.

[0222] For example, if the first threshold is set to 2 (refer to Figure 11) and K = 4, if the first CSI report does not meet the first condition at the first symbol in the second segment time domain, but meets the first condition at the first symbol in the first and third segment time domains, but does not meet the first condition at the first symbol in the fourth segment time domain, then it can be determined that the number of times the first CSI report does not meet the first condition (1 time) from the first to the third segment time domain is less than the first threshold. However, since the first CSI report does not meet the first condition at the first symbol in the last segment time domain, i.e., the fourth segment time domain, the terminal can determine that the first CSI report should not be updated.

[0223] This embodiment avoids focusing solely on the number of times the first condition is not met to determine whether to update the first CSI report, while ignoring the actual state of the first CSI report in the Kth segment time domain, thus preventing the problem of incorrect updates to the first CSI report. In other words, when deciding whether to update the first CSI report based on the number of times it fails to meet the first condition, this embodiment also specifically checks whether the first symbol of the first CSI report in the Kth segment time domain meets the first condition. This ensures that at critical moments when the PU needs to perform UCI encoding and / or AI inference, the first CSI report update will not fail due to resource conflicts.

[0224] In some embodiments, if the number of times the first CSI report fails to meet the first condition in the first segment time domain to the (K-1)th segment time domain is less than the first threshold, and the first symbol of the first CSI report in the Kth segment time domain meets the first condition, the processing method of the first CSI report is to update the first CSI report.

[0225] Understandably, if the number of times the first CSI report fails to meet the first condition in the first to the (K-1)th time segment is less than the first threshold, it indicates that although there may be a few instances where the first CSI report fails to meet the first condition, the number of such instances is within the allowable range. Simultaneously, if the first symbol of the first CSI report meets the first condition in the Kth time segment, it indicates that the necessary UCI encoding and / or AI inference for updating the first CSI report can proceed normally. Therefore, in this case, the terminal can determine that the processing method for the first CSI report is to update the first CSI report.

[0226] For example, if the first threshold is set to 2 (refer to Figure 11), and K = 4, and the number of times the first CSI report fails to meet the first condition in the four time segments includes one instance—specifically, the first CSI report fails to meet the first condition in the third time segment, while the first symbol of the first CSI report meets the first condition in the other three time segments—then the number of times the first CSI report fails to meet the first condition in the first to third time segment segments is less than the first threshold. Furthermore, since the first symbol of the first CSI report meets the first condition in the fourth time segment segment, the terminal can determine to update the first CSI report. It is understandable that since the first symbol of the first CSI report satisfies the first condition in both the first and second time segments, the first CSI report has already occupied PU resources in both time segments. If, at this point, the first CSI report is not updated simply because its first symbol in the third time segment does not satisfy the first condition, the PU resources already occupied by the first CSI report in the first and second time segments will be wasted. Therefore, in this embodiment, the first CSI report is not updated simply because its first symbol in the third time segment does not satisfy the first condition, thus reducing the waste of PU resources already occupied by the first CSI report.

[0227] In the above embodiment, if the number of times the first condition is not met in the first segment time domain to the (K-1)th segment time domain is less than the first threshold, and the first symbol of the first CSI report in the Kth segment time domain meets the first condition, the first CSI report is updated. This avoids prematurely deciding not to update the first CSI report because the first symbol of the first CSI report does not meet the first condition in some segment time domains, thus reducing the waste of PU resources already occupied by the first CSI report. It also ensures that the key operations necessary for updating the first CSI report (such as UCI encoding and / or AI inference) can be performed normally.

[0228] In the embodiments described above, both method 1 (if the first CSI report does not satisfy the first condition in any of the K segmented time domains, then the first CSI report is not updated) and method 2 (determining whether to update the first CSI report based on the number of times the first CSI report does not satisfy the first condition in the K segmented time domains) involve determining whether the first CSI report satisfies the first condition in the first symbol. The following will specifically describe the methods for determining whether the first symbol of the first CSI report satisfies the first condition in at least one segmented time domain:

[0229] In some embodiments, the first CSI report is one of N CSI reports, and the first symbol of the k-th segment time domain of the first CSI report is the same as the first symbol of any segment time domain of the N-1 CSI reports, k∈{1,2,…,K}; if the priority of the first CSI report is among the top M of the N CSI reports, the first symbol of the first CSI report in the k-th segment time domain satisfies a first condition; where 0≤M≤N, and M is the number of segments that satisfy the condition. The maximum value that is true, N PU L represents the total number of PUs that the terminal device can use to process CSI reports, and L represents the number of PUs that are already occupied in the first symbol. This refers to the number of PUs required by CSI report n in the k-th segment time domain, where n∈{0,1,…,N-1}. The number of PUs required by CSI report n in the k-th segment time domain can also be described as: the number of PUs required by CSI report n in the k-th segment time domain.

[0230] It is understandable that when the first symbol of the k-th segment time field of the first CSI report is the same as the first symbol of any segment time field in the remaining N-1 CSI reports, it indicates that these N CSI reports are preparing to occupy N segments at the same symbol. PU -L unoccupied PUs. Since the number of unoccupied PUs is limited at this time, the limited PUs will be allocated to the top M priority CSI reports to ensure that the top M priority CSI reports can occupy PUs in the corresponding time domain. That is, the top M priority CSI reports will get PU resources first, thereby improving the success rate of critical task processing.

[0231] Each of the N CSI reports can have its own priority. The priority of CSI reports n = 0, 1, ..., N-1 is from high to low, and the CSI report with the highest priority is called CSI report 0. The terminal can determine the priority of each of the N CSI reports according to the preset priority rules.

[0232] Optionally, determining the priority of each CSI report among N CSI reports according to preset priority rules can be understood as: calculating the priority value of each CSI report, determining the priority of each CSI report among N CSI reports based on the priority value of each CSI report, and the CSI report with the smaller the priority value has the higher priority.

[0233] Optionally, the priority of each CSI report among the N CSI reports is determined based on at least one of the serving carrier index, the type of the CSI report, and the report configuration identifier of the CSI report. Specifically, the priority value of the CSI report can be calculated first based on the serving carrier index, the type of the CSI report, and the report configuration identifier of the CSI report, and then the priority of the CSI report can be determined according to the priority value.

[0234] Optionally, the priority value of the CSI report is calculated using the following formula: Pri iCSI (y,k,c,s)=2·N cells ·M s ·y+N cells ·M s ·k+M s ·c+s

[0235] y is the CSI report type indicator value, where y takes different values ​​depending on the type of CSI report; for non-periodic CSI reports carried by PUSCH, y = 0; for semi-persistent CSI reports carried by PUSCH, y = 1; for semi-persistent CSI reports carried by PUCCH, y = 2; for periodic CSI reports carried by PUCCH, y = 3.

[0236] Regarding the value of k in the priority value calculation formula, if the CSI report carries L1-RSRP or L1-SINR, then k = 0; otherwise, k = 1.

[0237] In the priority value calculation formula, c is the serving carrier index (indicating the carrier index in carrier aggregation), N cells `c` is the maximum value of `c`, configured by the higher-level parameter `maxNrofServingCells`. For a CSI report configured by `LTM-CSI-ReportConfig`, `c` is the configured serving carrier index. `s` is the report configuration identifier `reportConfigID`. s This is the maximum configurable number of CSI reports, configured by the parameter maxNrofCSI-ReportConfigurations.

[0238] For a CSI report configured by LTM-CSI-ReportConfig, s is LTM-CSI-reportConfigID, M sThis is the maximum configurable number of LTM-CSI reports, configured by the parameter maxNrofLTM-CSI-ReportConfigurations.

[0239] If the priority value associated with the first CSI report (Pri) iCSI If the priority value (y,k,c,s) is smaller than the priority value associated with the second CSI report, then the first CSI report is said to have a higher priority (i.e., the smaller the priority value, the higher the priority).

[0240] CSI reports configured by LTM-CSI-ReportConfig have a higher priority than CSI reports configured by CSI-ReportConfig, as indicated by the priority value Pri. iCSI (y,k,c,s) are irrelevant.

[0241] As can be seen from the above formula for calculating priority values:

[0242] Regarding the time-domain characteristics of CSI reports, the priority of CSI reports with different time-domain characteristics, from highest to lowest, is as follows: aperiodic CSI reports, PUSCH semi-persistent CSI reports, PUCCH semi-persistent CSI reports, and periodic CSI reports. Because aperiodic CSI reports have an on-demand triggering characteristic, triggered by network devices according to demand, aperiodic CSI reports have the highest priority among CSI reports with different time-domain characteristics.

[0243] If a CSI report carries RSRP or SINR, it indicates that it is used for beam management. If the beam selection is inappropriate, there may be a risk of link disconnection. Therefore, CSI reports carrying RSRP and SINR should have a higher priority than CSI reports without RSRP and SINR.

[0244] LTM (Layer 1 / Layer 2 Triggered Mobility) involves cell handover and mobility management, and is a critical process for ensuring continuous user communication. Therefore, the CSI report configured by LTM-CSI-ReportConfig should have the highest priority.

[0245] For the first CSI report occupying the PU in K segment time domains, the first symbol of its k-th segment time domain is the same as the first symbol of any segment time domain of the other N-1 CSI reports. That is, N CSI reports are preparing to start occupying N on the same symbol. PU-L unused PUs. For N CSI reports, calculate the priority value of each CSI report using the priority value calculation formula described above. Based on the priority value of each CSI report, sort the N CSI reports in descending order of priority. If the first CSI report ranks in the top M positions among the N CSI reports, then the first symbol of the first CSI report in the k-th segment time domain satisfies the first condition, and the first CSI report can occupy a PU in the k-th segment time domain. If the first CSI report does not rank in the top M positions among the N CSI reports, but rather in the bottom NM positions, then the first symbol of the first CSI report in the k-th segment time domain does not satisfy the first condition, and the first CSI report cannot occupy a PU in the k-th segment time domain. M represents the number of N CSI reports that can occupy a PU. PU -L is the maximum number of CSI reports for each PU.

[0246] Figure 12 is a schematic diagram of multiple CSI reports occupying PU provided in an embodiment of this application.

[0247] For example, as shown in Figure 12, CSI report 4 occupies PU in three segments, CSI report 5 occupies PU in one segment, and CSI report 6 occupies PU in two segments. It should be noted that the "4", "5", and "6" in CSI report 4, CSI report 5, and CSI report 6 in Figure 12 are only used to distinguish different CSI reports and are not related to the priority of the CSI reports themselves.

[0248] The first symbol in the first segment time domain, the first symbol in the second segment time domain, and the first symbol in the third segment time domain of CSI Report 4 during PU occupancy can be referred to as: the first PU occupancy start point of CSI Report 4 (illustratively shown as the first symbol on the time axis in the figure), the second PU occupancy start point (illustratively shown as the seventh symbol on the time axis in the figure), and the third PU occupancy start point (illustratively shown as the thirteenth symbol on the time axis in the figure).

[0249] CSI Report 5 occupies a PU in segments. The first symbol during the PU occupancy period of CSI Report 5 is called: the first PU occupancy start point of CSI Report 5 (illustratively shown as the first symbol on the timeline in the figure).

[0250] The first symbol in the first segment of the time domain and the first symbol in the second segment of the time domain during the PU occupancy period in CSI Report 6 can be referred to as: the first PU occupancy start point of CSI Report 6 (illustratively shown as the 6th symbol on the time axis in the figure) and the second PU occupancy start point (illustratively shown as the 13th symbol on the time axis in the figure).

[0251] For CSI report 4, the condition is checked at the 1st, 7th, and 13th symbols to determine if CSI report 4 meets the first condition. For CSI report 5, the condition is checked only at the 1st symbol. For CSI report 6, the condition is checked at the 6th and 13th symbols to determine if CSI report 6 meets the first condition.

[0252] The starting point for the first PU occupancy of CSI Report 4 and CSI Report 5 is the same, both being the first symbol. At this point, there are two CSI reports ready to start occupying the PU at the first symbol, meaning N=2 at the first symbol. When determining whether CSI Report 4 meets the first condition at the first PU occupancy starting point, it is determined whether the priority of CSI Report 4 is among the top M positions in both CSI Report 4 and CSI Report 5. If the priority of CSI Report 4 is among the top M positions, then CSI Report 4 is determined to meet the first condition at the first PU occupancy starting point. When determining whether CSI Report 5 meets the first condition at the first PU occupancy starting point, it is determined whether the priority of CSI Report 5 is among the top M positions in both CSI Report 4 and CSI Report 5. If the priority of CSI Report 5 is among the top M positions, then CSI Report 5 is determined to meet the first condition at the first PU occupancy starting point.

[0253] The second PU occupancy starting point of CSI report 4 is the 7th symbol. As shown in Figure 12, only CSI report 4 starts occupying the PU from the 7th symbol. At this point, there is one CSI report ready to start occupying the PU at the 7th symbol, meaning N=1 at the 7th symbol. If M equals 1, then CSI report 4 can be considered to have satisfied the first condition at the second PU occupancy starting point. However, if M equals 0, it means there are not enough PUs available for CSI report 4 to occupy, thus determining that CSI report 4 does not satisfy the first condition at the second PU occupancy starting point.

[0254] The starting point for the third PU occupancy of CSI report 4 and the starting point for the second PU occupancy of CSI report 6 are the same, both being the 13th symbol. At this point, at the 13th symbol, there are two CSI reports preparing to start occupying the PU, meaning N=2 at the 13th symbol. When determining whether CSI report 4 meets the first condition at the third PU occupancy starting point, it is determined whether the priority of CSI report 4 is among the top M positions in both CSI reports 4 and 6. If the priority of CSI report 4 is among the top M positions, then CSI report 4 is determined to meet the first condition at the third PU occupancy starting point. When determining whether CSI report 6 meets the first condition at the second PU occupancy starting point, it is determined whether the priority of CSI report 6 is among the top M positions in both CSI reports 4 and 6. If the priority of CSI report 6 is among the top M positions, then CSI report 6 is determined to meet the first condition at the second PU occupancy starting point.

[0255] In the above embodiment, if the priority of the first CSI report is among the top M of the N CSI reports, the first symbol in the k-th segment time domain is considered to meet the first condition, that is, the first CSI report can occupy the PU in the k-th segment time domain. The priority mechanism realizes the reasonable allocation of PU resources and effectively avoids the conflict problem caused by N CSI reports preparing to occupy the PU in the same symbol.

[0256] In some embodiments, if the k-th segment time domain of the first CSI report is not the 1st segment time domain, the priority of the first CSI report among the N CSI reports is increased according to a preset rule.

[0257] Understandably, when determining whether the first symbol of the first CSI report in the k-th segment time domain satisfies the first condition, if the k-th segment time domain is not the 1st segment time domain, it means that the first CSI report has not occupied the PU for the first time, that is, the first CSI report has occupied the PU in at least one segment time domain. At this time, the priority of the first CSI report in the N CSI reports is increased according to the preset rules, so as to increase the probability that the priority of the first CSI report is in the top M positions of the N CSI reports. This also increases the probability that the first symbol of the first CSI report in the k-th segment time domain satisfies the first condition, which in turn helps to increase the probability of updating the first CSI report, so as to minimize the waste of PU resources already occupied by the first CSI report.

[0258] The aforementioned preset rule can be understood as a rule to increase priority. The purpose of setting this preset rule is to process the first CSI report that has already occupied the PU as much as possible. This "processing as much as possible" can be understood as completing the update as much as possible.

[0259] In some embodiments, a preset rule can be set with the distinction between first-time occupancy and non-first-time occupancy as the granularity. This preset rule may include: the priority of the first CSI report is higher than the priority of the second CSI report among N CSI reports, regardless of the priority value; wherein, the first symbol of the first segment time domain of the second CSI report is the same as the first symbol of the k-th segment time domain of the first CSI report. That is, the first symbol of the first segment time domain of the second CSI report and the first symbol of the k-th segment time domain of the first CSI report represent the same occupancy time.

[0260] It is understandable that the first symbol of the first segment time domain of the second CSI report is the same as the first symbol of the k-th segment time domain of the first CSI report. This indicates that both the second and first CSI reports are preparing to start occupying the PU at the same symbol, but the first CSI report is not starting to occupy the PU for the first time, while the second CSI report is starting to occupy the PU for the first time. The second CSI report can be understood as a set of CSI reports, which includes all CSI reports that are starting to occupy the PU for the first time. At this time, regardless of the relationship between the priority values ​​of the first and second CSI reports, the priority of the first CSI report is set to be higher than that of the second CSI report. This makes it more likely that the priority of the first CSI report will be among the top M positions in the N CSI reports, thereby increasing the probability that the first CSI report can occupy the PU first and reducing the waste of PU resources already occupied by the first CSI report.

[0261] Among the N CSI reports, there may be CSI reports that are not the first to occupy a PU, and there may be CSI reports that are the first to occupy a PU. The number of CSI reports that are not the first to occupy a PU may be multiple, and the number of CSI reports that are the first to occupy a PU may also be multiple. Overall, CSI reports that are not the first to occupy a PU have a higher priority than CSI reports that are the first to occupy a PU. For multiple CSI reports that are not the first to occupy a PU, their priority can still be determined based on a priority value. Similarly, for multiple CSI reports that are the first to occupy a PU, their priority can also be determined based on a priority value. This priority value can be calculated using the priority value calculation formula described above.

[0262] For example, when determining whether the first symbol of the first CSI report in the second segment time domain meets the first condition, if the other N-1 CSI reports are all CSI reports that have started occupying the PU for the first time, then even if the priority value of the first CSI report is not the smallest among the N CSI reports, the priority of the first CSI report can be set to the highest priority among the N CSI reports, so that the priority of the first CSI report is in the top M positions among the N CSI reports, so that the first CSI report can occupy the PU first, reducing the waste of the already occupied PU resources.

[0263] For example, when determining whether the first CSI report (denoted as CSI report a1) satisfies the first condition in the first symbol of the second segment time domain, the other N-1 CSI reports include CSI report a2, CSI report a3, and CSI report a4. CSI report a2 and CSI report a3 are both CSI reports that have started occupying the PU for the first time, while CSI report a4 is also a CSI report that has not started occupying the PU for the first time. In this case, the priority of CSI report a1 and CSI report a4 is higher than that of CSI report a2 and CSI report a3, regardless of the priority value. The priority between CSI report a1 and CSI report a4 is determined based on their respective priority values. If the priority value of CSI report a1 is less than that of CSI report a4, then CSI report a1 has a higher priority than CSI report a4; conversely, if the priority value of CSI report a1 is greater than that of CSI report a4, then CSI report a1 has a lower priority than CSI report a4. The priority of CSI reports a2 and a3 is also determined based on their respective priority values. If the priority value of CSI report a2 is less than that of CSI report a3, then CSI report a2 has a higher priority than CSI report a3; conversely, if the priority value of CSI report a2 is greater than that of CSI report a3, then CSI report a2 has a lower priority than CSI report a3. For example, in one possible scenario, the priority value of CSI report a1 is greater than that of CSI report a4, and the priority value of CSI report a2 is less than that of CSI report a3. In this case, the priorities of the four CSI reports from highest to lowest would be: CSI report a4, CSI report a1, CSI report a2, and CSI report a3.

[0264] In the above embodiment, the first CSI report is not the first CSI report to occupy the PU, while the second CSI report is the first CSI report to occupy the PU. In this case, regardless of the relationship between the priority values ​​of the first CSI report and the second CSI report, the priority of the first CSI report is higher than that of the second CSI report. This makes it more likely that the priority of the first CSI report will be in the top M positions among the N CSI reports, thereby increasing the possibility that the first CSI report can occupy the PU first and reducing the waste of PU resources already occupied by the first CSI report.

[0265] In some embodiments, a preset rule can be set with the number of occupied segmented time domains as the distinguishing granularity. The preset rule may include: the priority of the first CSI report is higher than the priority of the third CSI report among N CSI reports, regardless of the priority value; wherein, the number of segmented time domains occupied by the first CSI report is greater than the number of segmented time domains occupied by the third CSI report.

[0266] In one possible implementation, when determining whether the first symbol of the first CSI report in the k-th segment time domain satisfies the first condition, it can be concluded that the first CSI report has likely occupied k-1 segment time domains. Therefore, in this embodiment, CSI reports with less than k-1 occupied segment time domains are referred to as third CSI reports. The third CSI report can be understood as a set of CSI reports, which includes all CSI reports with less than k-1 occupied segment time domains.

[0267] Understandably, although N CSI reports are all preparing to occupy the PU at the same symbol, the number of segment time domains already occupied by different CSI reports may differ. Some CSI reports may have occupied 1 segment time domain, while others may have occupied 2. For example, referring to Figure 12, both CSI reports 4 and 6 begin occupying the PU at the 13th symbol, but CSI report 4 has occupied 2 segment time domains, while CSI report 6 has occupied 1. In this case, regardless of the priority value relationship between CSI report 4 and CSI report 6, the priority of CSI report 4 can be set to be higher than that of CSI report 6.

[0268] For example, when determining whether the first symbol of the first CSI report in the k-th segment time domain satisfies the first condition, it indicates that the first CSI report has occupied k-1 segment time domains. If among N-1 CSI reports, there is a CSI report (denoted as CSI report 7) that occupies the PU starting from the first symbol in the x-th segment time domain, it indicates that this CSI report may have occupied x-1 segment time domains. If k > x, then the priority of the first CSI report is set higher than the priority of CSI report 7. There may also be cases where the number of segment time domains occupied by N CSI reports is the same. For multiple CSI reports with the same number of occupied segment time domains, the priority order of the multiple CSI reports can be determined based on the priority value.

[0269] For example, when determining whether the first symbol of the first CSI report (denoted as CSI report b1) in the 5th segment time domain satisfies the first condition, the other N-1 CSI reports include CSI report b2, CSI report b3, and CSI report b4. The first symbol of the 3rd segment time domain of CSI report b2 and CSI report b3 is the same as the first symbol of the 5th segment time domain of CSI report b1. The first symbol of the 5th segment time domain of CSI report b4 is the same as the first symbol of the 5th segment time domain of CSI report b1. The number of segment time domains occupied by CSI report b1, CSI report b2, CSI report b3, and CSI report b4 are 4, 2, 2, and 4, respectively. In this case, the priority of CSI report b1 and CSI report b4 is higher than that of CSI report b2 and CSI report b3, regardless of the priority value. The priority of CSI report b1 and CSI report b4 is determined based on their respective priority values. If the priority value of CSI report b1 is less than that of CSI report b4, then CSI report b1 has a higher priority than CSI report b4; conversely, if the priority value of CSI report b1 is greater than that of CSI report b4, then CSI report b1 has a lower priority than CSI report b4. The priority of CSI report b2 and CSI report b3 is also determined based on their respective priority values. For example, in one possible scenario, the priority value of CSI report b1 is greater than that of CSI report b4, and the priority value of CSI report b2 is less than that of CSI report b3. Therefore, the priorities of these four CSI reports, from highest to lowest, are: CSI report b4, CSI report b1, CSI report b2, and CSI report b3.

[0270] In the above embodiments, the first CSI report has occupied more segmented time domains than the third CSI report. Regardless of the relationship between the priority values ​​of the first CSI report and the third CSI report, the priority of the first CSI report is higher than that of the third CSI report. This gives the first CSI report, which has occupied more segmented time domains, a higher priority, thereby reducing the waste of PU resources in the segmented time domains occupied by the first CSI report.

[0271] In some embodiments, for a first CSI report occupies PUs in K segmented time domains, the PUs include a first type of PU and / or a second type of PU. The first type of PU and the second type of PU are different types of PUs and can support different types of CSI calculations. For a first CSI report occupies PUs in K segmented time domains, it may occupy different types of PUs in different segmented time domains, or it may occupy the same type of PUs in different segmented time domains, or it may occupy different types of PUs in the same segmented time domain. This embodiment does not specifically limit this.

[0272] In some embodiments, the first type of PU is a CPU, and the second type of PU is an AL / ML PU (also known as an APU).

[0273] Understandably, if a CSI report consumes APU, it indicates that the CSI report is an AI-CSI report. However, an AI-CSI report may only consume APU, or it may also consume CPU. The following figures (13 to 15) illustrate several possible scenarios regarding AI-CSI report PU consumption:

[0274] Figure 13 is a schematic diagram of an AI-CSI report occupying PU provided in an embodiment of this application.

[0275] For example, as shown in Figure 13, the AI-CSI report occupies the PU in four segments, with the starting symbol of each segment's time domain being the first symbol of a reference signal set. For instance, the starting symbol of the first segment's time domain is the first symbol of reference signal set 1, the second segment's is the first symbol of reference signal set 2, the third segment's is the first symbol of reference signal set 3, and the fourth segment's is the first symbol of reference signal set 4. In the first to third segment time domains, the AI-CSI report occupies the CPU. In the fourth segment time domain, the AI-CSI report occupies both the CPU and the APU. In this example, the AI-CSI report first occupies the CPU, and then, starting from the first symbol of reference signal set 4, the AI-CSI report simultaneously occupies both the APU and the CPU.

[0276] In Figure 13, the AI-CSI report indicates that the CPU and APU are simultaneously occupied starting from the first symbol (i.e., the start symbol) in the fourth segment time domain. Therefore, when determining whether the first symbol in the fourth segment time domain satisfies the first condition, the first symbol in the fourth segment time domain can be determined for the CPU and APU respectively.

[0277] In one possible implementation, for an AI-CSI report that occupies the PU in K segment time domains, if the AI-CSI report needs to occupy both the APU and the CPU in the kth segment time domain, it can be determined whether the first symbol of the AI-CSI report in the kth segment time domain satisfies the first condition for both the CPU and the APU.

[0278] Optionally, when determining whether the first symbol of the AI-CSI report in the k-th segment time domain satisfies the first condition for CPU usage, the first symbol in the k-th segment time domain is called the k-th CPU occupancy start point. By determining whether the AI-CSI report satisfies the first condition at the k-th CPU occupancy start point, it is determined whether the AI-CSI report can occupy the CPU in the k-th segment time domain. For example, if the priority of the AI-CSI report is among the top M of N CSI reports, then it is determined that the AI-CSI report satisfies the first condition at the k-th CPU occupancy start point. Here, 0 ≤ M ≤ N, and M is the value that makes... The maximum value that is valid, where the letters in the formula all have CPU-related meanings. N specifically refers to the total number of CSI reports that are about to start occupying the CPU at the k-th CPU occupancy starting point. PU Specifically, L refers to the total number of CPUs that the terminal device can use to process CSI reports, and L specifically refers to the number of CPUs already occupied at the k-th CPU occupancy starting point. Specifically, it refers to the number of CPUs required by CSI report n in the k-th segment time domain, where n∈{0,1,…,N-1}.

[0279] Optionally, when determining whether the first symbol of the AI-CSI report in the k-th segment time domain satisfies the first condition for the APU, the first symbol in the k-th segment time domain is called the k-th APU occupancy start point. By determining whether the AI-CSI report satisfies the first condition at the k-th APU occupancy start point, it is determined whether the AI-CSI report can occupy the APU in the k-th segment time domain. For example, if the priority of the AI-CSI report is among the top M of N CSI reports, then it is determined that the AI-CSI report satisfies the first condition at the k-th APU occupancy start point. Here, 0 ≤ M ≤ N, and M is the value that makes... The maximum value that is valid, where the letters in the formula all have meanings related to the APU. N specifically refers to the total number of CSI reports that are preparing to start occupying the APU at the k-th APU occupancy starting point. PU Specifically, L refers to the total number of APUs that the terminal device can use to process CSI reports, and L specifically refers to the number of APUs that have been occupied at the k-th APU occupancy start point. Specifically, it refers to the number of APUs required by the CSI report in the k-th segment time domain, where n∈{0,1,…,N-1}.

[0280] Figure 14 is a schematic diagram of another AI-CSI report occupying PU provided in an embodiment of this application.

[0281] For example, as shown in Figure 14, the AI-CSI report occupies the PU in three segments. In the time domains from the first segment to the third segment, the PU occupied by the AI-CSI report includes the CPU. In the time domains of the first and second segments, the AI-CSI report only occupies the CPU. In the time domain of the third segment, the AI-CSI report occupies the APU starting from the first symbol combined with the fourth reference signal.

[0282] Figure 15 is a schematic diagram of another AI-CSI report occupying PU provided in the embodiments of this application.

[0283] For example, as shown in Figure 15, the AI-CSI report occupies PU in 4 segments. From the first segment to the fourth segment in the time domain, the AI-CSI report occupies APU.

[0284] It should be noted that Figures 13 to 15 only illustrate a few possible scenarios of AI-CSI reports occupying PU. In specific implementations, AI-CSI reports may also occupy PU in other ways. For example, AI-CSI reports may occupy both APU and CPU simultaneously in each segment time domain. Another example is that AI-CSI reports may occupy both APU and CPU simultaneously in the first and last segment time domains, and only occupy CPU in other segment time domains; however, this application embodiment does not specifically limit this.

[0285] In the embodiments described above, the dynamic occupation, or dynamic allocation, of PU resources by the first CSI report is achieved by determining whether the first CSI report meets the first condition at the start symbol of each segment time domain. This dynamic occupation can be understood as follows: the first CSI report can dynamically occupy the PU in that segment time domain only when the start symbol of the first CSI report meets the first condition in the k-th segment time domain; otherwise, it will relinquish its opportunity to occupy the PU in that segment time domain. In other words, in the above embodiments, PU resources are not pre-allocated, but rather, at the beginning of each segment time domain, a dynamic decision is made regarding whether to occupy them based on real-time conditions (such as PU availability, priority, channel status, etc.). This mechanism allows PU resources to be allocated on demand, improving flexibility and resource utilization. Furthermore, it avoids PU resource waste and PU occupation conflicts.

[0286] The following describes another CSI report processing method provided by an embodiment of this application. In this embodiment, the CSI report pre-occupies the PU, reserving the corresponding PU. This CSI report processing method can be applied to terminal 120 in the scenario shown in Figure 1. The CSI report processing method in this embodiment is described in detail below:

[0287] Figure 16 is a schematic flowchart of another CSI report processing method provided in an embodiment of this application.

[0288] For example, as shown in 16, the processing method for this CSI report includes:

[0289] S201: When the second symbols of N CSI reports are the same, determine the processing method of the N CSI reports based on the number of unoccupied PUs during the expected PU occupancy period of the N CSI reports; wherein, the second symbol is used to indicate the starting symbol of the CSI report.

[0290] Where N is an integer greater than or equal to 1. The fact that N CSI reports share the same second symbol indicates that these N CSI reports begin occupying the PU on the same symbol. Optionally, the second symbol used to indicate the starting symbol of a CSI report can be understood as: the first symbol when the CSI report begins occupying the PU, or the first symbol during the expected PU occupation period of the CSI report.

[0291] Optionally, the second symbol may include an OFDM symbol. For example, an OFDM symbol may be used as the second symbol.

[0292] It should be noted that the embodiments of this application only take OFDM symbol as the second symbol as an example. In specific implementation, the second symbol can also be SC-FDMA symbol. The embodiments of this application do not specifically limit the specific form of the second symbol.

[0293] For the N CSI reports in S201, each of these N CSI reports can be understood as a CSI report occupying PU in K segments, where K is greater than or equal to 1. For a CSI report occupying PU in K segments, the starting symbol of the CSI report refers to the starting symbol of the first segment in the time domain. For example, referring to Figure 11, for the CSI report occupying PU in 4 segments in Figure 11, the starting symbol of the CSI report is the first symbol on the time axis. Referring to Figure 12, for CSI report 6 occupying PU in 2 segments in Figure 12, the starting symbol of CSI report 6 is the sixth symbol on the time axis.

[0294] Optionally, for a CSI report, the expected CPU usage period can be understood as the time interval during which the CSI report is expected to occupy PU in order to update the CSI report. Expected PU usage refers to the time interval that is expected to be occupied but has not yet been actually occupied. When the CSI report is a CSI report with continuous PU usage, the time interval during which the CSI report is expected to occupy PU is a continuous time interval, which can also be called a continuous time domain. For example, referring to Figures 2 to 4, the CPU usage time in Figures 2 to 4 can all be understood as continuous time intervals. When the CSI report is a CSI report with discontinuous PU usage, the time interval during which the CSI report is expected to occupy PU is a segmented time interval, which can also be called a segmented time domain. For example, referring to Figure 11, the four segmented time domains in Figure 11 can be understood as segmented time intervals.

[0295] For a CSI report with K segments occupying PU, the expected PU occupation period of the CSI report includes K segment time domains. For example, referring to Figure 11, for the CSI report with 4 segments occupying PU in Figure 11, the expected PU occupation period of the CSI report includes the first segment time domain, the second segment time domain, the third segment time domain, and the fourth segment time domain. Referring to Figure 12, for CSI report 6 with 2 segments occupying PU in Figure 12, the expected PU occupation period of CSI report 6 includes the first segment time domain consisting of the 6th to 9th symbols on the time axis, and the second segment time domain consisting of the 13th to 16th symbols on the time axis.

[0296] For a single CSI report among N CSI reports, the number of unoccupied PUs during the expected PU occupancy period of that CSI report can be understood as the number of idle PUs. The number of idle PUs can include: the number of PUs not expected to be occupied and the number of PUs not actually occupied. Unoccupied PUs refer to PUs that are not expected to be occupied by other N-1 CSI reports during the expected PU occupancy period of that CSI report. Unoccupied PUs refer to PUs that are not actually occupied by other N-1 CSI reports during the expected PU occupancy period of that CSI report. "Expectedly occupied" means that PUs are not yet actually occupied in the current time unit but will be occupied by other N-1 CSI reports in the future. "Actually occupied" means that PUs have already been actually occupied by one or more of the N-1 CSI reports in the current time unit. The current time unit can be understood as the time unit represented by the starting symbol of the N CSI reports.

[0297] It is understandable that for a CSI report out of N CSI reports, the number of PUs required to occupy is known. The processing method for the CSI report can be determined by whether the number of unoccupied PUs during the expected PU occupation period of the CSI report is greater than the number of PUs required to occupy the CSI report.

[0298] In the above embodiments, both CSI reports that continuously occupy PUs and CSI reports that do not continuously occupy PUs have an expected PU occupation period. Considering the number of unoccupied PUs during the expected PU occupation period of each of the N CSI reports, it is beneficial to avoid conflicts when N CSI reports occupy PUs.

[0299] In some embodiments, if the number of unoccupied PUs during the expected PU occupancy period of the fourth CSI report is greater than or equal to a second threshold, the fourth CSI report is processed by updating the fourth CSI report. Here, the fourth CSI report is any one of N CSI reports, and the second threshold represents the number of PUs required for the fourth CSI report. This second threshold can be understood as: the number of PUs required for the fourth CSI report throughout its entire expected PU occupancy period.

[0300] In some embodiments, if the number of unoccupied PUs during the expected period of PU occupancy in the fourth CSI report is less than a second threshold, the fourth CSI report is not updated.

[0301] It is understandable that the fourth CSI report is any one of the N CSI reports, and the N CSI reports are all part of the N CSI reports. Therefore, the number of PUs required for the fourth CSI report can be expressed as follows: n refers to the index number of the fourth CSI report.

[0302] If the number of unoccupied PUs is greater than or equal to the number of PUs required during the expected PU occupancy period of the fourth CSI report, it indicates that there are sufficient PUs to support the update of the fourth CSI report during this period. Therefore, in this case, when updating the fourth CSI report, ensure that the update is performed when there are sufficient unoccupied PUs to avoid update failure due to insufficient unoccupied PUs.

[0303] If the number of unoccupied PUs is less than the number of PUs required for the fourth CSI report during its expected PU occupancy period, it indicates that there are not enough PUs to support the update of the fourth CSI report during this period. Therefore, in this case, not updating the fourth CSI report avoids update failure due to insufficient unoccupied PUs and prevents the fourth CSI report from attempting to occupy PUs already occupied by other CSI reports, thus effectively avoiding PU occupancy conflicts.

[0304] For example, referring to Figure 12, assume the fourth CSI report is CSI report 4. Figure 12 shows that the expected PU usage period for CSI report 4 includes: the first segment time domain consisting of symbols 1 to 3 on the time axis, the second segment time domain consisting of symbols 7 to 9, and the third segment time domain consisting of symbols 13 to 15. The number of PUs required for CSI report 4 is 1. If the number of unused PUs in each of the above-mentioned first, second, and third segment time domains is greater than or equal to 1, it indicates that there are sufficient PUs available for CSI report 4 to use throughout its entire expected PU usage period. In this case, the terminal can determine that the processing method for CSI report 4 is to update the fourth CSI report. If the number of unoccupied PUs is less than 1 in any of the first, second, and third time segments, it means that there are not enough PUs available for CSI report 4 to occupy during the entire expected PU occupation period. In this case, the terminal can determine that the processing method for CSI report 4 is not to update the fourth CSI report.

[0305] In some embodiments, if the number of unoccupied PUs during the expected PU occupancy period reported by the fourth CSI is greater than or equal to the second threshold, the fourth CSI reports the pre-occupancy of the second threshold of PUs.

[0306] Understandably, if the number of unoccupied PUs is greater than or equal to the number of PUs it requires during the expected PU occupancy period of the fourth CSI report, it indicates that there are a sufficient number of idle PUs during the expected PU occupancy period of the fourth CSI report. In this case, the fourth CSI report pre-occupies PUs up to the second threshold; that is, the terminal allocates the second threshold of PUs to the fourth CSI report at the start of the fourth CSI report. Therefore, as time progresses, the fourth CSI report can occupy the PUs it reserved at the corresponding marks.

[0307] Since the PU at the second threshold has already been pre-occupied by the fourth CSI report, it is considered an already occupied PU for the other N-1 CSI reports. Therefore, after the fourth CSI report pre-occupies the PU at the second threshold, the number of unoccupied PUs decreases. The terminal can then refresh the number of unoccupied PUs to accurately determine the processing method for the other N-1 CSI reports, effectively avoiding PU occupation conflicts between other CSI reports and the fourth CSI report.

[0308] In some embodiments, determining the processing method of N CSI reports based on the number of unoccupied PUs during the expected PU occupancy period of the N CSI reports includes: sequentially performing the following steps according to the priority of the N CSI reports from high to low: for the m-th CSI report, determining the processing method of the m-th CSI report based on the number of unoccupied PUs during the expected PU occupancy period of the m-th CSI report; where m∈{1,2…,N}.

[0309] Each of the N CSI reports has its own priority, which can be determined based on a preset priority rule. Optionally, the priority value of each CSI report can be calculated according to the formula for calculating the priority value of CSI reports mentioned above, and the M CSI reports can be arranged in descending order of priority based on their priority values. The smaller the priority value of a CSI report, the higher its priority.

[0310] In this embodiment, for N CSI reports, the following judgment is performed in order of priority from high to low: For the m-th CSI report ∈ {1,2,…,N}, it is determined whether there are enough PUs during the entire PU occupancy period of the m-th CSI report. If there are enough PUs, it is determined to update the m-th CSI report. If there are not enough PUs, it is determined not to update the m-th CSI report.

[0311] If the processing method determined for the m-th CSI report is to update the m-th CSI report, then the m-th CSI report pre-allocates its required number of PUs. The terminal then refreshes the number of unallocated PUs and sets m = m + 1 to continue determining the processing method for the next CSI report, until m = N. If the processing method determined for the m-th CSI report is not to update the m-th CSI report, then m = m + 1 to continue determining the processing method for the next CSI report, until m = N.

[0312] To facilitate understanding, the following example illustrates how to process two CSI reports with different priorities:

[0313] Figure 17 is a schematic diagram illustrating the principle of a processing method that determines two CSI reports in descending order of priority, according to an embodiment of this application.

[0314] As shown in Figure 17(a), both CSI Report 1 and CSI Report 2 begin occupying PU from the preparation of the 3rd symbol. The entire PU occupation period for CSI Report 1 and CSI Report 2 is the same, including the 3rd to 8th symbols and the 14th to 21st symbols. The number of PUs required for both CSI Report 1 and CSI Report 2 is 1.

[0315] It should be noted that the "1" and "2" in CSI Report 1 and CSI Report 2 shown in Figure 17(a) are only used to distinguish different CSI reports and have nothing to do with the priority of the CSI reports themselves.

[0316] As shown in Figure 17(b), the total number N of PUs that the terminal device can be used to process CSI reports is... PU =5. Before CSI Report 1 and CSI Report 2 have pre-allocated PUs, at the 3rd symbol, the number of occupied PUs is 2, and the number of unoccupied PUs is 3. At the 19th symbol, the number of occupied PUs is 4, and the number of unoccupied PUs is 1. Similarly, the number of occupied and unoccupied PUs at the remaining symbols can be obtained, and will not be repeated here to avoid repetition.

[0317] Assuming CSI Report 1 has a higher priority than CSI Report 2, the processing method for CSI Report 1 is determined first. Starting from the third symbol, referring to Figures 17(a) and (b), it can be seen that during the entire PU occupancy period of CSI Report 1, there is exactly one unoccupied PU. Since the number of PUs required for CSI Report 1 is also 1, the processing method for CSI Report 1 is determined to be updating it. CSI Report 1 pre-occupies one PU during its entire PU occupancy period. After CSI Report 1 pre-occupies one PU, the number of unoccupied PUs is refreshed. A diagram illustrating the number of occupied and unoccupied PUs for each symbol after CSI Report 1 pre-occupies one PU can be found in Figure 17(c). Figure 17(c) shows that during the period from the 17th to the 19th symbol, all 5 PUs are occupied, and the number of unoccupied PUs is 0.

[0318] For CSI report 2, starting from the third symbol, it can be seen from Figure 17(a) and (c) that there is insufficient PU during the 17th to 19th symbols of the entire PU occupancy period of CSI report 2. Therefore, the update method for CSI report 2 is determined to be not to update CSI report 2.

[0319] In the above embodiment, the processing method of the m-th CSI report is determined according to the number of unoccupied PUs during the expected PU occupation period of the m-th CSI report, based on the priority of the M CSI reports from high to low. This is beneficial for prioritizing the allocation of pre-occupied PUs to high-priority CSI reports and achieving priority updating of high-priority CSI reports among the M CSI reports.

[0320] In some embodiments, the PU in S201 includes a first type of PU and / or a second type of PU. Descriptions of the first type of PU and the second type of PU can be found in the relevant introductions above, and will not be repeated here to avoid repetition.

[0321] Optionally, the first type of PU is the CPU mentioned above, and the second type of PU is the AL / ML PU mentioned above.

[0322] In one possible implementation, the CSI report only occupies CPU, and the expected CPU occupancy period is specifically defined as the expected CPU occupancy period. In this case, the processing method for the CSI report can be determined based on the number of unoccupied CPUs during the expected CPU occupancy period. For example, if the number of unoccupied CPUs during the expected CPU occupancy period is greater than or equal to the number of CPUs required by the CSI report, then the processing method for the CSI report is determined to be updating the CSI report. In this case, the CSI report pre-occupies the required number of CPUs during its expected CPU occupancy period. If the number of unoccupied CPUs during the expected CPU occupancy period is less than the number of CPUs required by the CSI report, then the processing method for the CSI report is determined to be not updating the CSI report. In this case, the CSI report does not pre-occupy CPUs.

[0323] In one possible implementation, the CSI report only occupies APUs, and the expected APU occupancy period is specifically defined as the expected APU occupancy period. In this case, the processing method for the CSI report can be determined based on the number of unoccupied APUs during the expected APU occupancy period. For example, if the number of unoccupied APUs during the expected APU occupancy period is greater than or equal to the number of APUs required by the CSI report, then the processing method for the CSI report is determined to be updating the CSI report. In this case, the CSI report pre-occupies the required number of APUs during its expected APU occupancy period. If the number of unoccupied APUs during the expected APU occupancy period is less than the number of APUs required by the CSI report, then the processing method for the CSI report is determined to be not updating the CSI report. In this case, the CSI report does not pre-occupy APUs.

[0324] In one possible implementation, the PUs required for the CSI report include both CPUs and APUs. The expected PU occupancy period includes both an expected CPU occupancy period and an expected APU occupancy period. In this case, the processing method for the CSI report can be determined based on the number of unoccupied CPUs during the expected CPU occupancy period and the number of unoccupied APUs during the expected APU occupancy period. For example, if the number of unoccupied CPUs during the expected CPU occupancy period is greater than or equal to the number of CPUs required by the CSI report, and the number of unoccupied APUs during the expected APU occupancy period is greater than or equal to the number of APUs required by the CSI report, then the processing method for the CSI report is determined to be updating the CSI report. In this case, the CSI report pre-occupies the required number of CPUs during its expected CPU occupancy period and pre-occupies the required number of APUs during its expected APU occupancy period. If, during the expected CPU usage period, the number of unused CPUs is less than the number of CPUs required for the CSI report, or if, during the expected APU usage period, the number of unused APUs is less than the number of APUs required for the CSI report, then the CSI report will not be updated. In this case, the CSI report will neither pre-allocate CPUs nor pre-allocate APUs.

[0325] Figure 18 is a schematic diagram of the structure of a CSI report processing device provided in an embodiment of this application.

[0326] For example, as shown in FIG18, the CSI report processing device 1800 includes: a first determining module 1801, configured to determine the processing method of the first CSI report for a first CSI report occupying PU in K segmented time domains, based on whether the first symbol of the first CSI report in at least one of the segmented time domains satisfies a first condition; wherein the first symbol is used to represent the starting symbol of the segmented time domain, and K is greater than or equal to 1.

[0327] In one possible implementation, if the first symbol in any segmented time domain does not satisfy the first condition in the first CSI report, the first CSI report is not updated.

[0328] In one possible implementation, the first determining module is specifically used to: sequentially determine whether the first symbol of the first CSI report in each segment time domain, from the first segment time domain to the Kth segment time domain, satisfies the first condition; if the first symbol of the first CSI report in the kth segment time domain does not satisfy the first condition, determine that the processing method of the first CSI report is not to update the first CSI report; where k∈{1,2,…,K}.

[0329] In one possible implementation, the first determining module is further configured to, when the first symbol in the first CSI report in the k-th segment time domain does not satisfy the first condition and k is less than K, no longer determine whether the first symbol in the first CSI report in the (k+1)-th segment time domain to the K-th segment time domain satisfies the first condition.

[0330] In one possible implementation, if the first symbol of the first CSI report in the k-th segment time domain satisfies the first condition described above, the first CSI report occupies the PU in the k-th segment time domain; where k∈{1,2,…,K}.

[0331] In one possible implementation, if the first symbol of the first CSI report in each of the K segmented time domains satisfies the first condition described above, the processing method of the first CSI report is to update the first CSI report.

[0332] In one possible implementation, the first determining module is specifically used to: determine the processing method of the first CSI report based on the number of times the first symbol in at least one segmented time domain does not satisfy the first condition.

[0333] In one possible implementation, if the number of times the first CSI report fails to meet the first condition is greater than or equal to the first threshold in the first segment time domain to the (K-1)th segment time domain, the first CSI report is not updated.

[0334] In one possible implementation, the first CSI report fails to meet the first condition at least once in the K segmented time domains, and at least once includes the case where the first symbol of the first CSI report in the K segmented time domain fails to meet the first condition. In this case, the first CSI report is not updated.

[0335] In one possible implementation, if the number of times the first CSI report fails to meet the first condition in the first segment time domain to the (K-1)th segment time domain is less than the first threshold, and the first symbol of the first CSI report in the Kth segment time domain meets the first condition, the processing method for the first CSI report is to update the first CSI report.

[0336] In one possible implementation, the first determining module is further configured to: if the number of times the first CSI report fails to meet the first condition in the first segment time domain to the i-th segment time domain is greater than or equal to a first threshold, then the first symbol of the first CSI report in the (i+1)-th segment time domain to the K-th segment time domain is no longer judged to satisfy the first condition; wherein, if the first symbol of the first CSI report in the i-th segment time domain fails to satisfy the first condition, i is less than K.

[0337] In one possible implementation, the first CSI report is one of N CSI reports, and the first symbol of the k-th segment time domain of the first CSI report is the same as the first symbol of any segment time domain of the N-1 CSI reports, k∈{1,2,…,K}; if the priority of the first CSI report is among the top M of the N CSI reports, the first symbol of the first CSI report in the k-th segment time domain satisfies a first condition; where 0≤M≤N, and M is the number of segments that satisfy the condition. The maximum value that is true, N PU L represents the total number of PUs that the terminal device can use to process CSI reports, where L is the number of PUs already occupied in the first symbol mentioned above. The number of PUs required by CSI report n in the k-th segment time domain above, where n∈{0,1,…,N-1}.

[0338] In one possible implementation, the priority of each of the N CSI reports is determined based on at least one of the serving carrier index, the type of the CSI report, and the report configuration identifier of the CSI report.

[0339] In one possible implementation, the first determining module includes a priority raising unit, which is used to: increase the priority of the first CSI report among the N CSI reports according to a preset rule when the k-th segment time domain of the first CSI report is not the 1st segment time domain.

[0340] In one possible implementation, the aforementioned preset rule includes: the priority of the first CSI report is higher than the priority of the second CSI report among the N CSI reports, regardless of the priority value; wherein, the first symbol of the first segment time domain of the second CSI report is the same as the first symbol of the kth segment time domain of the first CSI report.

[0341] In one possible implementation, the aforementioned preset rules include: the priority of the first CSI report is higher than the priority of the third CSI report among the N CSI reports, regardless of the priority value; wherein, the number of segmented time domains occupied by the first CSI report is greater than the number of segmented time domains occupied by the third CSI report.

[0342] In one possible implementation, the first symbol mentioned above includes an OFDM symbol.

[0343] In one possible implementation, the aforementioned PU includes a first type of PU and / or a second type of PU.

[0344] In one possible implementation, the first type of PU mentioned above is a CPU, and the second type of PU mentioned above is an AL / ML PU.

[0345] Figure 19 is a schematic diagram of another CSI report processing device provided in an embodiment of this application.

[0346] For example, as shown in FIG19, the CSI report processing device 1900 includes: a second determining module 1901, used to determine the processing method of N CSI reports based on the number of unoccupied PUs during the expected PU occupancy period of the N CSI reports when the second symbols of the N CSI reports are the same; wherein the second symbol is used to represent the starting symbol of the CSI report.

[0347] In one possible implementation, if the number of unoccupied PUs during the expected PU occupancy period of the fourth CSI report is greater than or equal to a second threshold, the processing method of the fourth CSI report is to update the fourth CSI report; wherein the fourth CSI report is any one of the N CSI reports, and the second threshold is used to represent the number of PUs required for the fourth CSI report.

[0348] In one possible implementation, if the number of unoccupied PUs during the expected period of PU occupancy in the fourth CSI report is less than a second threshold, the fourth CSI report is not updated.

[0349] The aforementioned fourth CSI report is any one of the aforementioned N CSI reports, and the aforementioned second threshold is used to represent the number of PUs required for the aforementioned fourth CSI report.

[0350] In one possible implementation, the second determining module is specifically used to: execute the following steps in descending order of priority of the above N CSI reports: for the m-th CSI report, determine the processing method of the above m-th CSI report based on the number of unoccupied PUs during the expected PU occupancy period of the above m-th CSI report; where m∈{1,2…,N}.

[0351] In one possible implementation, if the number of unoccupied PUs during the expected PU occupancy period of the fourth CSI report is greater than or equal to the second threshold mentioned above, the fourth CSI report pre-occupies the PUs of the second threshold.

[0352] In one possible implementation, the second symbol mentioned above includes an OFDM symbol.

[0353] In one possible implementation, the aforementioned PU includes a first type of PU and / or a second type of PU.

[0354] In one possible implementation, the first type of PU mentioned above is a CPU, and the second type of PU mentioned above is an AL / ML PU.

[0355] Figure 20 is a schematic diagram of the structure of a terminal device provided in an embodiment of this application.

[0356] For example, as shown in FIG20, the terminal device 2000 includes: a memory 2001 for storing executable program code; and a processor 2002 for calling and running the executable program code from the memory 2001, so that the terminal device executes the CSI report processing method in the above method embodiment.

[0357] The processor may include one or more processing units. For example, the processor may include at least one of the following processing units: an application processor (AP), a modem processor, a graphics processing unit (GPU), an image signal processor (ISP), a controller, a video codec, a digital signal processor (DSP), a baseband processor, or a neural network processing unit (NPU). These different processing units may be independent devices or integrated devices. The controller can generate operation control signals based on instruction opcodes and timing signals to control the reading and execution of instructions.

[0358] The processor may also include memory for storing instructions and data. In some embodiments, the memory in the processor is a cache memory. This memory can store instructions or data that the processor has just used or that are used repeatedly. If the processor needs to use the instruction or data again, it can retrieve it directly from the memory. This avoids repeated accesses, reduces processor waiting time, and thus improves system operating efficiency.

[0359] In some embodiments, the processor may include one or more interfaces. For example, the processor may include at least one of the following interfaces: an Inter-integrated Circuit (I2C) interface, an Inter-integrated Circuit Sound (I2S) interface, a Pulse Code Modulation (PCM) interface, a Universal Asynchronous Receiver / Transmitter (UART) interface, a Mobile Industry Processor Interface (MIPI) interface, a General-Purpose Input / Output (GPIO) interface, a SIM interface, and a USB interface.

[0360] It should be noted that, in the description of the embodiments of this application, unless otherwise stated, " / " means "or," for example, A / B can mean A or B; the "and / or" in this document is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, and B existing alone. Furthermore, in the description of the embodiments of this application, "multiple" refers to two or more than two.

[0361] It should be understood that the methods, situations, categories, and classifications of embodiments in this application are for the convenience of description only and should not constitute a special limitation. Various methods, categories, situations, and features in embodiments can be combined with each other without contradiction.

[0362] It should also be understood that, in the description of this embodiment, unless otherwise stated, "multiple" means two or more. In the various embodiments of this application, the sequence number of each process does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0363] It should also be noted that in the embodiments of this application, "preset", "fixed value", etc. can be implemented by pre-saving the corresponding code, table or other means that can be used to indicate relevant information in the terminal device. This application does not limit the specific implementation method.

[0364] It is understood that, in order to achieve the above-mentioned functions, the terminal device includes hardware and / or software modules that perform the respective functions. Based on the algorithm steps of the examples described in the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed by hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application in conjunction with the embodiments, but such implementation should not be considered beyond the scope of this application.

[0365] This embodiment can divide the terminal device into functional modules according to the above method example. For example, each function can be divided into its own functional module, or two or more functions can be integrated into one processing module. The integrated module can be implemented in hardware. It should be noted that the module division in this embodiment is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods.

[0366] It should be noted that all relevant content of each step involved in the above method embodiments can be referenced from the functional description of the corresponding functional module, and will not be repeated here.

[0367] The terminal device provided in this embodiment is used to execute the above-described CSI report processing method, and therefore can achieve the same effect as the above-described implementation method.

[0368] When using integrated units, the terminal device may include a processing module, a storage module, and a communication module. The processing module is used to control and manage the actions of the terminal device. The storage module supports the execution of stored program code and data by the terminal device. The communication module supports communication between the terminal device and other devices.

[0369] The processing module can be a processor or a controller. It can implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of this application. The processor can also be a combination of functions that implement computing capabilities, such as a combination of one or more microprocessors, a combination of Digital Signal Processing (DSP) and a microprocessor, etc. The storage module can be a memory. The communication module can specifically be a radio frequency circuit, a Bluetooth chip, a Wi-Fi chip, or other devices that interact with other terminal devices.

[0370] This embodiment also provides a computer-readable storage medium storing computer instructions. When the computer instructions are executed on a terminal device, the terminal device performs the aforementioned method steps to implement the CSI report processing method in the above embodiment.

[0371] This embodiment also provides a computer program product that, when run on a computer, causes the computer to perform the aforementioned related steps to implement the CSI report processing method in the above embodiment.

[0372] In addition, embodiments of this application also provide an apparatus, which may specifically be a chip, component, or module. The apparatus may include a connected processor and a memory; wherein the memory is used to store computer execution instructions, and when the apparatus is running, the processor may execute the computer execution instructions stored in the memory to cause the chip to execute the CSI report processing method in the above method embodiments.

[0373] In this embodiment, the terminal device, computer-readable storage medium, computer program product or chip are all used to execute the corresponding methods provided above. Therefore, the beneficial effects that can be achieved can be referred to the beneficial effects in the corresponding methods provided above, and will not be repeated here.

[0374] Through the above description of the embodiments, those skilled in the art will understand that, for the sake of convenience and brevity, only the division of the above functional modules is used as an example. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above.

[0375] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of modules or units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another apparatus, or some features may be ignored or not executed. Furthermore, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0376] The units described as separate components may or may not be physically separate. A component shown as a unit can be one or more physical units; that is, it can be located in one place or distributed in multiple different locations. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0377] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0378] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solutions of the embodiments of this application, in essence, or the parts that contribute to the prior art, or all or part of the technical solutions, can be embodied in the form of a software product. This software product is stored in a storage medium and includes several instructions to cause a device (which may be a microcontroller, chip, etc.) or processor to execute all or part of the steps of the methods of the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0379] The above description is merely a specific embodiment of this application, but the specific embodiments of this application are not limited thereto. The scope of protection of this application shall be determined by the scope of protection of the claims. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in the claims of this application shall be included within the scope of protection of this application.

Claims

1. A method for processing CSI reports, characterized in that, include: For the first CSI report that occupies the PU in K segmented time domains, the processing method of the first CSI report is determined based on whether the first symbol of the first CSI report in at least one of the segmented time domains satisfies the first condition; Wherein, the first symbol is used to represent the starting symbol of the segmented time domain, and K is greater than or equal to 1.

2. The method according to claim 1, characterized in that, If the first CSI report does not satisfy the first condition in any of the first symbols of the segmented time domain, the first CSI report is processed by not updating the first CSI report.

3. The method according to claim 1 or 2, characterized in that, The step of determining the processing method of the first CSI report based on whether the first symbol in at least one of the segmented time domains satisfies the first condition includes: From the first segment time domain to the Kth segment time domain, it is sequentially determined whether the first symbol of the first CSI report in each segment time domain satisfies the first condition; If the first symbol of the first CSI report in the k-th segment time domain does not satisfy the first condition, the processing method for the first CSI report is determined to be not to update the first CSI report; where k∈{1,2,…,K}.

4. The method according to claim 3, characterized in that, The method further includes: If the first symbol of the first CSI report in the k-th segment time domain does not satisfy the first condition, and k is less than K, then the first symbol of the first CSI report in the (k+1)-th to K-th segment time domains will no longer be judged to satisfy the first condition.

5. The method according to claim 1, characterized in that, If the first symbol of the first CSI report in the k-th segment time domain satisfies the first condition, the first CSI report occupies PU in the k-th segment time domain; where k∈{1,2,…,K}.

6. The method according to claim 1, characterized in that, If the first symbol in each of the K segmented time domains of the first CSI report satisfies the first condition, the processing method of the first CSI report is to update the first CSI report.

7. The method according to claim 1, characterized in that, The step of determining the processing method of the first CSI report based on whether the first symbol in at least one of the segmented time domains satisfies the first condition includes: The processing method for the first CSI report is determined based on the number of times the first CSI report fails to satisfy the first condition in at least one of the segmented time domains.

8. The method according to claim 7, characterized in that, In the first to the (K-1)th time segment, if the number of times the first CSI report fails to meet the first condition is greater than or equal to the first threshold, the first CSI report is not updated.

9. The method according to claim 7, characterized in that, If the first CSI report fails to meet the first condition at least once in the K segment time domains, and at least once includes the case where the first symbol of the first CSI report in the K segment time domain fails to meet the first condition, the processing method for the first CSI report is not to update the first CSI report.

10. The method according to claim 7, characterized in that, If the number of times the first CSI report fails to meet the first condition is less than the first threshold in the first segment time domain to the (K-1)th segment time domain, and the first symbol of the first CSI report meets the first condition in the Kth segment time domain, the processing method for the first CSI report is to update the first CSI report.

11. The method according to claim 7, characterized in that, The method further includes: If the number of times the first CSI report fails to meet the first condition in the first segment time domain to the i-th segment time domain is greater than or equal to the first threshold, the first symbol of the first CSI report in the (i+1)-th segment time domain to the K-th segment time domain will no longer be judged to meet the first condition. Wherein, the first symbol in the first CSI report in the i-th segment time domain does not satisfy the first condition, and i is less than K.

12. The method according to any one of claims 1 to 11, characterized in that, The first CSI report is one of N CSI reports, and the first symbol of the k-th segment time domain of the first CSI report is the same as the first symbol of any segment time domain of the N-1 CSI reports, k∈{1,2,…,K}; If the priority of the first CSI report is among the top M of the N CSI reports, the first symbol of the first CSI report in the k-th segment time domain satisfies the first condition; Where 0≤M≤N, M is the value that makes M such that The maximum value that is true, N PU L represents the total number of PUs that the terminal device can use to process CSI reports, and L represents the number of PUs that have already been occupied in the first symbol. The number of PUs required by CSI report n in the k-th segment time domain, where n∈{0,1,…,N-1}.

13. The method according to claim 12, characterized in that, The priority of each of the N CSI reports is determined based on at least one of the serving carrier index, the type of the CSI report, and the report configuration identifier of the CSI report.

14. The method according to claim 13, characterized in that, The method further includes: If the k-th segment time domain of the first CSI report is not the 1st segment time domain, the priority of the first CSI report among the N CSI reports is increased according to a preset rule.

15. The method according to claim 14, characterized in that, The preset rules include: The first CSI report has a higher priority than the second CSI report among the N CSI reports; The first symbol of the first segment time domain of the second CSI report is the same as the first symbol of the kth segment time domain of the first CSI report.

16. The method according to claim 14, characterized in that, The preset rules include: The first CSI report has a higher priority than the third CSI report among the N CSI reports; The number of segmented time domains occupied by the first CSI report is greater than the number of segmented time domains occupied by the third CSI report.

17. The method according to claim 1, characterized in that, The first symbol includes OFDM symbols.

18. The method according to claim 1, characterized in that, The PU includes Class I PU and / or Class II PU.

19. The method according to claim 18, characterized in that, The first type of PU is a CPU, and the second type of PU is an AL / ML PU.

20. A method for processing CSI reports, characterized in that, include: When the second symbol of N CSI reports is the same, the processing method of N CSI reports is determined based on the number of unoccupied PUs during the expected PU occupancy period of the N CSI reports; The second symbol is used to indicate the starting symbol of the CSI report.

21. The method according to claim 20, characterized in that, If the number of unoccupied PUs during the expected period of PU occupancy in the fourth CSI report is greater than or equal to the second threshold, the fourth CSI report is processed by updating the fourth CSI report. The fourth CSI report is any one of the N CSI reports, and the second threshold is used to represent the number of PUs required for the fourth CSI report.

22. The method according to claim 20, characterized in that, If the number of unoccupied PUs during the expected period of PU occupancy in the fourth CSI report is less than the second threshold, the fourth CSI report will not be updated. The fourth CSI report is any one of the N CSI reports, and the second threshold is used to represent the number of PUs required for the fourth CSI report.

23. The method according to claim 20, characterized in that, The process of determining the handling method for the N CSI reports based on the number of unoccupied PUs during the expected PU occupancy period of the N CSI reports includes: The following steps are performed sequentially, according to the N CSI reports in descending order of priority: For the m-th CSI report, the processing method for the m-th CSI report is determined based on the number of unoccupied PUs during the expected PU occupancy period of the m-th CSI report; where m∈{1,2,…,N}.

24. The method according to claim 21, characterized in that, The method further includes: If the number of unoccupied PUs during the expected PU occupancy period of the fourth CSI report is greater than or equal to the second threshold, the fourth CSI report pre-occupies the PUs of the second threshold.

25. The method according to claim 20, characterized in that, The second symbol includes OFDM symbols.

26. The method according to claim 20, characterized in that, The PU includes Class I PU and / or Class II PU.

27. The method according to claim 26, characterized in that, The first type of PU is a CPU, and the second type of PU is an AL / ML PU.

28. A CSI report processing apparatus, characterized in that, include: The first determining module is used to determine the processing method of the first CSI report for a first CSI report occupying PU in K segmented time domains, based on whether the first symbol of the first CSI report in at least one of the segmented time domains satisfies a first condition; wherein the first symbol is used to represent the starting symbol of the segmented time domain, and K is greater than or equal to 1.

29. A CSI report processing apparatus, characterized in that, include: The second determining module is used to determine the processing method for N CSI reports when the second symbols of the N CSI reports are the same, based on the number of unoccupied PUs during the expected PU occupancy period of the N CSI reports. The second symbol is used to indicate the starting symbol of the CSI report.

30. A terminal device, characterized in that, include: Memory, used to store executable program code; A processor for calling and running the executable program code from the memory, causing the terminal device to perform the method as described in any one of claims 1 to 27.

31. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a terminal device, causes the terminal device to perform the method according to any one of claims 1 to 27.