Method and apparatus used for wireless communications

Abstract

Disclosed in the present application are a method and apparatus used for wireless communications. The method comprises: a first node sending a first report and a second report, wherein the first report indicates L0 first-type resources, L0 being a positive integer; the second report indicates that L1 first-type resources are not occupied, L1 being a positive integer not greater than L0; and the L0 first-type resources are used for inference. The method provides a signaling architecture for resource occupation of AI inference or ML inference, which is beneficial to making full use of the advantages of AI- or ML-based technology to improve system performance.

Description

Method and apparatus for wireless communication TECHNICAL FIELD

[0001] The present application relates to transmission methods and apparatuses in wireless communication systems, and in particular, to schemes and apparatuses related to resource occupation in wireless communication systems. BACKGROUND

[0002] In the evolution of communication systems from 5G (Generation) to 5G-Advanced and 6G, more advanced technologies are proposed and researched to improve the performance of wireless communication systems in all aspects and to meet the needs of more application scenarios. Typical technologies include but are not limited to AI (Artificial Intelligence) or ML (Machine Learning), full duplex mode or sub-band non-overlapping full duplex (SBFD), and reconfigurable intelligent surface (RIS).

[0003] One of the most significant features of 6G systems compared to 5G systems will be more intelligent. AI / ML aims to greatly improve the performance of wireless communication using advanced artificial intelligence and machine learning technologies. With AI / ML technologies, 6G systems can not only intelligently provide high-quality services such as scheduling, data reception, signal processing, coding and decoding, measurement and reporting, etc. according to the perception and learning of the surrounding environment, but also intelligently achieve self-optimization and self-maintenance of the network. In NR (New Radio) R (release) 18, AI / ML technology research has been initiated.

[0004] Compared with traditional processing methods, AI / ML has some unique characteristics, such as training-based, the need for deployment, and different requirements for computing / processing power and storage capacity than traditional technologies.

[0005] According to 3GPP (3rd Generation Partner Project) standard TS38.300, AI / ML models and algorithms are beyond the scope of 3GPP. SUMMARY

[0006] Applicant has found through research that AI inference or ML inference requires resource occupation, such as but not limited to computing resource and / or storage resource. When AI / ML technology is introduced, the existing resource occupation related design can not be able to adapt to the needs of AI / ML. To solve the above problems, the present application discloses a solution. It should be noted that although the motivation of the present application comes from the application of AI / ML model, and a large number of embodiments are developed for AI / ML, the present application is also applicable to other solutions, such as traditional receiving algorithm, traditional measurement and reporting solution, traditional scheduling algorithm, etc. Although the present application involves some description of AI / ML model and algorithm in the specification, however, those skilled in the art know that these descriptions are not necessary or irreplaceable for the solution related to wireless cellular communication. In addition, using a unified solution for different scenarios (including but not limited to AI / ML based solutions and traditional algorithms / solutions) helps to reduce signaling overhead / complexity, reduce hardware complexity and cost. In the case of no conflict, the embodiments in the first node and the features in the embodiments of the present application can be applied to the second node, and vice versa. In the case of no conflict, the embodiments of the present application and the features in the embodiments can be arbitrarily combined with each other.

[0007] When needed, the explanation of the terms in the present application is referred to the definition of 3GPP specification protocol TS38 series, or, referred to the definition of 3GPP specification protocol TS28 series.

[0008] The present application discloses a method in a first node used for wireless communication, characterized in that, comprising:

[0009] sending a first report, the first report indicating L0 first type resources, L0 being a positive integer;

[0010] sending a second report, the second report indicating that L1 first type resources are not occupied, L1 being a positive integer not greater than L0;

[0011] wherein the L0 first type resources are used for inference.

[0012] As an embodiment, the problem to be solved by the present application includes how the two parties of communication coordinate the information about the amount of resources used for inference; in the above method, the first node solves this problem by reporting L1 first type resources for inference that are not occupied.

[0013] As an embodiment, the benefits of the above method include providing a signaling architecture for resource occupation of AI or ML based technology, especially AI inference or ML inference, which is beneficial to fully play the advantages of AI or ML based technology to improve system performance.

[0014] As an embodiment, the above method has the advantages of facilitating the network side to reasonably schedule according to the number of the first type of resources available, optimizing the scheduling of the network side, and improving the performance of the first node and the overall network performance.

[0015] As an embodiment, the above method has the advantages of simplifying system design and facilitating implementation.

[0016] As an embodiment, the above method has the advantages of good flexibility, adapting to different terminals and different application scenarios.

[0017] According to an aspect of the present application, the second report is conditional on the first time domain resource.

[0018] As an embodiment, the above method has the advantages of more accurate reporting, providing the network side with more accurate information for scheduling and optimization.

[0019] According to an aspect of the present application, the L1 depends on the total number of the first type of resources occupied before the first time domain resource.

[0020] As an embodiment, the above method has the advantages of unifying the understanding of the content of the second report by the sender and the receiver of the second report, and optimizing system performance.

[0021] As an embodiment, the above method has the advantages of providing the network side with more accurate and detailed reports to optimize inference-related scheduling.

[0022] According to an aspect of the present application, the L1 depends on the total number of the first type of resources occupied before the first time domain resource.

[0023] As an embodiment, the above method has the advantages of unifying the understanding of the content of the second report by the sender and the receiver of the second report, and optimizing system performance.

[0024] As an embodiment, the above method has the advantages of providing the network side with more accurate and detailed reports to optimize inference-related scheduling.

[0025] According to an aspect of the present application, the second report is conditional on the downlink transmission rate on the first time domain resource.

[0026] As an embodiment, the above method has the advantages of unifying the understanding of the content of the second report by the sender and the receiver of the second report, and optimizing system performance.

[0027] As an embodiment, benefits of the above method include providing the network side with more accurate and detailed reports to optimize data scheduling for the first node.

[0028] According to an aspect of the present application, the second report is triggered by an event in a first event set, the first event set comprising at least one of:

[0029] a change in the number of occupied first-type resources is greater than a second threshold value;

[0030] at least one first-type operation is activated or deactivated, the first-type operation comprising inference;

[0031] at least one first-type operation is deployed or redeployed, the first-type operation comprising inference;

[0032] at least one first-type function is activated or deactivated, the first-type function relying on inference;

[0033] a first timer expires.

[0034] As an embodiment, benefits of the above method include good backward compatibility.

[0035] As an embodiment, benefits of the above method include higher flexibility suitable for different terminals and application scenarios.

[0036] As an embodiment, benefits of the above method include reduced latency.

[0037] According to an aspect of the present application, it comprises:

[0038] receiving first signaling;

[0039] wherein the first signaling triggers the second report.

[0040] As an embodiment, benefits of the above method include good backward compatibility.

[0041] As an embodiment, benefits of the above method include facilitating joint optimization of the network side, further improving system performance.

[0042] According to an aspect of the present application, each of the L0 first-type resources comprises one or more first-type sub-resources and one or more second-type sub-resources, and the second report indicates at least one of the number of unoccupied first-type sub-resources and the number of unoccupied second-type sub-resources in at least one first-type resource other than the L1 first-type resources among the L0 first-type resources.

[0043] As an embodiment, the benefits of the above method include good forward compatibility.

[0044] As an embodiment, the benefits of the above method include better flexibility, applicable to different terminals.

[0045] As an embodiment, the benefits of the above method include making full use of existing hardware devices and processing capabilities, improving device utilization.

[0046] According to an aspect of the present application, each of the L0 first-type resources comprises one or more first-type sub-resources and one or more second-type sub-resources, and the second report indicates at least one of the number of unoccupied first-type sub-resources and the number of unoccupied second-type sub-resources in at least one of the L1 first-type resources.

[0047] As an embodiment, the benefits of the above method include good forward compatibility.

[0048] As an embodiment, the benefits of the above method include better flexibility, applicable to different terminals.

[0049] As an embodiment, the benefits of the above method include making full use of existing hardware devices and processing capabilities, improving device utilization.

[0050] According to an aspect of the present application, the second report indicates the difference between N0 and N1, N0 is the maximum value of the number of occupied first-type resources associated with the first identifier, and N1 is the number of occupied first-type resources associated with the first identifier, and N1 is not greater than N0.

[0051] As an embodiment, the essence of the above method includes that the second report includes the occupation of the first-type resources of the AI model, AI operation or function identified by the first identifier.

[0052] As an embodiment, the benefits of the above method include more targeted reporting, further optimizing the performance of a certain AI model, AI operation or function.

[0053] According to an aspect of the present application, the first operation is associated with the first identifier, N0 is the maximum value of the number of first-type resources occupied by the first operation, and N1 is the number of first-type resources occupied by the first operation.

[0054] As an embodiment, the essence of the above method comprises that the second report comprises the occupation of the first type of resources for the first operation; the above method provides more accurate reporting for the first operation, further optimizing the performance of the first operation.

[0055] As an embodiment, the essence of the above method comprises that the first operation can obtain different performance under the condition of occupying different amounts of the first type of resources, and the first node reports the difference between the maximum value of the amount of the first type of resources occupied by the first operation and the actual amount of the first type of resources occupied, so as to facilitate the network side to indicate the first operation to occupy more or less the first type of resources according to the actual performance, and to obtain a better balance between performance and resource occupation.

[0056] According to an aspect of the present application, the first function is associated with the first identifier, the first function has P candidate operations, P is a positive integer greater than 1, N0 is the maximum value of the amount of the first type of resources occupied by the P candidate operations respectively, N1 is the amount of the first type of resources occupied by the first candidate operation, and the first candidate operation is the candidate operation used for the first function among the P candidate operations.

[0057] As an embodiment, the essence of the above method comprises that the second report comprises the occupation of the first type of resources for the first function; the above method provides more accurate reporting for the first function, further optimizing the first function.

[0058] As an embodiment, the essence of the above method comprises that a plurality of candidate operations are provided for the first function, improving the robustness of the first function, and at the same time, the relationship between the performance and resource occupation of the first function can be adjusted more flexibly.

[0059] As an embodiment, the essence of the above method comprises that the P candidate operations have different performance and different occupation requirements for the first type of resources, and the first node reports the difference between the maximum value of the amount of the first type of resources occupied by the first function and the amount of the first type of resources currently occupied by the first function, so as to facilitate the network side to indicate a better or worse candidate operation for the first function according to the actual performance, and to obtain a better balance between performance and resource occupation.

[0060] The present application discloses a method in a second node used for wireless communication, characterized in that it comprises:

[0061] receiving a first report, the first report indicating L0 first type of resources, L0 being a positive integer;

[0062] receiving a second report, the second report indicating that L1 first-type resources are not occupied, the L1 being a positive integer not greater than the L0;

[0063] wherein the L0 first-type resources are used for inference.

[0064] According to an aspect of the present application, the second report is conditioned on a first time-domain resource.

[0065] According to an aspect of the present application, the L1 depends on a total number of first-type resources occupied in the first time-domain resource.

[0066] According to an aspect of the present application, the L1 depends on a total number of first-type resources occupied before the first time-domain resource.

[0067] According to an aspect of the present application, the second report is conditioned on a downlink transmission rate on the first time-domain resource.

[0068] According to an aspect of the present application, the second report is triggered by an event in a first event set, the first event set comprising at least one of:

[0069] a change in a number of occupied first-type resources is greater than a second threshold value;

[0070] at least one first-type operation is activated or deactivated, the first-type operation comprising inference;

[0071] at least one first-type operation is deployed or redeployed, the first-type operation comprising inference;

[0072] at least one first-type function is activated or deactivated, the first-type function depending on inference;

[0073] a first timer expires.

[0074] According to an aspect of the present application, comprising:

[0075] sending first signaling;

[0076] wherein the first signaling triggers the second report.

[0077] According to an aspect of the present application, each of the L0 first-type resources comprises one or more first-type sub-resources and one or more second-type sub-resources, and the second report indicates at least one of a number of unoccupied first-type sub-resources and a number of unoccupied second-type sub-resources in at least one of the L0 first-type resources other than the L1 first-type resources.

[0078] According to an aspect of the present application, each of the L0 first-type resources comprises one or more first-type sub-resources and one or more second-type sub-resources, and the second report indicates at least one of a number of unoccupied first-type sub-resources and a number of unoccupied second-type sub-resources in at least one of the L1 first-type resources.

[0079] According to an aspect of the present application, the second report indicates a difference between N0 and N1, the N0 is a maximum value of a number of occupied first-type resources associated to the first identification, and the N1 is a number of occupied first-type resources associated to the first identification, the N1 is not greater than the N0.

[0080] According to an aspect of the present application, a first operation is associated to the first identification, the N0 is a maximum value of a number of first-type resources occupied by the first operation, and the N1 is a number of first-type resources occupied by the first operation.

[0081] According to an aspect of the present application, a first function is associated to the first identification, the first function has P candidate operations, P is a positive integer greater than 1, the N0 is a maximum value of a number of first-type resources respectively occupied by the P candidate operations, and the N1 is a number of first-type resources occupied by a first candidate operation, the first candidate operation is a candidate operation used for the first function among the P candidate operations.

[0082] The present application discloses a first node used for wireless communication, comprising:

[0083] a first processor configured to send a first report, the first report indicating L0 first-type resources, the L0 being a positive integer;

[0084] the first processor configured to send a second report, the second report indicating that L1 first-type resources are unoccupied, the L1 being a positive integer not greater than the L0;

[0085] wherein the L0 first-type resources are used for inference.

[0086] The present application discloses a second node used for wireless communication, comprising:

[0087] a second processor configured to receive a first report, the first report indicating L0 first-type resources, the L0 being a positive integer;

[0088] the second processor configured to receive a second report, the second report indicating that L1 first-type resources are unoccupied, the L1 being a positive integer not greater than the L0;

[0089] The L0 first-type resources are used for inference.

[0090] As an embodiment, compared with the conventional scheme, the present application has the following advantages:

[0091] A signaling architecture is provided for resource occupation of AI or ML based technology, especially AI inference or ML inference, which is beneficial to fully exert the advantages of AI or ML based technology to improve system performance.

[0092] It is convenient for the network side to reasonably schedule and optimize the performance of a single UE and the overall performance of the network.

[0093] The system design is simplified, and implementation is facilitated.

[0094] Good flexibility, suitable for different terminals and different application scenarios. BRIEF DESCRIPTION OF DRAWINGS

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

[0096] FIG. 1 shows a flowchart of a first report and a second report according to an embodiment of the present application;

[0097] FIG. 2 shows a schematic diagram of a network architecture according to an embodiment of the present application;

[0098] FIG. 3 shows a schematic diagram of an embodiment of a wireless protocol architecture of a user plane and a control plane according to an embodiment of the present application;

[0099] FIG. 4 shows a schematic diagram of a first communication device and a second communication device according to an embodiment of the present application;

[0100] FIG. 5 shows a transmission between a first node and a second node according to an embodiment of the present application;

[0101] FIG. 6 shows a schematic diagram of a first time domain resource according to an embodiment of the present application;

[0102] FIG. 7 shows a schematic diagram of a first time domain resource according to an embodiment of the present application;

[0103] FIG. 8 shows a schematic diagram of L1 according to an embodiment of the present application;

[0104] FIG. 9 shows a schematic diagram of L1 according to an embodiment of the present application;

[0105] FIG. 10 shows a schematic diagram of a downlink transmission rate on a first time domain resource according to an embodiment of the present application;

[0106] FIG. 11 shows a diagram of a downlink transmission rate on a first time domain resource according to one embodiment of the application;

[0107] FIG. 12 shows a diagram of a second report triggered by an event in a first set of events according to one embodiment of the application;

[0108] FIG. 13 shows a diagram of a first set of events according to one embodiment of the application;

[0109] FIG. 14 shows a diagram of a first set of events according to one embodiment of the application;

[0110] FIG. 15 shows a diagram of a first set of events according to one embodiment of the application;

[0111] FIG. 16 shows a diagram of a first set of events according to one embodiment of the application;

[0112] FIG. 17 shows a diagram of a first set of events according to one embodiment of the application;

[0113] FIG. 18 shows a diagram of a first signaling triggering a second report according to one embodiment of the application;

[0114] FIG. 19 shows a diagram of each of L0 first-type resources including one or more first-type sub-resources and one or more second-type sub-resources according to one embodiment of the application;

[0115] FIG. 20 shows a diagram of a second report indicating at least one of a number of unoccupied first-type sub-resources and a number of unoccupied second-type sub-resources in at least one first-type resource of L0 first-type resources other than L1 first-type resources according to one embodiment of the application;

[0116] FIG. 21 shows a diagram of a second report indicating at least one of a number of unoccupied first-type sub-resources and a number of unoccupied second-type sub-resources in at least one first-type resource of L1 first-type resources according to one embodiment of the application;

[0117] FIG. 22 shows a diagram of a second report indicating a difference between N0 and N1 according to one embodiment of the application;

[0118] FIG. 23 shows a diagram of N0 and N1 according to one embodiment of the application;

[0119] FIG. 24 shows a diagram of N0 and N1 according to one embodiment of the application;

[0120] FIG. 25 shows a diagram of N0 and N1 according to one embodiment of the application;

[0121] FIG. 26 shows a schematic diagram of P candidate operations for a first function according to an embodiment of the present application;

[0122] FIG. 27 shows a schematic diagram of N0 and N1 according to an embodiment of the present application;

[0123] FIG. 28 shows a schematic diagram of an artificial intelligence or machine learning based processing system according to an embodiment of the present application;

[0124] FIG. 29 shows a schematic diagram of an artificial intelligence or machine learning based processing system according to an embodiment of the present application;

[0125] FIG. 30 shows a schematic diagram of AI function deployment according to an embodiment of the present application;

[0126] FIG. 31 shows a schematic diagram of AI function deployment according to an embodiment of the present application;

[0127] FIG. 32 shows a schematic diagram of AI function deployment according to an embodiment of the present application;

[0128] FIG. 33 shows a schematic diagram of AI function deployment according to an embodiment of the present application;

[0129] FIG. 34 shows a structural block diagram of a processing apparatus in a first node according to an embodiment of the present application;

[0130] FIG. 35 shows a structural block diagram of a processing apparatus in a second node according to an embodiment of the present application; DETAILED DESCRIPTION

[0131] The technical solutions of the present application will be further described in detail below with reference to the accompanying drawings. It should be noted that the embodiments in the present application and the features in the embodiments can be combined with each other arbitrarily without conflict. Based on performance, flexibility, complexity, overhead and compatibility, etc., the person skilled in the art has the motivation to flexibly combine the embodiments in different drawings without conflict, for example, but not limited to, the embodiments in FIG. 1 and the embodiments in FIG. 5-FIG. 35, the embodiments in FIG. 5 and the embodiments in FIG. 6-FIG. 35, etc.

[0132] Embodiment 1

[0133] Embodiment 1 shows a flowchart of the first report and the second report according to an embodiment of the present application, as shown in FIG. 1. In 100 shown in FIG. 1, each block represents a step. In particular, the order of the steps in the block does not represent a specific time sequence between the steps.

[0134] In Embodiment 1, the first node sends a first report in step 101; and the first node sends a second report in step 102. Wherein, the first report indicates L0 first-type resources, and L0 is a positive integer; the second report indicates that L1 first-type resources are not occupied, and L1 is a positive integer not greater than L0; and the L0 first-type resources are used for inference.

[0135] As an embodiment, the first report is carried by a higher layer message.

[0136] As an embodiment, the first report is carried by a Radio Resource Control (RRC) message.

[0137] As an embodiment, the first report is carried by RRC signaling.

[0138] As an embodiment, the first report is carried by a Medium Access Control (MAC) Control Element (CE).

[0139] As an embodiment, the first report includes UE capability information.

[0140] As an embodiment, the first report is carried by a UE capability IE.

[0141] As an embodiment, the first report includes information in all or part of the fields in a UE capability IE.

[0142] As an embodiment, the first report includes information in one or more UE capability IEs.

[0143] As an embodiment, the first report includes capability reporting of the first node.

[0144] As an embodiment, the first report includes UE processing capability of the first node.

[0145] As an embodiment, the first report includes UE capability indication of the first node.

[0146] As an embodiment, the first report is only applicable to one carrier or one serving cell of the first node.

[0147] As one embodiment, the first report is applicable to all component carriers of the first node.

[0148] As one embodiment, the first report is applicable to all component carriers of the first node belonging to the same cell group.

[0149] As one embodiment, the first report is applicable to all component carriers of the first node belonging to the same frequency band (Band) or Band Combination.

[0150] As one embodiment, the first report is applicable to all serving cells of the first node.

[0151] As one embodiment, the first report is applicable to all serving cells of the first node belonging to the same cell group.

[0152] As one embodiment, the first report is applicable to all serving cells of the first node belonging to the same frequency band or Band Combination.

[0153] Typically, the same cell group is a Master Cell Group (MCG) or a Secondary Cell Group (SCG).

[0154] As one embodiment, the L0 is greater than 1.

[0155] As one embodiment, the L0 is equal to 1.

[0156] As one embodiment, the L0 is the total number of the first type of resources.

[0157] As one embodiment, the L0 is the total number of the first type of resources of the first node.

[0158] As one embodiment, the L0 is the total number of the first type of resources deployed at the first node.

[0159] As one embodiment, the L0 is the maximum number of the first type of resources.

[0160] As one embodiment, the L0 is the maximum number of occupied first type of resources.

[0161] As one embodiment, the L0 is the maximum number of the first type of resources supported by the first node.

[0162] As one embodiment, the L0 is the maximum number of the first type of resources that the first node can provide.

[0163] As one embodiment, the L0 is a maximum value of a number of the first type of resources that the first node can support simultaneously.

[0164] As one embodiment, the L0 is a maximum value of a number of the first type of resources that the first node can provide simultaneously.

[0165] As one embodiment, the first node supports the L0 first type of resources simultaneously.

[0166] As one embodiment, the first node can provide the L0 first type of resources simultaneously.

[0167] As one embodiment, the L0 is a total number of the first type of resources on one carrier.

[0168] As one embodiment, the L0 is a total number of the first type of resources on one carrier by the first node.

[0169] As one embodiment, the L0 is a maximum value of occupied first type of resources on one carrier.

[0170] As one embodiment, the L0 is a maximum value of the first type of resources supported on one carrier by the first node.

[0171] As one embodiment, the L0 is a maximum value of the first type of resources that can be provided on one carrier by the first node.

[0172] As one embodiment, the L0 is a maximum value of the first type of resources simultaneously supported on one carrier by the first node.

[0173] As one embodiment, the L0 is a maximum value of the first type of resources that can be provided simultaneously on one carrier by the first node.

[0174] As one embodiment, the carrier refers to a component carrier.

[0175] As one embodiment, the L0 is a total number of the first type of resources on all carriers.

[0176] As one embodiment, the L0 is a total number of the first type of resources on all carriers by the first node.

[0177] As one embodiment, the L0 is a maximum value of occupied first type of resources on all carriers.

[0178] As one embodiment, the L0 is a maximum value of the first type of resources supported on all carriers by the first node.

[0179] As an embodiment, the L0 is a maximum of the first type of resources that the first node can provide on all carriers.

[0180] As an embodiment, the L0 is a maximum of the first type of resources that the first node can support on all carriers simultaneously.

[0181] As an embodiment, the L0 is a maximum of the first type of resources that the first node can provide on all carriers simultaneously.

[0182] As an embodiment, the all carriers refer to all component carriers.

[0183] As an embodiment, the all carriers refer to all component carriers belonging to the same cell group.

