Method and apparatus used in coding node for wireless communication

Abstract

Disclosed in the present application are a method and apparatus used in a coding node for wireless communication. The method comprises: a node receiving first signaling, and receiving a first wireless channel, wherein the first signaling indicates scheduling information of the first wireless channel; bit blocks transmitted on the first wireless channel comprise at least a first bit block; a first domain comprised in the first signaling indicates an MCS index used by the first bit block, and the MCS index that is indicated by the first domain and used by the first bit block is associated with K candidate code rates, K being a positive integer greater than 1; the size of the first bit block depends on a first code rate, which is one of the K candidate code rates; and the first signaling indicates the first code rate from among the K candidate code rates. In the present application, AI / ML is introduced for optimizing a coding scheme, so as to improve the transmission performance and spectral efficiency.

Description

A method and apparatus for use in coded nodes for wireless communication Technical Field

[0001] This application relates to signal transmission methods and apparatus in wireless communication systems, and more particularly to coding methods and apparatus that integrate artificial intelligence and communication. Background Technology

[0002] Leveraging AI / ML (Artificial Intelligence / Machine Learning) technologies to enhance 5G network performance is a crucial component of achieving deep integration of 5G and AI / ML and building intelligent dimensions for 5G-Advanced (5.5G) networks. The 3GPP (3rd Generation Partnership Project) standards organization initiated research on standards for RAN (Radio Access Networks) intelligence starting with Rel-16 (Release-16), primarily focusing on intelligent use cases, enhanced data collection, and the potential impact on RAN nodes and interfaces. Rel-18 formally established a project for AI / ML-based 5G air interface enhancement, initiating international standardization work on the integration of 5G air interface and AI / ML, mainly focusing on research into use cases, lifecycle management (LCM), simulation verification, and data collection.

[0003] Currently, the development of AI / ML has entered the stage of large-scale models. Large-scale communication models can realize autonomous networks and intelligent services, support network operation optimization, and improve network efficiency. The deep integration of communication and AI is an important direction for the future evolution of communication. AI will empower the development and upgrading of 5G, 5.5G to 6G, bringing new management models such as automated management of frequency bands and traffic, real-time analysis of user data and network load, and prediction of network status. Summary of the Invention

[0004] In traditional communication systems, coding schemes use a source encoder to encode source information, removing redundancy to obtain a bitstream. This bitstream is then channel-coded, with parity bits added to resist channel noise. After modulation, the bitstream is transmitted to the channel, demodulated, and then the information is reconstructed by a channel decoder and a source decoder. Compared to source-channel separation coding schemes, how to incorporate source characteristics into channel coding through the introduction of AI / ML to further improve spectral efficiency will be an important direction and a problem that needs to be solved in future AI / ML research in the field of wireless communication.

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

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

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

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

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

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

[0011] This application discloses a method for encoding a first node for wireless communication, comprising:

[0012] Receive the first signaling and receive the first radio channel;

[0013] Wherein, the first signaling indicates scheduling information for the first wireless channel; the bit block transmitted on the first wireless channel includes at least a first bit block; the first field included in the first signaling indicates the MCS (Modulation and Coding Scheme) index used by the first bit block, the MCS index used by the first bit block indicated by the first field is associated with K candidate code rates, where K is a positive integer greater than 1; the size of the first bit block depends on a first code rate, which is one of the K candidate code rates; the first signaling indicates the first code rate from the K candidate code rates.

[0014] As an example, the problems to be solved by this application include: In traditional wireless communication, a single transmission of a channel corresponds to only one code rate, and the determination of the code rate is mainly limited by the MCS (Modulation and Coding Scheme) and the number of allocated REs (Resource Elements), and has nothing to do with the content being transmitted or the service type corresponding to the content being transmitted.

[0015] As an example, the problems to be solved by this application include: in existing downlink scheduling, one MCS index corresponds to one target code rate, and the determination of the target code rate does not take into account the correlation of the transmitted source data and the characteristics of the corresponding logical channel; while in this scheme, one MCS index is associated with K candidate code rates, so different code rates can be flexibly indicated under one MCS index, thereby maximizing the correlation of the transmitted source data, reducing coding redundancy, and improving spectrum efficiency.

[0016] As an example, the features of the above method include: at least one of the K candidate code rates is generated based on AI / ML, so as to make full use of AI / ML tools to improve spectral efficiency and optimize performance.

[0017] As an example, the features of the above method include: at least one of the K candidate bitrates is a bitrate generated by an existing encoder, thereby ensuring the compatibility of this scheme.

[0018] As an example, the advantages of the above method include: this application supports the deep integration of AI and communication, improves the adaptability and intelligence level of the communication system, and thus enhances the performance, efficiency and user experience of the communication system.

[0019] As an example, the advantages of the above method include: simplified protocol implementation, good compatibility based on existing methods for determining TBS (Transport Block Size).

[0020] According to one aspect of this application, the method is characterized in that the second field included in the first signaling indicates the first code rate from the K candidate code rates; the first bit block corresponds to a MAC (Medium Access Control) SDU (Service Data Unit), and the second field included in the first signaling is used to determine the LCID (Logical Channel Identifier) ​​or eLCID in the MAC subheader of the MAC SDU corresponding to the first bit block.

[0021] As an example, the features of the above method include: when the determination of the first code rate is based on the correlation of the logical channel corresponding to the first bit block by the AI / ML algorithm, the LCID or eLCID (Enhanced Logical Channel Identifier) ​​corresponding to the first bit block will also be associated with the first code rate, thereby enabling the determination of the LCID or eLCID of the first bit block through the second field included in the first signaling, reducing signaling overhead and avoiding secondary transmission of LCID or eLCID.

[0022] According to one aspect of this application, the above method is characterized in that the input of the first encoder includes at least the first bit block, and the candidates of the first encoder include K encoders, the K encoders being associated with the K candidate bit rates respectively.

[0023] As an example, the features of the above method include: the first encoder is used to encode the first bit block, thereby ensuring that the design of the first encoder makes full use of the statistical characteristics from the first bit block to achieve maximum performance improvement.

[0024] As an example, the features of the above method include: the K encoders correspond to the K candidate bitrates, which facilitates the system side to indirectly determine the corresponding candidate bitrate by instructing the encoders.

[0025] According to one aspect of this application, the method is characterized in that the third field included in the first signaling indicates a first coefficient; the first coefficient and the scheduling information of the first wireless channel are used together to determine the first resource set size occupied by the first bit block, the size of the first bit block depending on the first resource set size, the MCS index used by the first bit block, and the first code rate.

[0026] As an example, the features of the above method include: determining the size of the time-frequency resources occupied by the first bit block by instructing the first coefficient, thereby facilitating flexible adjustment of the size of the first bit block to improve scheduling flexibility and fully utilize the system gains brought by AI / ML.

[0027] According to one aspect of this application, the method is characterized in that the bits transmitted on the first wireless channel include the outputs of Q encoders; the inputs of the Q encoders each include Q bit blocks; the first encoder is an encoder among the Q encoders whose input includes the first bit blocks; the Q encoders are each associated with Q MCS indices, and the Q encoders are each associated with Q code rates.

[0028] As an example, the features of the above method include: the Q encoders correspond to Q logical channels or logical channel groups respectively, and the Q encoders independently optimize the code rate through AI / ML, thereby maximizing the reduction of redundancy in coding and improving spectral efficiency.

[0029] According to one aspect of this application, the above method is characterized in that Q is greater than 1, and the size of any one of the Q bit blocks is not less than a first threshold.

[0030] As an example, the characteristics of the above method include: each bit block cannot be too small in order to ensure the coding gain brought about by the interleaving depth of the encoding.

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

[0032] Send the first information block;

[0033] The first information block is used to determine the K candidate code rates.

[0034] As an example, the features of the above method include: the first node reporting the K candidate bitrates that it can support, and then reporting the encoder types supported by the first node, so as to facilitate network-side indication and achieve unification between the encoding and decoding sides.

[0035] According to one aspect of this application, the above method is characterized in that the first node is a user equipment.

[0036] According to one aspect of this application, the above method is characterized in that the first node is a terminal.

[0037] As an example, the features of the above method include: the first node is configured with an entity for AI / ML.

[0038] As an example, the features of the above method include: the first node is configured with an AI / ML model.

[0039] As an example, the features of the above method include: the first node is configured with a Functionality for AI / ML.