[0184] As an embodiment, the all carriers refer to all component carriers belonging to the same frequency band or frequency band combination.

[0185] As an embodiment, the L0 is a total number of the first type of resources on one serving cell.

[0186] As an embodiment, the L0 is a total number of the first type of resources on one serving cell of the first node.

[0187] As an embodiment, the L0 is a maximum of the first type of resources occupied on one serving cell.

[0188] As an embodiment, the L0 is a maximum of the first type of resources supported on one serving cell of the first node.

[0189] As an embodiment, the L0 is a maximum of the first type of resources that the first node can provide on one serving cell.

[0190] As an embodiment, the L0 is a maximum of the first type of resources that the first node can support on one serving cell simultaneously.

[0191] As an embodiment, the L0 is a maximum of the first type of resources that the first node can provide on one serving cell simultaneously.

[0192] As an embodiment, the one serving cell is a SpCell (Special Cell) or a SCell (Secondary Cell).

[0193] As an embodiment, the L0 is a total number of the first type of resources on all serving cells.

[0194] As an embodiment, the L0 is a total number of the first type of resources on all serving cells of the first node.

[0195] As an embodiment, the L0 is a maximum value of the first type of resources occupied on all serving cells.

[0196] As an embodiment, the L0 is a maximum value of the first type of resources supported by the first node on all serving cells.

[0197] As an embodiment, the L0 is a maximum value of the first type of resources that can be provided by the first node on all serving cells.

[0198] As an embodiment, the L0 is a maximum value of the first type of resources simultaneously supported by the first node on all serving cells.

[0199] As an embodiment, the L0 is a maximum value of the first type of resources that can be simultaneously provided by the first node on all serving cells.

[0200] As an embodiment, the all serving cells refer to all serving cells configured for the first node.

[0201] As an embodiment, the all serving cells refer to all serving cells belonging to a same cell group.

[0202] As an embodiment, the all serving cells refer to all serving cells belonging to a same frequency band or frequency band combination.

[0203] As an embodiment, the second report is carried by a higher layer signaling.

[0204] As an embodiment, the second report is carried by a Radio Resource Control (RRC) signaling.

[0205] As an embodiment, the second report is carried by a Medium Access Control (MAC) Control Element (CE).

[0206] As an embodiment, the second report is carried by a Downlink Control Information (DCI).

[0207] As an embodiment, the L1 is equal to the L0.

[0208] As an embodiment, the L1 is less than the L0.

[0209] As one embodiment, the LI is a number of the L0 first-type resources that are not occupied.

[0210] As one embodiment, the LI first-type resources are LI unoccupied first-type resources of the L0 first-type resources.

[0211] As one embodiment, the number of the L0 first-type resources that are not occupied is the LI.

[0212] As one embodiment, only the LI first-type resources of the L0 first-type resources are not occupied.

[0213] As one embodiment, the number of the L0 first-type resources that are not occupied is greater than the LI.

[0214] As one embodiment, at least one first-type resource of the L0 first-type resources is unoccupied in addition to the LI first-type resources.

[0215] As one embodiment, the second report indicates the LI.

[0216] As one embodiment, the second report indicates that the number of unoccupied first-type resources is the LI.

[0217] As one embodiment, the second report indicates that the number of the L0 first-type resources that are not occupied is the LI.

[0218] As one embodiment, the second report indicates that LI first-type resources of the L0 first-type resources are not occupied.

[0219] As one embodiment, the second report indicates that at least LI unoccupied first-type resources of the L0 first-type resources.

[0220] As one embodiment, the second report indicates that at least the LI first-type resources of the L0 first-type resources are not occupied.

[0221] As one embodiment, the second report indicating that LI first-type resources are not occupied means that the second report indicates that the number of the L0 first-type resources that are not occupied is the LI.

[0222] As one embodiment, the second report indicating that LI first-type resources are not occupied means that the second report indicates that LI first-type resources of the L0 first-type resources are not occupied.

[0223] As one embodiment, the second report indicating that L1 first-type resources are not occupied means that the second report indicates that at least L1 first-type resources of the L0 first-type resources are not occupied.

[0224] As one embodiment, which first-type resource or which first-type resources of the L1 first-type resources are unknown to the target receiver of the second report.

[0225] As one embodiment, the second report indicates that L1 first-type resources of the L0 first-type resources are not occupied; which first-type resource or which first-type resources of the L1 first-type resources are unknown to the target receiver of the second report.

[0226] As one embodiment, the second report indicates that L1 first-type resources of the L0 first-type resources are not occupied, and indicates which first-type resource or which first-type resources are not occupied.

[0227] As one embodiment, the first-type resources include storage units.

[0228] As one embodiment, the first-type resources include processing units or computing units.

[0229] As one embodiment, the first-type resources include storage units and processing units.

[0230] As one embodiment, the first-type resources include storage units and computing units.

[0231] As one embodiment, the first-type resources include CSI (Channel Status Information) processing units.

[0232] As one embodiment, the first-type resources are different from CSI processing units.

[0233] As one embodiment, the first-type resources include CSI processing units and resources different from CSI processing units.

[0234] As one embodiment, the first-type resources are used for storage.

[0235] As one embodiment, the first-type resources are used for computing or processing.

[0236] As one embodiment, the first-type resources are used for storage and computing.

[0237] As one embodiment, the first-type resources are used for storage and processing.

[0238] As one embodiment, the first type of resources are used for storage required for inference.

[0239] As one embodiment, the first type of resources are used for computation or processing required for inference.

[0240] As one embodiment, the first type of resources are used for storage required for inference and computation or processing required for inference.

[0241] As one embodiment, the first type of resources are used for Channel State Information (CSI) processing.

[0242] As one embodiment, the first type of resources are used for processing that does not include inference.

[0243] As one embodiment, the first type of resources are used for CSI processing that does not include inference.

[0244] As one embodiment, the first type of resources are used only for inference.

[0245] As one embodiment, the first type of resources are used for inference and processing that does not include inference.

[0246] As one embodiment, inference refers to AI (Artificial Intelligence) inference.

[0247] As one embodiment, inference refers to ML (Machine Learning) inference.

[0248] As one embodiment, inference refers to AI inference or ML inference.

[0249] As one embodiment, the inference is used for one or more of CSI compression, CSI prediction, and beam management.

[0250] As one embodiment, the inference is used for data reception.

[0251] As one embodiment, the inference is used for downlink data reception.

[0252] As one embodiment, the inference is used for PDSCH (Physical Downlink Shared Channel) reception.

[0253] As an embodiment, the inference is used for one or more of channel estimation, MIMO (Multiple Input Multiple Output) reception, demodulation, channel decoding, and CRC (Cyclic Redundancy Check) check.

[0254] As an embodiment, the inference is used for positioning.

[0255] As an embodiment, the inference is used for scheduling.

[0256] As an embodiment, the inference is used for semantic-based error correction.

[0257] As an embodiment, at least one of the L0 first-type resources comprises one or more first-type sub-resources and one or more second-type sub-resources.

[0258] As an embodiment, each of the L0 first-type resources comprises one or more first-type sub-resources and one or more second-type sub-resources.

[0259] As an embodiment, at least one of the L0 first-type resources comprises a number of first-type sub-resources and a number of second-type sub-resources that are not equal.

[0260] As an embodiment, the first-type sub-resources are used for computation or processing, and the second-type sub-resources are used for storage.

[0261] As an embodiment, the first-type sub-resources are used for computation or processing required for inference, and the second-type sub-resources are used for storage required for inference.

[0262] As an embodiment, the first-type sub-resources are used for inference, and the second-type sub-resources are CSI processing units.

[0263] As an embodiment, a first-type resource is occupied if at least one first-type sub-resource or at least one second-type sub-resource comprised by the first-type resource is occupied; a first-type resource is unoccupied if every first-type sub-resource and every second-type sub-resource comprised by the first-type resource is unoccupied.

[0264] As an embodiment, a first-type resource is occupied if all first-type sub-resources and all second-type sub-resources comprised by the first-type resource are occupied; a first-type resource is unoccupied if at least one first-type sub-resource or at least one second-type sub-resource comprised by the first-type resource is unoccupied.

[0265] As one embodiment, the L1 depends on a total number of first type resources occupied.

[0266] As one embodiment, the L1 depends on a total number of first type resources occupied at a point in time.

[0267] As one embodiment, the L1 depends on a total number of first type resources occupied in a symbol or time slot.

[0268] As one embodiment, the L1 depends on a total number of first type resources occupied on one carrier.

[0269] As one embodiment, the L1 depends on a total number of first type resources occupied on all carriers.

[0270] As one embodiment, the L1 depends on a total number of first type resources occupied on one serving cell.

[0271] As one embodiment, the L1 depends on a total number of first type resources occupied on all serving cells.

[0272] As one embodiment, the L1 depends on a total number of first type resources occupied on one carrier at a point in time.

[0273] As one embodiment, the L1 depends on a total number of first type resources occupied on all carriers at a point in time.

[0274] As one embodiment, the L1 depends on a total number of first type resources occupied on one serving cell at a point in time.

[0275] As one embodiment, the L1 depends on a total number of first type resources occupied on all serving cells at a point in time.

[0276] As one embodiment, the L1 depends on a total number of first type resources occupied on one carrier in a symbol or time slot.

[0277] As one embodiment, the L1 depends on a total number of first type resources occupied on all carriers in a symbol or time slot.

[0278] As one embodiment, the L1 depends on a total number of first type resources occupied on one serving cell in a symbol or time slot.

[0279] As one embodiment, the L1 depends on a total number of first type resources occupied on all serving cells in a symbol or time slot.

[0280] As one embodiment, one first type resource being occupied comprises the one first type resource not being free.

[0281] As one embodiment, a first type of resource being occupied includes the one first type of resource being occupied for inference.

[0282] As one embodiment, a first type of resource being occupied includes the one first type of resource being occupied for computation or processing needed for inference.

[0283] As one embodiment, a first type of resource being occupied includes the one first type of resource being occupied for storage needed for inference.

[0284] As one embodiment, a first type of resource being occupied includes the one first type of resource being occupied for storage needed for inference and computation or processing needed for inference.

[0285] As one embodiment, a first type of resource being occupied includes the one first type of resource having been used for inference.

[0286] As one embodiment, a first type of resource being occupied includes the one first type of resource having been used for computation or processing needed for inference.

[0287] As one embodiment, a first type of resource being occupied includes the one first type of resource having been used for storage needed for inference.

[0288] As one embodiment, a first type of resource being occupied includes the one first type of resource having been used for storage needed for inference and computation or processing needed for inference.

[0289] As one embodiment, a first type of resource not being occupied includes the one first type of resource being idle.

[0290] As one embodiment, a first type of resource not being occupied includes the one first type of resource not being occupied for inference.

[0291] As one embodiment, a first type of resource not being occupied includes the one first type of resource not being occupied for computation or processing needed for inference.

[0292] As one embodiment, a first type of resource not being occupied includes the one first type of resource not being occupied for storage needed for inference.

[0293] As one embodiment, a first type of resource not being occupied includes the one first type of resource not being occupied for storage needed for inference and computation or processing needed for inference.

[0294] As one embodiment, a first type of resource not being occupied includes the one first type of resource not having been used for inference.

[0295] As one embodiment, one first-type resource being unoccupied includes the one first-type resource not having been used for storage required for inference.

[0296] As one embodiment, one first-type resource being unoccupied includes the one first-type resource not having been used for storage required for inference.

[0297] As one embodiment, one first-type resource being unoccupied includes the one first-type resource not having been used for storage required for inference and computation or processing required for inference.

[0298] As one embodiment, if one first-type resource is occupied, the one first-type resource cannot be used for new inference requirements; if one first-type resource is unoccupied, the one first-type resource can be used for new inference requirements.

[0299] As one embodiment, the LI depends on a number of first-type resources occupied by one operation, the one operation including inference.

[0300] As one sub-embodiment of the above embodiment, the LI depends on a difference between the LO and the number of first-type resources occupied by the one operation.

[0301] As one sub-embodiment of the above embodiment, the LI is equal to a difference between the LO and the number of first-type resources occupied by the one operation.

[0302] As one embodiment, the LI depends on a total number of first-type resources occupied by a plurality of operations, each operation in the plurality of operations including inference.

[0303] As one sub-embodiment of the above embodiment, the LI depends on a difference between the LO and the total number of first-type resources occupied by the plurality of operations.

[0304] As one sub-embodiment of the above embodiment, the LI is equal to a difference between the LO and the total number of first-type resources occupied by the plurality of operations.

[0305] As one sub-embodiment of the above embodiment, a time overlap of first-type resources occupied by any two operations in the plurality of operations.

[0306] As one sub-embodiment of the above embodiment, the LI depends on a total number of first-type resources occupied by a plurality of operations within a time window, a time overlap of first-type resources occupied by any two operations in the plurality of operations within the time window.

[0307] As one embodiment, the LI depends on a number of first-type resources occupied by one function, the one function depending on inference.

[0308] As one sub-example of the above example, the implementation of the one function relies on inference.

[0309] As one sub-example of the above example, the one function is implemented by inference.

[0310] As one sub-example of the above example, the one function is implemented by an operation that includes inference.

[0311] As one sub-example of the above example, the first node implements the one function using an operation that includes inference.

[0312] As one sub-example of the above example, the LI relies on the difference between the L0 and the number of first-type resources occupied by the one function.

[0313] As one sub-example of the above example, the LI is equal to the difference between the L0 and the number of first-type resources occupied by the one function.

[0314] As one example, the LI relies on the total number of first-type resources occupied by a plurality of functions, each of the plurality of functions relying on inference.

[0315] As one sub-example of the above example, the implementation of each of the plurality of functions relies on inference.

[0316] As one sub-example of the above example, any of the plurality of functions is implemented by inference.

[0317] As one sub-example of the above example, any of the plurality of functions is implemented by an operation that includes inference.

[0318] As one sub-example of the above example, the first node implements any of the plurality of functions using an operation that includes inference.

[0319] As one sub-example of the above example, the LI relies on the difference between the L0 and the total number of first-type resources occupied by the plurality of functions.

[0320] As one sub-example of the above example, the LI is equal to the difference between the L0 and the total number of first-type resources occupied by the plurality of functions.

[0321] As one sub-example of the above example, any two of the plurality of functions overlap in time in occupying first-type resources.

[0322] As a sub-example of the above embodiment, the L1 depends on a total number of first-type resources occupied by a plurality of functions in a time window, and a time overlap of any two functions of the plurality of functions in the time window.

[0323] As an example, a first-type resource occupied by one operation refers to a first-type resource occupied by one execution of an operation.

[0324] As an example, a first-type resource occupied by one function refers to a first-type resource occupied by an inference implementing the one function.

[0325] As an example, a first-type resource occupied by one function refers to a first-type resource occupied by one execution of an operation including an inference implementing the one function.

[0326] Embodiment 2

[0327] Embodiment 2 illustrates a schematic diagram of a network architecture according to an embodiment of the present application, as shown in FIG. 2.

[0328] FIG. 2 illustrates a network architecture 200. The network architecture 200 is a 5G NR (New Radio) / LTE (Long-Term Evolution) / LTE-A (Long-Term Evolution Advanced) system, or the network architecture 200 is a 5G+ network architecture, or the network architecture 200 is a 6G network architecture, or the network architecture 200 is a network architecture adopted in 3GPP future continued evolution; the network architecture 200 can be referred to as 5GS (5G System) / EPS (Evolved Packet System), or the network architecture 200 can be referred to as 6GS (6G System); the network architecture 200 includes at least one of a UE (User Equipment) 201, a RAN (Radio Access Network) 202, a core network 210, a HSS (Home Subscriber Server) / UDM (Unified Data Management) 220, and an Internet service 230. The network architecture 200 can be interconnected with other access networks, but these entities / interfaces are not shown for simplicity. As illustrated, the network architecture 200 provides packet-switched services, however, those skilled in the art will readily appreciate that the various concepts presented throughout this application are amenable to use with networked systems including, but not limited to, other cellular systems, wireless or wired packet-switched network systems, or other mobile communication systems. The RAN includes a node 203. The RAN can also include other nodes 204. The node 203 provides user and control plane protocol terminations toward the UE 201. The node 203 can be connected to the other nodes 204 via an Xn interface (e.g., backhaul) / X2 interface. The node 203 can also be referred to as a base station, a base transceiver station, a radio base station, a radio transceiver, a transceiver function, a basic service set (BSS), an extended service set (ESS), a TRP (Transmit Receive Point), or some other suitable terminology. The core network 210 is a 5GC (5G Core Network) / EPC (Evolved Packet Core), or the core network 210 is a 6GC; the node 203 provides an access point to the core network 210 for the UE 201.Examples of UE 201 include cellular phones, smart phones, session initiation protocol (SIP) phones, laptop computers, personal digital assistants (PDAs), satellite radios, non-terrestrial base station communications, satellite mobile communications, global positioning systems, multimedia devices, video devices, digital audio players (e.g., MP3 players), cameras, game consoles, drones, aerial vehicles, narrowband internet of things devices, machine type communication devices, land vehicles, automobiles, wearable devices, or any other similar functional device. Those skilled in the art will also The node 203 is connected to the core network 210 through an S1 / NG interface. The core network 210 includes a MME (Mobility Management Entity) / AMF (Authentication Management Field) / SMF (Session Management Function) 211, other MME / AMF / SMF 214, a S-GW (Service Gateway) / UPF (User Plane Function) 212, and a P-GW (Packet Data Network Gateway) / UPF 213. The MME / AMF / SMF 211 is a control node that handles signaling between the UE 201 and the core network 210. Generally, the MME / AMF / SMF 211 provides bearer and connection management. All user IP (Internet Protocal) packets are transferred through the S-GW / UPF 212, which itself is connected to the P-GW / UPF 213. The P-GW provides UE IP address allocation as well as other functions. The P-GW / UPF 213 is connected to Internet services 230. The Internet services 230 include operator corresponding Internet protocol services, which can specifically include the Internet, an intranet, an IMS (IP Multimedia Subsystem), and a packet switching service.

[0329] As one embodiment, the first node comprises the UE 201.

[0330] As one embodiment, the second node comprises the node 203.

[0331] As one embodiment, the wireless link between the UE 201 and the node 203 comprises a cellular network link.

[0332] As one embodiment, the sender of the first report comprises the UE 201.

[0333] As one embodiment, the receiver of the first report comprises the node 203.

[0334] As one embodiment, the sender of the second report comprises the UE 201.

[0335] As one embodiment, the receiver of the second report comprises the node 203.

[0336] As one embodiment, the sender of the first signaling comprises the node 203.

[0337] As one embodiment, the receiver of the first signaling comprises the UE 201.

[0338] As one embodiment, the UE 201 supports AI or ML based operations.

[0339] As one embodiment, the node 203 supports AI or ML based operations.

[0340] Embodiment 3

[0341] Embodiment 3 illustrates a diagram of an embodiment of a radio protocol architecture for the user and control planes according to one embodiment of the application, as shown in FIG. 3.

[0342] Figure 3 is a schematic diagram illustrating an embodiment of a radio protocol architecture for a user plane 350 and a control plane 300, Figure 3 showing three layers of the radio protocol architecture for the control plane 300 between a first communication node device (UE, gNB or RSU in V2X) and a second communication node device (gNB, UE or RSU in V2X), or between two UEs: Layer 1, Layer 2, and Layer 3. Layer 1 (LI layer) is the lowest layer and implements various PHY (Physical layer) signal processing functions. The LI layer will be referred to as the PHY 301 herein. Layer 2 (L2 layer) 305 is above the PHY 301 and is responsible for the link between the first communication node device and the second communication node device, or between two UEs. The L2 layer 305 includes a MAC (Medium Access Control) sublayer 302, a RLC (Radio Link Control) sublayer 303, and a PDCP (Packet Data Convergence Protocol) sublayer 304, which terminate the functions of the second communication node device. The PDCP sublayer 304 provides multiplexing between different radio bearers and logical channels. The PDCP sublayer 304 also provides security functions, such as ciphering of the data packets, and header compression. The RLC sublayer 303 provides segmentation and reassembly of upper layer data packets, retransmission of lost data packets, and reordering of data packets to compensate for out-of-order reception due to HARQ. The MAC sublayer 302 provides multiplexing between logical and transport channels. The MAC sublayer 302 is also responsible for allocating the various radio resources (e.g., resource blocks) in one cell among the UEs. The MAC sublayer 302 is also responsible for HARQ operations. The RRC (Radio Resource Control) sublayer 306 in Layer 3 (L3 layer) in the control plane 300 is responsible for obtaining radio resources (i.e., radio bearers) and the use of RRC signaling between the second communication node device and the first communication node device for configuring the lower layers. The radio protocol architecture for the user plane 350 includes Layer 1 (LI layer) and Layer 2 (L2 layer), which are substantially the same as the corresponding layers and sublayers in the control plane 300 for the physical layer 351, the PDCP sublayer 354 in the L2 layer 355, the RLC sublayer 353 in the L2 layer 355, and the MAC sublayer 352 in the L2 layer 355 for the first communication node device and the second communication node device, but the PDCP sublayer 354 also provides header compression for upper layer data packets to reduce radio transmission overhead.A SDAP (Service Data Adaptation Protocol) sublayer 356 is also comprised in the L2 layer 355 in the user plane 350, the SDAP sublayer 356 is in charge of mapping between QoS flows and data radio bearers (DRBs) to support the diversity of services. Although not shown, the first communication node device can have several upper layers above the L2 layer 355, including a network layer (e.g., IP layer) that terminates at a P-GW on the network side and an application layer that terminates at the other end of the connection (e.g., a remote UE, a server, etc.).

[0343] As one embodiment, the wireless protocol architecture in FIG. 3 is applicable to the first node.

[0344] As one embodiment, the wireless protocol architecture in FIG. 3 is applicable to the second node.

[0345] As one embodiment, the higher layer in this application refers to the layer above the physical layer.

[0346] As one embodiment, the first report is generated at the RLC sublayer 353.

[0347] As one embodiment, the first report is generated at the PDCP sublayer 354.

[0348] As one embodiment, the first report is generated at the SDAP sublayer 356.

[0349] As one embodiment, the second report is generated at the MAC sublayer 302 or the MAC sublayer 352.

[0350] As one embodiment, the second report is generated at the PHY 301 or the PHY 351.

[0351] As one embodiment, the first signaling is generated at the RRC sublayer 306.

[0352] As one embodiment, the first signaling is generated at the MAC sublayer 302 or the MAC sublayer 352.

[0353] As one embodiment, the first signaling is generated at the PHY 301 or the PHY 351.

[0354] Embodiment 4

[0355] Embodiment 4 illustrates a schematic diagram of a first communication device and a second communication device according to one embodiment of the application, as shown in FIG. 4. FIG. 4 is a block diagram of a first communication device 410 and a second communication device 450 that communicate with each other in an access network.

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

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

[0358] In transmissions from the first communication device 410 to the second communication device 450, at the first communication device 410, upper layer packets from a core network are provided to the controller / processor 475. The controller / processor 475 implements functionality of the L2 layer. In the DL (DownLink), the controller / processor 475 provides header compression, ciphering, packet segmentation and reordering, multiplexing between logical and transport channels, and radio resource allocations for the second communication device 450 based on various priority metrics. The controller / processor 475 is also responsible for HARQ operations, retransmission of lost packets, and signaling to the second communication device 450. The transmit processor 416 and the multi-antenna transmit processor 471 implement various signal processing functions for the LI layer (i.e., physical layer). The transmit processor 416 implements coding and interleaving to facilitate forward error correction (FEC) at the second communication device 450, and constellation mapping based on various modulation schemes (e.g., binary phase-shift keying (BPSK), quadrature phase-shift keying (QPSK), M-phase-shift keying (M-PSK), M-quadrature amplitude modulation (M-QAM)). The multi-antenna transmit processor 471 performs digital spatial pre-coding on the coded and modulated symbols, including codebook-based and non-codebook-based pre-coding, and beamforming processing, generating one or more parallel streams. The transmit processor 416 then maps to each of the parallel streams to the subcarriers, multiplexes the modulated symbols with reference signals (e.g., pilot) in time domain and / or frequency domain, and then performs an inverse fast Fourier transform (IFFT) to generate time domain multi-carrier symbol streams. The multi-antenna transmit processor 471 then performs transmit analog pre-coding / beamforming operations on the time domain multi-carrier symbol streams. Each transmitter 418 converts the baseband multi-carrier symbol streams provided by the multi-antenna transmit processor 471 into radio frequency signals, and then provides the radio frequency signals to the different antennas 420.

[0359] In transmission from the first communication device 410 to the second communication device 450, at the second communication device 450, each receiver 454 receives a signal through its respective antenna 452. Each receiver 454 recovers information modulated onto an RF carrier and converts the RF stream into a baseband, multicarrier symbol stream to be provided to a receive processor 456. The receive processor 456 and a multiple access receive processor 458 implement various signal processing functions of the Ll layer. The multiple access receive processor 458 performs receive analog precoding / beamforming operations on the baseband, multicarrier symbol stream from the receivers 454. The receive processor 456 converts the baseband, multicarrier symbol stream from the receive analog precoding / beamforming operations from the time domain to the frequency domain using a Fast Fourier Transform (FFT). In the frequency domain, the physical layer data signals and the reference signals are demultiplexed by the receive processor 456, with the reference signals to be used for channel estimation and the data signals to be recovered after multi-antenna detection in the multiple access receive processor 458 for any parallel streams destined to the second communication device 450. The symbols on each parallel stream are demodulated and recovered in the receive processor 456 and generate soft decisions. The receive processor 456 then decodes and de-interleaves the soft decisions to recover the upper layer data and control signals transmitted by the first communication device 410 on the physical channels. The upper layer data and control signals are then provided to a controller / processor 459. The controller / processor 459 implements the functions of the L2 layer. The controller / processor 459 can be associated with a memory 460 that stores program codes and data. The memory 460 can be referred to as a computer-readable medium. In the DL, the controller / processor 459 provides demultiplexing between transport and logical channels, packet reassembly, deciphering, header decompression, control signal processing to recover upper layer data packets from the core network. The upper layer data packets are then provided to all protocol layers above the L2 layer. Various control signals can also be provided to the L3 for L3 processing. The controller / processor 459 is also responsible for error detection using an acknowledgement (ACK) and / or negative acknowledgement (NACK) protocol to support HARQ operations.

[0360] In the transmission from the second communication device 450 to the first communication device 410, at the second communication device 450, a data source 467 is used to provide upper layer packets to a controller / processor 459. The data source 467 represents all protocol layers above the L2 layer. Similar to the transmit function described at the first communication device 410 in the DL, the controller / processor 459 implements header compression, ciphering, packet segmentation and reordering, and multiplexing between logical and transport channels based on radio resource allocations for the first communication device 410, implements L2 layer functionality for the user plane and control plane. The controller / processor 459 is also responsible for HARQ operations, retransmission of lost packets, and signaling to the first communication device 410. A transmit processor 468, in conjunction with a multi-antenna transmit processor 457, performs modulation mapping, channel coding processing, digital multi-antenna spatial processing, including codebook-based and non-codebook-based precoding, and beamforming processing, and then the transmit processor 468 creates parallel streams of coded and modulated symbols for the different antenna ports, which are provided to different antennas 452 via separate transmitters 454 after analog precoding / beamforming at the multi-antenna transmit processor 457. Each transmitter 454 then converts the baseband streams into radio frequency signals and transmits the radio frequency signals via the antennas 452.

[0361] In the transmission from the second communication device 450 to the first communication device 410, the functionality at the first communication device 410 is similar to the functionality described in connection with the reception at the second communication device 450 in the transmission from the first communication device 410 to the second communication device 450. Each receiver 418 receives a signal from its respective antenna 420, converts the received signal into a baseband signal, and provides the baseband signal to a multi-antenna receive processor 472 and a receive processor 470. The receive processor 470 and the multi-antenna receive processor 472, in conjunction with the controller / processor 475, implement the L1 layer functions. The controller / processor 475 implements L2 layer functions. The controller / processor 475 can be associated with a memory 476 that stores program codes and data. The memory 476 can be referred to as a computer-readable medium. The controller / processor 475 provides demultiplexing between transport and logical channels, packet reassembly, deciphering, header decompression, control signal processing to recover upper layer packets from the second communication device 450. Upper layer packets from the controller / processor 475 can be provided to a core network. The controller / processor 475 is also responsible for error detection using an ACK and / or NACK protocol to support HARQ operations.

[0362] As one embodiment, the second communication device 450 comprises: at least one processor and at least one memory including computer program code; the at least one memory and the computer program code configured to, with the at least one processor, cause the performance of the actions. The second communication device 450 is caused to perform at least: transmitting the first report; transmitting the second report. The first report indicates L0 first-type resources, L0 being a positive integer; the second report indicates that L1 first-type resources are unoccupied, L1 being a positive integer not greater than L0; the L0 first-type resources are used for inference.

[0363] As one embodiment, the second communication device 450 comprises: a memory storing a program of computer readable instructions to produce actions when executed by at least one processor, the actions comprising: transmitting the first report and the second report.

[0364] As one embodiment, the first communication device 410 comprises: at least one processor and at least one memory including computer program code; the at least one memory and the computer program code configured to, with the at least one processor, cause the performance of the actions. The first communication device 410 is caused to perform at least: receiving the first report; receiving the second report. The first report indicates L0 first-type resources, L0 being a positive integer; the second report indicates that L1 first-type resources are unoccupied, L1 being a positive integer not greater than L0; the L0 first-type resources are used for inference.

[0365] As one embodiment, the first communication device 410 comprises: a memory storing a program of computer readable instructions to produce actions when executed by at least one processor, the actions comprising: receiving the first report and the second report.

[0366] As one embodiment, the first node in the present application comprises the second communication device 450.

[0367] As one embodiment, the second node in the present application comprises the first communication device 410.

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

[0369] As an embodiment, at least one of {the antenna 420, the receiver 418, the receive processor 470, the multi-antenna receive processor 472, the controller / processor 475, the memory 476} is configured to receive the second report; at least one of {the antenna 452, the transmitter 454, the transmit processor 468, the multi-antenna transmit processor 457, the controller / processor 459, the memory 460, the data source 467} is configured to transmit the second report.

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

[0371] Embodiment 5

[0372] Embodiment 5 illustrates a flowchart of transmission according to an embodiment of the present application; as shown in FIG. 5. In FIG. 5, the second node U1 and the first node U2 are communication nodes of transmission through an air interface. In FIG. 5, the steps in the block F51 to the block F55 are optional respectively.

[0373] For the second node U1, the first report is received in the step S511; the first signaling is transmitted in the step S5101; the second report is received in the step S512.

[0374] For the first node U2, the first operation is deployed in the step S5201; at least one of the P candidate operations is deployed in the step S5202; the first report is transmitted in the step S521; the first signaling is received in the step S5203; the first operation is executed in the step S5204; the first candidate operation is executed in the step S5205; the second report is transmitted in the step S522.

[0375] In embodiment 5, the first report indicates L0 first-type resources, the L0 being a positive integer; the second report indicates that L1 first-type resources are not occupied, the L1 being a positive integer not greater than the L0; and the L0 first-type resources are used for inference.

[0376] As one embodiment, the second report is sent later than the first report.

[0377] As one embodiment, the first report is transmitted on a PUSCH (Physical Uplink Shared Channel).

[0378] As one embodiment, the second report is transmitted on a PUSCH.

[0379] As one embodiment, the second report is conditional on a first time-domain resource.

[0380] As one embodiment, the L1 is conditional on a first time-domain resource.

[0381] As one embodiment, the L1 is a number of first-type resources that are not occupied in the first time-domain resource.

[0382] As one embodiment, the L1 first-type resources are first-type resources that are not occupied in the first time-domain resource.

[0383] As one embodiment, the second report indicates a number of first-type resources that are not occupied in the first time-domain resource.

[0384] As one embodiment, the second report being conditional on a first time-domain resource includes that the L1 is conditional on the first time-domain resource.

[0385] As one embodiment, the second report being conditional on a first time-domain resource includes that the L1 is a number of first-type resources that are not occupied in the first time-domain resource.

[0386] As one embodiment, the second report being conditional on a first time-domain resource includes that the L1 first-type resources are first-type resources that are not occupied in the first time-domain resource.

[0387] As one embodiment, the L1 depends on a total number of first-type resources that are occupied in the first time-domain resource.

[0388] As one embodiment, the second report being conditional on a first time-domain resource includes that the L1 depends on a total number of first-type resources that are occupied in the first time-domain resource.

[0389] As one embodiment, the second report is conditioned on a first time-domain resource, and the second report indicates that L1 first-type resources are not occupied in the first time-domain resource.

[0390] As one embodiment, the L1 is equal to the L0 minus a total number of first-type resources occupied before the first time-domain resource.

[0391] As one embodiment, the L1 depends on a total number of first-type resources occupied before the first time-domain resource.

[0392] As one embodiment, the second report is conditioned on a first time-domain resource, and the L1 depends on a total number of first-type resources occupied before the first time-domain resource.

[0393] As one embodiment, the second report is conditioned on a first time-domain resource, and the second report indicates that L1 first-type resources are not occupied before the first time-domain resource.

[0394] As one embodiment, the L1 is equal to the L0 minus a total number of first-type resources occupied before the first time-domain resource.

[0395] As one embodiment, the second report is conditioned on a downlink transmission rate on the first time-domain resource.

[0396] As one embodiment, the second report is conditioned on a first time-domain resource, and the second report is conditioned on a downlink transmission rate on the first time-domain resource.

[0397] As one embodiment, the second report is conditioned on a first time-domain resource, and the second report indicates that L1 first-type resources are not occupied under a condition that a downlink transmission rate does not exceed the downlink transmission rate on the first time-domain resource.

[0398] As one embodiment, the second report is conditioned on a first time-domain resource, and the second report indicates that at least L1 first-type resources are not occupied under a condition that a downlink transmission rate does not exceed the downlink transmission rate on the first time-domain resource.

[0399] As one embodiment, the second report is conditioned on a first time-domain resource, and the second report indicates that a number of first-type resources not occupied under a condition that a downlink transmission rate does not exceed the downlink transmission rate on the first time-domain resource is the L1.

[0400] As one embodiment, the second report is a first time domain resource conditioned inclusion, the second report indicates that the number of unoccupied first type resources is at least the L1 under the condition that the downlink transmission rate does not exceed the downlink transmission rate on the first time domain resource.

[0401] As one embodiment, the second report is a first time domain resource conditioned inclusion, the second report indicates that L1 first type resources are unoccupied under the condition that the downlink transmission rate equals the downlink transmission rate on the first time domain resource.

[0402] As one embodiment, the second report is a first time domain resource conditioned inclusion, the second report indicates that at least L1 first type resources are unoccupied under the condition that the downlink transmission rate equals the downlink transmission rate on the first time domain resource.

[0403] As one embodiment, the second report is a first time domain resource conditioned inclusion, the second report indicates that the number of unoccupied first type resources is the L1 under the condition that the downlink transmission rate equals the downlink transmission rate on the first time domain resource.

[0404] As one embodiment, the second report is a first time domain resource conditioned inclusion, the second report indicates that the number of unoccupied first type resources is at least the L1 under the condition that the downlink transmission rate equals the downlink transmission rate on the first time domain resource.

[0405] As one embodiment, the unit of the downlink transmission rate is Mbps (Megabit per second).

[0406] As one embodiment, the unit of the downlink transmission rate is Gbps or Mbpms (Megabit per millisecond).

[0407] As one embodiment, the downlink transmission rate is for bits in a TB (Transport Block).

[0408] As one embodiment, the downlink transmission rate depends on the transmission rate of bits in a TB.

[0409] As one embodiment, the downlink transmission rate is the transmission rate of bits in a TB.

[0410] As one embodiment, the first node is only configured with a given serving cell, and the downlink transmission rate is a downlink data rate in a given time slot on the given serving cell.

[0411] As one embodiment, the first node is configured with only one serving cell, and the downlink transmission rate is the number of bits of all TBs or CBs (Code Blocks) transmitted in a given time slot on the given serving cell.

[0412] As one embodiment, the first node is configured with only one serving cell, and the downlink transmission rate is the total number of bits of all TBs or CBs transmitted in a given time slot on the given serving cell divided by a time length.

[0413] As one embodiment, for the downlink transmission rate on the first time domain resource, the first time domain resource belongs to the given time slot.

[0414] As one embodiment, the downlink transmission rate is the sum of J transmission rates, each of which is a downlink data rate in a time slot with overlap in J cells, and J is a positive integer greater than 1.

[0415] As one embodiment, the downlink transmission rate is the sum of J transmission rates, each of which is the total number of bits of all TBs or CBs transmitted in the time slot with overlap in the J cells.

[0416] As one embodiment, the downlink transmission rate is the sum of J transmission rates, each of which is the total number of bits of all TBs or CBs transmitted in the time slot with overlap in the J cells divided by a time length.

[0417] As one embodiment, for the downlink transmission rate on the first time domain resource, the first time domain resource belongs to one of the time slots with overlap.

[0418] As one embodiment, the J cells include J carriers.

[0419] As one embodiment, the J cells include J serving cells.

[0420] As one embodiment, the J cells form one cell group.

[0421] As one embodiment, the J cells belong to one frequency band or frequency band combination.

[0422] As one embodiment, the time length is in seconds.

[0423] As one embodiment, the time length is in milliseconds or microseconds.

[0424] As one embodiment, the time length is expressed as a number of symbols.

[0425] As one embodiment, the second report is triggered by an event in a first set of events, the first set of events comprising at least one of:

[0426] - a change in a number of first-type resources occupied is greater than a second threshold;

[0427] - at least one first-type operation is activated or deactivated, the first-type operation comprising inference;

[0428] - at least one first-type operation is deployed or redeployed, the first-type operation comprising inference;

[0429] - at least one first-type function is activated or deactivated, the first-type function relying on inference;

[0430] - a first timer expires.

[0431] As one embodiment, the step in block F53 in Figure 5 is present, the first signaling triggering the second report.

[0432] As one embodiment, the first signaling is transmitted on a PDSCH.

[0433] As one embodiment, the first signaling is transmitted on a PDCCH (Physical Downlink Control Channel).

[0434] As one embodiment, each of the L0 first-type resources comprises one or more first-type sub-resources and one or more second-type sub-resources, the second report indicating at least one of a number of first-type sub-resources unoccupied and a number of second-type sub-resources unoccupied in at least one of the L0 first-type resources other than the L1 first-type resources.

[0435] As one embodiment, each of the L0 first-type resources comprises one or more first-type sub-resources and one or more second-type sub-resources, the second report indicating at least one of a number of first-type sub-resources unoccupied and a number of second-type sub-resources unoccupied in at least one of the L1 first-type resources.

[0436] As one embodiment, the second report indicates a difference between N0 and N1, the N0 being a maximum of a number of first-type resources occupied associated to a first identity, the N1 being a number of first-type resources occupied associated to the first identity, the N1 not being greater than the N0.

[0437] As one embodiment, the first operation is associated to the first identity, the N0 is a maximum of a number of first type resources occupied by the first operation, and the N1 is a number of first type resources occupied by the first operation.

[0438] As one embodiment, the step in block F54 in Figure 5 is present, the method in the first node for wireless communication comprises: performing the first operation.

[0439] As one embodiment, the performing of the first operation is earlier than the sending of the second report.

[0440] As one embodiment, the performing of the first operation is later than the sending of the second report.

[0441] As one embodiment, the step in block F51 in Figure 5 is present, the method in the first node for wireless communication comprises: deploying the first operation.

[0442] As one embodiment, the step in block F51 in Figure 5 is not present, the first operation is not needed to be deployed.

[0443] As one embodiment, the first function is associated to the first identity, the first function has P candidate operations, P is a positive integer greater than 1, the N0 is a maximum of a number of first type resources respectively occupied by the P candidate operations, the N1 is a number of first type resources occupied by a first candidate operation, and the first candidate operation is a candidate operation of the P candidate operations used for the first function.

[0444] As one embodiment, the step in block F55 in Figure 5 is present, the method in the first node for wireless communication comprises: performing the first candidate operation.

[0445] As one embodiment, the performing of the first candidate operation is earlier than the sending of the second report.

[0446] As one embodiment, the performing of the first candidate operation is later than the sending of the second report.

[0447] As one embodiment, the step in block F52 in Figure 5 is present, the method in the first node for wireless communication comprises: deploying at least one candidate operation of the P candidate operations.

[0448] As one embodiment, the step in block F52 in Figure 5 is not present, each candidate operation of the P candidate operations does not need to be deployed.

[0449] Embodiment 6

[0450] Embodiment 6 illustrates a schematic diagram of a first time-domain resource according to an embodiment of the application; as shown in FIG. 6.

[0451] As an embodiment, the first time-domain resource comprises one or more symbols.

[0452] As an embodiment, the first time-domain resource is one symbol.

[0453] As an embodiment, the first time-domain resource comprises one or more slots.

[0454] As an embodiment, the first time-domain resource is one slot.

[0455] As an embodiment, the first time-domain resource is one symbol or one slot.

[0456] As an embodiment, the symbol comprises an OFDM (Orthogonal Frequency Division Multiplexing) symbol.

[0457] As an embodiment, the symbol is an OFDM symbol.

[0458] As an embodiment, the symbol comprises a DFT-S-OFDM (Discrete Fourier Transform Spread OFDM) symbol.

[0459] As an embodiment, the symbol is an OFDM symbol after generation of a transform precoder.

[0460] As an embodiment, the symbol comprises a cyclic prefix.

[0461] As an embodiment, the first time-domain resource is a time point.

[0462] As an embodiment, the first time-domain resource is a starting time of a symbol.

[0463] As an embodiment, the first time-domain resource is dependent on a time-domain resource of the second report.

[0464] As an embodiment, the benefits of the above method include good backward compatibility, simple implementation, and reduced signaling overhead.

[0465] As an embodiment, the first time-domain resource is a slot occupied by the second report.

[0466] As one embodiment, the first time-domain resource is a first symbol of a slot occupied by the second report.

[0467] As one embodiment, the first time-domain resource is a first symbol of a slot occupied by the second report.

[0468] As one embodiment, the first time-domain resource is earlier in time domain than the second report.

[0469] As one embodiment, the first time-domain resource depends on n0 and a first offset, the second report is located in slot n1; the n0 depends on the n1, and the first offset is an integer.

[0470] As one subembodiment of the above embodiment, the first offset depends on configuration of a higher layer parameter.

[0471] As one subembodiment of the above embodiment, the first offset depends on capability of the first node.

[0472] As one embodiment, the second report is located in slot n1; the first time-domain resource is a first symbol of a slot or a last symbol of a slot before a third offset symbols before the first symbol of the slot n1.

[0473] As one subembodiment of the above embodiment, the third offset depends on configuration of a higher layer parameter.

[0474] As one subembodiment of the above embodiment, the third offset depends on capability of the first node.

[0475] As one embodiment, the second report is located in slot n1; the first time-domain resource is a first symbol of a slot or a last symbol of a slot before a third offset symbols before the first symbol of the slot n1, the slot being the last slot configured as DL by a higher layer parameter “tdd-UL-DL-ConfigurationCommon” or “tdd-UL-DL-ConfigurationDedicated”.

[0476] As one subembodiment of the above embodiment, the third offset depends on configuration of a higher layer parameter.

[0477] As one subembodiment of the above embodiment, the third offset depends on capability of the first node.

[0478] As one embodiment, the first time-domain resource is a time-domain resource not later than a latest PDSCH allocated for the second report.

[0479] As one embodiment, the first time-domain resource is the latest PDSCH allocated time-domain resource no later than the sixth offset symbols before the first symbol of the second report, and the sixth offset is a positive integer.

[0480] As one sub-embodiment of the above embodiment, the sixth offset depends on the configuration of a higher layer parameter.

[0481] As one sub-embodiment of the above embodiment, the sixth offset depends on the capability of the first node.

[0482] As one embodiment, the first time-domain resource depends on the time-domain resource of the latest CSI reporting no later than the second report.

[0483] As one embodiment, the first time-domain resource depends on the time slot occupied by the latest CSI reporting no later than the second report.

[0484] As one embodiment, the first time-domain resource depends on the last symbol of the latest CSI reporting no later than the second report.

[0485] As one embodiment, the first time-domain resource depends on the CSI reference resource of the latest CSI reporting no later than the second report.

[0486] As one embodiment, the definition of the CSI reference resource refers to 5.2.2.5 of 3GPP TS38.214.

[0487] As one embodiment, the first time-domain resource depends on the latest RS (Reference Signal) resource transmission occasion relied on by the channel measurement of the latest CSI reporting no later than the second report.

[0488] As one embodiment, the first time-domain resource depends on the first signaling.

[0489] The above method has the benefits of supporting network-side joint optimization and further improving system performance.

[0490] As one embodiment, the first time-domain resource depends on the time-domain resource of the first signaling.

[0491] As one embodiment, the first signaling is located in time slot n2, and the first time-domain resource is located in time slot (n2+ fifth offset), and the fifth offset is a positive integer.

[0492] As one sub-embodiment of the above embodiment, the fifth offset depends on the configuration of a higher layer parameter.

[0493] As one subembodiment of the above embodiment, the fifth offset depends on a capability of the first node.

[0494] As one subembodiment of the above embodiment, the first signaling indicates the fifth offset.

[0495] As one embodiment, the first time-domain resource depends on a CORESET (Control Resource Set) pool to which the first signaling belongs.

[0496] As one embodiment, the first signaling indicates the first time-domain resource.

[0497] As one embodiment, the first signaling explicitly indicates the first time-domain resource.

[0498] As one embodiment, a field of the first signaling indicates the first time-domain resource.

[0499] As one embodiment, the first signaling indicates a time interval between the first time-domain resource and a slot in which the first signaling is located.

[0500] As one embodiment, the first signaling implicitly indicates the first time-domain resource.

[0501] As one embodiment, the first signaling indicates the first time-domain resource by indicating other information.

[0502] As one embodiment, the second report indicates the first time-domain resource.

[0503] The above method has the benefits of better flexibility, adaptation to different terminals and application scenarios, according to one embodiment.

[0504] As one embodiment, the second report is located in slot n1, the first time-domain resource is located in slot (n1-first offset), and the second report indicates the first offset.

[0505] As one embodiment, the first time-domain resource is a first symbol or a last symbol of a last slot before third offset symbols before a first symbol of a slot to which the second report belongs, and the second report indicates the third offset.

[0506] As an embodiment, the first time-domain resource is the last symbol before a third offset symbols before a first symbol or a last symbol of a first slot of a slot to which the second report belongs, the second report indicating the third offset.

[0507] As an embodiment, the first time-domain resource depends on a time instant at which one event in the first set of events occurs.

[0508] As an embodiment, the first time-domain resource depends on a time instant at which one event in the first set of events occurs.