[0040] As an example, the features of the above method include: the first node includes an entity for AI / ML.

[0041] As an example, the features of the above method include: the first node includes an AI / ML model.

[0042] As an example, the features of the above method include: the first node includes a Functionality for AI / ML.

[0043] This application discloses a method for encoding a second node for wireless communication, comprising:

[0044] Send the first signaling and send the first radio channel;

[0045] Wherein, the first signaling indicates scheduling information for the first wireless channel; the bit block transmitted on the first wireless channel includes at least a first bit block; a first field included in the first signaling indicates the MCS index used by the first bit block, the MCS index used by the first bit block indicated by the first field is associated with K candidate code rates, where K is a positive integer greater than 1; the size of the first bit block depends on a first code rate, which is one of the K candidate code rates; the first signaling indicates the first code rate from the K candidate code rates.

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

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

[0048] As an example, the features of the above method include: the second node includes an entity for deploying AI / ML models.

[0049] As an example, the features of the above method include: the second node includes a node for deploying AI / ML models.

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

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

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

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

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

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

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

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

[0058] As an example, the features of the above method include: the base station in this application includes an entity for deploying AI / ML models.

[0059] As an example, the features of the above method include: the base station in this application includes nodes for deploying AI / ML models.

[0060] According to one aspect of this application, the method is characterized in that the second field included in the first signaling indicates the first code rate from the K candidate code rates; the first bit block corresponds to a MAC SDU, and the second field included in the first signaling is used to determine the LCID or eLCID in the MAC subheader of the MAC SDU corresponding to the first bit block.

[0061] According to one aspect of this application, the above method is characterized in that the input of the first encoder includes at least the first bit block, and the candidates of the first encoder include K encoders, the K encoders being associated with the K candidate bit rates respectively.

[0062] According to one aspect of this application, the method is characterized in that the third field included in the first signaling indicates a first coefficient; the first coefficient and the scheduling information of the first wireless channel are used together to determine the first resource set size occupied by the first bit block, the size of the first bit block depending on the first resource set size, the MCS index used by the first bit block, and the first code rate.

[0063] According to one aspect of this application, the method is characterized in that the bits transmitted on the first wireless channel include the outputs of Q encoders; the inputs of the Q encoders each include Q bit blocks; the first encoder is an encoder among the Q encoders whose input includes the first bit blocks; the Q encoders are each associated with Q MCS indices, and the Q encoders are each associated with Q code rates.

[0064] According to one aspect of this application, the above method is characterized in that Q is greater than 1, and the size of any one of the Q bit blocks is not less than a first threshold.

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

[0066] Receive the first information block;

[0067] The first information block is used to determine the K candidate code rates.

[0068] According to one aspect of this application, the method described above is characterized in that the second node is a base station.

[0069] According to one aspect of this application, the above method is characterized in that the second node includes a TRP (transmitter-receiver point).

[0070] This application discloses a first coded node for wireless communication, comprising:

[0071] The first receiver receives the first signaling and the first wireless channel;

[0072] Wherein, the first signaling indicates scheduling information for the first wireless channel; the bit block transmitted on the first wireless channel includes at least a first bit block; a first field included in the first signaling indicates the MCS index used by the first bit block, the MCS index used by the first bit block indicated by the first field is associated with K candidate code rates, where K is a positive integer greater than 1; the size of the first bit block depends on a first code rate, which is one of the K candidate code rates; the first signaling indicates the first code rate from the K candidate code rates.

[0073] This application discloses a second coded node for wireless communication, comprising:

[0074] The second transmitter sends the first signaling and transmits the first wireless channel;

[0075] Wherein, the first signaling indicates scheduling information for the first wireless channel; the bit block transmitted on the first wireless channel includes at least a first bit block; a first field included in the first signaling indicates the MCS index used by the first bit block, the MCS index used by the first bit block indicated by the first field is associated with K candidate code rates, where K is a positive integer greater than 1; the size of the first bit block depends on a first code rate, which is one of the K candidate code rates; the first signaling indicates the first code rate from the K candidate code rates.

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

[0077] This application supports the deep integration of AI and communication to improve the adaptability and intelligence of communication systems, thereby enhancing the performance, efficiency, and user experience of communication systems.

[0078] By introducing AI / ML, the correlation of data can be fully explored to reduce bit rate and improve spectrum efficiency.

[0079] To take into account the characteristics of multiple logical channels included in a single scheduling, multiple independent encoders are designed to fully utilize the correlation of data and improve spectral efficiency. Attached Figure Description

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

[0081] Figure 1 illustrates a flowchart of the first node transmission according to an embodiment of this application;

[0082] Figure 2 shows a schematic diagram of a network architecture according to an embodiment of this application;

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

[0084] Figure 4 shows a schematic diagram of a first communication device and a second communication device according to an embodiment of this application;

[0085] Figure 5 shows a first flowchart of the transmission between a first node and a second node according to an embodiment of this application;

[0086] Figure 6 illustrates a second flowchart of the transmission between a first node and a second node according to an embodiment of this application;

[0087] Figure 7 shows a schematic diagram of a first encoder according to an embodiment of this application;

[0088] Figure 8 shows a schematic diagram of Q encoders according to an embodiment of this application;

[0089] Figure 9 shows a schematic diagram of the first signaling according to an embodiment of this application;

[0090] Figure 10 shows a schematic diagram of RAN domain AI / ML function deployment according to an embodiment of this application;

[0091] Figure 11 shows a schematic diagram of the AI / ML function deployment of a UE according to an embodiment of this application;

[0092] Figure 12 shows a schematic diagram of a processing system based on artificial intelligence or machine learning according to an embodiment of this application;

[0093] Figure 13 illustrates a schematic diagram of artificial intelligence or machine learning according to an embodiment of this application;

[0094] Figure 14 shows a structural block diagram of a processing apparatus for a first node according to an embodiment of the present application;

[0095] Figure 15 shows a structural block diagram of a processing apparatus for a second node according to an embodiment of this application. Detailed Implementation

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

[0097] Example 1

[0098] Example 1 illustrates a flowchart of the first node transmission according to an embodiment of this application, as shown in Figure 1. In Figure 1, each block represents a step. In particular, the order of the steps in the blocks does not represent a specific temporal relationship between the steps.

[0099] The first node receives the first signaling in step 101 and receives the first wireless channel in step 102.

[0100] In Embodiment 1, the first signaling indicates scheduling information for the first wireless channel; the bit block transmitted on the first wireless channel includes at least a first bit block; a first field included in the first signaling indicates the MCS index used by the first bit block, the MCS index used by the first bit block indicated by the first field is associated with K candidate code rates, where K is a positive integer greater than 1; the size of the first bit block depends on a first code rate, which is one of the K candidate code rates; the first signaling indicates the first code rate from the K candidate code rates.

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

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

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

[0104] As an example, the first signaling is a downlink grant (DL Grant).

[0105] As an example, the first signaling is DCI (Downlink Control Information).

[0106] As an example, the physical layer channel occupied by the first signaling includes the PDCCH (Physical Downlink Control Channel).

[0107] As one embodiment, the first signaling schedules the reception of the first wireless channel.

[0108] As an example, the physical layer channel corresponding to the first wireless channel includes PDSCH (Physical Downlink Shared Channel).

[0109] As an example, the transmission channel corresponding to the first wireless channel includes DL-SCH (Downlink Shared Channel).

[0110] As an example, the first wireless channel is generated by a TB (Transport Block).

[0111] As an example, the first wireless channel is generated by at least one TB.

[0112] As one embodiment, the first wireless channel is for a transmission with a downlink license.

[0113] As one example, the first wireless channel is for a transmission scheduled for a downlink.

[0114] As an example, the first wireless channel is generated by at least one CB (Code Block).

[0115] As one embodiment, the scheduling information of the first wireless channel includes the time-domain resources occupied by the first wireless channel.

[0116] As one embodiment, the scheduling information of the first wireless channel includes the frequency domain resources occupied by the first wireless channel.

[0117] As one embodiment, the scheduling information of the first wireless channel includes the time-frequency resources occupied by the first wireless channel.

[0118] As one embodiment, the scheduling information of the first wireless channel includes the HARQ (Hybrid Automatic Repeat reQuest) process number corresponding to the first wireless channel.

[0119] As one embodiment, the scheduling information of the first wireless channel includes the TCI (Transmission Configuration Indication) used by the first wireless channel.

[0120] As one embodiment, the scheduling information of the first wireless channel includes the RV (Redundancy Version) used by the first wireless channel.

[0121] As an example, the first bit block is a CB.

[0122] As an example, the first bit block is a data block.

[0123] As an example, the first bit block is an information block.

[0124] As one embodiment, the first bit block comprises a positive integer number of bits.

[0125] As an example, all of the K candidate code rates correspond to the MCS index used by the first bit block.

[0126] As an example, all of the K candidate code rates correspond to a Q. m .

[0127] As an example, all of the K candidate code rates correspond to a modulation order.

[0128] As an example, at least one of the K candidate bitrates corresponds to the traditional target bitrate.

[0129] As an example, at least one of the K candidate code rates corresponds to an I in Table 5.1.3.1-1 of TS 38.214-i20. MCS The corresponding target bitrate.

[0130] As an example, at least one of the K candidate code rates corresponds to an I in Table 5.1.3.1-2 of TS 38.214-i20. MCS The corresponding target bitrate.

[0131] As an example, at least one of the K candidate code rates corresponds to an I in Table 5.1.3.1-3 of TS 38.214-i20. MCS The corresponding target bitrate.

[0132] As an example, at least one of the K candidate code rates corresponds to an I in Table 5.1.3.1-4 of TS 38.214-i20. MCS The corresponding target bitrate.

[0133] As an example, at least one of the K candidate code rates is any one of Tables 5.1.3.1-1, 5.1.3.1-2, 5.1.3.1-3, or 5.1.3.1-4 in TS 38.214-i20. MCS The bitrate other than the target bitrate.

[0134] As an example, any one of the K candidate code rates is a real number greater than 0.

[0135] As an example, the MCS index in this application is the MCS Index.

[0136] As an example, the MCS index in this application corresponds to I. MCS .

[0137] As an example, the MCS index in this application is a value from 0 to 31.

[0138] As an example, the spectral efficiency corresponding to any of the K candidate code rates is a real number between 0 and 10.

[0139] As an example, the K candidate bit rates all correspond to the encoder for the first bit block.

[0140] As an example, the K candidate bit rates correspond to K encoders respectively.

[0141] As an example, the code rate of the encoder for the first bit block is one of the K candidate code rates.

[0142] As an example, the encoder for the first bit block can implement any of the K candidate code rates.

[0143] As an example, the size of the first bit block includes the number of information bits included in the first bit block.

[0144] As an example, the size of the first bit block includes the number of bits included in the first bit block.

[0145] As an example, the first field included in the first signaling is used only to indicate the MCS index used by the first bit block.

[0146] As an example, the first field included in the first signaling is used to indicate the MCS index used by the first wireless channel, and all bit blocks included in the first wireless channel use the same MCS index.

[0147] As an example, the first signaling explicitly indicates the first code rate from the K candidate code rates.

[0148] As an example, the first signaling implicitly indicates the first code rate from the K candidate code rates.

[0149] As an example, the first signaling directly indicates the first code rate from the K candidate code rates.

[0150] As an example, the first signaling indirectly indicates the first code rate from the K candidate code rates.

[0151] As an example, the DCI format used in the first signaling is used to determine the first code rate from the K candidate code rates.

[0152] As an example, the RNTI (Radio Network Temporary Identity) of the CRC included in the scrambling of the first signaling is used to determine the first code rate from the K candidate code rates.

[0153] As an example, K equals 2, and the K candidate code rates are respectively a first candidate code rate and a second candidate code rate. The first candidate code rate is one of Tables 5.1.3.1-1, 5.1.3.1-2, 5.1.3.1-3, or 5.1.3.1-4 in the existing TS 38.214-i20. MCS The corresponding target bitrate, and the second candidate bitrate is the bitrate generated based on AI / ML.

[0154] As an example, at least one of the K candidate code rates is determined based on AI / ML.

[0155] As an example, at least one of the K candidate code rates depends on inference.

[0156] As an example, at least one of the K candidate code rates depends on prediction.

[0157] As an example, (K-1) of the K candidate code rates are determined based on AI / ML.

[0158] As an example, (K-1) of the K candidate code rates are inference-dependent.

[0159] As an example, (K-1) of the K candidate code rates depend on prediction.

[0160] As an example, there are two candidate code rates that are the same among the K candidate code rates.

[0161] As an example, the K candidate code rates are configured independently.

[0162] As an example, the K candidate code rates are optimized independently.

[0163] It should be noted that receiving (or transmitting) the first wireless channel is a common expression in the art, meaning receiving (or transmitting) on ​​the first wireless channel, or meaning receiving (or transmitting) signals (e.g., modulation symbols) on the first wireless channel; the above expression is beneficial for maintaining consistency with the general expression in the art.

[0164] Typically, the first node recovers (or decodes) the first bit block based on the signal on the first wireless channel. The specific decoding algorithm is implementation-dependent, meaning it is determined by the hardware vendor of the first node; however, those skilled in the art will know that, in effect, the decoding algorithm can generally be considered the inverse operation of the encoder of the first bit block, and the first node, as the decoding end, needs to know the size of the first bit block for decoding. Therefore, the limitation on the size of the first bit block depending on the first code rate in this application has a substantial impact on the first node.

[0165] Example 2

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

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

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

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

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

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

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

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

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

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

[0176] As an example, node B 203 is a base station device that supports large latency differences.

[0177] As an example, node B 203 is a flight platform device.

[0178] As an example, node B 203 is a satellite device.

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

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

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

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

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

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

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

[0186] As an example, the node B 203 supports the deployment of network-side (NW-side) AI / ML models.

[0187] As an example, the UE 201 supports the deployment of UE-side AI / ML models.

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

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

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

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

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

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

[0194] As an example, the sender of the first wireless channel in this application includes the node B 203.

[0195] As an example, the receiver of the first wireless channel in this application includes the UE 201.

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

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

[0198] Example 3

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

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

[0201] As an example, the wireless protocol architecture in Figure 3 is applicable to the first node in this application.

[0202] As an example, the wireless protocol architecture in Figure 3 is applicable to the second node in this application.

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

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

[0205] As an example, in this application, the first signaling is generated in MAC302 or MAC352.

[0206] As an example, in this application, the first wireless channel is generated in the PHY301 or PHY351.

[0207] As an example, in this application, the first wireless channel is generated by MAC302 or MAC352.

[0208] As an example, in this application, the first information block is generated in the PHY301 or PHY351.

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

[0210] Example 4

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

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

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

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

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

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

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

[0218] As one embodiment, the second communication device 450 includes: at least one processor and at least one memory, the at least one memory including computer program code; the at least one memory and the computer program code are configured to be used with the at least one processor. The second communication device 450 receives at least a first signaling and a first wireless channel; the first signaling indicates scheduling information for the first wireless channel; a bit block transmitted on the first wireless channel includes at least a first bit block; a first field included in the first signaling indicates an MCS index used by the first bit block, the MCS index indicated by the first field being associated with K candidate code rates, where K is a positive integer greater than 1; the size of the first bit block depends on a first code rate, the first code rate being one of the K candidate code rates; the first signaling indicates the first code rate from the K candidate code rates.

[0219] As one embodiment, the second communication device 450 includes: a memory storing a computer-readable instruction program that, when executed by at least one processor, produces actions including: receiving a first signaling and receiving a first wireless channel; the first signaling indicating scheduling information of the first wireless channel.

[0220] As one embodiment, the first communication device 410 includes: at least one processor and at least one memory, the at least one memory including computer program code; the at least one memory and the computer program code are configured to be used with the at least one processor. The first communication device 410 means to transmit at least a first signaling and a first wireless channel; the first signaling indicates scheduling information for the first wireless channel; a bit block transmitted on the first wireless channel includes at least a first bit block; a first field included in the first signaling indicates the MCS index used by the first bit block, the MCS index indicated by the first field being associated with K candidate code rates, where K is a positive integer greater than 1; the size of the first bit block depends on a first code rate, the first code rate being one of the K candidate code rates; the first signaling indicates the first code rate from the K candidate code rates.

[0221] As one embodiment, the first communication device 410 includes: a memory storing a computer-readable instruction program that, when executed by at least one processor, produces actions including: sending a first signaling and sending a first wireless channel; the first signaling indicating scheduling information for the first wireless channel.

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

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

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

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

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