[0509] As an embodiment, the first time-domain resource depends on a time instant at which one event in the first set of events occurs.

[0510] As an embodiment, the first time-domain resource depends on a time instant at which one event in the first set of events occurs.

[0511] As an embodiment, the first time-domain resource depends on a time instant at which one event in the first set of events occurs.

[0512] As an embodiment, the first time-domain resource depends on a time instant at which one event in the first set of events occurs.

[0513] As an embodiment, the first time-domain resource depends on a time instant at which one event in the first set of events occurs.

[0514] As an embodiment, the first time-domain resource depends on a time instant at which one event in the first set of events occurs.

[0515] As an embodiment, the first time-domain resource depends on a time instant at which one event in the first set of events occurs.

[0516] Embodiment 7

[0517] Embodiment 7 illustrates a diagram of a first time-domain resource according to an embodiment of the present application; as shown in FIG. 7. In Embodiment 7, the first time-domain resource depends on n0 and a first offset, the second report is located at slot n1; the n0 depends on the n1, and the first offset is an integer. In FIG. 7(a), the first time-domain resource is slot (n0-the first offset); in FIG. 7(b), the first time-domain resource is the first symbol of slot (n0-the first offset).

[0518] As an embodiment, the n0 depends on the n1 means that the n0 is equal to the n1.

[0519] As an embodiment, the n0 depends on a downlink subcarrier spacing configuration.

[0520] As an embodiment, the n0 depends on an uplink subcarrier spacing configuration.

[0521] As an embodiment, the n0 depends on a capability of the first node.

[0522] As an embodiment, the n0 depends on the n1 means that the n0 depends on a product of the n1 and a first ratio, the first ratio is equal to a ratio of a downlink subcarrier spacing configuration power of 2 and an uplink subcarrier spacing configuration power of 2.

[0523] As an embodiment, the n0 is equal to a floor of a product of the n1 and the first ratio.

[0524] As an embodiment, the n0 is equal to a floor of a product of the n1 and the first ratio plus a second offset; the second offset is an integer.

[0525] As a sub-embodiment of the above embodiment, the second offset is configurable.

[0526] As a sub-embodiment of the above embodiment, the second offset depends on a configuration of a higher layer parameter.

[0527] As a sub-embodiment of the above embodiment, the second offset depends on a downlink subcarrier spacing configuration.

[0528] As a sub-embodiment of the above embodiment, the second offset depends on a capability of the first node.

[0529] As an embodiment, the first offset is configurable.

[0530] As an embodiment, the first offset depends on a configuration of a higher layer parameter.

[0531] As an embodiment, the first offset depends on a downlink subcarrier spacing configuration.

[0532] As one embodiment, the first offset depends on an uplink subcarrier spacing configuration.

[0533] As one embodiment, the first offset depends on a capability of the first node.

[0534] As one embodiment, the first offset is a minimum value that is greater than or equal to a given threshold and such that the slot (n0 - the first offset) corresponds to a valid downlink slot; the given threshold is an integer.

[0535] As one sub-embodiment of the above embodiment, the given threshold is configurable.

[0536] As one sub-embodiment of the above embodiment, the given threshold depends on a configuration of a higher layer parameter.

[0537] As one sub-embodiment of the above embodiment, the given threshold depends on a capability of the first node.

[0538] As one embodiment, the downlink subcarrier spacing configuration is one of 0, 1, 2, 3, 4, 5, 6.

[0539] As one embodiment, the uplink subcarrier spacing configuration is one of 0, 1, 2, 3, 4, 5, 6.

[0540] Embodiment 8

[0541] Embodiment 8 illustrates a schematic diagram of L1 according to one embodiment of the present application; as shown in FIG. 8. In embodiment 8, the L1 is equal to the L0 minus the total number of the first type of resources occupied in the first time domain resources.

[0542] As one embodiment, the L1 is equal to the L0 minus the total number of the first type of resources occupied in the first time domain resources, the L0 is the maximum value of the number of the first type of resources simultaneously supported by the first node.

[0543] As one embodiment, the L1 is equal to the L0 minus the total number of the first type of resources occupied in the first time domain resources, the L0 is the total number of the first type of resources.

[0544] As one embodiment, the L1 is equal to the L0 minus the total number of the first type of resources occupied in the first time domain resources, the L0 is the maximum value of the first type of resources occupied.

[0545] As one embodiment, the total number of the first type of resources occupied in the first time domain resources refers to the total number of the first type of resources occupied in the first time domain resources on a first carrier or a first serving cell.

[0546] As one sub-example of the above embodiment, the first carrier is a component carrier of the first node.

[0547] As one sub-example of the above embodiment, the first carrier is a downlink carrier.

[0548] As one sub-example of the above embodiment, the first carrier is a downlink carrier, and the second report is transmitted in an uplink carrier corresponding to the first carrier.

[0549] As one sub-example of the above embodiment, the first serving cell is a SpCell or a SCell.

[0550] As one sub-example of the above embodiment, the second report is transmitted in the first serving cell.

[0551] As one sub-example of the above embodiment, the first carrier or the first serving cell is indicated by the first signaling.

[0552] As one sub-example of the above embodiment, the second report indicates the first carrier or the first serving cell.

[0553] As one embodiment, the above method has the advantage of reporting the number of unoccupied first-type resources for different carriers or serving cells respectively, which optimizes the performance of each carrier or serving cell.

[0554] As one embodiment, the total number of first-type resources occupied in the first time-domain resource refers to the total number of first-type resources occupied in the first time-domain resource on all carriers or all serving cells.

[0555] As one sub-example of the above embodiment, the all carriers or the all serving cells belong to the same frequency range.

[0556] As one sub-example of the above embodiment, the all carriers are all component carriers of the first node.

[0557] As one sub-example of the above embodiment, the all carriers are all component carriers in MCG or SCG.

[0558] As one sub-example of the above embodiment, the all carriers are all component carriers within one frequency band or frequency band combination.

[0559] As one sub-example of the above embodiment, the all serving cells are all serving cells configured by the first node.

[0560] As one sub-example of the above embodiment, the all serving cells form one MCG or SCG.

[0561] As one sub-example of the above embodiment, the all serving cells are all serving cells within one frequency band or frequency band combination.

[0562] As one embodiment, the benefits of the above method include that different carriers or serving cells can share the first type of resources, improving the utilization of the first type of resources.

[0563] As one embodiment, the total number of the first type of resources occupied in the first time domain resource is equal to the sum of K values, the K is a positive integer greater than 1; the K values and K carriers or K serving cells are in one-to-one correspondence, the K carriers or the K serving cells and K time pools are in one-to-one correspondence, any time pool of the K time pools overlaps with the first time domain resource; the K values are respectively the number of the first type of resources occupied in the corresponding time pool on the K carriers or the K serving cells.

[0564] As one sub-example of the above embodiment, the K carriers are all component carriers of the first node.

[0565] As one sub-example of the above embodiment, the K carriers are all component carriers in the MCG or SCG.

[0566] As one sub-example of the above embodiment, the K carriers are all component carriers within one frequency band or frequency band combination.

[0567] As one sub-example of the above embodiment, the K serving cells are all serving cells of the first node.

[0568] As one sub-example of the above embodiment, the K serving cells form one MCG or SCG.

[0569] As one sub-example of the above embodiment, the K serving cells are all serving cells within one frequency band or frequency band combination.

[0570] As one sub-example of the above embodiment, the K time pools are respectively K time slots.

[0571] As one sub-example of the above embodiment, the K time pools are respectively K symbols.

[0572] As one sub-example of the above embodiment, the K time pools all overlap with the same time point.

[0573] As one subembodiment of the above embodiment, the K time pools include one common time point.

[0574] As one subembodiment of the above embodiment, the first time-domain resource is one time pool of the K time pools.

[0575] As one subembodiment of the above embodiment, the first time-domain resource is an intersection of the K time pools.

[0576] As one subembodiment of the above embodiment, the first time-domain resource is a union of the K time pools.

[0577] Embodiment 9

[0578] Embodiment 9 illustrates a schematic diagram of L1 according to one embodiment of the present application; as shown in FIG. 9. In embodiment 9, the L1 is equal to the L0 minus the total number of first-type resources occupied before the first time-domain resource.

[0579] As one embodiment, the L1 is equal to the L0 minus the total number of first-type resources occupied before the first time-domain resource, and the L0 is the maximum value of the number of first-type resources simultaneously supported by the first node.

[0580] As one embodiment, the L1 is equal to the L0 minus the total number of first-type resources occupied before the first time-domain resource, and the L0 is the total number of first-type resources.

[0581] As one embodiment, the L1 is equal to the L0 minus the total number of first-type resources occupied before the first time-domain resource, and the L0 is the maximum value of the number of occupied first-type resources.

[0582] As one embodiment, the total number of first-type resources occupied before the first time-domain resource refers to the total number of first-type resources occupied before the first time-domain resource on a first carrier or a first serving cell.

[0583] As one subembodiment of the above embodiment, the first carrier is one component carrier of the first node.

[0584] As one subembodiment of the above embodiment, the first carrier is a downlink carrier.

[0585] As one subembodiment of the above embodiment, the first carrier is a downlink carrier, and the second report is transmitted in an uplink carrier corresponding to the first carrier.

[0586] As one subembodiment of the above embodiment, the first serving cell is one SpCell or SCell.

[0587] As one subembodiment of the above embodiment, the second report is transmitted in the first serving cell.

[0588] As one subembodiment of the above embodiment, the first carrier or the first serving cell is indicated by the first signaling.

[0589] As one subembodiment of the above embodiment, the second report indicates the first carrier or the first serving cell.

[0590] As one embodiment, the benefits of the above method include that the number of unoccupied first-type resources is reported separately for different carriers or serving cells, which optimizes the performance of each carrier or serving cell.

[0591] As one embodiment, the total number of first-type resources occupied before the first time-domain resource is the total number of first-type resources occupied before the first time-domain resource on all carriers or all serving cells.

[0592] As one subembodiment of the above embodiment, the all carriers or the all serving cells belong to the same frequency range.

[0593] As one subembodiment of the above embodiment, the all carriers are all component carriers of the first node.

[0594] As one subembodiment of the above embodiment, the all carriers are all component carriers in an MCG or an SCG.

[0595] As one subembodiment of the above embodiment, the all carriers are all component carriers within one frequency band or frequency band combination.

[0596] As one subembodiment of the above embodiment, the all serving cells are all serving cells configured by the first node.

[0597] As one subembodiment of the above embodiment, the all serving cells form an MCG or an SCG.

[0598] As one subembodiment of the above embodiment, the all serving cells are all serving cells within one frequency band or frequency band combination.

[0599] As one embodiment, the benefits of the above method include that different carriers or serving cells can share the first-type resources, which improves the utilization of the first-type resources.

[0600] As an embodiment, the total number of the first type of resources occupied before the first time domain resource is equal to the sum of K values, the K is a positive integer greater than 1; the K values and K carriers or K serving cells correspond to each other, the K carriers or the K serving cells and K time pools correspond to each other, the K time pools overlap with each other in pairs, and the starting time of any time pool in the K time pools is earlier than the first time domain resource; the K values are respectively the number of the first type of resources occupied in the corresponding time pool on the K carriers or the K serving cells.

[0601] As a sub-embodiment of the above embodiment, the K carriers are all component carriers of the first node.

[0602] As a sub-embodiment of the above embodiment, the K carriers are all component carriers in the MCG or the SCG.

[0603] As a sub-embodiment of the above embodiment, the K carriers are all component carriers in one frequency band or frequency band combination.

[0604] As a sub-embodiment of the above embodiment, the K serving cells are all serving cells of the first node.

[0605] As a sub-embodiment of the above embodiment, the K serving cells form a MCG or a SCG.

[0606] As a sub-embodiment of the above embodiment, the K serving cells are all serving cells in one frequency band or frequency band combination.

[0607] As a sub-embodiment of the above embodiment, the K time pools are K time slots respectively.

[0608] As a sub-embodiment of the above embodiment, the K time pools are K symbols respectively.

[0609] As a sub-embodiment of the above embodiment, the K time pools all overlap with the same time point.

[0610] As a sub-embodiment of the above embodiment, the K time pools include a common time point.

[0611] As a sub-embodiment of the above embodiment, at least one time pool in the K time pools includes the starting time of the first time domain resource.

[0612] As a sub-embodiment of the above embodiment, at least one time pool in the K time pools overlaps with the first time domain resource.

[0613] As one subembodiment of the above embodiment, any of the K time pools includes a starting time of the first time-domain resource.

[0614] As one subembodiment of the above embodiment, any of the K time pools overlaps with the first time-domain resource.

[0615] Embodiment 10

[0616] Embodiment 10 illustrates a diagram of a downlink transmission rate on a first time-domain resource according to one embodiment of the present application, as shown in FIG. 10. In Embodiment 10, the downlink transmission rate on the first time-domain resource is a sum of S numbers of bits divided by a first time length, the S numbers of bits respectively correspond to S TBs, the S TBs are in S1 PDSCHs, the S1 PDSCHs are scheduled in a same time slot of a same cell, the first time-domain resource belongs to the same time slot; the S and the S1 are positive integers respectively. In FIG. 10, the S numbers of bits are respectively denoted as a number of bits #0, …, a number of bits #(S-1).

[0617] As one embodiment, the first time-domain resource is one symbol in the same time slot.

[0618] As one embodiment, the first time-domain resource is a first symbol of the same time slot.

[0619] As one embodiment, the first time-domain resource is the same time slot.

[0620] As one embodiment, the S is equal to 1.

[0621] As one embodiment, the S is greater than 1.

[0622] As one embodiment, the S1 is equal to 1.

[0623] As one embodiment, the S1 is greater than 1.

[0624] As one embodiment, any of the S TBs is carried by one of the S1 PDSCHs.

[0625] As one embodiment, any of the S1 PDSCHs carries at least one of the S TBs.

[0626] As one embodiment, the S1 is equal to 1, the S1 PDSCHs include two PDSCH transmission occasions, the two PDSCH transmission occasions are located in the same time slot in time domain.

[0627] As an embodiment, the S1 is greater than 1, and the S1 PDSCHs overlap with each other in time domain.

[0628] As an embodiment, the S1 is greater than 1, and the S1 PDSCHs overlap in time domain.

[0629] As an embodiment, the S1 is equal to 1, and the S TBs are TBs carried by the S1 PDSCHs.

[0630] As an embodiment, the S1 is equal to 1, and the S1 PDSCHs carry the S TBs.

[0631] As an embodiment, the S1 is greater than 1, and the S TBs include TBs carried by each of the S1 PDSCHs.

[0632] As an embodiment, the S1 is greater than 1, and the S TBs consist of TBs carried by each of the S1 PDSCHs.

[0633] As an embodiment, the S bit numbers depend on bit numbers of TBs of the PDSCHs transmitted in the same time slot.

[0634] As an embodiment, the S bit numbers respectively depend on bit numbers of the S TBs.

[0635] As an embodiment, the S bit numbers respectively are bit numbers of the S TBs.

[0636] As an embodiment, the S bit numbers respectively are bit numbers of the S TBs transmitted in the same time slot.

[0637] As an embodiment, any bit number of the S bit numbers is equal to a value obtained by dividing a bit number of a corresponding TB by a CB number of the corresponding TB and then rounding off, multiplied by a CB number of the corresponding TB scheduled.

[0638] As an embodiment, the rounding off includes rounding off downward.

[0639] As an embodiment, the first time length is a positive real number.

[0640] As an embodiment, the first time length depends on a symbol number allocated to the S TBs.

[0641] As an embodiment, the first time length depends on a number of symbols allocated to PDSCHs in the same time slot.

[0642] As an embodiment, the first time length is a total length of symbols allocated to PDSCHs in the same time slot.

[0643] As an embodiment, the first time length is a total duration of symbols allocated to PDSCHs in the same time slot.

[0644] As an embodiment, the unit of the first time length is second.

[0645] As an embodiment, the unit of the first time length is millisecond or microsecond.

[0646] As an embodiment, the first time length is expressed as a number of symbols.

[0647] As an embodiment, the S1 PDSCHs include two PDSCH transmission occasions, the two PDSCH transmission occasions are located in the same time slot in time domain, and the first time length is equal to a number of symbols of one of the two PDSCH transmission occasions multiplied by a first parameter.

[0648] As an embodiment, the S1 PDSCHs overlap with each other in time domain two by two, and the first time length is equal to a total number of symbols of the S1 PDSCHs multiplied by a first parameter.

[0649] As an embodiment, the first parameter is a positive real number.

[0650] As an embodiment, the first parameter is a duration of one symbol on the same cell.

[0651] As an embodiment, the first parameter is an average duration of one symbol on the same cell.

[0652] As an embodiment, the first parameter is equal to 10 raised to the power of -3 divided by a first integer and divided by 2 raised to the power of a downlink subcarrier spacing configuration, the first integer is a number of symbols included per time slot, and the downlink subcarrier spacing configuration is a downlink subcarrier spacing configuration of the S1 PDSCHs.

[0653] As an embodiment, the downlink subcarrier spacing configuration is one of 0, 1, 2, 3, 4, 5, 6.

[0654] As an embodiment, the number of bits of one TB includes a number of CRC bits.

[0655] As an embodiment, the number of bits of one TB includes a number of transport block CRC bits of this TB.

[0656] As an embodiment, the number of bits of one TB does not include the number of code block CRC bits.

[0657] As an embodiment, the number of bits of one TB is defined in section 7.2.1 of 3GPP TS 38.212.

[0658] Embodiment 11

[0659] Embodiment 11 illustrates a diagram of downlink transmission rate on a first time domain resource according to an embodiment of the present application; as shown in FIG. 11. In embodiment 11, the downlink transmission rate on the first time domain resource is a sum of J transmission rates, the J is a positive integer greater than 1, the J transmission rates respectively correspond to J time slots, the J transmission rates respectively correspond to J cells, and the J time slots overlap; the J transmission rates respectively correspond to J numbers of bits, the J transmission rates respectively correspond to J lengths of time, and any transmission rate of the J transmission rates is equal to the corresponding number of bits divided by the corresponding length of time. In FIG. 11, the J transmission rates are respectively denoted as transmission rate #0, …, transmission rate #(J-1); the number of bits and the length of time corresponding to the transmission rate #i are respectively denoted as number of bits #i and length of time #i; the i is any integer in 0, …, J-1.

[0660] Typically, the J does not exceed 32.

[0661] As an embodiment, the J time slots are respectively time slots in the J cells.

[0662] As an embodiment, the J transmission rates are respectively downlink data rates in the J time slots.

[0663] As an embodiment, any transmission rate of the J transmission rates is a downlink data rate in a corresponding time slot in a cell to which the transmission rate corresponds.

[0664] As an embodiment, the J transmission rates respectively depend on the number of bits of all TBs or CBs transmitted in the J time slots.

[0665] As an embodiment, the J transmission rates are respectively total numbers of bits of all TBs or CBs transmitted in the J time slots divided by the corresponding lengths of time.

[0666] As an embodiment, the J time slots overlapping means that the J time slots all overlap with a same time point.

[0667] As an embodiment, the J time slots overlapping means that the J time slots include a common time point.

[0668] As one embodiment, any of the J numbers of bits depends on the number of bits of all TBs or CBs transmitted in the corresponding time slot.

[0669] As one embodiment, any of the J numbers of bits depends on the sum of the numbers of bits of scheduled CBs of all TBs transmitted in the corresponding time slot.

[0670] As one embodiment, the number of bits of a scheduled CB of one TB is equal to the number of bits of the one TB divided by the number of CBs of the one TB, rounded down, multiplied by the number of scheduled CBs of the one TB.

[0671] As one embodiment, the first number of bits is any of the J numbers of bits, the first number of bits is the sum of S2 numbers of bits, S2 is a positive integer, each of the S2 numbers of bits corresponds to a TB, each of the S2 numbers of bits is equal to the number of bits of the corresponding TB divided by the number of CBs of the corresponding TB, rounded down, multiplied by the number of scheduled CBs of the corresponding TB; the S2 TBs are TBs transmitted in the time slot corresponding to the first number of bits among the J time slots.

[0672] As one sub-embodiment of the above embodiment, S2 is equal to 1.

[0673] As one sub-embodiment of the above embodiment, S2 is greater than 1.

[0674] As one sub-embodiment of the above embodiment, the S2 TBs are all TBs transmitted in the corresponding time slot.

[0675] As one sub-embodiment of the above embodiment, the S2 TBs are all TBs transmitted in the corresponding time slot, and if one TB has two PDSCH transmission occasions in the corresponding time slot, each PDSCH transmission occasion is counted separately.

[0676] As one sub-embodiment of the above embodiment, any of the S2 TBs is transmitted in PDSCH.

[0677] As one embodiment, the J time lengths respectively depend on the subcarrier spacing configurations of the J cells.

[0678] As one embodiment, the J time lengths are respectively the lengths of one time slot in the J cells.

[0679] As an embodiment, any of the J time lengths is a length of one slot in a subcarrier spacing configuration of PDSCH transmitted in a corresponding slot.

[0680] As an embodiment, the unit of the J time lengths is second respectively.

[0681] As an embodiment, the unit of the J time lengths is millisecond or microsecond respectively.

[0682] As an embodiment, any of the J time lengths is equal to 10 raised to the power of -3 divided by 2 raised to the power of a given subcarrier spacing configuration, the given subcarrier spacing configuration being a subcarrier spacing configuration of PDSCH transmitted in a slot corresponding to this time length.

[0683] As an embodiment, the rounding includes rounding down.

[0684] As an embodiment, the subcarrier spacing configuration is one of 0, 1, 2, 3, 4, 5, 6.

[0685] As an embodiment, any of the J cells is a SpCell or a SCell of the first node.

[0686] As an embodiment, the J cells employ a same RAT (Radio Access Technology), e.g., 6G, or 5G.

[0687] As an embodiment, the J cells belong to a same frequency range.

[0688] As an embodiment, the J cells are all serving cells of the first node configured.

[0689] As an embodiment, the J cells are serving cells of the first node configured belonging to a same frequency range.

[0690] As an embodiment, the J consists of all serving cells of the first node configured belonging to a same frequency range.

[0691] As an embodiment, the J cells consist of one MCG or SCG.

[0692] As an embodiment, the J cells belong to one MCG or SCG.

[0693] As an embodiment, the J cells are within one Band or Band Combination.

[0694] As one embodiment, the number of bits of a TB includes the number of CRC bits.

[0695] As one embodiment, the number of bits of a TB includes the number of transport block CRC bits of the TB.

[0696] As one embodiment, the number of bits of a TB does not include the number of code block CRC bits.

[0697] As one embodiment, the number of bits of a TB is defined in section 7.2.1 of 3GPP TS 38.212.

[0698] Embodiment 12

[0699] Embodiment 12 illustrates a diagram of a second report triggered by an event in a first set of events according to an embodiment of the present application; as shown in FIG. 12. In embodiment 12, the first set of events includes at least one of: a change in the number of occupied first-type resources is greater than a second threshold; at least one first-type operation is activated or deactivated, the first-type operation including inference; at least one first-type operation is deployed or redeployed, the first-type operation including inference; at least one first-type function is activated or deactivated, the first-type function relying on inference; a first timer expires.

[0700] As one embodiment, the first set of events includes one or more events.

[0701] As one embodiment, the second report is triggered by an event in the first set of events.

[0702] As one embodiment, the second report is triggered by multiple events in the first set of events.

[0703] As one preferred embodiment, the second report is triggered by any event in the first set of events.