[0227] Example 5

[0228] Example 5 illustrates a flowchart of transmission between a first node and a second node according to an embodiment of this application, as shown in Figure 5. In Figure 5, the first node U1 and the second node N2 communicate via a wireless link. It should be noted that the order in this embodiment does not limit the signal transmission order or the order of implementation in this application.

[0229] For the first node U1, the first signaling is received in step S510; the first wireless channel is received in step S511.

[0230] For the second node N2, a first signaling is sent in step S520; a first wireless channel is sent in step S521.

[0231] In Embodiment 5, the first signaling indicates scheduling information for the first wireless channel; the bit block transmitted on the first wireless channel includes at least a first bit block; a first field included in the first signaling indicates the MCS index used by the first bit block, the MCS index used by the first bit block indicated by the first field is associated with K candidate code rates, where K is a positive integer greater than 1; the size of the first bit block depends on a first code rate, which is one of the K candidate code rates; the first signaling indicates the first code rate from the K candidate code rates.

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

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

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

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

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

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

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

[0239] As one embodiment, the encoding of the first bit block is performed at the second node, and the decoding of the first bit block is performed at the first node.

[0240] As an example, the encoding method of the first bit block is known in both the first node and the second node.

[0241] Typically, the bits transmitted on the first wireless channel include the outputs of Q encoders; the inputs of the Q encoders each include Q bit blocks; the first encoder is the encoder among the Q encoders whose input includes the first bit blocks; the Q encoders are each associated with Q MCS indices, and the Q encoders are each associated with Q code rates.

[0242] As an example, the first bit block is one of the Q bit blocks.

[0243] As one embodiment, the bits transmitted on the first wireless channel include the outputs of the Q bit blocks after being encoded by the Q encoders respectively.

[0244] As one example, the Q encoders each correspond to a Q logical channel.

[0245] As one embodiment, the Q encoders each correspond to a Q logical channel group.

[0246] As one embodiment, the Q encoders each correspond to a Q wireless bearer.

[0247] As an example, the Q encoders each correspond to a Q service.

[0248] As an example, the Q encoders correspond to Q service types respectively.

[0249] As an example, the Q encoders each correspond to a channel from the RLC layer to the MAC layer.

[0250] As an example, the Q encoders each correspond to a channel from the MAC layer to the MAC layer above the MAC layer.

[0251] As an example, the Q encoders each correspond to a channel from the RLC layer or above to the MAC layer.

[0252] As an example, any one of the Q encoders corresponds to one of the TM, UM, or AM of the RLC layer.

[0253] As an example, any one of the Q encoders corresponds to one of the TM / UM or AM layers in the RLC layer.

[0254] As an example, the Q encoders each correspond to a Q ID.

[0255] As one embodiment, the first signaling includes Q first-class fields, and the Q first-class fields included in the first signaling respectively indicate the Q MCS indices associated with the Q encoders.

[0256] As a sub-example of this embodiment, the Q bit blocks are respectively indexed by the Q MCS.

[0257] As a sub-implementation of this embodiment, the first field in this application is the first class field corresponding to the first bit block among the Q first class fields.

[0258] As one embodiment, the first signaling includes Q second-class fields, and the Q second-class fields included in the first signaling respectively indicate the Q code rates associated with the Q encoders.

[0259] As a sub-example of this embodiment, the Q bit blocks each employ the Q code rates.

[0260] As a sub-implementation of this embodiment, the second field in this application is the second type field corresponding to the first bit block among the Q second type fields.

[0261] As one embodiment, the first signaling includes Q third-class fields, and the Q third-class fields included in the first signaling respectively indicate Q first-class coefficients, which are used to determine the Q resource set sizes allocated to the Q bit blocks.

[0262] As a sub-implementation of this embodiment, the Q bit blocks each adopt the Q resource set sizes.

[0263] As a sub-implementation of this embodiment, the Q first-type coefficients and the number of time-frequency resources allocated to the first wireless channel are respectively used to determine the size of the Q resource sets.

[0264] As a sub-implementation of this embodiment, the third field in this application is the third field corresponding to the first bit block among the Q third-class fields.

[0265] As a sub-implementation of this embodiment, the first coefficient in this application is the first type coefficient corresponding to the first bit block among the Q first type coefficients.

[0266] As a sub-implementation of this embodiment, any one of the Q first-type coefficients is a real number between 0 and 1.

[0267] As a sub-implementation of this embodiment, any one of the Q first-type coefficients is a percentage.

[0268] As an example, the second node implements the relevant configuration of time-frequency resources corresponding to Q resource set sizes for the Q bit blocks.

[0269] As one embodiment, the second node configures the time-frequency resources corresponding to the first resource set size for the first bit block according to the number of remaining bits in the logical channel or logical channel group corresponding to the first bit block.

[0270] Typically, the first node recovers (or decodes) the Q bit blocks based on the signal on the first wireless channel. The specific decoding algorithm is implementation-dependent, i.e., determined by the hardware vendor of the first node; however, those skilled in the art will know that, in effect, the decoding algorithm can generally be considered as the inverse operation of the encoder of the Q bit blocks, and the first node, as the decoding end, needs to know the size of the Q bit blocks in order to decode them.

[0271] Typically, the encoding of the Q bit blocks is performed at the second node, and the decoding of the Q bit blocks is performed at the first node.

[0272] Typically, the Q encoders are independently encoded.

[0273] Typically, the Q encoders correspond to Q decoders, and the Q decoders decode independently.

[0274] Typically, Q is greater than 1, and the size of any one of the Q bit blocks is not less than a first threshold.

[0275] As an example, the first threshold is predefined.

[0276] As an example, the first threshold is fixed.

[0277] As an example, the first threshold is configurable.

[0278] As an example, the first threshold depends on the TBS table.

[0279] As an example, the first threshold is the minimum TBS in the TBS table.

[0280] As an example, the first threshold is 24.

[0281] As an example, the first threshold depends on the capabilities of the first node.

[0282] As an example, the first threshold depends on the FeatureCombination of the first node.

[0283] As an example, the first threshold depends on the UECapabilityInformation of the first node.

[0284] As an example, the first threshold depends on the UEAssistanceInformation of the first node.

[0285] As an example, the first threshold depends on the UEInformationResponse of the first node.

[0286] Typically, the RE in this application corresponds to a minimum time-frequency resource.

[0287] Typically, in this application, the RE corresponds to the time-domain resource of a multi-carrier symbol in the time domain and the frequency-domain resource of a subcarrier in the frequency domain.

[0288] As an example, the multicarrier symbol described in this application is an OFDM (Orthogonal Frequency Division Multiplexing) symbol.

[0289] As an example, the multi-carrier symbol described in this application is the FBMC (Filter Bank Multi Carrier) symbol.

[0290] As an example, the multi-carrier symbol described in this application is the UFMC (Universal Filtered Multi Carrier) symbol.

[0291] As an example, the multicarrier symbol described in this application is an F-OFDM (Filtered-OFDM) symbol.

[0292] As an example, the multicarrier symbol described in this application is an OCDM-OFDM (Orthogonal Chirp Division Multiplexing-OFDM) symbol.

[0293] As an example, the multicarrier symbol described in this application is a CP-OFDM (Cyclic Prefix-OFDM) symbol.

[0294] Example 6

[0295] Example 6 illustrates a flowchart of transmission between a first node and a second node according to another embodiment of this application, as shown in Figure 6. In Figure 6, the first node U3 and the second node N4 communicate via a wireless link. It should be noted that the order in this embodiment does not limit the signal transmission order or the order of implementation in this application.

[0296] For the first node U3, the first information block is sent in step S610.

[0297] For the second node N4, the first information block is received in step S620.

[0298] In Example 6, the first information block is used to determine the K candidate code rates.

[0299] As an example, the first information block is determined by the capabilities of the first node.

[0300] As one embodiment, the first information block includes the FeatureCombination of the first node.

[0301] As one embodiment, the first information block includes the UECapabilityInformation of the first node.

[0302] As one embodiment, the first information block includes the UEAssistanceInformation of the first node.

[0303] As one example, the first information block includes the UEInformationResponse of the first node.

[0304] As an example, the physical layer channel occupied by the first information block includes PUCCH.

[0305] As an example, the physical layer channel occupied by the first information block includes PUSCH.

[0306] As one embodiment, the transmission channel occupied by the first information block includes UL-SCH.

[0307] As an example, step S610 is located before step S510 in Example 5.

[0308] As an example, step S620 is located before step S520 in Example 5.

[0309] Example 7

[0310] Example 7 illustrates a schematic diagram of a first encoder according to an embodiment of this application, as shown in Figure 7. In Figure 7, the input of the first encoder includes at least the first bit block, and the candidates for the first encoder include K encoders, each of which is associated with one of the K candidate bit rates.

[0311] In embodiment 7, the input of the first encoder includes the first bit block.

[0312] As one embodiment, the first bit block includes L data blocks arranged sequentially, namely data block #1, data block #2, ..., data block #L; the first node converts the output V of the first encoder... i Send to the second node; the V i It is a bit block.

[0313] As an example, the first bit block is one of the L data blocks.

[0314] As an example, the first bit block includes a portion of the data blocks from the L data blocks.

[0315] Generally speaking, how the first node utilizes the output V of the first encoder... i The method for recovering the L data blocks is implementation-dependent, meaning it is determined by the hardware vendor of the first node; the first decoder in Embodiment 7 is merely a non-limiting implementation. As shown in Figure 7, the input of the first decoder includes the V... i And L data blocks arranged in sequence, namely data block #1, data block #2, ..., data block #L.

[0316] In Example 7, when the output W of the first decoder i When the CRC check passes, the L data blocks are correctly received; when the output W of the first decoder... i If the CRC check fails, the L data blocks are not received correctly.

[0317] As an example, any one of the L sequentially arranged data blocks is a bit block, and the output W of the first decoder i It is a block of bits.

[0318] In the above embodiments, the input and output of the first encoder are both bit blocks, and the input and output of the first decoder are both bit blocks; therefore, the training dataset used to train the AI ​​model is also a quantized bit block.

[0319] As a sub-example of the above embodiment, the CRC check applies the CRC bit block of the L bit blocks.

[0320] As a sub-implementation of the above embodiment, the CRC check applies the CRC bit block of the first bit block.

[0321] As an example, any one of the L sequentially arranged data blocks includes at least one service data, which is a complex number or a vector; the output W of the first decoder i It is a data block.

[0322] In the above embodiments, the input and output of the first encoder are both bit blocks, and the input and output of the first decoder are both bit blocks; therefore, the training dataset used to train the AI ​​model is also a bit block.

[0323] As a sub-implementation of the above embodiment, the CRC check applies the CRC bit block of the L bit blocks, which is obtained after quantization.

[0324] As a sub-implementation of the above embodiment, the CRC check applies a CRC bit block of a first bit block, which is obtained after quantization.

[0325] As an example, the first encoder corresponds to a set of encoding configuration parameters.

[0326] As an example, the first encoder corresponds to a training dataset.

[0327] As an example, the first encoder corresponds to one inference.

[0328] As an example, the first encoder corresponds to an AI / ML model.

[0329] As an example, the first encoder corresponds to an AI / ML model ID.

[0330] As an example, the first encoder corresponds to a Functionality.

[0331] As an example, the first encoder corresponds to an Associated ID.

[0332] As one example, the first encoder corresponds to a logical channel.

[0333] As one embodiment, the first encoder corresponds to a logical channel group.

[0334] As one embodiment, the first encoder corresponds to a radio bearer.

[0335] As one example, the first encoder corresponds to a type of service.

[0336] As an example, the first encoder corresponds to a service type.

[0337] As an example, the first encoder is based on AI / ML.

[0338] As an example, the first encoder is based on AI.

[0339] As an example, the first encoder relies on inference.

[0340] As an example, the first encoder relies on prediction.

[0341] As an example, the first adjustment factor is generated based on inference.

[0342] As an example, the first adjustment factor is generated based on prediction.

[0343] As an example, the output of the first encoder includes a CRC attachment step.

[0344] As an example, the output of the first encoder includes a CB Segmentation step.

[0345] As an example, the output of the first encoder includes a Rate Matching step.

[0346] As an example, the output of the first encoder includes an encoding step.

[0347] As an example, the output of the first encoder includes a scrambling step.

[0348] As an example, the steps described above for the output of the first encoder can be combined arbitrarily.

[0349] As an example, the order of the steps described above for the output of the first encoder can be arranged arbitrarily.

[0350] As an example, any one of the K encoders is based on AI / ML.

[0351] As an example, each of the K encoders corresponds to a set of encoding configuration parameters.

[0352] As an example, each of the K encoders corresponds to a training dataset.

[0353] As an example, any one of the K encoders corresponds to one inference.

[0354] As an example, any one of the K encoders corresponds to an AI / ML model.

[0355] As an example, any one of the K encoders corresponds to an AI / ML model ID.

[0356] As an example, any one of the K encoders corresponds to a Functionality.

[0357] As an example, each of the K encoders corresponds to an Associated ID.

[0358] As an example, each of the K encoders corresponds to a logical channel.

[0359] As an example, any one of the K encoders corresponds to a logical channel group.

[0360] As an example, each of the K encoders corresponds to a radio bearer.

[0361] As an example, any one of the K encoders corresponds to a type of service.

[0362] As an example, any one of the K encoders corresponds to a service type.

[0363] As an example, any one of the K encoders is based on AI / ML.

[0364] As an example, any one of the K encoders is AI-based.

[0365] As an example, any one of the K encoders depends on inference.

[0366] As an example, any one of the K encoders depends on prediction.

[0367] Example 8

[0368] Example 8 illustrates a schematic diagram of Q encoders according to one embodiment of this application, as shown in Figure 8. In Figure 8, encoders #1 to #Q correspond to the Q encoders, all of which are located at the second node in this application. The first encoder in this application is one of the Q encoders.

[0369] In embodiment 8, the bits transmitted on the first wireless channel include the outputs of Q encoders; the inputs of the Q encoders each include Q bit blocks; the first encoder is the encoder whose input includes the first bit block; the Q encoders are each associated with Q MCS indices, and the Q encoders are each associated with Q code rates.

[0370] As an example, the total size of the Q bit blocks is determined based on LCP (Logical Channel Prioritization).

[0371] As an example, the total size of the Q bit blocks is determined based on the scheduling of the first signaling.

[0372] As an example, the size of the Q bit blocks is determined by the Q bit rates associated with the Q encoders.

[0373] As an example, the second node implements a method to determine the size of the time-frequency resources occupied by the first wireless channel based on the total size of the Q bit blocks.

[0374] As an example, the second node implements the determination of the Q bitrates associated with the Q encoders.

[0375] Example 9

[0376] Example 9 illustrates a schematic diagram of a first signaling according to an embodiment of this application, as shown in Figure 9. In Figure 9, the first signaling includes a second field and a third field.

[0377] Typically, the second field included in the first signaling indicates the first code rate from the K candidate code rates; the first bit block corresponds to a MAC SDU, and the second field included in the first signaling is used to determine the LCID or eLCID in the MAC subheader of the MAC SDU corresponding to the first bit block.

[0378] As an example, the K candidate code rates correspond to K IDs respectively, and the second field included in the first signaling is used to indicate the ID corresponding to the first code rate from the K IDs.

[0379] As a sub-example of this embodiment, the K IDs correspond to K encoders respectively, and the encoder corresponding to the first bit rate is the first encoder among the K encoders.

[0380] As a sub-implementation of this embodiment, the K IDs all correspond to the first encoder in this application.

[0381] As an example, the ID mentioned in this application refers to IDentify, proof.

[0382] As an example, the ID mentioned in this application refers to: IDentification, identity verification.

[0383] As an example, the ID mentioned in this application refers to: IDentity, identity, or identifier.

[0384] As an example, the ID mentioned in this application refers to: Identifier, identifier.

[0385] As an example, the ID mentioned in this application refers to: InDex, index.

[0386] As an example, the ID mentioned in this application refers to: InDicator, indicator.

[0387] As an example, the first bit block corresponds to a logical channel.

[0388] As an example, the first bit block corresponds to a logical channel group.

[0389] As an example, the first bit block corresponds to a radio bearer.

[0390] As an example, the first bit block corresponds to a type of service.

[0391] As an example, the first bit block corresponds to a service type.

[0392] As an example, the first bit block corresponds to a channel from the RLC layer to the MAC layer.