[0704] As one embodiment, occurrence of any event in the first set of events triggers the second report.

[0705] As one embodiment, the second report is triggered when any event in the first set of events occurs.

[0706] As one embodiment, the second report is triggered in response to occurrence of any event in the first set of events.

[0707] As one embodiment, the second report is triggered with occurrence of any event in the first set of events.

[0708] As one embodiment, the second report is triggered when an event of the first set of events occurs.

[0709] As one embodiment, the second report is triggered in response to an event of the first set of events occurring.

[0710] As one embodiment, the second report is triggered in conjunction with an event of the first set of events occurring.

[0711] As one embodiment, the first set of events includes a first event comprising a change in a quantity of a first type of resource being occupied greater than a second threshold.

[0712] As one embodiment, the first set of events includes a second event comprising at least one first type of operation being activated or deactivated, the first type of operation comprising inference.

[0713] As one embodiment, the first set of events includes a third event comprising at least one first type of operation being deployed or redeployed, the first type of operation comprising inference.

[0714] As one embodiment, the first set of events includes a fourth event comprising at least one first type of function being activated or deactivated, the first type of function relying on inference.

[0715] As one embodiment, the first set of events includes a fifth event comprising a first timer expiring.

[0716] As one embodiment, the first set of events includes at least one of the first event, the second event, the third event, the fourth event, and the fifth event.

[0717] As one embodiment, the first set of events includes the first event and the second event.

[0718] As one embodiment, the first set of events includes the first event and the third event.

[0719] As one embodiment, the first set of events includes the first event and the fourth event.

[0720] As one embodiment, the first set of events includes the first event and the fifth event.

[0721] As one embodiment, the first set of events includes the second event, the third event and the fifth event.

[0722] As one embodiment, the first set of events includes the second event, the fourth event and the fifth event.

[0723] As one embodiment, the first set of events includes the first event, the second event, the third event, the fourth event and the fifth event.

[0724] Embodiment 13

[0725] Embodiment 13 illustrates a diagram of a first set of events according to one embodiment of the present application; as shown in FIG. 13. In embodiment 13, the first set of events includes a first event, the first event includes a change in the number of occupied first-type resources greater than a second threshold.

[0726] As one embodiment, the second threshold is configurable.

[0727] As one embodiment, the second threshold is configured by RRC signaling.

[0728] As one embodiment, the second threshold depends on configuration of a higher layer parameter.

[0729] As one embodiment, the second threshold depends on capability of the first node.

[0730] As one embodiment, the second threshold is reported by the first node through a UE capability IE.

[0731] As one embodiment, the change greater than the second threshold means that the absolute value of the change is greater than the second threshold.

[0732] As one embodiment, the change in the number of occupied first-type resources includes a change in the total number of occupied first-type resources across all carriers or all serving cells.

[0733] As one embodiment, the benefit of the above method includes saving reporting overhead.

[0734] As one embodiment, the benefit of the above method includes improving utilization of the first-type resources.

[0735] As one embodiment, the change in the number of occupied first-type resources includes a change in the total number of occupied first-type resources across one carrier or one serving cell.

[0736] As one embodiment, the benefit of the above method includes achieving a better balance among complexity, reporting overhead and performance.

[0737] As one embodiment, the change in the number of occupied first-type resources includes a change in the number of first-type resources occupied by an operation that includes inference.

[0738] As one embodiment, the change in the number of occupied first-type resources includes a change in the number of first-type resources occupied by one execution of an operation that includes inference.

[0739] As one embodiment, the change in the number of occupied first-type resources includes a change in the number of first-type resources occupied by a function that relies on inference.

[0740] As one embodiment, the benefits of the above method include more accurate and detailed reporting, facilitating global optimization on the network side.

[0741] As one embodiment, the first event is that the change in the number of occupied first-type resources is greater than the second threshold.

[0742] As one embodiment, the first event is that the change in the number of occupied first-type resources is greater than the second threshold within two adjacent time slots.

[0743] As one embodiment, the first event is that the change in the number of occupied first-type resources is greater than the second threshold within adjacent time-domain resources occupied by PDSCH.

[0744] As one embodiment, the first event is that the change in the number of occupied first-type resources is greater than the second threshold under a given downlink rate condition.

[0745] As one embodiment, under a given downlink rate condition means under the condition that the downlink transmission rate is equal to the given downlink rate.

[0746] As one embodiment, under a given downlink rate condition means when the downlink transmission rate is equal to the given downlink rate.

[0747] As one embodiment, the unit of the given downlink rate is Mbps (Megabits per second).

[0748] As one embodiment, the unit of the given downlink rate is Gbps or Mbpms (Megabits per millisecond).

[0749] As one embodiment, the given downlink rate is configurable.

[0750] As one embodiment, the given downlink rate is configured by higher layer signaling.

[0751] As an embodiment, the given downlink rate is RRC signaling configured.

[0752] As an embodiment, the given downlink rate depends on the capability of the first node.

[0753] As an embodiment, the given downlink rate depends on UE capability indication.

[0754] As an embodiment, the given downlink rate is reported by the first node through UE capability IE.

[0755] As an embodiment, the given downlink rate is fixed.

[0756] As an embodiment, the given downlink rate is fixed as 1 Mbps.

[0757] As an embodiment, the given downlink rate is fixed as 10 Mbps or 1 Kbps.

[0758] As an embodiment, the first node and the second report have consensus on the given downlink rate.

[0759] As an embodiment, the first event set includes a first event that the change of the number of first type resources occupied by downlink data reception under the given downlink rate condition is greater than the second threshold.

[0760] As an embodiment, the downlink data includes PDSCH.

[0761] As an embodiment, the downlink data includes downlink TB and downlink CB.

[0762] As an embodiment, the downlink data reception includes one or more of channel estimation, MIMO reception, demodulation, channel decoding and CRC check.

[0763] As an embodiment, the first type resource occupied by downlink data reception refers to the first type resource occupied by inference used by downlink data reception.

[0764] As an embodiment, the first type resource occupied by downlink data reception includes the first type resource occupied by calculation or processing required by inference used by downlink data reception.

[0765] As an embodiment, the first type resource occupied by downlink data reception includes the first type resource occupied by storage required by inference used by downlink data reception.

[0766] As an embodiment, the given downlink rate is less than a maximum data rate supported under the current configuration; and the current configuration includes one or more of a number of aggregated carriers, a maximum modulation order, and a maximum number of layers.

[0767] As an embodiment, the maximum data rate supported under the current configuration refers to a maximum downlink data rate supported under the current configuration.

[0768] As an embodiment, the given downlink rate and the maximum data rate supported under the current configuration are determined separately.

[0769] As an embodiment, the given downlink rate is configured by RRC signaling, and the maximum data rate supported under the current configuration is determined by the first node according to the current configuration.

[0770] As an embodiment, the given downlink rate is fixed, and the maximum data rate supported under the current configuration is determined by the first node according to the current configuration.

[0771] As an embodiment, the maximum data rate supported under the current configuration is calculated by the first node according to a supported frequency band or a frequency band combination.

[0772] As an embodiment, the maximum data rate supported under the current configuration is calculated by the first node for a given number of aggregated carriers in a frequency band or a frequency band combination.

[0773] As an embodiment, the maximum data rate supported under the current configuration is a maximum value among maximum data rates calculated by the first node for each supported frequency band or frequency band combination.

[0774] As an embodiment, the maximum data rate supported under the current configuration is calculated according to a method in 4.1.2 of 3GPP TS 8.306, according to the current configuration.

[0775] As an embodiment, the maximum data rate supported under the current configuration is in units of Mbps (Megabits per second).

[0776] As an embodiment, the maximum data rate supported under the current configuration is in units of Gbps or Mbpms (Megabits per millisecond).

[0777] As an embodiment, the first set of events includes a first event that a change in a number of first type resources occupied by two adjacent CSI reports is greater than the second threshold.

[0778] As one embodiment, the first set of events includes a first event that a number of first type of resources occupied by two adjacent CSI reporting for a same CSI reporting configuration changes by more than the second threshold.

[0779] As one embodiment, the first set of events includes a first event that a number of first type of resources occupied by at least one function in a first set of functions changes by more than the second threshold, the first set of functions including at least one function, any function in the first set of functions relying on inference.

[0780] As one sub-embodiment to the above embodiment, any function in the first set of functions is implemented through inference.

[0781] As one sub-embodiment to the above embodiment, a function in the first set of functions includes generation, update or computation of CSI.

[0782] As one sub-embodiment to the above embodiment, a function in the first set of functions includes one or more of CSI compression, CSI prediction or beam management.

[0783] As one sub-embodiment to the above embodiment, a function in the first set of functions includes data reception.

[0784] As one sub-embodiment to the above embodiment, a function in the first set of functions includes PDSCH reception.

[0785] As one sub-embodiment to the above embodiment, a function in the first set of functions includes one or more of channel estimation, MIMO reception, demodulation, channel decoding and CRC check.

[0786] As one sub-embodiment to the above embodiment, a function in the first set of functions includes positioning.

[0787] As one sub-embodiment to the above embodiment, a function in the first set of functions includes scheduling.

[0788] As one sub-embodiment to the above embodiment, a function in the first set of functions includes semantic-based error correction.

[0789] Embodiment 14

[0790] Embodiment 14 illustrates a diagram of a first set of events of one embodiment of the present application; as shown in FIG. 14. In embodiment 14, the first set of events includes a second event that includes at least one first type of operation being activated or deactivated, the first type of operation including inference.

[0791] As one embodiment, each of the at least one first type of operation comprises inference.

[0792] As one embodiment, the first type of operation is based on training.

[0793] As one embodiment, each of the at least one first type of operation is based on training.

[0794] As one embodiment, the first type of operation is obtained by training.

[0795] As one embodiment, the models of the first type of operation are all obtained by training.

[0796] As one embodiment, the first type of operation comprises AI inference.

[0797] As one embodiment, the first type of operation is inference.

[0798] As one embodiment, the first type of operation comprises AI entity.

[0799] As one embodiment, the first type of operation comprises AI entity for inference.

[0800] As one embodiment, the first type of operation comprises a part of AI entity for inference.

[0801] As one embodiment, the first type of operation is executed by AI entity or AI function.

[0802] As one embodiment, the first type of operation is executed by AI entity or AI function deployed on the first node.

[0803] As one embodiment, the first type of operation is based on artificial intelligence or machine learning.

[0804] As one embodiment, the first type of operation is based on neural network.

[0805] As one embodiment, the at least one first type of operation comprises AI inference for CSI.

[0806] As one embodiment, the at least one first type of operation comprises AI inference for data reception.

[0807] As one embodiment, the at least one first type of operation comprises AI inference for positioning.

[0808] As one embodiment, the at least one first type of operation comprises AI inference for scheduling.

[0809] As one embodiment, the at least one first type of operation comprises AI inference for semantic based error correction.

[0810] As one embodiment, the output of the at least one first type of operation comprises one or more of channel information, positioning information, recovered TB or CB, and scheduling result.

[0811] As one embodiment, the channel information comprises CSI.

[0812] As one embodiment, the channel information comprises one or more of CQI (Channel quality indicator), PMI (Precoding Matrix Indicator), CRI (CSI-RS Resource Indicator), LI (Layer Indicator), RI (Rank Indicator), SSBRI (SS / PBCH Block Resource Indicator), RSRP (Reference Signal received power), SINR (Signal-to-Interference and Noise Ratio), Capability Index, and TDCP (Time Domain Channel Properties).

[0813] As one embodiment, the channel information comprises compressed CSI.

[0814] As one embodiment, the channel information comprises predicted CSI.

[0815] As one embodiment, the at least one first type of operation is deployment requiring.

[0816] As one embodiment, part or all of the at least one first type of operation is obtained from onboarding from a serving cell of the first node.

[0817] As one embodiment, part or all of the at least one first type of operation is obtained from onboarding from a core network.

[0818] As one embodiment, the at least one first type of operation is deployment non-requiring.

[0819] As one embodiment, a portion of the at least one first type of operation is deployment required and another portion is not deployment required.

[0820] As one embodiment, the first type of resource is used to perform the first type of operation.

[0821] As one embodiment, the first node uses the first type of resource for computation or storage required by the first type of operation.

[0822] As one embodiment, the first node uses the first type of resource for both computation and storage required by the first type of operation.

[0823] As one embodiment, each of the at least one first type of operation is associated to an identity.

[0824] As one sub-embodiment of the above embodiment, activating or deactivating one first type of operation refers to activating or deactivating the identity associated to the one first type of operation.

[0825] As one sub-embodiment of the above embodiment, any of the at least one first type of operation is identified by the identity associated to the one first type of operation.

[0826] As one sub-embodiment of the above embodiment, the model of any of the at least one first type of operation is identified by the identity associated to the one first type of operation.

[0827] As one sub-embodiment of the above embodiment, the AI entity or AI function to which any of the at least one first type of operation belongs is identified by the identity associated to the one first type of operation.

[0828] As one sub-embodiment of the above embodiment, for any of the at least one first type of operation, the AI function or AI entity performing the one first type of operation is identified by the identity associated to the one first type of operation.

[0829] As one sub-embodiment of the above embodiment, the training of any of the at least one first type of operation is identified by the identity associated to the one first type of operation.

[0830] As one sub-embodiment of the above embodiment, the data set of the training of any of the at least one first type of operation is identified by the identity associated to the one first type of operation.

[0831] As one embodiment, for activation or deactivation of each of the at least one first type of operation, the first node and the second reported target receiver have consensus.

[0832] As an embodiment, the above method has the benefit of simplifying system design.

[0833] As an embodiment, the above method has the benefit of further optimizing performance.

[0834] As an embodiment, the activation or deactivation of the at least one first-type operation is indicated to the first node.

[0835] As an embodiment, the above method has the benefit of supporting joint optimization, further improving system performance.

[0836] As an embodiment, the first node determines the activation or deactivation of the at least one first-type operation by itself.

[0837] As an embodiment, the above method has the benefit of better flexibility, adapting to different terminals.

[0838] As an embodiment, the above method has the benefit of reducing air interface overhead.

[0839] As an embodiment, the activation or deactivation of a part of the at least one first-type operation is determined by the first node by itself, and the activation or deactivation of another part of the at least one first-type operation is indicated to the first node.

[0840] As an embodiment, the above method has the benefit of achieving a better balance between performance, flexibility and air interface overhead.

[0841] Generally, how the first node determines whether a first-type operation is activated or deactivated is determined by hardware vendors by themselves. Some non-limiting embodiments are introduced as follows:

[0842] As an embodiment, the first node determines whether a first-type operation is deactivated by monitoring whether the first-type operation reaches a performance target.

[0843] As an embodiment, the first node determines whether a first-type operation is activated by performing ML test or ML evaluation on a model of the first-type operation.

[0844] As an embodiment, the first node determines whether a first-type operation is deactivated by comparing the distribution characteristics of the output of the first-type operation in the inference stage and the distribution characteristics of the output obtained by inputting the data in the training data set.

[0845] As one embodiment, the first node determines whether the one first type of operation is activated or deactivated according to whether a timer corresponding to the one first type of operation expires.

[0846] As one embodiment, the second event is at least one first type of operation being activated or deactivated, the first type of operation comprising reasoning.

[0847] Embodiment 15

[0848] Embodiment 15 illustrates a diagram of a first set of events according to one embodiment of the present application; as shown in FIG. 15. In embodiment 15, the first set of events comprises a third event, the third event comprising at least one first type of operation being deployed or redeployed, the first type of operation comprising reasoning.

[0849] In FIG. 15, a given operation is one of the at least one first type of operation, the first node makes a request to a first producer to load the given operation, and obtains the given operation from the first producer.

[0850] Embodiments of the first type of operation are with reference to embodiment 14.

[0851] As one embodiment, each of the at least one first type of operation comprises reasoning.

[0852] As one embodiment, the given operation is any of the at least one first type of operation.

[0853] As one embodiment, the deployment comprises obtaining the given operation.

[0854] As one embodiment, the deployment comprises obtaining an AI entity.

[0855] As one embodiment, the deployment comprises obtaining an AI entity that executes the given operation.

[0856] As one embodiment, the deployment comprises obtaining an AI entity that comprises an AI function that executes the given operation.

[0857] As one embodiment, the deployment comprises obtaining an AI function.

[0858] As one embodiment, the deployment comprises obtaining an AI function that executes the given operation.

[0859] As one embodiment, the deployment comprises loading the given operation.

[0860] As one embodiment, the deployment includes a request to load the given operation.

[0861] As one embodiment, the request in Figure 15 is a request to load the given operation by the first node.

[0862] As one embodiment, the response in Figure 15 is a response to the request to load the given operation by the first node.

[0863] As one embodiment, the first node obtains the given operation by the response in Figure 15.

[0864] As one embodiment, the first node obtains a model of the given operation by the response in Figure 15.

[0865] As one embodiment, the first node obtains an AI entity including an AI function to perform the given operation by the response in Figure 15.

[0866] As one embodiment, the first node obtains an AI function to perform the given operation by the response in Figure 15.

[0867] As one embodiment, the first producer provides the given operation to the first node by the response in Figure 15.

[0868] As one embodiment, the first producer provides a model of the given operation to the first node by the response in Figure 15.

[0869] As one embodiment, the first producer provides an AI entity including an AI function to perform the given operation to the first node by the response in Figure 15.

[0870] As one embodiment, the first producer provides an AI function to perform the given operation to the first node by the response in Figure 15.

[0871] As one embodiment, the deployment is done by an AI function.

[0872] As one embodiment, the deployment is done by an AI function deployed at the first node.

[0873] As one embodiment, the deployment is done by an AI deployment function.

[0874] As one embodiment, the deployment is done by an AI deployment function deployed at the first node.

[0875] As one embodiment, the deployment is done by an AI inference function.

[0876] As one embodiment, the deployment is done by an AI inference function deployed at the first node.

[0877] As one embodiment, the deployment is done by an AI entity.

[0878] As one embodiment, the deployment is done by an AI entity deployed at the first node.

[0879] As one embodiment, the deployment is done by an AI entity having a deployment function.

[0880] As one embodiment, the deployment is done by an AI entity having a deployment function deployed at the first node.

[0881] As one embodiment, the deployment is done by an AI entity having an inference function.

[0882] As one embodiment, the deployment is done by an AI entity having an inference function deployed at the first node.

[0883] As one embodiment, the first producer generates and provides an AI model.

[0884] As one embodiment, the first producer generates and provides an AI entity.

[0885] As one embodiment, the first producer generates and provides an AI function.

[0886] As one embodiment, the first producer is a producer of the given operation.

[0887] As one embodiment, the first producer is a producer of the training of the given operation.

[0888] As one embodiment, the first producer comprises an AI entity producer.

[0889] As one embodiment, the first producer comprises an AI function producer.

[0890] As one embodiment, the first producer comprises an AI deployment producer.

[0891] As one embodiment, the first producer comprises an AI inference producer.

[0892] As one embodiment, the first producer comprises an AI training producer.

[0893] As one embodiment, the first producer comprises an AI inference producer.

[0894] As one embodiment, the first producer comprises a producer of training of an AI model.

[0895] As one embodiment, the first producer comprises an MnS (Management Service) producer.

[0896] As one embodiment, the first producer is a serving cell of the first node.

[0897] As one embodiment, the first producer is a serving cell of the first node.

[0898] As one embodiment, the first producer is a core network.

[0899] As one embodiment, the training of the given operation is performed by the first producer.

[0900] As one embodiment, the third event is at least one first type of operation being deployed or redeployed, the first type of operation comprising inference.

[0901] Embodiment 16

[0902] Embodiment 16 illustrates a schematic diagram of a first set of events according to one embodiment of the application; as shown in Figure 16. In embodiment 16, the first set of events comprises a fourth event, the fourth event comprising at least one first type of function being activated or deactivated, the first type of function relying on inference.

[0903] As one embodiment, each of the at least one first type of function relies on inference.

[0904] As one embodiment, the first type of function comprises an AI or ML based function.

[0905] As one embodiment, the first type of function comprises a function that can be implemented with inference.

[0906] As one embodiment, the first type of function is based on AI or ML.

[0907] As one embodiment, the first type of function is implemented through inference.

[0908] As one embodiment, each of the at least one first type of function is implemented through inference.

[0909] As one embodiment, the first type of function can be implemented through inference or through a scheme that does not include inference.

[0910] As one embodiment, a candidate of the scheme employed by the first type of function includes inference.

[0911] As one embodiment, a candidate of the scheme employed by the first type of function includes inference and a scheme other than inference.

[0912] As one embodiment, the first type of function includes generation, update, or computation of CSI.

[0913] As one embodiment, the first type of function includes one or more of CSI compression, CSI prediction, or beam management.

[0914] As one embodiment, the first type of function includes data reception.

[0915] As one embodiment, the first type of function includes PDSCH reception.

[0916] As one embodiment, the first type of function includes one or more of channel estimation, MIMO reception, demodulation, channel decoding, and CRC check.

[0917] As one embodiment, the first type of function includes positioning.

[0918] As one embodiment, the first type of function includes scheduling.

[0919] As one embodiment, the first type of function includes semantic-based error correction.

[0920] As one embodiment, any function in the first set of functions is a first type of function.

[0921] As one embodiment, for activation or deactivation of each of the at least one first type of function, the first node and the second reported target receiver have consensus.

[0922] As one embodiment, the above method has the benefit of simplifying system design.

[0923] As one embodiment, the above method has the benefit of further optimizing performance.

[0924] As an embodiment, the activation or deactivation of the at least one first type of function is indicated to the first node.

[0925] As an embodiment, the benefits of the above method include supporting joint optimization, further improving system performance.

[0926] As an embodiment, the first node determines the activation or deactivation of the at least one first type of function by itself.

[0927] As an embodiment, the benefits of the above method include better flexibility, adapting to different terminals.

[0928] As an embodiment, the benefits of the above method include reducing air interface overhead.

[0929] As an embodiment, the activation or deactivation of a part of the at least one first type of function is determined by the first node by itself, and the activation or deactivation of another part of the at least one first type of function is indicated to the first node.

[0930] As an embodiment, the benefits of the above method include achieving a better balance between performance, flexibility and air interface overhead.

[0931] Generally, how the first node determines whether a first type of function is activated or deactivated is determined by the hardware device manufacturer, and some non-limiting embodiments are introduced as follows:

[0932] As an embodiment, the first node determines whether a first type of function is deactivated by monitoring whether the first type of function reaches a performance target.

[0933] As an embodiment, a first type of function has at least one candidate operation, and the first node determines whether the first type of function is deactivated by monitoring the performance of the at least one candidate operation.

[0934] As an embodiment, the first node determines whether a first type of function is deactivated by monitoring whether the performance of each candidate operation of the at least one candidate operation reaches a performance target.

[0935] As an embodiment, the first node determines whether a first type of function is deactivated by monitoring whether the performance of the candidate operation with the worst performance or the smallest number of occupied first type of resources among the at least one candidate operation reaches a performance target.

[0936] As an embodiment, one first type function has at least one candidate operation, and the first node determines whether the one first type function is activated by performing ML test or ML evaluation on a model of the at least one candidate operation.

[0937] As an embodiment, the first node determines whether the one first type function is activated by performing ML test or ML evaluation on a model of each of the at least one candidate operation.

[0938] As an embodiment, the first node determines whether the one first type function is activated by performing ML test or ML evaluation on a model of a candidate operation of the at least one candidate operation that has the best performance or occupies the largest amount of first type resources.

[0939] As an embodiment, one first type function has at least one candidate operation, and the first node determines whether the one first type function is deactivated by comparing a distribution characteristic of an output of the at least one candidate operation in an inference stage and a distribution characteristic of an output obtained by taking data in a training data set as input.

[0940] As an embodiment, the first node determines whether the one first type function is activated or deactivated according to whether a timer corresponding to the one first type function expires.

[0941] As an embodiment, the fourth event is that at least one first type function is activated or deactivated, and the first type function relies on inference.

[0942] Embodiment 17

[0943] Embodiment 17 illustrates a schematic diagram of a first event set according to an embodiment of the present application; as shown in FIG. 17. In embodiment 17, the first event set includes a fifth event, and the fifth event includes expiration of a first timer.

[0944] As an embodiment, the first timer is configurable.

[0945] As an embodiment, the first timer relies on configuration of a higher layer parameter.

[0946] As an embodiment, the first timer is configured by RRC signaling.

[0947] As an embodiment, the first timer relies on capability of the first node.

[0948] As an embodiment, the first timer is reported by the first node on a UE capability IE.

[0949] As an example, the first timer is started or restarted upon the first node sending an indication of a number of unoccupied first-type resources.

[0950] As an example, the first timer is started or restarted upon the first node sending an indication of a number of unoccupied first-type resources.

[0951] As an example, the first timer is started or restarted in response to the first node sending an indication of a number of unoccupied first-type resources.

[0952] As an example, the fifth event is the first timer expiring.

[0953] Embodiment 18

[0954] Embodiment 18 illustrates a diagram of a first signaling triggering a second reporting according to an embodiment of the application; as shown in FIG. 18.

[0955] As an example, the first signaling comprises RRC signaling.

[0956] As an example, the first signaling comprises MAC CE.

[0957] As an example, the first signaling comprises DCI (Downlink Control Information).

[0958] As an example, the first signaling is DCI.

[0959] As an example, the first time-domain resource is dependent on the first signaling.

[0960] As an example, the first signaling indicates the first time-domain resource.

[0961] As an example, the first signaling indicates an interval between the first time-domain resource and a slot where the first signaling is located.

[0962] As an example, the first signaling indicates an interval between the first time-domain resource and a slot where the second reporting is located.

[0963] Embodiment 19

[0964] Embodiment 19 illustrates a diagram of each of the L0 first-type resources comprising one or more first-type sub-resources and one or more second-type sub-resources according to an embodiment of the application; as shown in FIG. 19.

[0965] As an example, the first-type sub-resource is for inference.

[0966] As one embodiment, the first type of sub-resource is used for computation or processing.

[0967] As one embodiment, the first type of sub-resource is used for computation or processing required for inference.

[0968] As one embodiment, the first type of sub-resource is used for storage.

[0969] As one embodiment, the first type of sub-resource comprises storage resource.

[0970] As one embodiment, the first type of sub-resource is used for storage required for inference.

[0971] As one embodiment, the second type of sub-resource is used for storage.

[0972] As one embodiment, the second type of sub-resource is used for storage required for inference.

[0973] As one embodiment, the second type of sub-resource is CSI processing units.

[0974] As one embodiment, the second type of sub-resource comprises storage units or storage space.

[0975] As one embodiment, the second type of sub-resource comprises storage resource.

[0976] As one embodiment, the second type of sub-resource comprises memory.

[0977] As one embodiment, the second type of sub-resource comprises video memory.

[0978] As one embodiment, the second type of sub-resource is used to store part or all parameters of an AI model or ML model.

[0979] As one embodiment, the second type of sub-resource is used to store part or all intermediate results of inference.

[0980] As one embodiment, the second type of sub-resource is used to store part or all outputs of inference.

[0981] As one embodiment, the second type of sub-resource is used to store part or all parameters of an AI model or ML model and part or all intermediate results of inference.

[0982] As one embodiment, the second type of sub-resource is used to store part or all parameters of an AI model or ML model, part or all intermediate results of inference, and part or all outputs of inference.

[0983] As an embodiment, the parameters of the AI model or the ML model include one or more of a convolution kernel size, a number of convolution layers, a convolution stride, a pooling kernel size, a pooling kernel stride, a pooling function, an activation function, and a number of feature maps.

[0984] As an embodiment, the parameters of the AI model or the ML model include one or more of a convolution kernel, a pooling kernel, a pooling function, an activation function, a parameter of the pooling function, and a parameter of the activation function.

[0985] As an embodiment, the first type of sub-resource is used for computation or processing, and the second type of sub-resource is used for storage.

[0986] As an embodiment, the benefits of the above method include better meeting the needs of inference and taking full advantage of AI or ML technology.

[0987] As an embodiment, the first type of sub-resource is used for computation or processing required for inference, and the second type of sub-resource is used for storage required for inference.

[0988] As an embodiment, the first type of sub-resource is used for inference, and the second type of sub-resource is a CSI processing unit.

[0989] As an embodiment, the benefits of the above method include making full use of existing CSI processing units and improving utilization.

[0990] As an embodiment, the first type of sub-resource is used for inference, and the second type of sub-resource is used for CSI computation or CSI processing.

[0991] As an embodiment, the first type of sub-resource is used for storage, and the second type of sub-resource is used for CSI computation or CSI processing.

[0992] As an embodiment, the benefits of the above method include making full use of existing CSI processing units and improving utilization.

[0993] As an embodiment, at least two of the L0 first type of resources include a different number of first type of sub-resources.

[0994] As an embodiment, at least two of the L0 first type of resources include a different number of second type of sub-resources.

[0995] As an embodiment, any two of the L0 first type of resources include an equal number of first type of sub-resources.

[0996] As an embodiment, any two of the L0 first type of resources include an equal number of second type of sub-resources.

[0997] As one embodiment, a number of first-type sub-resources included in each first-type resource of the L0 first-type resources and a number of second-type sub-resources included in each first-type resource of the L0 first-type resources are unknown to a target recipient of the second report.

[0998] As one embodiment, the first report indicates a number of first-type sub-resources included in each first-type resource of at least some of the L0 first-type resources and a number of second-type sub-resources included in each first-type resource of at least some of the L0 first-type resources.

[0999] As one embodiment, the first report indicates a number of first-type sub-resources included in each first-type resource of the L0 first-type resources and a number of second-type sub-resources included in each first-type resource of the L0 first-type resources.

[1000] As one embodiment, one first-type sub-resource being occupied includes that the one first-type sub-resource is not idle.

[1001] As one embodiment, one first-type sub-resource being occupied includes that the one first-type sub-resource has been used for inference.

[1002] As one embodiment, one first-type sub-resource being occupied includes that the one first-type sub-resource has been used for computation or processing.

[1003] As one embodiment, one first-type sub-resource being occupied includes that the one first-type sub-resource has been used for storage.

[1004] As one embodiment, one first-type sub-resource not being occupied includes that the one first-type sub-resource is idle.

[1005] As one embodiment, one first-type sub-resource not being occupied includes that the one first-type sub-resource has not been used for inference.

[1006] As one embodiment, one first-type sub-resource not being occupied includes that the one first-type sub-resource has not been used for computation or processing.

[1007] As one embodiment, one first-type sub-resource not being occupied includes that the one first-type sub-resource has not been used for storage.

[1008] As one embodiment, one second-type sub-resource being occupied includes that the one second-type sub-resource is not idle.

[1009] As one embodiment, one second-type sub-resource being occupied includes that the one second-type sub-resource has been used for storage.

[1010] As one embodiment, a second-type sub-resource being occupied includes that the one second-type sub-resource has been used for CSI processing.

[1011] As one embodiment, a second-type sub-resource not being occupied includes that the one second-type sub-resource is free.

[1012] As one embodiment, a second-type sub-resource not being occupied includes that the one second-type sub-resource has not been used for storage.

[1013] As one embodiment, a second-type sub-resource not being occupied includes that the one second-type sub-resource has not been used for CSI processing.

[1014] As one embodiment, if a first-type sub-resource is occupied, the one first-type sub-resource cannot be used for new computing or processing requirements; if a first-type sub-resource is not occupied, the one first-type sub-resource can be used for new computing or processing requirements.

[1015] As one embodiment, if a first-type sub-resource is occupied, the one first-type sub-resource cannot be used for new storage requirements; if a first-type sub-resource is not occupied, the one first-type sub-resource can be used for new storage requirements.

[1016] As one embodiment, if a second-type sub-resource is occupied, the one second-type sub-resource cannot be used for new storage requirements; if a second-type sub-resource is not occupied, the one second-type sub-resource can be used for new storage requirements.

[1017] As one embodiment, if a second-type sub-resource is occupied, the one second-type sub-resource cannot be used for new CSI processing requirements; if a second-type sub-resource is not occupied, the one second-type sub-resource can be used for new CSI processing requirements.

[1018] Embodiment 20

[1019] Embodiment 20 illustrates a schematic diagram of indicating at least one of the number of unoccupied first-type sub-resources and the number of unoccupied second-type sub-resources in at least one first-type resource other than L1 first-type resources in L0 first-type resources according to one embodiment of the present application; as shown in FIG. 20.

[1020] As one embodiment, a first-type resource being occupied includes that at least one first-type sub-resource or at least one second-type sub-resource included in the one first-type resource is occupied.

[1021] As one embodiment, one first-type resource being unoccupied includes that each first-type sub-resource and each second-type sub-resource included in the one first-type resource is unoccupied.

[1022] As one embodiment, for any first-type resource among the L0 first-type resources other than the L1 first-type resources, if at least one first-type sub-resource included in this first-type resource is unoccupied, the second report indicates the number of unoccupied first-type sub-resources in this first-type resource; if at least one second-type sub-resource included in this first-type resource is unoccupied, the second report indicates the number of unoccupied second-type sub-resources in this first-type resource.

[1023] As one embodiment, the second report indicates which first-type resource or which first-type resources among the first-type resources other than the L1 first-type resources included in the L0 first-type resources includes unoccupied first-type sub-resource or unoccupied second-type sub-resource.

[1024] As one embodiment, for any first-type resource among the L0 first-type resources other than the L1 first-type resources, the second report indicates the number of unoccupied first-type sub-resources and the number of unoccupied second-type sub-resources in this first-type resource.

[1025] As one sub-embodiment of the above embodiment, the number of unoccupied first-type sub-resources is a non-negative integer, and the number of unoccupied second-type sub-resources is a non-negative integer.

[1026] Embodiment 21

[1027] Embodiment 21 illustrates a schematic diagram of the second report indicating at least one of the number of unoccupied first-type sub-resources and the number of unoccupied second-type sub-resources in at least one first-type resource among the L1 first-type resources according to one embodiment of the present application; as shown in FIG. 21.

[1028] As one embodiment, one first-type resource being occupied includes that all first-type sub-resources and all second-type sub-resources included in the one first-type resource are occupied.

[1029] As one embodiment, one first-type resource being unoccupied includes that at least one first-type sub-resource or at least one second-type sub-resource included in the one first-type resource is unoccupied.

[1030] As one embodiment, for any first-type resource of the LI first-type resources, if at least one first-type sub-resource included in this first-type resource is not occupied, the second report indicates the number of the unoccupied first-type sub-resources in this first-type resource; if at least one second-type sub-resource included in this first-type resource is not occupied, the second report indicates the number of the unoccupied second-type sub-resources in this first-type resource.

[1031] As one embodiment, the second report indicates which first-type resource or which first-type resources of the LI first-type resources include unoccupied first-type sub-resources or unoccupied second-type sub-resources.

[1032] As one embodiment, for any first-type resource of the LI first-type resources, the second report indicates the number of the unoccupied first-type sub-resources and the number of the unoccupied second-type sub-resources in this first-type resource.

[1033] As one sub-embodiment of the above-mentioned embodiment, the number of the unoccupied first-type sub-resources is a non-negative integer, and the number of the unoccupied second-type sub-resources is a non-negative integer.

[1034] Embodiment 22

[1035] Embodiment 22 illustrates a diagram of the second report indicating the difference between N0 and N1 according to one embodiment of the present application; as shown in FIG. 22. In embodiment 22, the N0 is the maximum value of the number of occupied first-type resources associated with the first identifier, and the N1 is the number of occupied first-type resources associated with the first identifier.

[1036] As one embodiment, the N0 and the N1 are positive integers respectively.

[1037] As one embodiment, the N1 depends on the first identifier.

[1038] As one embodiment, the first node determines the N1 according to the first identifier.

[1039] As one embodiment, the N0 depends on the first identifier.

[1040] As one embodiment, the first node determines the N0 according to the first identifier.

[1041] As one embodiment, the N0 and the N1 both depend on the first identifier.

[1042] As one embodiment, the first identifier is a non-negative integer.

[1043] As one embodiment, the first identifier is a string.

[1044] As an embodiment, the first identity is used to identify an AI model.

[1045] As an embodiment, the first identity is used to identify an operation, the operation comprising inference.

[1046] As an embodiment, the first identity is used to identify a function, the function relying on inference.

[1047] As a sub-embodiment of the above embodiment, the function is implemented by inference.

[1048] As a sub-embodiment of the above embodiment, the function is implemented by an operation comprising inference.

[1049] As an embodiment, the occupied first-type resource associated with the first identity refers to the first-type resource occupied by the operation or function identified by the first identity.

[1050] As an embodiment, the N0 is the maximum value of the number of first-type resources occupied by the operation or function identified by the first identity.

[1051] As an embodiment, the N1 is the number of first-type resources occupied by the operation or function identified by the first identity.

[1052] As an embodiment, the first report indicates the N0.

[1053] As an embodiment, the first report indicates the first identity and the N0.

[1054] As an embodiment, the benefit of the above method includes that more information facilitates the network side to further optimize scheduling.

[1055] As an embodiment, the N0 is unknown to the target receiver of the second report.

[1056] As an embodiment, the benefit of the above method includes that different terminals are more flexibly supported.

[1057] As an embodiment, the benefit of the above method includes that air interface overhead is saved.

[1058] As an embodiment, the second report indicates the first identity.

[1059] As an embodiment, the benefit of the above method includes that the design is more flexible, and different application scenarios and different terminals are better adapted.

[1060] As an embodiment, the first signaling indicates the first identity.

[1061] As an embodiment, benefits of the above method include facilitating joint optimization at the network side, further improving performance.

[1062] Embodiment 23

[1063] Embodiment 23 illustrates a schematic diagram of N0 and N1 according to an embodiment of the present application; as shown in FIG. 23. In embodiment 23, the first operation is associated to the first identity, the N0 is the maximum value of the number of first-type resources occupied by the first operation, and the N1 is the number of first-type resources occupied by the first operation.

[1064] As an embodiment, the N1 is the number of first-type resources actually occupied by the first operation.

[1065] As an embodiment, the N1 is the number of first-type resources currently occupied by the first operation.

[1066] As an embodiment, the N1 is the number of first-type resources occupied by one execution of the first operation.

[1067] As an embodiment, the N1 is the number of first-type resources occupied by the most recent execution of the first operation.

[1068] As an embodiment, the N1 is the number of first-type resources occupied by the first operation in the first time-domain resource.

[1069] As an embodiment, the N1 is unknown to the target receiver of the second report.

[1070] As an embodiment, the N1 is unknown to the target receiver of the second report before receiving the second report.

[1071] As an embodiment, the first report indicates the first operation and the N0.

[1072] As an embodiment, benefits of the above method include that more information facilitates further optimization at the network side.

[1073] As an embodiment, the first operation is unknown to the target receiver of the second report.

[1074] As an embodiment, benefits of the above method include more flexible support for different terminals.

[1075] As an embodiment, the second report indicates the first operation.

[1076] As an embodiment, the second report indicates the first identity.

[1077] As one embodiment, the second report indicates the first operation by indicating the first identity.

[1078] As one embodiment, the first operation is associated to the first identity, the first type of resources associated to the first identity being the first type of resources occupied by the first operation.

[1079] As one embodiment, the first operation is based on training.

[1080] As one embodiment, the first operation is obtained by training.

[1081] As one embodiment, the model of the first operation is obtained by training.

[1082] As one embodiment, the training of the first operation is performed by the first node.

[1083] As one embodiment, the training of the first operation is performed by a serving cell of the first node.

[1084] As one embodiment, the training of the first operation is performed by a core network.

[1085] As one embodiment, the training of the first operation is performed by a MDA function.

[1086] As one embodiment, the training of the first operation is performed by a NWDAF.

[1087] As one embodiment, the training of the first operation is performed by a MDAS producer.

[1088] As one embodiment, the training of the first operation is performed by a MnS producer.

[1089] As one embodiment, the first operation comprises an inference.

[1090] As one embodiment, the first operation is an inference.

[1091] As one embodiment, the first operation comprises an AI entity.

[1092] As one embodiment, the first operation comprises a part of an AI entity for inference.

[1093] As one embodiment, the first operation is performed by an AI entity or an AI function.

[1094] As one embodiment, the first operation is performed by an AI entity or an AI function deployed at the first node.

[1095] As one embodiment, the AI function comprises an AI inference function.

[1096] As one embodiment, the AI function comprises an AI training function.

[1097] As one embodiment, the AI function comprises an AI management function.

[1098] As one embodiment, the AI comprises ML (Machine Learning).

[1099] As one embodiment, the AI comprises AI and ML.

[1100] As one embodiment, the AI comprises AI or ML.

[1101] As one embodiment, the first operation is based on artificial intelligence or machine learning.

[1102] As one embodiment, the first operation is based on a neural network.

[1103] As one embodiment, the first operation comprises inference for CSI (Channel State Information).

[1104] As one embodiment, the first operation comprises inference for data reception.

[1105] As one embodiment, the first operation comprises inference for positioning.

[1106] As one embodiment, the first operation comprises inference for scheduling.

[1107] As one embodiment, the first operation comprises inference for semantic-based error correction.

[1108] As one embodiment, the output of the first operation comprises channel information.

[1109] As one embodiment, the channel information comprises CSI.

[1110] As an example, the channel information comprises one or more of CQI, PMI, CRI, LI, RI, SSBRI, RSRP, SINR, capability index, and TDCP.

[1111] As an example, the channel information comprises compressed CSI.

[1112] As an example, the channel information comprises predicted CSI.

[1113] As an example, the channel information comprises channel matrix.

[1114] As an example, the channel information comprises precoding matrix.

[1115] As an example, the output of the first operation comprises positioning information.

[1116] As an example, the output of the first operation comprises recovered TB (Transport Block) or CB (Code Block).

[1117] As an example, the output of the first operation comprises scheduling result.

[1118] As an example, the first operation is deployment-free.

[1119] As an example, the first operation is obtained by load.

[1120] As an example, the first operation is deployment-free.

[1121] As an example, the first type of resource is used to perform the first operation.

[1122] As an example, the first operation is identified by the first identity.

[1123] As an example, the model of the first operation is identified by the first identity.

[1124] As an example, the above method has the benefit of simplifying the design and unifying the understanding of different AI operations or AI models among different nodes.

[1125] As an example, the AI entity or AI function to which the first operation belongs is identified by the first identity.

[1126] As an example, the AI function or AI entity that performs the first operation is identified by the first identity.

[1127] As an embodiment, the benefits of the above method include simplifying the design and unifying the understanding of different AI entities or AI functions among different nodes.

[1128] As an embodiment, the training of the first operation is identified by the first identification.

[1129] As an embodiment, the data set of the training of the first operation is identified by the first identification.

[1130] As an embodiment, the benefits of the above method include identifying the inference generated by an AI training or an AI training data set by identifying the AI training or the AI training data set, establishing consensus among different AI functions, and further simplifying the design.

[1131] Embodiment 24

[1132] Embodiment 24 illustrates a schematic diagram of N0 and N1 according to an embodiment of the present application; as shown in FIG. 24. In embodiment 24, the candidate of the number of first type resources occupied by the first operation includes M1 values, the N0 is the maximum value among the M1 values, the N1 is the number of first type resources occupied by the first operation, the N1 is one of the M1 values, the M1 is a positive integer greater than 1, and the M1 values are positive integers respectively.

[1133] As an embodiment, the M1 values are pairwise unequal.

[1134] As an embodiment, each of the M1 values is a candidate of the number of first type resources occupied by the first operation.

[1135] As an embodiment, the first report indicates the maximum value among the M1 values.

[1136] As an embodiment, the first report indicates the maximum value and the minimum value among the M1 values.

[1137] As an embodiment, the first report indicates the M1 values.

[1138] As an embodiment, the benefits of the above method include that more information facilitates the network side to further optimize the scheduling.

[1139] As an embodiment, the first report indicates the first operation and the maximum value among the M1 values.

[1140] As an embodiment, the first report indicates the first identification and the maximum value among the M1 values.

[1141] As an embodiment, the M1 values are unknown to a target receiver of the second report.

[1142] As an embodiment, benefits of the above method include, more flexible support for different terminals.

[1143] As an embodiment, benefits of the above method include, saving air interface overhead.

[1144] As an embodiment, the first operation includes a plurality of sub-operations, one execution of the first operation can include execution of all or part of the plurality of sub-operations, when one execution of the first operation includes different sub-operations of the plurality of sub-operations, the number of first-type resources occupied by the one execution is different values in the M1 values.

[1145] As an embodiment, the more sub-operations included in one execution of the first operation, the greater the number of first-type resources occupied by the one execution.

[1146] As an embodiment, one execution of the first operation includes execution of all sub-operations of the plurality of sub-operations, another execution of the first operation includes execution of only part of the plurality of sub-operations, the number of first-type resources occupied by the one execution is greater than the number of first-type resources occupied by the another execution.

[1147] As an embodiment, when one execution of the first operation includes different sub-operations of the plurality of sub-operations, the performance achieved by the one execution is different.

[1148] As an embodiment, when one execution of the first operation includes different numbers of sub-operations, the performance achieved by the one execution is different.

[1149] As an embodiment, the more sub-operations included in one execution of the first operation, the better the performance achieved by the one execution.

[1150] As an embodiment, the performance of AI or ML inference is significantly improved with the increase in the number of parameters of an AI or ML model, and the greater the number of parameters, the greater the amount of computation and storage space required for inference; therefore, there is a mutual constraint relationship between the performance of AI or ML inference and resource occupation; the above method provides different inference performance and resource occupation for the first operation, making the system more flexible, more efficient and more robust.

[1151] As an embodiment, the first node determines the N1 according to an indication of a target receiver of the second report.

[1152] As an embodiment, the above method has the advantage of supporting joint optimization, further improving system performance.

[1153] As an embodiment, the first node determines the N1 by itself.

[1154] As an embodiment, the above method has the advantage of better flexibility, adapting to different terminals.

[1155] As an embodiment, determining the N1 means determining the number of first-type resources occupied by one execution of the first operation.

[1156] As an embodiment, determining the N1 means determining the number of first-type resources currently occupied by the first operation.

[1157] As an embodiment, determining the N1 means determining the number of first-type resources occupied by one execution of the first operation.

[1158] As an embodiment, determining the N1 means determining the number of first-type resources occupied by the last execution of the first operation.

[1159] As an embodiment, determining the N1 means determining the number of first-type resources occupied by the first operation in the first time-domain resource.

[1160] As an embodiment, the first node determines the N1 from the M1 values by itself.

[1161] Generally, how the first node determines the N1 is determined by the hardware manufacturer, and some non-limiting embodiments are introduced as follows:

[1162] As an embodiment, the first node randomly determines the N1 from the M1 values.

[1163] As an embodiment, the first node selects the M1 values as the N1 in turn.

[1164] As an embodiment, the first node determines the N1 according to the number of currently unoccupied first-type resources.