[0393] As an example, the first bit block corresponds to a channel from the layer above the MAC layer to the MAC layer.

[0394] As an example, the first bit block corresponds to a channel from the layer above the RLC layer to the MAC layer.

[0395] As an example, the first bit block corresponds to one of the following in the RLC layer: TM (Transparent Mode), UM (Unacknowledged Mode), or AM (Acknowledged Mode).

[0396] As an example, the first bit block corresponds to one of TM / UM or AM in the RLC layer.

[0397] As an example, the first bit block corresponds to a MAC SDU.

[0398] As an example, the first bit block corresponds to a MAC subheader.

[0399] As an example, the first bit block corresponds to a MAC subPDU.

[0400] As an example, the first bit block corresponds to a MAC subheader and a MAC SDU.

[0401] As an example, the first bit block corresponds to an LCID.

[0402] As an example, the LCID corresponding to the first bit block includes P bits, where P is a positive integer greater than 1. The second field included in the first signaling is used to determine P1 bits out of the P bits. The MAC subheader of the MAC SDU corresponding to the first bit block indicates P2 bits out of the P bits. P1 and P2 are both positive integers less than P, and the sum of P1 and P2 is equal to P.

[0403] As a sub-example of this embodiment, P equals 6.

[0404] As an example, the second field included in the first signaling is used to determine an LCID group, which includes multiple LCIDs, and the MAC subheader of the MAC SDU corresponding to the first bit block indicates the LCID corresponding to the first bit block from the LCID group.

[0405] As an example, the first bit block corresponds to an eLCID.

[0406] As an example, the eLCID corresponding to the first bit block includes M bits, where M is a positive integer greater than 1. The second field included in the first signaling is used to determine M1 bits out of the M bits. The MAC subheader of the MAC SDU corresponding to the first bit block indicates M2 bits out of the M bits. M1 and M2 are both positive integers less than M, and the sum of M1 and M2 is equal to M.

[0407] As a sub-example of this embodiment, M is equal to 8 or 16.

[0408] As an example, the second field included in the first signaling is used to determine an eLCID group, which includes multiple eLCIDs, and the MAC subheader of the MAC SDU corresponding to the first bit block indicates the eLCID corresponding to the first bit block from the eLCID group.

[0409] As an example, the first node considers the first bit block to have been correctly received only if the LCID or eLCID in the MAC subheader of the MAC SDU corresponding to the first bit block is the same as the LCID or eLCID determined by the second field included in the first signaling.

[0410] As a sub-implementation of this embodiment, the second field included in the first signaling is used to determine a portion of the bits in the LCID or eLCID corresponding to the first bit block.

[0411] Typically, the third field included in the first signaling indicates a first coefficient; the first coefficient and the scheduling information of the first radio channel are used together to determine the first resource set size occupied by the first bit block, the size of the first bit block depending on the first resource set size, the MCS index used by the first bit block, and the first code rate.

[0412] As an example, the first coefficient is a real number between 0 and 1.

[0413] As an example, the first coefficient is a percentage value.

[0414] As one embodiment, the size of the first resource set corresponds to the size of the time-frequency resources occupied by the first bit block.

[0415] As an example, the first resource set size corresponds to the number of REs occupied by the first bit block.

[0416] As one embodiment, the scheduling information of the first wireless channel is used to determine the size of the time-frequency resources allocated to the first wireless channel, the size of the first resource set depending on the product of the first coefficient and the size of the time-frequency resources allocated to the first wireless channel.

[0417] As a sub-example of this embodiment, the size of the time-frequency resource allocated to the first wireless channel corresponds to the number of REs.

[0418] As a sub-implementation of this embodiment, the size of the first resource set is equal to the product of the first coefficient and the size of the time-frequency resources allocated to the first wireless channel.

[0419] As a sub-implementation of this embodiment, the size of the first resource set is equal to the floor of the product of the first coefficient and the size of the time-frequency resources allocated to the first wireless channel.

[0420] As an example, the size of the first bit block corresponds to the TBS corresponding to the first bit block.

[0421] As an example, the size of the first bit block corresponds to the non-quantized intermediate variable corresponding to the first bit block.

[0422] As an example, the size of the first bit block corresponds to the Ninfo corresponding to the first bit block.

[0423] As an example, the size of the first bit block depends on the product of the first resource set size, the Qm corresponding to the MCS index used by the first bit block, and the first code rate.

[0424] As a sub-implementation of this embodiment, the size of the first bit block is equal to the size of the first resource set and the Q corresponding to the MCS index used by the first bit block. m The product of the first code rate and the number of MIMO layers of the first wireless channel.

[0425] As a sub-implementation of this embodiment, the size of the first bit block is equal to N1, where N1 is the largest positive integer not greater than a first value and a positive integer multiple of 8, and the first value is equal to the size of the first resource set and the Q corresponding to the MCS index used by the first bit block. m The product of the first code rate and the number of MIMO layers of the first wireless channel.

[0426] As a sub-implementation of this embodiment, the size of the first bit block is equal to N1, where N1 is not greater than a first value and is the positive integer closest to the first value in Table 5.1.3.2-1 of TS 38.214-i20. The first value is equal to the size of the first resource set and the Q corresponding to the MCS index used by the first bit block. m The product of the first code rate and the number of MIMO layers of the first wireless channel.

[0427] As one embodiment, the second node implements the relevant configuration of time-frequency resources corresponding to the size of the first resource set for the first bit block.

[0428] As one embodiment, the second node configures the time-frequency resources corresponding to the first resource set size for the first bit block according to the number of remaining bits in the logical channel or logical channel group corresponding to the first bit block.

[0429] Example 10

[0430] Example 10 illustrates a schematic diagram of RAN domain AI / ML function deployment according to one embodiment of this application, as shown in Figure 10. In Figure 10, the gNB can be replaced with, for example, an eNB, or a network device such as a 6G base station.

[0431] In Example 10, the management of ML inference functions of multiple base stations is completed by the RAN domain management function 1002, that is, data interaction with the RAN domain MnS (Management Service) consumer / cross-domain management 1001 (as shown by the dashed arrow in Figure 10). The RAN domain ML training function 1003 is located in the RAN domain management function 1002; while the ML inference functions are located in the base stations, that is, the AI / ML inference function 1004 is located in gNB 1005, the AI / ML inference function 1006 is located in gNB 1007, and so on.

[0432] AI / ML related functions include ML training (also known as AI training or AI / ML training), ML testing, and ML inference (also known as AI inference or AI / ML inference), etc. ML training, ML testing, and ML inference functions can be deployed independently or co-located. Deployment of AI / ML related functions can be implemented through software, such as downloading and / or running executable files; or it can be implemented through a combination of software and hardware, such as accelerating specific computing units through hardware to improve computing speed or save power.

[0433] ML training functions can be deployed in a cross-domain management system or a domain-specific management system; the domain-specific management system is used to manage the RAN domain or the CN (Core Network) domain. For example, ML training functions for MDA (Management Data Analytics) can be deployed in MDAF (Management Data Analytic Function); ML training for network data analytics can be deployed in NWDAF (Network Data Analytics Function), meaning the ML training function is an MTLF (Model Training Logical Function).

[0434] The ML inference function can also be deployed in a cross-domain management system or a domain-specific management system; for example, the ML inference function is MDAF, or the ML inference function is AnLF (Analytics Logical Function) located in NWDAF.

[0435] Similarly, ML testing capabilities can also be deployed in cross-domain management systems or domain-specific management systems.

[0436] Optionally, the management of ML inference function can also be completed by the base station itself, that is, each base station can independently interact with the RAN domain MnS consumer / cross-domain management 1001.

[0437] It should be noted that Embodiment 10 is merely a non-limiting implementation method; optionally, the ML training function of the RAN domain may also be deployed in the base station; or optionally, some base stations may deploy both the ML inference function and the ML training function of the RAN domain, while some base stations may only deploy the ML inference function.

[0438] As an example, one of the gNBs (or base stations) in Example 10 is the second node of this application.

[0439] Example 11

[0440] Example 11 illustrates a schematic diagram of the deployment of AI / ML functions in a UE according to one embodiment of this application, as shown in Figure 11. In Figure 11, the RAN domain ML training function 1104 is optional.