[1165] As an embodiment, the N1 is the maximum value in the M1 values that is not greater than the number of currently unoccupied first-type resources.

[1166] As an embodiment, when one execution of the first operation includes different sub-operations in the plurality of sub-operations, the number of first-type resources occupied by the one execution is different, and the performance achieved is also different; the first node selects the N1 according to performance requirements.

[1167] As an embodiment, when one execution of the first operation includes different number of sub-operations, the one execution occupies different number of the first type of resources, and achieves different performance; the first node selects the N1 according to the performance requirement.

[1168] As an embodiment, the N1 is the minimum value in the M1 values under the condition that the performance requirement can be achieved.

[1169] As an embodiment, the first node receives R1 signaling before sending the second report, the R1 is a positive integer, each of the R1 signaling indicates to increase or decrease the number of the first type of resources occupied by the first operation; the first node determines the N1 according to the R1 signaling.

[1170] As an embodiment, the first value is one of the M1 values, the first node increases or decreases the number of the first type of resources occupied by the first operation according to the indication of each of the R1 signaling based on the first value, and accumulates to obtain the N1.

[1171] As a sub-embodiment of the above embodiment, the first value is the number of the first type of resources occupied by the last execution of the first operation before the first node receives the earliest one of the R1 signaling.

[1172] As a sub-embodiment of the above embodiment, the first value is the number of the first type of resources occupied by the first execution of the first operation.

[1173] As a sub-embodiment of the above embodiment, the first value is the minimum one of the M1 values.

[1174] As a sub-embodiment of the above embodiment, the first value is randomly determined by the first node from the M1 values.

[1175] Embodiment 25

[1176] Embodiment 25 illustrates a schematic diagram of N0 and N1 according to an embodiment of the present application; as shown in FIG. 25. In embodiment 25, the first function is associated with the first identifier, the N0 is the maximum value of the number of the first type of resources occupied by the first function, and the N1 is the number of the first type of resources occupied by the first function.

[1177] As an embodiment, the first function includes an AI or ML based function.

[1178] As an embodiment, the first function includes a function that can be implemented by inference.

[1179] As one embodiment, the first function is based on AI or ML.

[1180] As one embodiment, the first function is based on AI inference or ML inference.

[1181] As one embodiment, the first function can be implemented with AI inference or ML inference.

[1182] As one embodiment, the first function can be implemented with AI inference or ML inference.

[1183] As one embodiment, the first function can be implemented with inference, and can also be implemented with a scheme that does not include inference.

[1184] As one embodiment, the candidate of the scheme that the first function employs includes a scheme based on AI or ML.

[1185] As one embodiment, the candidate of the scheme that the first function employs includes inference.

[1186] As one embodiment, the candidate of the scheme that the first function employs includes inference, and also includes a scheme other than inference.

[1187] As one embodiment, the first function includes generation, update or computation of CSI.

[1188] As one embodiment, the first function includes one or more of CSI compression, CSI prediction or beam management.

[1189] As one embodiment, the first function includes data reception.

[1190] As one embodiment, the first function includes PDSCH reception.

[1191] As one embodiment, the first function includes one or more of channel estimation, MIMO reception, demodulation, channel decoding and CRC check.

[1192] As one embodiment, the first function includes positioning.

[1193] As one embodiment, the first function includes scheduling.

[1194] As one embodiment, the first function includes semantic-based error correction.

[1195] As one embodiment, the first node and the target receiver of the second report have consensus on the first function.

[1196] As one embodiment, the first function set includes the first function.

[1197] As one embodiment, the first function is associated to the first identity, and the first type of resource associated to the first identity occupied by the first function means the first type of resource occupied by the first function.

[1198] As one embodiment, the first function is identified by the first identity.

[1199] As one embodiment, the benefits of the above method include facilitating the consensus of the first function by different nodes.

[1200] As one embodiment, the first function includes a combination of all or part of a plurality of candidate sub-functions, and the combination is identified by the first identity.

[1201] As one sub-embodiment of the above embodiment, the first node and the second reported target receiver have consensus on the plurality of candidate sub-functions.

[1202] As one sub-embodiment of the above embodiment, the plurality of candidate sub-functions are configured by higher layer signaling.

[1203] As one sub-embodiment of the above embodiment, the plurality of candidate sub-functions depend on the configuration of higher layer signaling.

[1204] As one sub-embodiment of the above embodiment, the plurality of candidate sub-functions depend on the capability of the first node.

[1205] As one sub-embodiment of the above embodiment, the plurality of candidate sub-functions are reported by the first node through a UE capability IE.

[1206] As one sub-embodiment of the above embodiment, the plurality of candidate sub-functions are predefined.

[1207] As one sub-embodiment of the above embodiment, different combinations of the plurality of candidate sub-functions are identified by different identities.

[1208] As one reference embodiment of the above sub-embodiment, the first node and the second reported target receiver have consensus on the different combinations.

[1209] As one reference embodiment of the above sub-embodiment, the first node and the second reported target receiver have consensus on the different combinations and corresponding identities.

[1210] As one embodiment, the benefits of the above method include more flexible design, adapting to different terminals and application scenarios.

[1211] As one embodiment, the benefits of the above method include good forward compatibility.

[1212] Embodiment 26

[1213] Embodiment 26 illustrates a schematic diagram of a first function having P candidate operations according to an embodiment of the present application; as shown in FIG. 26.

[1214] As one embodiment, any of the P candidate operations can be used for the first function.

[1215] As one embodiment, any of the P candidate operations can be used for the first function.

[1216] As one embodiment, any of the P candidate operations can be used for the first function.

[1217] As one embodiment, any of the P candidate operations can be used for the first function.

[1218] As one embodiment, the first node can use any of the P candidate operations to implement the first function.

[1219] As one embodiment, the first node uses any of the P candidate operations to implement the first function.

[1220] As one embodiment, the first candidate operation is a candidate operation of the P candidate operations used to implement the first function.

[1221] As one embodiment, the first candidate operation is a candidate operation of the P candidate operations used to implement the first function.

[1222] As one embodiment, the first candidate operation is a candidate operation of the P candidate operations used to implement the first function.

[1223] As one embodiment, the first candidate operation is a candidate operation of the P candidate operations used to implement the first function.

[1224] As one embodiment, the first candidate operation is a candidate operation of the P candidate operations used to implement the first function.

[1225] As one embodiment, for the first function means to implement the first function.

[1226] As one embodiment, any of the P candidate operations is based on training.

[1227] As one embodiment, any of the P candidate operations is obtained through training.As one embodiment, the model of any of the P candidate operations is obtained by training.

[1228] As one embodiment, the training of at least one of the P candidate operations is performed by the first node.

[1229] As one embodiment, the training of at least one of the P candidate operations is performed by the target recipient of the first report.

[1230] As one embodiment, the training of at least one of the P candidate operations is performed by a core network.

[1231] As one embodiment, the training of at least one of the P candidate operations is performed by an MDA function.

[1232] As one embodiment, the training of at least one of the P candidate operations is performed by a NWDAF.

[1233] As one embodiment, the training of at least one of the P candidate operations is performed by an MDAS producer.

[1234] As one embodiment, the training of at least one of the P candidate operations is performed by an MnS producer.

[1235] As one embodiment, any of the P candidate operations comprises an inference.

[1236] As one embodiment, any of the P candidate operations is an inference.

[1237] As one embodiment, any of the P candidate operations comprises an AI entity.

[1238] As one embodiment, any of the P candidate operations comprises a part of an AI entity for inference.

[1239] As one embodiment, any of the P candidate operations is executed by an AI entity or an AI function.

[1240] As one embodiment, any of the P candidate operations is executed by an AI entity or an AI function deployed at the first node.

[1241] As one embodiment, any of the P candidate operations is based on artificial intelligence or machine learning.

[1242] As one embodiment, any of the P candidate operations is based on a neural network.

[1243] As one embodiment, the output of any of the P candidate operations includes channel information.

[1244] As one embodiment, the output of any of the P candidate operations includes positioning information.

[1245] As one embodiment, the output of any of the P candidate operations includes a recovered TB or CB.

[1246] As one embodiment, the output of any of the P candidate operations includes a scheduling result.

[1247] As one embodiment, at least one of the P candidate operations is deployment- requiring.

[1248] As one embodiment, at least one of the P candidate operations is obtained by loading.

[1249] As one embodiment, at least one of the P candidate operations is obtained from a serving cell of the first node.

[1250] As one embodiment, at least one of the P candidate operations is obtained from a core network.

[1251] As one embodiment, at least one of the P candidate operations is deployment- non- requiring.

[1252] As one embodiment, at least two of the P candidate operations respectively occupy different amounts of the first type of resource.

[1253] As one embodiment, any two of the P candidate operations respectively occupy different amounts of the first type of resource.

[1254] As one embodiment, at least two of the P candidate operations, when executed, occupy different amounts of the first type of resource.

[1255] As one embodiment, any two of the P candidate operations, when executed, occupy different amounts of the first type of resource.

[1256] As one embodiment, there are at least two candidate operations in the P candidate operations, and the number of the first type of resources occupied when one of the two candidate operations is executed is different from the number of the first type of resources occupied when the other of the two candidate operations is executed.

[1257] As one embodiment, for any two candidate operations in the P candidate operations, the number of the first type of resources occupied when one of the two candidate operations is executed is different from the number of the first type of resources occupied when the other of the two candidate operations is executed.

[1258] As one embodiment, at least two candidate operations in the P candidate operations have different performance.

[1259] As one embodiment, any two candidate operations in the P candidate operations have different performance.

[1260] As one embodiment, at least two candidate operations in the P candidate operations have different number of the first type of resources occupied and different performance.

[1261] As one embodiment, any two candidate operations in the P candidate operations have different number of the first type of resources occupied and different performance.

[1262] As one embodiment, the performance of inference is significantly improved as the number of parameters of the AI / ML model increases, and the larger the number of parameters, the more computation and storage space required for inference; therefore, there is a mutual constraint relationship between the performance of inference and resource occupation; in the above method, the P candidate operations provide different inference performance and resource occupation options, making the system more flexible, more efficient and more robust.

[1263] As one embodiment, the first report indicates the number of the first type of resources occupied by each of the P candidate operations.

[1264] As one embodiment, the first report indicates the minimum and maximum values of the number of the first type of resources respectively occupied by the P candidate operations.

[1265] As one embodiment, the first report indicates the maximum value of the number of the first type of resources respectively occupied by the P candidate operations.

[1266] As one embodiment, the benefits of the above method include that more information facilitates the network side to further optimize scheduling.

[1267] As one embodiment, the number of first type of resources occupied by at least one of the P candidate operations is unknown to the target receiver of the second report.

[1268] As one embodiment, the number of first type of resources occupied by any of the P candidate operations is unknown to the target receiver of the second report.

[1269] As one embodiment, the benefits of the above method include, more flexible support of different terminals.

[1270] As one embodiment, the benefits of the above method include, saving air interface overhead.

[1271] As one embodiment, the first report indicates the P candidate operations.

[1272] As one embodiment, the first report indicates P identities, the P candidate operations are respectively associated to the P identities.

[1273] As one embodiment, the benefits of the above method include, more information facilitates further optimization of scheduling by the network side.

[1274] As one embodiment, one operation being associated to one identity includes, the one operation is identified by the one identity.

[1275] As one embodiment, one operation being associated to one identity includes, the model of the one operation is identified by the one identity.

[1276] As one embodiment, one operation being associated to one identity includes, the AI entity or AI function to which the one operation belongs is identified by the one identity.

[1277] As one embodiment, one operation being associated to one identity includes, the AI function or AI entity performing the one operation is identified by the one identity.

[1278] As one embodiment, one operation being associated to one identity includes, the training of the one operation is identified by the one identity.

[1279] As one embodiment, one operation being associated to one identity includes, the training data set of the one operation is identified by the one identity.

[1280] As one embodiment, at least one of the P candidate operations is unknown to the target receiver of the second report.

[1281] As one embodiment, the P candidate operations are unknown to the target receiver of the second report.

[1282] As an embodiment, benefits of the above method include, more flexible support of different terminals.

[1283] As an embodiment, benefits of the above method include, saving air interface overhead.

[1284] As an embodiment, the first report indicates a maximum of a number of first type resources occupied by the P candidate operations respectively, the P candidate operations being unknown to a target receiver of the second report.

[1285] As an embodiment, a number of first type resources occupied by any of the P candidate operations is unknown to a target receiver of the second report, the P candidate operations being unknown to the target receiver of the second report.

[1286] Embodiment 27

[1287] Embodiment 27 illustrates a diagram of N0 and N1 according to an embodiment of the present application; as shown in Figure 27. In embodiment 27, the second report indicates a difference between N0 and N1, the N0 being a maximum of a number of first type resources occupied by P candidate operations respectively, the N1 being a number of first type resources occupied by a first candidate operation, the first candidate operation being a candidate operation of the P candidate operations used for the first function.

[1288] As an embodiment, the N1 is a number of first type resources occupied by one execution of the first candidate operation.

[1289] As an embodiment, the N1 is a number of first type resources occupied by a most recent execution of the first candidate operation.

[1290] As an embodiment, the N1 is a number of first type resources occupied by the first candidate operation in the first time domain resource.

[1291] As an embodiment, the maximum of a number of first type resources occupied by the P candidate operations respectively refers to a number of first type resources occupied by a candidate operation of the P candidate operations having a maximum number of first type resources occupied.

[1292] As an embodiment, at least two of the P candidate operations occupy different numbers of first type resources.

[1293] As an embodiment, any two of the P candidate operations occupy different numbers of first type resources.

[1294] As an embodiment, the first node determines the first candidate operation according to an indication of a target receiver of the second report.

[1295] As an embodiment, the first node determines the first candidate operation by itself.

[1296] As an embodiment, the first node determines the first candidate operation from the P candidate operations by itself.

[1297] Generally, how the first node determines the first candidate operation is determined by the hardware device manufacturer, and some non-limiting embodiments are described as follows:

[1298] As an embodiment, the first node determines the first candidate operation randomly from the P candidate operations.

[1299] As an embodiment, the first node selects the P candidate operations as the first candidate operation in turn.

[1300] As an embodiment, the first node determines the first candidate operation according to the number of the first type of resources that are not currently occupied.

[1301] As an embodiment, the first candidate operation is the candidate operation in the P candidate operations that occupies the largest number of the first type of resources, among the candidate operations whose occupied number of the first type of resources is not greater than the number of the first type of resources that are not currently occupied.

[1302] As an embodiment, the number of the first type of resources occupied by any two candidate operations in the P candidate operations is different, and the performance achieved is different; the first node selects the first candidate operation according to the performance requirement.

[1303] As an embodiment, the first candidate operation is the candidate operation in the P candidate operations that occupies the smallest number of the first type of resources, among the candidate operations that can achieve the performance requirement.

[1304] As an embodiment, the first node receives R2 signaling before sending the second report, R2 is a positive integer, each of the R2 signaling indicates to increase or decrease the number of the first type of resources occupied by the first function; the first node determines the first candidate operation according to the R2 signaling.

[1305] As an embodiment, the second candidate operation is one of the P candidate operations, and the first node selects a candidate operation that occupies a higher or lower number of the first type of resources for the first function according to the indication of each of the R2 signaling based on the second candidate operation, and accumulates to obtain the first candidate operation.

[1306] As one sub-example of the above embodiment, the second candidate operation is one with the smallest number of the first type of resources required among the P candidate operations.

[1307] As one sub-example of the above embodiment, the first node randomly determines the second candidate operation from the P candidate operations.

[1308] As one sub-example of the above embodiment, the second candidate operation is one with the smallest corresponding identifier among the P candidate operations.

[1309] As one sub-example of the above embodiment, the second candidate operation is one that the first node used most recently to implement the first function before receiving the earliest one of the R2 signaling.

[1310] As one sub-example of the above embodiment, the second candidate operation is one that the first node used first to implement the first function.

[1311] Embodiment 28

[1312] Embodiment 28 illustrates a schematic diagram of an artificial intelligence or machine learning based processing system according to one embodiment of the present application; as shown in FIG. 28. In embodiment 28, the third processing machine sends a first data set to the fourth processing machine, and a second data set to the fifth processing machine; the fourth processing machine generates a target first type of parameter group according to the first data set, and sends the generated target first type of parameter group to the fifth processing machine; the fifth processing machine processes the second data set using the target first type of parameter group to obtain a first type of output, and sends the first type of output to the sixth processing machine. In FIG. 28, the first type of feedback and the second type of feedback are optional; the fourth processing machine comprises an ML training function; and the fifth processing machine comprises an inference function.

[1313] As one embodiment, the sixth processing machine comprises an ML testing function.

[1314] As one embodiment, the sixth processing machine comprises performance monitoring / evaluation of the ML model.

[1315] As one embodiment, the fifth processing machine sends the first type of feedback to the fourth processing machine, which is used to trigger recalculation or update of the target first type of parameter group, i.e., trigger ML initial training or ML retraining.

[1316] As an embodiment, the sixth processor sends second type feedback to the third processor, the second type feedback is used to generate the first data set or the second data set, or the second type feedback is used to trigger the sending of the first data set or the sending of the second data set.

[1317] As an embodiment, the third processor generates the first data set and the second data set according to the measurement of the reference signal.

[1318] As an embodiment, the fifth processor belongs to the first node.

[1319] As an embodiment, the sixth processor belongs to the first node or the second node.

[1320] As an embodiment, the fifth processor performs the first operation.

[1321] As an embodiment, the fifth processor performs the first candidate operation.

[1322] As an embodiment, the second data set includes the measurement of the reference signal.

[1323] As an embodiment, the first data set includes training data.

[1324] As an embodiment, the fourth processor is used for training an ML model, and the trained model is described by the target first type parameter group.

[1325] As an embodiment, the fourth processor is located in the first node.

[1326] The above embodiment avoids passing the first data set to the second node.

[1327] As an embodiment, the fourth processor is located in the second node.

[1328] The above embodiment supports joint training and optimizes system performance.

[1329] As an embodiment, the fourth processor is located in the core network.

[1330] The above embodiment supports full-network joint training and further optimizes system performance.

[1331] As an embodiment, the second data set includes inference data.

[1332] As an embodiment, the fifth processor is located in the first node.

[1333] As an embodiment, the fifth processor constructs a model according to the target first-type parameter group, and then inputs the second data set into the constructed model to obtain the first-type output.

[1334] As an embodiment, the fifth processor compares the real measurement result with the first-type output, and the error obtained is used to generate the first-type feedback.

[1335] As an embodiment, the fifth processor generates the first-type feedback through performance monitoring.

[1336] As an embodiment, the first-type feedback is used to reflect the performance of the trained model; when the performance of the trained model cannot meet the requirement, the fourth processor recalculates the target first-type parameter group.

[1337] As an embodiment, the sixth processor compares the real measurement result with the first-type output, and the error obtained is used to generate the second-type feedback.

[1338] As an embodiment, the sixth processor generates the second-type feedback through performance monitoring.

[1339] As an embodiment, the second-type feedback is used to reflect the performance of the trained model; when the performance of the trained model cannot meet the requirement, the third processor sends the first data set to trigger or assist the fourth processor to recalculate the target first-type parameter group.

[1340] As an embodiment, when the error is too large or the update is not performed for too long a time, the performance of the trained model is considered to be unable to meet the requirement.

[1341] As an embodiment, the target first-type parameter group includes one or more of a convolution kernel size, a convolution layer number, a convolution step, a pooling kernel size, a pooling kernel step, a pooling function, an activation function, or a feature map number.

[1342] As an embodiment, the target first-type parameter group includes one or more of a convolution kernel, a pooling kernel, a pooling function, an activation function, a parameter of the pooling function, or a parameter of the activation function.

[1343] As an embodiment, the ML includes AI.

[1344] As an embodiment, the ML includes ML and AI.

[1345] Embodiment 29

[1346] Embodiment 29 illustrates a schematic diagram based on artificial intelligence or machine learning, according to an embodiment of the application; as shown in FIG. 29. FIG. 29 includes a second operation, a third operation, a fourth operation, a fifth operation, and a sixth operation. In Embodiment 29, the second operation and the third operation belong to a first phase, the fourth operation belongs to a second phase, the fifth operation belongs to a third phase, and the sixth operation belongs to a fourth phase. In FIG. 29, the line with an arrow indicates the order of the flow.

[1347] As an embodiment, the second operation includes ML training, the third operation includes ML testing, the fourth operation includes ML emulation, the fifth operation includes ML entity loading, and the sixth operation includes inference.

[1348] As an embodiment, the first phase includes a training phase, the second phase includes an emulation phase, the third phase includes a deployment phase, and the fourth phase includes an inference phase.

[1349] As an embodiment, the first phase includes ML model training.

[1350] As an embodiment, the first phase includes ML model training and ML testing.

[1351] As an embodiment, the ML model training includes initial training and re-training of one or a set of ML models.

[1352] As an embodiment, the ML model training relies on training data.

[1353] As an embodiment, the ML model training includes ML entity validation.

[1354] As an embodiment, the ML entity validation is used to evaluate the performance of the ML entity.

[1355] As an embodiment, the ML entity validation relies on validation data.

[1356] As an embodiment, if the result of ML entity validation does not meet the expectation, the ML model will be re-trained.

[1357] As one embodiment, the ML testing includes testing the validated ML entity to estimate the performance of the trained ML model.

[1358] As one embodiment, if the result of the ML testing meets the expectation, the ML entity proceeds to the next stage; otherwise, the ML model will be retrained.

[1359] As one embodiment, the ML testing relies on testing data.

[1360] As one embodiment, the second stage includes ML simulation, which simulates the inference of the ML entity in a simulation environment.

[1361] As one embodiment, the ML simulation estimates the performance of the inference of the ML entity in a simulation environment before the ML entity is used.

[1362] As one embodiment, the second stage is optional.

[1363] As one embodiment, the third stage includes ML entity loading, which is to obtain the trained ML entity to obtain the desired AI inference function.

[1364] As one embodiment, the third stage is optional.

[1365] As one embodiment, the third stage is no longer needed when the training function and the inference function are co-located.

[1366] As one embodiment, the fourth stage includes AI inference or ML inference.

[1367] As one embodiment, the ML includes AI.

[1368] As one embodiment, the AI includes ML.

[1369] Embodiment 30

[1370] Embodiment 30 illustrates a diagram of AI function deployment according to one embodiment of the present application; as shown in FIG. 30.

[1371] In embodiment 30, the AI training function of the RAN (Radio Access Network) domain is located in a 3GPP RAN domain-specific management function, while the AI inference function is located in the UE.

[1372] In embodiment 30, the RAN domain-specific management function provides the AI training function management capability and the AI inference function management capability.

[1373] Embodiment 31

[1374] Embodiment 31 illustrates a schematic diagram of AI function deployment according to one embodiment of the present application; as shown in FIG. 31.

[1375] In embodiment 31, the AI training function is located in the RAN domain-specific management function, and the AI inference function is located locally in the UE.

[1376] In embodiment 31, the management capability of the AI training function is provided by the RAN domain-specific management function, and the management capability of the AI inference is provided locally by the UE.

[1377] In FIG. 31, MnF refers to Management Function.

[1378] Embodiment 32

[1379] Embodiment 32 illustrates a schematic diagram of AI function deployment according to one embodiment of the present application; as shown in FIG. 32.

[1380] In embodiment 32, the AI training function and the AI inference function are both located in the UE, wherein the UE provides the capability of training and inference.