[0441] UE function 1103 is deployed in the first node of this application, and the UE function 1103 includes AI / ML inference function 1105; the AI / ML inference function 1105 uses an ML model (also called an AI model) for inference; an ML model is typically trained before being used for AI / ML inference.

[0442] As an example, the UE function 1103 includes a RAN domain ML training function 1104, which runs training data through an ML model to obtain a relevant loss and adjusts the parameters of the ML model based on the calculated loss; the ML training includes at least one of ML initial training, ML re-training, and reinforcement learning.

[0443] The above embodiments can reduce the complexity of the base station, or save air interface resources caused by reporting training data; however, the above embodiments place high demands on the processing capabilities of the UE side.

[0444] Optionally, the UE function 1103 also includes a CN domain ML training function (not shown in Figure 11).

[0445] Optionally, the UE function 1103 also includes an AI / ML deployment function—not shown in Figure 11—for loading ML models and data.

[0446] As an example, the first node indicates whether it supports ML training function (RAN domain or CN domain) through capability reporting. The capability reporting is RRC signaling or NAS (Non-Access Stratum) signaling.

[0447] As an example, the ML model and the associated metadata are loaded by the first node from a network device or a remote server.

[0448] Optionally, the UE function 1103 is an MnS producer that provides data to the CN domain MnF (Management Function) and / or the RAN domain MnF and / or the cross-domain management system 1101 for management or analysis (as shown by the double arrow 1102).

[0449] Optionally, the UE function 1103 is an MnS consumer that loads data from the CN domain MnF and / or RAN domain MnF and / or cross-domain management system 1101 for AI / ML-related management, such as managing data requests, ML model activation, and / or ML training (as shown by double arrow 1102).

[0450] As an example, the ML model is based on NN (Neural Networks).

[0451] As an example, the ML model is based on ANN (Artificial Neural Networks).

[0452] As an example, the ML model is based on CNN (Convolutional Neural Networks).

[0453] As an example, the ML model is based on the LLM (Large Language Model) architecture.

[0454] As an example, the ML model is based on the Transformer architecture.

[0455] As an example, the ML model is based on the GPT (Generative Pre-Trained) architecture.

[0456] As an example, the ML model is based on LSTM (Long Short-Term Memory network).

[0457] As an example, the ML model is based on MLP (MultiLayer Perceptron).

[0458] As an example, the ML model is based on GAN (Generative Adversarial Nets).

[0459] As an example, the ML model is based on a lightweight neural network.

[0460] As a sub-example of this embodiment, the lightweight neural network includes one or more of MobileNet, ShuffleNet, and SqueezeNet.

[0461] Example 12

[0462] Example 12 illustrates a schematic diagram of a processing system based on artificial intelligence or machine learning according to an embodiment of this application, as shown in Figure 12. In Figure 12, the processing system based on artificial intelligence or machine learning includes a first processor, a second processor, a third processor, and a fourth processor.

[0463] In Example 12, the first processor sends a first dataset to the second processor and a second dataset to the third processor; the second processor generates a target first-class parameter set based on the first dataset, and sends the generated target first-class parameter set to the third processor; the third processor processes the second dataset using the target first-class parameter set to obtain a first-class output, optionally sending the first-class output to the fourth processor. In Figure 12, the first-class feedback and the second-class feedback are optional; the second processor includes ML training functionality; the third processor includes ML inference functionality.

[0464] As one embodiment, the fourth processor includes ML testing functionality.

[0465] As one embodiment, the fourth processor includes performance monitoring / evaluation of the ML model.

[0466] As an example, the third processor sends a first type of feedback to the second processor; the first type of feedback is used to trigger the recalculation or update of the target first type of parameter set, that is, to trigger ML initial training or ML retraining.

[0467] As one embodiment, the fourth processor sends a second type of feedback to the first processor; the second type of feedback is used to generate the first dataset or the second dataset, or the second type of feedback is used to trigger the sending of the first dataset or the sending of the second dataset.

[0468] As one embodiment, the first processor generates the first dataset and the second dataset based on the measurement of the reference signal.

[0469] As one embodiment, the third processor belongs to the first node, and the fourth processor belongs to the second node.

[0470] As an example, the third processor belongs to the first node.

[0471] As an example, the first dataset includes training data.

[0472] As one embodiment, the second processor is used to train an ML model, and the trained model is described by the target first class of parameter sets.

[0473] As an example, the second processor belongs to the first node; the above method avoids passing the first dataset to the second node.

[0474] As an example, the second processor belongs to the second node in this application; the above method supports joint training and optimizes system performance.

[0475] As an example, the second processor belongs to the core network; the above method supports network-wide joint training, further optimizing system performance.

[0476] As an example, the second dataset includes inference data.

[0477] As an example, the third processor constructs a model based on the target first type of parameter group, and then inputs the second dataset into the constructed model to obtain the first type of output.

[0478] As an example, the output of the third processor includes the performance parameters described in this application.

[0479] As an example, the third processor generates a recovery dataset based on the first type of output, and the error between the recovery dataset and the second dataset is used to generate the first type of feedback.

[0480] As an example, the first type of feedback is used to reflect the performance of the trained model; when the performance of the trained model fails to meet the requirements, the second processing opportunity will recalculate the target first type of parameter set.

[0481] As an example, when the error is too large or the update has not been performed for too long, the performance of the trained model is considered to be unsatisfactory.

[0482] As an example, the target first type of parameter group includes one or more of the following: convolution kernel, pooling kernel, pooling function, activation function, parameters of the pooling function, or parameters of the activation function.

[0483] As an example, the target first type of parameter group includes one or more of the following: convolution kernel size, number of convolution layers, convolution stride, pooling kernel size, pooling kernel stride, pooling function, activation function, or number of feature maps.

[0484] Example 13

[0485] Example 13 illustrates a schematic diagram based on artificial intelligence or machine learning according to an embodiment of this application, as shown in Figure 13. In Figure 13, the first and second operations belong to a first stage, the third operation belongs to a second stage, the fourth operation belongs to a third stage, and the fifth operation belongs to a fourth stage; the arrowed lines indicate the sequence of the process.

[0486] As an example, the first operation includes AI / ML training, the second operation includes AI / ML testing, the third operation includes AI / ML emulation, the fourth operation includes AI / ML entity loading, and the fifth operation includes AI / ML inference.

[0487] As an example, the first stage includes a training phase, the second stage includes an emulation phase, the third stage includes a deployment phase, and the fourth stage includes an inference phase.

[0488] As an example, the first stage includes AI / ML model training.

[0489] As an example, the first stage includes AI / ML model training and AI / ML testing.

[0490] As an example, the AI / ML model training includes initial training and re-training of one or a group of AI / ML entities.

[0491] As an example, the training of the AI / ML model depends on training data.

[0492] As an example, the AI / ML model training includes AI / ML entity validation.

[0493] As an example, the AI / ML entity verification is used to evaluate the performance of the AI / ML entity.

[0494] As an example, the AI / ML entity verification relies on verification data.

[0495] As an example, if the AI / ML entity verification results do not meet expectations, the AI / ML model will be retrained.

[0496] As an example, the AI / ML testing includes testing the validated AI / ML entities to estimate the performance of the trained AI / ML model.

[0497] As an example, if the AI / ML test results meet expectations, the AI / ML entity proceeds to the next stage; otherwise, the AI / ML model will be retrained.

[0498] As an example, the AI / ML test relies on test data.

[0499] As one embodiment, the second stage includes AI / ML simulation, which performs AI / ML entity reasoning in a simulation environment.

[0500] As an example, the AI / ML simulation estimates the performance of AI / ML entity reasoning in a simulation environment before using AI / ML entities.

[0501] As one embodiment, the second stage is optional.

[0502] As an example, the third stage includes AI / ML entity loading, which is to obtain trained AI / ML entities to obtain the desired AI / ML inference function.

[0503] As an example, the third stage is optional.

[0504] As an example, the third stage is no longer needed when the training and inference functions are co-located.

[0505] As an example, the fourth stage includes AI / ML inference.

[0506] Example 14

[0507] Example 14 illustrates a structural block diagram of a processing apparatus for a first node according to an embodiment of the present application, as shown in Figure 14. In Figure 14, the processing apparatus 1400 in the first node includes a first receiver 1401 and a first transmitter 1402.

[0508] In embodiment 14, the first receiver 1401 receives the first signaling and the first wireless channel;