[1381] In embodiment 32, the RAN domain-specific management function provides the management capability of the AI training function and the management capability of the AI inference function.

[1382] Embodiment 33

[1383] Embodiment 33 illustrates a schematic diagram of AI function deployment according to one embodiment of the present application; as shown in FIG. 33.

[1384] In embodiment 33, the AI training function and the AI inference function are both located in the UE.

[1385] In embodiment 33, both the management capability of the AI training function and the management capability of the AI inference function are provided locally by the UE.

[1386] In FIG. 33, MnF refers to Management Function.

[1387] Embodiment 34

[1388] Embodiment 34 illustrates a structural block diagram of a processing apparatus in a first node according to one embodiment of the present application; as shown in FIG. 34. In FIG. 34, the processing apparatus 3400 in the first node includes a first processor 3401.

[1389] In embodiment 34, the first processor 3401 sends a first report and a second report.

[1390] In embodiment 34, the first report indicates L0 first-type resources, where L0 is a positive integer; the second report indicates that L1 first-type resources are not occupied, where L1 is a positive integer not greater than L0; the L0 first-type resources are used for inference.

[1391] One feature of AI inference or ML inference is that its performance is significantly improved with the increase in the number of parameters of the AI or ML model, and the greater the number of parameters, the greater the amount of calculation required for inference and the greater the storage requirements; therefore, there is a mutual constraint relationship between the performance of AI inference or ML inference and resource occupation; in the above scheme, the first node reports the information of the number of resources that can be used for inference, which facilitates the network side to obtain a better balance between the performance of inference and resource occupation, fully optimizes resource utilization, and maximizes the overall system performance.

[1392] As one embodiment, the first report includes UE capability information, L0 is greater than 1, and L0 is the maximum value of the number of occupied first-type resources.

[1393] As one embodiment, the second report is carried by a MAC CE.

[1394] As one embodiment, the first-type resources are used for storage, or the first-type resources are used for calculation or processing, or the first-type resources are used for storage and are used for calculation or processing.

[1395] As one embodiment, the second report is conditional on a first time-domain resource.

[1396] As one embodiment, L1 depends on the total number of occupied first-type resources in the first time-domain resource.

[1397] As a sub-embodiment of the above-mentioned embodiment, the L1 is equal to the L0 minus a total number of the first type of resources occupied before the first time-domain resource, the L0 being a maximum value of a number of the first type of resources supported by the first node.

[1398] As an embodiment, the L1 depends on a total number of the first type of resources occupied before the first time-domain resource.

[1399] As a sub-embodiment of the above-mentioned embodiment, the L1 is equal to the L0 minus a total number of the first type of resources occupied before the first time-domain resource, the L0 being a maximum value of a number of the first type of resources supported by the first node.

[1400] As an embodiment, the second report is conditional on a downlink transmission rate on the first time-domain resource.

[1401] As an embodiment, the second report is triggered by an event in a first set of events, the first set of events comprising at least one of:

[1402] - a change in a number of the first type of resources occupied being greater than a second threshold value;

[1403] - at least one first type of operation being activated or deactivated, the first type of operation comprising inference;

[1404] - at least one first type of operation being deployed or redeployed, the first type of operation comprising inference;

[1405] - at least one first type of function being activated or deactivated, the first type of function depending on inference;

[1406] - a first timer expiring.

[1407] As a sub-embodiment of the above-mentioned embodiment, the change in the number of the first type of resources occupied comprises a change in a total number of the first type of resources occupied on all carriers or all serving cells.

[1408] As an embodiment, the first processor 3401 receives first signaling; wherein the first signaling triggers the second report.

[1409] As a sub-embodiment of the above-mentioned embodiment, the first signaling is DCI.

[1410] As one embodiment, each of the L0 first-type resources comprises one or more first-type sub-resources and one or more second-type sub-resources, and the second report indicates at least one of a number of unoccupied first-type sub-resources and a number of unoccupied second-type sub-resources in at least one of the L0 first-type resources other than the L1 first-type resources.

[1411] As one sub-embodiment of the above embodiment, the first-type sub-resources are for computation or processing, and the second-type sub-resources are for storage.

[1412] As one embodiment, each of the L0 first-type resources comprises one or more first-type sub-resources and one or more second-type sub-resources, and the second report indicates at least one of a number of unoccupied first-type sub-resources and a number of unoccupied second-type sub-resources in at least one of the L1 first-type resources.

[1413] As one sub-embodiment of the above embodiment, the first-type sub-resources are for computation or processing, and the second-type sub-resources are for storage.

[1414] As one embodiment, the second report indicates a difference between N0 and N1, the N0 is a maximum value of a number of occupied first-type resources associated to a first identity, and the N1 is a number of occupied first-type resources associated to the first identity, and the N1 is not greater than the N0.

[1415] As one embodiment, a first operation is associated to the first identity, the N0 is a maximum value of a number of first-type resources occupied by the first operation, and the N1 is a number of first-type resources occupied by the first operation.

[1416] As one sub-embodiment of the above embodiment, the first operation is based on training.

[1417] As one sub-embodiment of the above embodiment, the first operation comprises inference.

[1418] As one embodiment, a first function is associated to the first identity, the first function has P candidate operations, P is a positive integer greater than 1, the N0 is a maximum value of a number of first-type resources respectively occupied by the P candidate operations, and the N1 is a number of first-type resources occupied by a first candidate operation, the first candidate operation is a candidate operation of the P candidate operations used for the first function.

[1419] As one sub-embodiment of the above embodiment, any of the P candidate operations is based on training.

[1420] As a sub-embodiment of the above-mentioned embodiment, any of the P candidate operations comprises an inference.

[1421] As an embodiment, the first node is a terminal.

[1422] As an embodiment, the first node is a user equipment.

[1423] As an embodiment, the first node is a relay node equipment.

[1424] As an embodiment, the first processor 3401 comprises at least one of {antenna 452, receiver / transmitter 454, reception processor 456, transmission processor 468, multi-antenna reception processor 458, multi-antenna transmission processor 457, controller / processor 459, memory 460, data source 467} in embodiment 4.

[1425] Embodiment 35

[1426] Embodiment 35 illustrates a structural block diagram of a processing apparatus in a second node according to an embodiment of the present application; as shown in FIG. 35. In FIG. 35, the processing apparatus 3500 in the second node comprises a second processor 3501.

[1427] In embodiment 35, the second processor 3501 receives a first report and a second report.

[1428] In embodiment 35, the first report indicates L0 first-type resources, the L0 being a positive integer; the second report indicates that L1 first-type resources are not occupied, the L1 being a positive integer not greater than the L0; the L0 first-type resources are used for inference.

[1429] One feature of AI inference or ML inference is that its performance is significantly improved with the increase of the number of parameters of the AI or ML model, and the greater the number of parameters, the greater the amount of calculation required for inference and the requirement for storage; therefore, there is a mutual constraint relationship between the performance of AI inference or ML inference and resource occupation; in the above-mentioned scheme, the second node can obtain a better balance between the performance of inference and resource occupation by receiving the information of the number of resources that can be used for inference, fully optimize resource utilization, and maximize the overall performance of the system.

[1430] As an embodiment, the first report comprises UE capability information, the L0 is greater than 1, and the L0 is the maximum value of the number of occupied first-type resources.

[1431] As an embodiment, the second report is carried by a MAC CE.

[1432] As an embodiment, the first type of resources are used for storage, or, the first type of resources are used for computation or processing, or, the first type of resources are used for storage and are used for computation or processing.

[1433] As an embodiment, the second report is conditioned on a first time-domain resource.

[1434] As an embodiment, the L1 depends on a total number of first type of resources occupied in the first time-domain resource.

[1435] As a sub-embodiment of the above embodiment, the L1 is equal to the L0 minus the total number of first type of resources occupied in the first time-domain resource, the L0 being a maximum value of a number of the first type of resources supported by the first node.

[1436] As an embodiment, the L1 depends on a total number of first type of resources occupied before the first time-domain resource.

[1437] As a sub-embodiment of the above embodiment, the L1 is equal to the L0 minus the total number of first type of resources occupied before the first time-domain resource, the L0 being a maximum value of a number of the first type of resources supported by the first node.

[1438] As an embodiment, the second report is conditioned on a downlink transmission rate on the first time-domain resource.

[1439] As an embodiment, the second report is triggered by an event in a first set of events, the first set of events comprising at least one of:

[1440] - a change of a number of occupied first type of resources is greater than a second threshold value;

[1441] - at least one first type of operation is activated or deactivated, the first type of operation comprising inference;

[1442] - at least one first type of operation is deployed or re-deployed, the first type of operation comprising inference;

[1443] - at least one first type of function is activated or deactivated, the first type of function depending on inference;

[1444] - a first timer expires.

[1445] As a sub-embodiment of the above embodiment, the change of the number of occupied first type of resources comprises a change of a total number of occupied first type of resources on all carriers or all serving cells.

[1446] As one embodiment, the second processor 3501 sends first signaling; wherein the first signaling triggers the second report.

[1447] As one sub-embodiment of the above embodiment, the first signaling is DCI.

[1448] As one embodiment, each of the L0 first-type resources comprises one or more first-type sub-resources and one or more second-type sub-resources, and the second report indicates at least one of a number of unoccupied first-type sub-resources and a number of unoccupied second-type sub-resources in at least one of the L0 first-type resources other than the L1 first-type resources.

[1449] As one sub-embodiment of the above embodiment, the first-type sub-resources are used for computation or processing, and the second-type sub-resources are used for storage.

[1450] As one embodiment, each of the L0 first-type resources comprises one or more first-type sub-resources and one or more second-type sub-resources, and the second report indicates at least one of a number of unoccupied first-type sub-resources and a number of unoccupied second-type sub-resources in at least one of the L1 first-type resources.

[1451] As one sub-embodiment of the above embodiment, the first-type sub-resources are used for computation or processing, and the second-type sub-resources are used for storage.

[1452] As one embodiment, the second report indicates a difference between N0 and N1, the N0 is a maximum value of a number of occupied first-type resources associated to a first identity, and the N1 is a number of occupied first-type resources associated to the first identity, and the N1 is not greater than the N0.

[1453] As one embodiment, a first operation is associated to the first identity, the N0 is a maximum value of a number of first-type resources occupied by the first operation, and the N1 is a number of first-type resources occupied by the first operation.

[1454] As one sub-embodiment of the above embodiment, the first operation is based on training.

[1455] As one sub-embodiment of the above embodiment, the first operation comprises inference.

[1456] As one embodiment, the first function is associated to the first identity, the first function has P candidate operations, P is a positive integer greater than 1, the N0 is the maximum of the number of first type resources respectively occupied by the P candidate operations, the N1 is the number of first type resources occupied by a first candidate operation, the first candidate operation is a candidate operation of the P candidate operations used for the first function.

[1457] As one sub-embodiment of the above embodiment, any candidate operation of the P candidate operations is based on training.

[1458] As one sub-embodiment of the above embodiment, any candidate operation of the P candidate operations includes inference.

[1459] As one embodiment, the second node is a base station.

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

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

[1462] As one embodiment, the second node is a relay node device.

[1463] As one embodiment, the second processor 3501 includes at least one of {antenna 420, transmitter / receiver 418, transmit processor 416, receive processor 470, multi-antenna transmit processor 471, multi-antenna receive processor 472, controller / processor 475, memory 476} in embodiment 4.

[1464] Those skilled in the art can understand that all or part of the steps in the foregoing method can be instructed by programs to the relevant hardware, and the programs can be stored in a computer readable storage medium, such as a read-only memory, a hard disk, an optical disk or the like. Alternatively, all or part of the steps of the foregoing embodiments can also be implemented using one or more integrated circuits. Correspondingly, each module unit in the foregoing embodiments can be implemented in the form of hardware or in the form of a software function module, and the present application is not limited to any specific form of combination of software and hardware. The user equipment, terminal and UE in the present application include but are not limited to unmanned aerial vehicles, communication modules on unmanned aerial vehicles, remote control aircraft, aircraft, small aircraft, mobile phones, tablet computers, notebooks, vehicle-mounted communication devices, vehicles, vehicles, RSUs, wireless sensors, network cards, Internet of Things terminals, RFID terminals, NB-IOT terminals, MTC (Machine Type Communication) terminals, eMTC (enhanced MTC) terminals, data cards, network cards, vehicle-mounted communication devices, low-cost mobile phones, low-cost tablet computers and other wireless communication devices. The base station or system device in the present application includes but is not limited to macro cellular base stations, micro cellular base stations, small cellular base stations, home base stations, relay base stations, eNBs, gNBs, TRPs (Transmitter Receiver Points), GNSSs, relay satellites, satellite base stations, air base stations, RSUs (Road Side Units), unmanned aerial vehicles, test equipment such as wireless communication devices that simulate part of the functions of base stations or signaling testers, and the like.

[1465] Those skilled in the art will understand that the application can be implemented by other specified forms without departing from the core or essential characteristics thereof. Therefore, the presently disclosed embodiments should in no way be considered as descriptive rather than limiting. The scope of the application is determined by the appended claims rather than the preceding description, and all modifications within the equivalent meaning and range of the claims are considered to be included therein.

Claims

The first node used for wireless communication is characterized by, include: A first processor sends a first report, the first report indicating L0 first-class resources, where L0 is a positive integer; The first processor sends a second report indicating that L1 first-class resources are not occupied, where L1 is a positive integer not greater than L0; Among them, the L0 first-class resources are used for inference. The first node according to claim 1 is characterized in that, The second report is conditional on the resources of the first time domain. The first node according to claim 2 is characterized in that, The L1 depends on the total number of first-class resources occupied in the first time-domain resource; or, the L1 depends on the total number of first-class resources occupied before the first time-domain resource. The first node according to claim 2 is characterized in that, The second report is conditional on the downlink transmission rate on the first time domain resource. The first node according to any one of claims 1 to 4 is characterized in that, The second report is triggered by an event in a first event set, which includes at least one of the following: The change in the quantity of the first type of resource being occupied is greater than the second threshold; At least one type-1 operation is activated or deactivated, and the type-1 operation includes inference; At least one type-1 operation is deployed or redeployed, and the type-1 operation includes inference; At least one type-1 function is activated or deactivated, and the type-1 function depends on reasoning; The first timer expired. The first node according to any one of claims 1 to 4 is characterized in that, The first processor receives a first signaling; wherein the first signaling triggers the second report. The first node according to any one of claims 1 to 6 is characterized in that, Each of the L0 first-class resources includes one or more first-class sub-resources and one or more second-class sub-resources. The second report indicates at least one of the number of unoccupied first-class sub-resources and the number of unoccupied second-class sub-resources in at least one first-class resource other than the L1 first-class resources in the L0 first-class resources. Alternatively, each of the L0 first-class resources includes one or more first-class sub-resources and one or more second-class sub-resources, and the second report indicates at least one of the number of unoccupied first-class sub-resources and the number of unoccupied second-class sub-resources in at least one of the L1 first-class resources. The first node according to any one of claims 1 to 7 is characterized in that, The second report indicates the difference between N0 and N1, where N0 is the maximum number of occupied first-class resources associated with the first identifier, and N1 is the number of occupied first-class resources associated with the first identifier, and N1 is not greater than N0. The first node according to claim 8 is characterized in that, The first operation is associated with the first identifier, where N0 is the maximum value of the number of first-type resources occupied by the first operation, and N1 is the number of first-type resources occupied by the first operation. The first node according to claim 8 is characterized in that, The first function is associated with the first identifier. The first function has P candidate operations, where P is a positive integer greater than 1. N0 is the maximum value among the number of first-type resources occupied by the P candidate operations. N1 is the number of first-type resources occupied by the first candidate operation. The first candidate operation is the candidate operation among the P candidate operations used for the first function. The second node used for wireless communication is characterized by, include: The second processor receives a first report, which indicates L0 first-class resources, where L0 is a positive integer. The second processor receives a second report indicating that L1 first-class resources are not occupied, where L1 is a positive integer not greater than L0; Among them, the L0 first-class resources are used for inference. The second node according to claim 11 is characterized in that, The second report is conditional on the resources of the first time domain. The second node according to claim 12 is characterized in that, The L1 depends on the total number of first-class resources occupied in the first time-domain resource; or, the L1 depends on the total number of first-class resources occupied before the first time-domain resource. The second node according to claim 12 is characterized in that, The second report is conditional on the downlink transmission rate on the first time domain resource. The second node according to any one of claims 11 to 14 is characterized in that, The second report is triggered by an event in a first event set, which includes at least one of the following: The change in the quantity of the first type of resource being occupied is greater than the second threshold; At least one type-1 operation is activated or deactivated, and the type-1 operation includes inference; At least one type-1 operation is deployed or redeployed, and the type-1 operation includes inference; At least one type-1 function is activated or deactivated, and the type-1 function depends on reasoning; The first timer expired. The second node according to any one of claims 11 to 14 is characterized in that, The second processor sends a first signaling message; wherein the first signaling message triggers the second report. The second node according to any one of claims 11 to 16 is characterized in that, Each of the L0 first-class resources includes one or more first-class sub-resources and one or more second-class sub-resources. The second report indicates at least one of the number of unoccupied first-class sub-resources and the number of unoccupied second-class sub-resources in at least one first-class resource other than the L1 first-class resources in the L0 first-class resources. Alternatively, each of the L0 first-class resources includes one or more first-class sub-resources and one or more second-class sub-resources, and the second report indicates at least one of the number of unoccupied first-class sub-resources and the number of unoccupied second-class sub-resources in at least one of the L1 first-class resources. The second node according to any one of claims 11 to 17 is characterized in that, The second report indicates the difference between N0 and N1, where N0 is the maximum number of occupied first-class resources associated with the first identifier, and N1 is the number of occupied first-class resources associated with the first identifier, and N1 is not greater than N0. The second node according to claim 18 is characterized in that, The first operation is associated with the first identifier, where N0 is the maximum value of the number of first-type resources occupied by the first operation, and N1 is the number of first-type resources occupied by the first operation. The second node according to claim 18 is characterized in that, The first function is associated with the first identifier. The first function has P candidate operations, where P is a positive integer greater than 1. N0 is the maximum value among the number of first-type resources occupied by the P candidate operations. N1 is the number of first-type resources occupied by the first candidate operation. The first candidate operation is the candidate operation among the P candidate operations used for the first function. A method used in the first node of wireless communication, characterized in that, include: Send a first report indicating L0 first-class resources, where L0 is a positive integer; Send a second report indicating that L1 first-class resources are not occupied, where L1 is a positive integer not greater than L0; Among them, the L0 first-class resources are used for inference. The method in the first node according to claim 21 is characterized in that, The second report is conditional on the resources of the first time domain. The method in the first node according to claim 22 is characterized in that, The L1 depends on the total number of first-class resources occupied in the first time-domain resource; or, the L1 depends on the total number of first-class resources occupied before the first time-domain resource. The method in the first node according to claim 22 is characterized in that, The second report is conditional on the downlink transmission rate on the first time domain resource. The method in the first node according to any one of claims 21 to 24 is characterized in that, The second report is triggered by an event in a first event set, which includes at least one of the following: The change in the quantity of the first type of resource being occupied is greater than the second threshold; At least one type-1 operation is activated or deactivated, and the type-1 operation includes inference; At least one type-1 operation is deployed or redeployed, and the type-1 operation includes inference; At least one type-1 function is activated or deactivated, and the type-1 function depends on reasoning; The first timer expired. The method in the first node according to any one of claims 21 to 24 is characterized in that, include: Receive the first signaling; The first signaling triggers the second report. The method in the first node according to any one of claims 21 to 26 is characterized in that, Each of the L0 first-class resources includes one or more first-class sub-resources and one or more second-class sub-resources. The second report indicates at least one of the number of unoccupied first-class sub-resources and the number of unoccupied second-class sub-resources in at least one first-class resource other than the L1 first-class resources in the L0 first-class resources. Alternatively, each of the L0 first-class resources includes one or more first-class sub-resources and one or more second-class sub-resources, and the second report indicates at least one of the number of unoccupied first-class sub-resources and the number of unoccupied second-class sub-resources in at least one of the L1 first-class resources. The method in the first node according to any one of claims 21 to 27 is characterized in that, The second report indicates the difference between N0 and N1, where N0 is the maximum number of occupied first-class resources associated with the first identifier, and N1 is the number of occupied first-class resources associated with the first identifier, and N1 is not greater than N0. The method in the first node according to claim 28 is characterized in that, The first operation is associated with the first identifier, where N0 is the maximum value of the number of first-type resources occupied by the first operation, and N1 is the number of first-type resources occupied by the first operation. The method in the first node according to claim 28 is characterized in that, The first function is associated with the first identifier. The first function has P candidate operations, where P is a positive integer greater than 1. N0 is the maximum value among the number of first-type resources occupied by the P candidate operations. N1 is the number of first-type resources occupied by the first candidate operation. The first candidate operation is the candidate operation among the P candidate operations used for the first function. A method used in a second node of wireless communication, characterized in that, include: Receive a first report indicating L0 first-class resources, where L0 is a positive integer; Receive a second report indicating that L1 first-class resources are not occupied, where L1 is a positive integer not greater than L0; Among them, the L0 first-class resources are used for inference. The method in the second node according to claim 31 is characterized in that, The second report is conditional on the resources of the first time domain. The method in the second node according to claim 32 is characterized in that, The L1 depends on the total number of first-class resources occupied in the first time-domain resource; or, the L1 depends on the total number of first-class resources occupied before the first time-domain resource. The method in the second node according to claim 32 is characterized in that, The second report is conditional on the downlink transmission rate on the first time domain resource. The method in the second node according to any one of claims 31 to 34 is characterized in that, The second report is triggered by an event in a first event set, which includes at least one of the following: The change in the quantity of the first type of resource being occupied is greater than the second threshold; At least one type-1 operation is activated or deactivated, and the type-1 operation includes inference; At least one type-1 operation is deployed or redeployed, and the type-1 operation includes inference; At least one type-1 function is activated or deactivated, and the type-1 function depends on reasoning; The first timer expired. The method in the second node according to any one of claims 31 to 34 is characterized in that, include: Send the first signaling; The first signaling triggers the second report. The method in the second node according to any one of claims 31 to 36 is characterized in that, Each of the L0 first-class resources includes one or more first-class sub-resources and one or more second-class sub-resources. The second report indicates at least one of the number of unoccupied first-class sub-resources and the number of unoccupied second-class sub-resources in at least one first-class resource other than the L1 first-class resources in the L0 first-class resources. Alternatively, each of the L0 first-class resources includes one or more first-class sub-resources and one or more second-class sub-resources, and the second report indicates at least one of the number of unoccupied first-class sub-resources and the number of unoccupied second-class sub-resources in at least one of the L1 first-class resources. The method in the second node according to any one of claims 31 to 37 is characterized in that, The second report indicates the difference between N0 and N1, where N0 is the maximum number of occupied first-class resources associated with the first identifier, and N1 is the number of occupied first-class resources associated with the first identifier, and N1 is not greater than N0. The method in the second node according to claim 38 is characterized in that, The first operation is associated with the first identifier, where N0 is the maximum value of the number of first-type resources occupied by the first operation, and N1 is the number of first-type resources occupied by the first operation. The method in the second node according to claim 38 is characterized in that, The first function is associated with the first identifier. The first function has P candidate operations, where P is a positive integer greater than 1. N0 is the maximum value among the number of first-type resources occupied by the P candidate operations. N1 is the number of first-type resources occupied by the first candidate operation. The first candidate operation is the candidate operation among the P candidate operations used for the first function.

Images