[0509] In embodiment 14, the first signaling indicates scheduling information for the first wireless channel; the bit block transmitted on the first wireless channel includes at least a first bit block; a first field included in the first signaling indicates the MCS index used by the first bit block, the MCS index used by the first bit block indicated by the first field is associated with K candidate code rates, where K is a positive integer greater than 1; the size of the first bit block depends on a first code rate, which is one of the K candidate code rates; the first signaling indicates the first code rate from the K candidate code rates.

[0510] As an example, the second field included in the first signaling indicates the first code rate from the K candidate code rates; the first bit block corresponds to a MAC SDU, and the second field included in the first signaling is used to determine the LCID or eLCID in the MAC subheader of the MAC SDU corresponding to the first bit block.

[0511] As an example, the input of the first encoder includes at least the first bit block, and the candidates for the first encoder include K encoders, each of which is associated with one of the K candidate bit rates.

[0512] As an example, the third field included in the first signaling indicates a first coefficient; the first coefficient and the scheduling information of the first wireless channel are used together to determine the first resource set size occupied by the first bit block, the size of the first bit block depending on the first resource set size, the MCS index used by the first bit block and the first code rate.

[0513] As one embodiment, the bits transmitted on the first wireless channel include the outputs of Q encoders; the inputs of the Q encoders each include Q bit blocks; the first encoder is the encoder among the Q encoders whose input includes the first bit blocks; the Q encoders are each associated with Q MCS indices, and the Q encoders are each associated with Q code rates.

[0514] As an example, Q is greater than 1, and the size of any bit block among the Q bit blocks is not less than a first threshold.

[0515] As one embodiment, the processing device 1400 in the first node includes:

[0516] First transmitter 1402 sends the first information block;

[0517] The first information block is used to determine the K candidate code rates.

[0518] As an example, the first node 1400 is a user equipment.

[0519] As an example, the first node 1400 is a terminal.

[0520] As an example, the first node 1400 is a relay node device.

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

[0522] As an example, the first transmitter 1402 includes at least one of the following in embodiment 4: the antenna 452, the transmitter 454, the transmission processor 468, the multi-antenna transmission processor 457, the controller / processor 459, the memory 460, and the data source 467.

[0523] Example 15

[0524] Example 15 illustrates a structural block diagram of a processing apparatus for a second node according to an embodiment of the present application, as shown in Figure 15. In Figure 15, the processing apparatus 1500 in the second node includes a second transmitter 1501 and a second receiver 1502.

[0525] In embodiment 15, the second transmitter 1501 transmits a first signaling and transmits a first wireless channel;

[0526] In embodiment 15, the first signaling indicates scheduling information for the first wireless channel; the bit block transmitted on the first wireless channel includes at least a first bit block; a first field included in the first signaling indicates the MCS index used by the first bit block, the MCS index used by the first bit block indicated by the first field is associated with K candidate code rates, where K is a positive integer greater than 1; the size of the first bit block depends on a first code rate, which is one of the K candidate code rates; the first signaling indicates the first code rate from the K candidate code rates.

[0527] As an example, the second field included in the first signaling indicates the first code rate from the K candidate code rates; the first bit block corresponds to a MAC SDU, and the second field included in the first signaling is used to determine the LCID or eLCID in the MAC subheader of the MAC SDU corresponding to the first bit block.

[0528] As an example, the input of the first encoder includes at least the first bit block, and the candidates for the first encoder include K encoders, each of which is associated with one of the K candidate bit rates.

[0529] As an example, the third field included in the first signaling indicates a first coefficient; the first coefficient and the scheduling information of the first wireless channel are used together to determine the first resource set size occupied by the first bit block, the size of the first bit block depending on the first resource set size, the MCS index used by the first bit block and the first code rate.

[0530] As one embodiment, the bits transmitted on the first wireless channel include the outputs of Q encoders; the inputs of the Q encoders each include Q bit blocks; the first encoder is the encoder among the Q encoders whose input includes the first bit blocks; the Q encoders are each associated with Q MCS indices, and the Q encoders are each associated with Q code rates.

[0531] As an example, Q is greater than 1, and the size of any bit block among the Q bit blocks is not less than a first threshold.

[0532] As one embodiment, the processing device 1500 in the second node includes:

[0533] The second receiver 1502 receives the first information block;

[0534] The first information block is used to determine the K candidate code rates.

[0535] As one example, the second node 1500 is a base station device.

[0536] As one embodiment, the second node 1500 is a user equipment.

[0537] As an example, the second node 1500 is a TRP.

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

[0539] As one embodiment, the second receiver 1502 includes at least one of the following in embodiment 4: the antenna 420, the receiver 418, the receiver processor 470, the multi-antenna receiver processor 472, the controller / processor 475, and the memory 476.

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

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

Claims

1. A first node used in coding for wireless communication, characterized in that, include: The first receiver receives the first signaling and the first wireless channel; Wherein, the first signaling indicates the scheduling information of the first wireless channel; The bit block transmitted on the first wireless channel includes at least a first bit block; the first field included in the first signaling indicates the MCS index used by the first bit block, and the MCS index used by the first bit block indicated by the first field is associated with K candidate code rates, where K is a positive integer greater than 1; the size of the first bit block depends on a first code rate, which is one of the K candidate code rates; the first signaling indicates the first code rate from the K candidate code rates.

2. The first node according to claim 1, characterized in that, The second field included in the first signaling indicates the first code rate from the K candidate code rates; the first bit block corresponds to a MAC SDU, and the second field included in the first signaling is used to determine the LCID or eLCID in the MAC subheader of the MAC SDU corresponding to the first bit block.

3. The first node according to claim 1 or 2, characterized in that, The input to the first encoder includes at least the first bit block, and the candidates for the first encoder include K encoders, each of which is associated with one of the K candidate bit rates.

4. The first node according to any one of claims 1 to 3, characterized in that, The third field included in the first signaling indicates a first coefficient; the first coefficient and the scheduling information of the first wireless channel are used together to determine the first resource set size occupied by the first bit block, the size of the first bit block depending on the first resource set size, the MCS index used by the first bit block and the first code rate.

5. The first node according to any one of claims 1 to 4, characterized in that, The bits transmitted on the first wireless channel include the outputs of Q encoders; the inputs of the Q encoders each include Q bit blocks; the first encoder is the encoder among the Q encoders whose input includes the first bit blocks; the Q encoders are each associated with Q MCS indices, and the Q encoders are each associated with Q code rates.

6. The first node according to claim 5, characterized in that, Q is greater than 1, and the size of any bit block among the Q bit blocks is not less than the first threshold.

7. The first node according to any one of claims 1 to 6, characterized in that, include: The first transmitter sends the first information block; The first information block is used to determine the K candidate code rates.

8. A second node used in coding for wireless communication, characterized in that, include: The second transmitter sends the first signaling and transmits the first wireless channel; Wherein, the first signaling indicates the scheduling information of the first wireless channel; The bit block transmitted on the first wireless channel includes at least a first bit block; the first field included in the first signaling indicates the MCS index used by the first bit block, and the MCS index used by the first bit block indicated by the first field is associated with K candidate code rates, where K is a positive integer greater than 1; the size of the first bit block depends on a first code rate, which is one of the K candidate code rates; the first signaling indicates the first code rate from the K candidate code rates.

9. A method for use in the first node of coding in wireless communication, characterized in that, include: Receive the first signaling and receive the first radio channel; Wherein, the first signaling indicates the scheduling information of the first wireless channel; The bit block transmitted on the first wireless channel includes at least a first bit block; the first field included in the first signaling indicates the MCS index used by the first bit block, and the MCS index used by the first bit block indicated by the first field is associated with K candidate code rates, where K is a positive integer greater than 1; the size of the first bit block depends on a first code rate, which is one of the K candidate code rates; the first signaling indicates the first code rate from the K candidate code rates.

10. A method for a second node in coding for wireless communication, characterized in that, include: Send the first signaling and send the first radio channel; Wherein, the first signaling indicates scheduling information for the first wireless channel; the bit block transmitted on the first wireless channel includes at least a first bit block; a first field included in the first signaling indicates the MCS index used by the first bit block, the MCS index used by the first bit block indicated by the first field is associated with K candidate code rates, where K is a positive integer greater than 1; the size of the first bit block depends on a first code rate, which is one of the K candidate code rates; the first signaling indicates the first code rate from the K candidate code rates.

Images