Information processing method and apparatus

Abstract

The present application discloses an information processing method and apparatus. The method comprises: acquiring a third sequence, and performing channel coding on the third sequence, wherein the channel coding process comprises RM coding, a first parameter m of an RM code corresponding to the RM coding is obtained on the basis of at least one of an input sequence length K of the RM coding, a target code length E, a code rate R, a modulation and coding scheme, a maximum code length parameter, and a minimum code length parameter, the code rate R=K / E, the code length N of the RM code satisfies that N=2m, m, K, E, the maximum code length parameter, and the minimum code length parameter are all positive integers, and the code rate R is a positive number less than 1. The method and apparatus of the present application can support RM coding of different lengths to satisfy the requirements of different application scenarios.

Description

Information processing methods and apparatus Technical Field

[0001] This application relates to the field of communication technology, and in particular to methods and apparatus for information processing. Background Technology

[0002] Channel coding is a technique that improves data transmission reliability by adding redundant information. At the same bit error rate, the less redundant information required, the higher the coding efficiency. Traditional channel coding generally includes linear block codes (such as Hamming codes, Gray codes, BCH codes, Reed-Solomon codes, etc.), convolutional codes, and concatenated codes. These codes have their own distinct characteristics and performance, and are suitable for different scenarios.

[0003] In 3G and 4G mobile communication systems, Turbo codes, as a coding and decoding technology defined by the 3GPP standard, belong to convolutional codes and have excellent performance. In the 5G era, data transmission rates are orders of magnitude higher than in 4G. For Turbo codes, their serial-processing-based decoders struggle to effectively support such high-speed data transmission. Simultaneously, the 5G era has also seen the emergence of richer service scenarios and new requirements for channel coding. For example, massive machine-type communication (mMTC) scenarios require smaller data packets, while ultra-reliable low-latency communication (URLLC) scenarios have very high requirements for encoding and decoding latency and low bit error rate. Therefore, based on the key channel coding requirements of the three major 5G application scenarios, the 5G standard ultimately adopted low-density parity-check (LDPC) codes and polar codes. Compared to traditional linear block codes and convolutional codes, these two codes offer superior performance, but they also have different characteristics in terms of applicable scenarios and the complexity of the codecs.

[0004] For future mobile communication networks, commercial applications such as extended reality (XR), mixed reality (MR), and immersive services have emerged, offering real-time high data rates. These emerging services place higher demands on the peak throughput and area efficiency of encoding and decoding, with peak rates even required to reach Tbps. At the same time, the power consumption of decoders needs to be further reduced. Obviously, 5G's LDPC and Polar codes cannot meet these extremely high requirements. Therefore, for the channel encoding and decoding of future mobile communication network chips, technological breakthroughs need to be sought in two main directions: high-throughput low-power encoding and decoding, and high-reliability encoding and decoding. This can be achieved through new coding designs and low-complexity decoding designs to reach the goals of future mobile communication standards. Summary of the Invention

[0005] This application provides an information processing method and apparatus to meet the higher performance requirements of future mobile communication networks.

[0006] In a first aspect, a communication method is provided, which can be executed by a first communication device, which can be a terminal-side device (e.g., a terminal, or a module or unit applied to a terminal, or a device capable of realizing the functions of a terminal) or a network-side device (e.g., a network device, or a module or unit applied to a network device, or a device capable of realizing the functions of a network device).

[0007] In this method, a first communication device acquires a third sequence and performs channel coding on the third sequence. The channel coding process includes RM coding. The first parameter m of the RM code corresponding to the RM coding is obtained based on at least one of the following: the RM coding input sequence length K, the target code length E, the code rate R, the modulation and coding strategy, the maximum code length parameter, and the minimum code length parameter. The code rate R = K / E, and the code length N = 2. m The m, K, E, maximum code length parameter, and minimum code length parameter are all positive integers, and the code rate R is a positive number less than 1.

[0008] In one possible design, the first communication device determines the first parameter m based on the target code length E.

[0009] In one possible design, the first parameter m is the smallest candidate first parameter in the candidate first parameter set that satisfies the second condition. The candidate first parameter set includes at least one candidate first parameter, and the second condition is that the code length of the RM code corresponding to the first parameter m is not less than the target code length.

[0010] In one possible design, the first parameter

[0011] In one possible design, the first parameter m is the largest candidate first parameter in the candidate first parameter set that satisfies the second condition. The candidate first parameter set includes at least one candidate first parameter. The second condition is that the RM code length corresponding to the first parameter m is not greater than the target code length.

[0012] In one possible design, the set of candidate first parameters may be predefined or configured by the network-side device.

[0013] In one possible design, the first parameter

[0014] In one possible design, the first parameter m is determined based on the target code length E and the code rate R.

[0015] In one possible design, when the code rate R is less than a third threshold, The third threshold is an integer.

[0016] In one possible design, when the code rate R is not less than a third threshold, The third threshold is an integer.

[0017] In one possible design, when the code rate R is not greater than a third threshold, The third threshold is an integer.

[0018] In one possible design, when the code rate R is greater than a third threshold, The third threshold is an integer.

[0019] In one possible design, the third threshold is predefined or configured by the network-side device.

[0020] In one possible design, the first parameter m is determined based on the maximum code length parameter and / or the minimum code length parameter, wherein the maximum code length parameter and / or the minimum code length parameter are predefined or configured by the network-side device, and both the maximum code length parameter and the minimum code length parameter are positive integers.

[0021] In one possible design, if the first parameter m is greater than or equal to the maximum code length parameter, then the first parameter m takes the value of the maximum code length parameter.

[0022] In one possible design, if the first parameter m is less than or equal to the minimum code length parameter, then the first parameter m takes the value of the maximum code length parameter.

[0023] In one possible design, the second parameter *r* of the RM code corresponding to the RM code is the smallest candidate second parameter in the candidate second parameter set that satisfies the third condition. The candidate second parameter set includes at least one candidate second parameter. The third condition is that the third parameter corresponding to the second parameter *r* is not less than the length *K* of the third sequence.

[0024] In one possible design, the set of candidate second parameters is predefined or configured by the network-side device.

[0025] In one possible design, the second parameter r is predefined or configured by the network-side device.

[0026] In one possible design, the channel coding process also includes pre-transformation and / or concatenated coding.

[0027] In one possible design, the channel coding execution steps are: "pre-transformation-concatenated coding-RM coding" or "pre-transformation-RM coding-concatenated coding" or "concatenated coding-pre-transformation-RM coding" or "RM coding-pre-transformation-concatenated coding".

[0028] In one possible design, the first communication device does not perform pre-transformation.

[0029] In one possible design, the first communication device does not perform concatenation coding.

[0030] In one possible design, the network-side device indicates whether to perform a pre-transformation.

[0031] In one possible design, the network-side device indicates whether to perform concatenation coding.

[0032] In one possible design, the concatenated coding uses a linear block code, a convolutional code, or a polar code.

[0033] In one possible design, the third sequence is either a second sequence that has not been scrambled by the first scrambling or has been scrambled by the first scrambling.

[0034] In one possible design, the first scrambling is RNTI scrambling.

[0035] In one possible design, the second sequence is a code block with or without a second CRC.

[0036] In one possible design, the second sequence is a code block with or without a second CRC.

[0037] In one possible design, the code block is a first sequence.

[0038] In one possible design, the code block is one of a plurality of code blocks obtained by the first communication device after dividing the first sequence into code blocks.

[0039] In one possible design, there is a second correspondence between the number of bits in the second CRC and the number of bits in the code block.

[0040] In one possible design, the second correspondence is predefined or configured by the network-side device.

[0041] In one possible design, the second correspondence includes one or more correspondences, each of which can be a correspondence between the code block bit number range and the CRC polynomial.

[0042] In one possible design, there is no second correspondence between the number of bits in the second CRC and the number of bits in the code block.

[0043] In one possible design, when the first condition is met, the first communication device performs code block segmentation on the first sequence to obtain multiple code blocks.

[0044] In one possible design, the first condition includes: the length A of the first sequence is greater than or equal to a first threshold, where the first threshold is a positive integer.

[0045] In one possible design, the first condition includes: the target code length E is greater than or equal to a second threshold, where the second threshold is a positive integer.

[0046] In one possible design, the first condition includes: the length A of the first sequence is greater than or equal to a first threshold, and the length E of the target code is greater than or equal to a second threshold, wherein both the first threshold and the second threshold are positive integers.

[0047] In one possible design, the first threshold is predefined or configured by the network-side device.

[0048] In one possible design, the second threshold is predefined or configured by the network-side device.

[0049] In one possible design, the first sequence is an information sequence with or without a first CRC.

[0050] In one possible design, the information sequence is a transport block TB.

[0051] In one possible design, there is a first correspondence between the number of bits in the first CRC and the number of bits in the information sequence.

[0052] In one possible design, the first correspondence is predefined or configured by the network-side device.

[0053] In one possible design, the first correspondence may include one or more correspondences, each of which may be a correspondence between the bit range of the information sequence and the CRC polynomial.

[0054] In one possible design, there is no first correspondence between the number of bits in the first CRC and the number of bits in the information sequence.

[0055] In one possible design, the first communication device performs rate matching on the fourth sequence to obtain a rate-matched output sequence of length E, wherein the fourth sequence is the channel-coded output sequence.

[0056] In one possible design, the rate matching process includes bit selection.

[0057] In one possible design, the rate matching process further includes preprocessing and / or bit interleaving.

[0058] In one possible design, the first communication device does not perform preprocessing.

[0059] In one possible design, the first communication device does not perform bit interleaving.

[0060] In one possible design, the network-side device indicates whether preprocessing should be performed.

[0061] In one possible design, the network-side device indicates whether bit interleaving should be performed.

[0062] In one possible design, the first communication device performs rate matching post-operation on the rate-matched output sequence.

[0063] In one possible design, the post-rate matching operation includes a second scrambling.

[0064] In one possible design, the rate-matched post-operation also includes code block concatenation and / or interleaving.

[0065] In one possible design, the execution steps of the post-rate matching operation can be: "code block concatenation - second scrambling - interleaving" or "code block concatenation - interleaving - second scrambling" or "second scrambling - interleaving - code block concatenation" or "second scrambling - code block concatenation - interleaving" or "interleaving - second scrambling - code block concatenation".

[0066] In one possible design, if the first communication device performs code block concatenation on the first sequence, the first communication device performs code block concatenation; otherwise, code block concatenation is not performed.

[0067] In one possible design, the second scrambling is a pseudo-random sequence with a second scrambling.

[0068] In one possible design, if the first communication device performs bit interleaving, then the first communication device does not perform interleaving in the post-rate matching operation.

[0069] In one possible design, the network-side device indicates whether to perform interleaving in the post-rate-matching operation.

[0070] Secondly, this application provides a communication device that implements the method in any of the possible designs in the first aspect described above. The communication device includes modules or units that perform the operations involved in the first aspect, which can be implemented in software, hardware, or a combination of both.

[0071] Thirdly, this application provides a communication device including one or more processors. The processors are coupled to a memory for storing computer programs or instructions. When the processor executes the computer program or instructions, the communication device implements the methods in any of the possible designs described in the first aspect above.

[0072] In one possible design, the communication device may also include the memory.

[0073] The aforementioned communication device can be a terminal-side device (e.g., a terminal, or a module or unit applied to a terminal, or a device capable of realizing the functions of a terminal) or a network-side device (e.g., a network device, or a module or unit applied to a network device, or a device capable of realizing the functions of a network device).

[0074] Fourthly, this application provides a computer-readable storage medium storing a computer program or instructions that, when executed on a computer, cause the computer to perform any of the possible designs in the first aspect described above.

[0075] Fifthly, this application provides a computer program product comprising a computer program or instructions that, when permitted on a computer, cause the computer to perform the method in any of the possible designs described in the first aspect above. Attached Figure Description

[0076] Figure 1 is a schematic diagram of the architecture of a communication system provided in an embodiment of this application;

[0077] Figure 2 is a schematic diagram of a possible application framework in the communication system provided in an embodiment of this application;

[0078] Figure 3 is a schematic diagram of another possible application framework in the communication system provided in the embodiments of this application;

[0079] Figure 4 is a schematic diagram of a communication method in a 5G communication system;

[0080] Figure 5 is a schematic diagram of a communication method provided in an embodiment of this application;

[0081] Figure 6 is a schematic diagram of the communication device provided in an embodiment of this application; Detailed Implementation

[0082] The technical solutions of the embodiments of this application will be described below with reference to the accompanying drawings. In the description of this application, unless otherwise stated, " / " indicates that the objects before and after are in an "or" relationship. For example, A / B can represent A or B. "And / or" in this application is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, and B alone, where A and B can be singular or plural. Furthermore, in the description of this application, unless otherwise stated, "multiple" refers to two or more. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can represent: a, b, c, ab, ac, bc, or abc, where a, b, and c can be single or multiple. In addition, to facilitate a clear description of the technical solutions of the embodiments of this application, the following points will be explained before introducing the solutions of this application.

[0083] (1) In this application, “instruction” may include direct instruction, indirect instruction, explicit instruction, and implicit instruction. When describing a certain instruction information to indicate A, it can be understood that the instruction information carries A, directly indicates A, or indirectly indicates A.

[0084] In this application, the information indicated by the instruction information is called the information to be instructed. In specific implementations, there are many ways to indicate the information to be instructed, such as, but not limited to, directly indicating the information to be instructed, such as the information to be instructed itself or its index. It can also indirectly indicate the information to be instructed by indicating other information, where there is a relationship between the other information and the information to be instructed. It can also indicate only a part of the information to be instructed, while the other parts are known or pre-agreed upon. For example, the instruction of specific information can be achieved by using a pre-agreed (e.g., protocol-defined) arrangement of various pieces of information, thereby reducing instruction overhead to some extent. Furthermore, the information to be instructed can be sent as a whole or divided into multiple sub-information pieces, and the sending period and / or timing of these sub-information pieces can be the same or different.

[0085] (2) In this application, “configuration” may include direct configuration, indirect configuration, explicit configuration, and implicit configuration. When a certain configuration information is described as being used to configure A, it can be understood that the configuration information carries A, directly configures A, or indirectly configures A.

[0086] In this application, the information referred to as configuration information is called the information to be configured. In specific implementations, there are many ways to configure the information to be configured, such as, but not limited to, directly configuring the information to be configured, such as the information to be configured itself or its index. It can also be indirectly configured by configuring other information, where there is a relationship between the other information and the information to be configured. Alternatively, only a portion of the information to be configured can be configured, while the other parts are known or pre-agreed upon. For example, the configuration of specific information can be achieved by using a pre-agreed (e.g., protocol-defined) arrangement of various pieces of information, thereby reducing configuration overhead to some extent. Furthermore, the information to be configured can be sent as a whole or divided into multiple sub-information pieces, and the sending period and / or timing of these sub-information pieces can be the same or different.

[0087] (3) In this application, "send" and "receive" indicate the direction of signal transmission. For example, "send information to XX" can be understood as the destination of the information being XX, which may include direct transmission via the air interface or indirect transmission by other units or modules via the air interface. "Receive information from YY" can be understood as the source of the information being YY, which may include direct reception from YY via the air interface or indirect reception from YY via other units or modules via the air interface. "Send" can also be understood as the "output" of the chip interface, and "receive" can also be understood as the "input" of the chip interface. In other words, sending and receiving can occur between devices, such as between network devices and terminal devices, or within a device, such as between components, modules, chips, software modules, or hardware modules within the device via a bus, wiring, or interface. Furthermore, unless otherwise specified, "transmission" includes receiving and / or sending. For example, transmitting signals can include receiving signals and / or sending signals.

[0088] (4) In this application, information C is used to determine information D, including both when information D is determined solely based on information C and when it is determined based on information C and other information. Furthermore, information C can also be used to determine information D indirectly, for example, when information D is determined based on information E, and information E is determined based on information C.

[0089] (5) The terms “comprising” and “having” and any variations thereof are intended to cover non-exclusive inclusion, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are explicitly listed, but may include other steps or units that are not explicitly listed or that are inherent to such process, method, product or device.

[0090] (6) In the various embodiments of this application, unless otherwise specified or in case of logical conflict, the terms and / or descriptions of different embodiments are consistent and can be referenced by each other. The technical features of different embodiments can be combined to form new embodiments according to their inherent logical relationship.

[0091] (7) In this application, "first" and "second" are used for convenience of description only to distinguish objects, and are not intended to limit the scope of the embodiments of this application, nor to describe the order or sequence of features. It should be understood that the objects described in this way can be interchanged where appropriate so as to describe solutions other than those in the embodiments of this application.

[0092] (8) In this application, the words “exemplary” or “for example” are used to indicate that something is an example, illustration, or illustration. Any embodiment or design described as “exemplary” or “for example” in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of the words “exemplary” or “for example” is intended to present the relevant concepts in a specific manner.

[0093] Figure 1 is a schematic diagram of the architecture of the communication system applied in an embodiment of this application. As shown in Figure 1, the communication system includes a radio access network (RAN) 100. Optionally, the communication system also includes a core network (CN) 200. Optionally, the communication system also includes an Internet 300. RAN 100 includes at least one RAN node (110a, 110b, and 110c in Figure 1, collectively referred to as 110) and at least one terminal (120a-120f in Figure 1, collectively referred to as 120). Terminal 120 is wirelessly connected to RAN node 110. RAN node 110 is wirelessly or wiredly connected to core network 200. The core network equipment in core network 200 and RAN node 110 in RAN 100 can be different physical devices, or they can be the same physical device integrating core network logical functions and radio access network logical functions.

[0094] RAN 100 can be a cellular system related to the 3rd Generation Partnership Project (3GPP), such as a 4th generation (4G), 5th generation (5G) mobile communication system, or a future-oriented mobile communication system. RAN 100 can also be an open RAN (O-RAN or ORAN), a cloud radio access network (CRAN), or a wireless fidelity (WiFi) system. RAN 100 can also be a communication system that integrates two or more of the above systems.

[0095] RAN node 110, sometimes also referred to as network equipment, access network equipment, RAN entity, or access node, constitutes part of the communication system and is used to help terminals achieve wireless access. Multiple RAN nodes 110 in the communication system can be of the same type or different types. In some scenarios, the roles of RAN node 110 and terminal 120 are relative. For example, for terminal 120d, network element 110c is a base station; but for base station 110a, network element 110c is a terminal. RAN node 110 and terminal 120 are sometimes both referred to as communication devices. For example, in Figure 1, network elements 110a-110c can be understood as communication devices with base station functions, and network elements 120a-120f can be understood as communication devices with terminal functions.

[0096] In one possible scenario, the RAN node can be a base station, an evolved NodeB (eNodeB), an access point (AP), a transmission reception point (TRP), a next-generation NodeB (gNB), a next-generation base station in a future-oriented mobile communication system, or an access node in a WiFi system. The RAN node can be a macro base station (as shown in Figure 1, 110a), a micro base station or indoor station (as shown in Figure 1, 110c), a relay node or a host node, or a radio controller in a CRAN scenario. Optionally, the RAN node can also be a server, wearable device, vehicle, or in-vehicle equipment. For example, network equipment in vehicle-to-everything (V2X) technology can be a roadside unit (RSU). All or part of the functions of the RAN node in this application can also be implemented through software functions running on hardware, or through virtualization functions instantiated on a platform (e.g., a cloud platform). The RAN node can also be equipped with communication modules, circuits, or chips that perform corresponding communication functions. The RAN node can also be configured with program instructions for performing corresponding communication functions, as well as corresponding program instructions. The RAN node in this application can also be a logical node, logical module, or software capable of implementing all or part of the RAN node's functions.

[0097] In another possible scenario, multiple RAN nodes collaborate to assist the terminal in achieving wireless access, with each RAN node performing a portion of the base station's functions. For example, RAN nodes can be central units (CUs), distributed units (DUs), CU-control plane (CPs), CU-user plane (UPs), or radio units (RUs), etc. CUs and DUs can be separate entities or included in the same network element, such as a baseband unit (BBU). RUs can be included in radio frequency equipment or radio frequency units, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs).

[0098] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. CU (or CU-CP and CU-UP), DU, and RU can be divided according to the protocol layer of the wireless network, or according to function or requirements, or in other ways. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules, and these modules and the methods they execute are also within the protection scope of the embodiments of this application. For example, when the method of the embodiments of this application is executed by a network device, it can be specifically executed by at least one of CU, CU-CP, CU-UP, or DU.

[0099] A terminal can be a device or module that connects to the aforementioned communication system and has corresponding communication functions. A terminal can also be called a terminal device, user equipment (UE), mobile station, mobile terminal, etc. Terminals can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, smart transportation, smart cities, etc. Terminals can be mobile phones, tablets, computers with wireless transceiver capabilities, wearable devices, vehicles, drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, transportation vehicles with wireless communication capabilities, communication modules, etc. The embodiments of this application do not limit the device form of the terminal. A terminal typically contains a communication module, circuit, or chip that performs the corresponding communication functions. The terminal also contains program instructions for performing the corresponding communication functions.

[0100] Network devices and terminal devices can be fixed in location or mobile. They can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can be deployed on aircraft, balloons, and artificial satellites. The embodiments of this application do not limit the application scenarios of the network devices and terminal devices.

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

[0102] In the embodiments of this application, the functions of the network device can be executed by modules (such as chips) within the network device, or by a control subsystem that includes network device functions. This control subsystem, including network device functions, can be a control center in the aforementioned application scenarios such as smart grids, industrial control, intelligent transportation, and smart cities. Similarly, the functions of the terminal device can be executed by modules (such as chips or modems) within the terminal device, or by a device that includes terminal device functions.

[0103] The functions of the network devices or terminal devices involved in this application can be implemented by one device, or by multiple devices, or by one or more functional modules within one device, or by one or more chips, or by a system on a chip (SOC) or chip system. A chip system can be composed of chips or include chips and other discrete devices. The embodiments of this application do not specifically limit this.

[0104] It is understood that the above functions can be network elements in hardware devices, software functions running on dedicated hardware, a combination of hardware and software, or virtualization functions instantiated on a platform (e.g., a cloud platform).

[0105] To support AI technology in wireless networks, AI nodes may also be introduced into the network.

[0106] Optionally, the AI ​​node can be deployed in one or more of the following locations within the communication system: network devices, terminal devices, or core network devices, etc. Alternatively, the AI ​​node can be deployed independently, for example, in a location other than any of the aforementioned devices, such as in the host or cloud server of an over-the-top (OTT) system. The AI ​​node can communicate with other devices in the communication system, which can be one or more of the following: network devices, terminal devices, or network elements of the core network, etc.

[0107] It is understood that this application does not limit the number of AI nodes. For example, when there are multiple AI nodes, they can be divided based on function, such as different AI nodes being responsible for different functions.

[0108] It can also be understood that AI nodes can be independent devices, or they can be integrated into the same device to achieve different functions. Alternatively, they can be network elements in hardware devices, software functions running on dedicated hardware, or virtualization functions instantiated on a platform (e.g., a cloud platform). This application does not limit the specific form of the aforementioned AI nodes.

[0109] AI nodes can be AI network elements or AI modules.

[0110] Figure 2 illustrates a possible application framework in a communication system. As shown in Figure 2, network elements in the communication system are connected via interfaces (e.g., NG, Xn) or air interfaces. These network element nodes, such as core network equipment, access network nodes (RAN nodes), terminals, or one or more devices in the OAM, are equipped with one or more AI modules (only one is shown in Figure 2 for clarity). The access network node can be a single RAN node or can include multiple RAN nodes, for example, including CU and DU. The CU and / or DU can also be equipped with one or more AI modules. Optionally, the CU can also be split into CU-CP and CU-UP. One or more AI models are configured in CU-CP and / or CU-UP.

[0111] The AI ​​module is used to implement corresponding AI functions. AI modules deployed in different network elements can be the same or different. Depending on the parameter configuration, the AI ​​module can implement different functions. The AI ​​module model can be configured based on one or more of the following parameters: structural parameters (e.g., at least one of the following: number of neural network layers, neural network width, inter-layer connections, neuron weights, neuron activation function, or bias in the activation function), input parameters (e.g., type and / or dimension of input parameters), or output parameters (e.g., type and / or dimension of output parameters). The bias in the activation function can also be referred to as the neural network bias.

[0112] An AI module can have one or more models. A model can infer an output, which includes one or more parameters. The learning, training, or inference processes of different models can be deployed on different nodes or devices, or they can be deployed on the same node or device.

[0113] Figure 3 illustrates another possible application framework in a communication system. As shown in Figure 3, the communication system includes a RAN intelligent controller (RIC), which comprises near-real-time (near-RT) RICs and non-real-time (non-RT) RICs. Non-real-time RICs primarily process non-real-time information, such as data that is not sensitive to latency, with latency in the order of seconds. Real-time RICs primarily process near-real-time information, such as data that is relatively sensitive to latency, with latency in the order of tens of milliseconds.

[0114] The near real-time RIC is used for model training and inference. For example, it can be used to train an AI model and then use that AI model for inference. The near real-time RIC can obtain network-side and / or terminal-side information from RAN nodes (e.g., CU, CU-CP, CU-UP, DU, and / or RU) and / or terminals. This information can be used as training data or inference data. Optionally, the near real-time RIC can deliver inference results to RAN nodes and / or terminals. Optionally, inference results can be exchanged between CU and DU, and / or between DU and RU. For example, the near real-time RIC delivers the inference result to the DU, and the DU sends it to the RU.

[0115] The non-real-time RIC is also used for model training and inference. For example, it can be used to train an AI model and then use that model for inference. The non-real-time RIC can obtain network-side and / or terminal-side information from RAN nodes (e.g., CU, CU-CP, CU-UP, DU, and / or RU) and / or terminals. This information can be used as training data or inference data, and the inference results can be delivered to the RAN nodes and / or terminals. Optionally, inference results can be exchanged between CU and DU, and / or between DU and RU. For example, the non-real-time RIC delivers the inference results to the DU, which then forwards them to the RU.

[0116] The near real-time RIC and non-real-time RIC can also be set up as separate network elements. Optionally, the near real-time RIC and non-real-time RIC can also be part of other devices. For example, the near real-time RIC can be set in the RAN node (e.g., in CU, DU), while the non-real-time RIC can be set in the OAM, cloud server, core network device, or other network device.

[0117] It is understood that this application uses network devices and terminal devices as examples to illustrate the execution of the interaction, but this application does not limit the execution subject of the interaction. For example, the method executed by the network device in this application can also be implemented by modules in the network device (such as chips, chip systems, processors, or circuits), or by logical nodes, logical modules, or software that can implement all or part of the functions of the network device; similarly, the method executed by the terminal device in this application can also be implemented by modules in the terminal device (such as chips, chip systems, processors, or circuits), or by logical nodes, logical modules, or software that can implement all or part of the functions of the terminal device.

[0118] The communication systems and service scenarios described in the embodiments of this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new service scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0119] The relevant terms used in the embodiments of this application will be explained below. It should be noted that these explanations are for the purpose of making the embodiments of this application easier to understand, and should not be regarded as a limitation on the scope of protection claimed by this application.

[0120] 1. Cyclic Redundancy Check (CRC)

[0121] CRC is a commonly used error detection technique in data communication. At the sending end, a check bit is calculated using a specific algorithm and appended to the data bits before being sent to the receiving end. The receiving end verifies the received data and check bit using the same algorithm to determine if the received data is correct and complete.

[0122] 2. Code block segmentation

[0123] Code block segmentation, also known as code block segmentation or code block splitting, is a process where, due to encoding and decoding complexity, the encoder has certain limitations on the length of the sequence to be encoded. For example, when the number of information bits exceeds the limit, the information sequence needs to be divided into multiple information sub-sequences, also called code blocks, and each code block is encoded.

[0124] The information sequence may contain data information, control information, a combination of data and control information, broadcast information, or other types of information, and this invention is not limited thereto. When the information sequence contains data information, it may be a transport block (TB), etc.; when the information sequence contains control information, it may be downlink control information (DCI) or uplink control information (UCI), etc.

[0125] 3. RM code

[0126] The Reed-Muller (RM) code was proposed in 1954. A binary RM code contains multivariate polynomials in a binary field. The evaluation results are as follows. Consider a polynomial ring with m variables. For a polynomial and a binary vector Define Eval z (f)=f(z1,z2,…,z m Let f be the value of the polynomial f in the binary vector z. Based on this, the evaluation vector of the polynomial f can be defined. That is, a coordinate of Eval(f) is the evaluation result of the polynomial f at a certain binary vector. Since The CCP has 2 m There are m-dimensional binary vectors, therefore the evaluation vector Eval(f) has a total of 2 m Each dimension. For an RM code with parameters m and r, its codeword set can be defined as the set of evaluation vectors for all polynomials of order no higher than r, i.e.

[0127] Here, deg(f) represents the order of the polynomial f. Without ambiguity, we also refer to the parameter m as the code length parameter of the RM(m,r) code (or the first parameter of the RM code), and the code length of the RM code is N = 2. m m is a positive integer; the parameter r is called the order of the RM(m,r) code (or the second parameter of the RM code), 0≤r≤m, where r is an integer. The third parameter q of the RM(m,r) code is the number of m-ary binary monomials, i.e. here Represents the number of combinations.

[0128] The aforementioned evaluation vectors are also known as basis vectors, basis sequences, or basis vectors.

[0129] In actual RM encoding, the number of basis vectors that make up the RM code generation matrix is ​​equal to the length of the RM encoding input sequence, and the third parameter q is not less than the length of the RM encoding input sequence; the specific basis vectors that make up the generation matrix are not limited in this invention.

[0130] Optionally, the RM code generation matrix can be K*2. m The matrix; where K is the length of the RM-encoded input sequence, m is the first parameter of the RM code, and 2 m This refers to the length of the RM code.

[0131] Optionally, the RM code generation matrix can also be 2. m A matrix of size *K; where K is the length of the RM-encoded input sequence, m is the first parameter of the RM code, and 2 m This refers to the length of the RM code.

[0132] For example, let's take an RM code where the first parameter m is 3, the second parameter r is 2, and the length of the RM encoding input sequence is 7. For example, the generating matrix can be composed of one first-class basis vector v0 = Eval(1) = [1 1 1 1 1 1 1 1 1], three second-class basis vectors v1 = Eval(x1) = [1 1 1 1 0 0 0 0], v2 = Eval(x2) = [1 1 0 0 1 1 0 0], v3 = Eval(x3) = [1 0 1 0 1 0 1 0], and three third-class basis vectors v4 = Eval(x1x2) = [1 1 0 0 0 0 0 0], v5 = Eval(x1x3) = [1 0 1 0 0 0 0 0], and v6 = Eval(x2x3) = [1 0 0 0 1 0 0 0]. At this point, the RM code generation matrix G = [v0 v1 v2 v3 v4 v5 v6] T ,in[] T The matrix transpose operation generates matrix G as follows:

[0133] Then, the RM-encoded input sequence is RM-encoded according to the RM code generation matrix to obtain the RM-encoded output sequence. The length of the RM-encoded output sequence is the RM code length or the code length of the RM code.

[0134] 4. Rate matching

[0135] Taking RM code as an example, the RM-coded output sequence needs to be transmitted on a physical channel, but the length of the RM-coded output sequence may not match the capacity of the physical channel. In this case, rate matching of the RM-coded output sequence is required.

[0136] The rate matching process includes bit selection; optionally, the rate matching process also includes preprocessing and / or bit interleaving.

[0137] Preprocessing:

[0138] Performing operations such as reordering the RM-encoded output sequence and preprocessing before bit selection can improve the decoding performance of the bit-selected sequence.

[0139] Bit selection:

[0140] Bit selection is performed on the preprocessed output sequence to obtain a bit-selected output sequence of length E; if no preprocessing is performed, the input sequence for bit selection is the output sequence for channel coding.

[0141] For example, if the length of the preprocessed output sequence and the length of the RM-coded output sequence are both N, the number of code blocks is 4, and the physical channel capacity is 400 bits, then the target code length for each code block is E = 400 / 4 = 100, where the target code length is the sequence length after rate matching for each encoded code block. For instance, if the RM-coded output sequence length N for each code block is 128, rate matching is needed for this RM-coded output sequence, and the first 100 bits of the RM-coded output sequence of length 128 can be used as the bit selection output sequence. As another example, if the length N after encoding each code block is 64, the RM-coded output sequence of length 64 can be read cyclically to obtain a bit selection output sequence of length 100.

[0142] Optionally, the target code length can be predefined; or, when the first communication device is a terminal-side device (e.g., a terminal, or a module or unit applied to a terminal, or a device capable of implementing the functions of a terminal), the target code length can be configured by a network-side device (e.g., a network device, or a module or unit applied to a network device, or a device capable of implementing the functions of a network device).

[0143] Optionally, the target code length can also be calculated by the first communication device based on time-frequency resources. The time-frequency resources of the first communication device can be predefined or signaled; for example, when the first communication device is a terminal-side device (such as a terminal, or a module or unit applied to a terminal, or a device capable of implementing the functions of a terminal), the time-frequency resources can be configured by a network-side device (such as a network device, or a module or unit applied to a network device, or a device capable of implementing the functions of a network device).

[0144] Bit interleaving:

[0145] Interleaving operations are performed on the bit selection output sequence, such as row-column interleaving, upper triangular interleaving, etc. Bit interleaving rearranges the bits, randomizes errors, and thus improves decoding performance.

[0146] 5. Code block cascading

[0147] Code block concatenation, also known as code block joining or code block splicing, is necessary if code block segmentation is involved before encoding, and code block concatenation is required after rate matching; otherwise, it is not required. For example, if the number of code blocks after segmentation is 4, and the physical channel capacity is 400 bits, then the target code length for each code block is 400 / 4 = 100, meaning that concatenating the four rate-matched sequences yields a sequence of length 400.

[0148] Figure 4 is a schematic diagram of a communication method in a 5G communication system. This communication scheme includes the following steps:

[0149] Step 401: The terminal performs RM encoding on the RM-encoded input sequence.

[0150] In 5G communication systems, RM codes are used for scenarios where the number of bits for Uplink Control Information (UCI) is 3-11. For K UCI bits, where 3≤K≤11, encoding is performed according to the (32,K) RM code defined in the standard protocol, i.e., RM(5,1) code is used, resulting in an RM encoded output sequence of length N=32.

[0151] Step 402: The terminal performs rate matching on the RM-encoded output sequence.

[0152] For example, the RM-encoded output sequence is [d0, d1, ..., d N-1 After rate matching, the sequence is [f0, f1, ..., f E-1 ], where N is the encoded code length and E is the target code length. The rate-matched sequence can be obtained as follows:

[0153] for k=0to E-1

[0154] f k =d kmodN

[0155] end for

[0156] That is, the rate-matched sequence is obtained by cyclically reading the RM-encoded output sequence.

[0157] Step 403: The terminal scrambles the rate-matched sequence.

[0158] The terminal uses a scrambling sequence to scramble the rate-matched sequence. Specifically, the rate-matched sequence and the scrambling sequence are XORed bit by bit to obtain the scrambled sequence, where the scrambling sequence is a pseudo-random sequence.

[0159] As can be seen from the above, the encoding pattern of RM code in 5G system is relatively fixed, that is, the first parameter m=5 and the second parameter r=1. This method is only suitable for transmitting information sequences with short bit lengths and cannot be applied to various information sequence length scenarios.

[0160] Figure 5 is a schematic diagram of a communication method provided in an embodiment of this application. It is understood that the steps and execution order shown in Figure 5 are only examples. In actual implementation, some of the steps may be executed, or other steps may be executed between two steps. The execution order of the steps may also be adjusted. This embodiment of the application does not limit this.

[0161] In the following method flow description, the first communication device will be used as the sending end as an example.

[0162] In this embodiment, the first communication device can be a terminal-side device (e.g., a terminal, or a module or unit applied to a terminal, or a device capable of implementing the functions of a terminal) or a network-side device (e.g., a network device, or a module or unit applied to a network device, or a device capable of implementing the functions of a network device). Furthermore, the processing performed by a single execution entity can also be divided into multiple execution entities, which can be logically and / or physically separated. For example, when the first communication device is a network device, the processing performed by the first communication device can be divided into execution by at least one of CU, DU, RU, etc.

[0163] This communication method includes, but is not limited to, the following steps:

[0164] Step 501: The first communication device adds CRC bits to the information sequence.

[0165] The CRC in this step can be called the first CRC.

[0166] Optionally, the information sequence includes A information bits, where A is a positive integer. For example, the information sequence is [a0,…,a…]. A-1 ].

[0167] For example, the number of information sequence bits A can be predefined; or, when the first communication device is a terminal-side device (e.g., a terminal, or a module or unit applied to a terminal, or a device capable of implementing the functions of a terminal), the number of information sequence bits A can be configured by a network-side device (e.g., a network device, or a module or unit applied to a network device, or a device capable of implementing the functions of a network device).

[0168] Optionally, the first communication device determines the CRC bits, and the number of CRC bits is a fixed value.

[0169] Optionally, the first communication device determines the CRC bits based on the number of bits A in the information sequence.

[0170] Optionally, the first communication device determines the CRC bits based on the number of bits A in the information sequence and the first correspondence.

[0171] Optionally, the first correspondence may include the correspondence between the number of bits A in the information sequence and the CRC polynomial.

[0172] The first correspondence can be predefined; or, when the first communication device is a terminal-side device (e.g., a terminal, or a module or unit applied to a terminal, or a device capable of realizing the functions of a terminal), the first correspondence can be configured by a network-side device (e.g., a network device, or a module or unit applied to a network device, or a device capable of realizing the functions of a network device).

[0173] For example, the first correspondence may include one or more correspondences, each of which may be a correspondence between the bit number range of the information sequence and the CRC polynomial.

[0174] For example, as shown in Table 1, the first correspondence includes the correspondence between different information sequence bit number intervals and CRC polynomials. Different intervals correspond to different CRC polynomials. Different CRC polynomials mean that the number of CRC bits is different or the number of CRC bits is the same but the generator polynomial is different.

[0175] The CRC polynomial is determined based on the number of bits in the information sequence, thus avoiding the situation where the CRC check passes after the receiving end receives the information, but the information transmission is incorrect, thereby improving the reliability of information transmission.

[0176] Table 1

[0177] Optionally, there may or may not be a first correspondence between the range of bits in the information sequence and the CRC polynomial. For example, as shown in Table 2, when the range of A is 1 to 63, there is no first correspondence between this range and the CRC polynomial, that is, the first communication device does not need to determine the CRC bits.

[0178] Table 2

[0179] It should be understood that in the above first correspondence, the number of intervals of information sequence bits, the range of each interval, and the CRC polynomial corresponding to each interval are merely examples of the correspondence between the number of information sequence bits and the CRC polynomial in the embodiments of this application, and the embodiments of this application do not limit this.

[0180] After the first communication device determines the CRC polynomial, it generates CRC bits based on the information sequence and the CRC polynomial.

[0181] The first communication device adds CRC bits to an information sequence of length A. The CRC bits can be located at the end of the information sequence or scattered throughout the information sequence. For example, at least one information bit in the information sequence has CRC bits before and after it.

[0182] Optionally, the number of CRC bits can be 0, in which case the first communication device does not need to add CRC bits.

[0183] The information sequence for adding CRC can be called the first sequence. If step 501 is not executed, the first sequence is the same as the information sequence.

[0184] Optionally, step 501 can also be skipped, that is, the first communication device does not perform step 501.

[0185] Optionally, the network-side device (e.g., a network device, or a module or unit applied to the network device, or a device capable of implementing the functions of the network device) indicates whether to perform step 501.

[0186] Step 502: The first communication device performs code block segmentation on the first sequence.

[0187] For example, when the first condition is met, the first communication device divides the first sequence into code blocks to obtain multiple information sub-sequences, i.e., multiple code blocks. When the first condition is not met, the first communication device does not divide the first sequence, and there is only one code block, which is the same as the first sequence.

[0188] Optionally, the first condition includes: the length A of the first sequence is greater than or equal to the first threshold, where the first threshold is a positive integer.

[0189] Optionally, the first condition includes: the target code length E is greater than or equal to the second threshold, where the second threshold is a positive integer.

[0190] Optionally, the first condition includes: the length of the first sequence A is greater than or equal to the first threshold, the target code length E is greater than or equal to the second threshold, and both the first threshold and the second threshold are positive integers.

[0191] Optionally, the first threshold can be predefined or configured by network-side devices (such as network equipment, or modules or units applied to network equipment, or devices that can implement the functions of network equipment).

[0192] Optionally, the second threshold can be predefined or configured by network-side devices (such as network equipment, or modules or units applied to network equipment, or devices that can implement the functions of network equipment).

[0193] The above-mentioned code block segmentation scheme can achieve a balance between complexity and performance in channel coding.

[0194] Optionally, the network-side device (e.g., a network device, or a module or unit applied to the network device, or a device capable of implementing the functions of the network device) indicates whether to perform step 502.

[0195] Step 503: The first communication device adds CRC bits to the code block.

[0196] The CRC in this step can be called the second CRC.

[0197] Optionally, when CRC bits are added to the information sequence but no code block segmentation is performed, the code block is the same as the information sequence after adding CRC, and there is no need to add CRC bits to the code block further.

[0198] Optionally, the first communication device determines the CRC bits, and the number of CRC bits is a fixed value.

[0199] Optionally, the first communication device determines the CRC bits based on the number of code block bits S.

[0200] Optionally, the first communication device determines the CRC bits based on the number of code block bits S and the second correspondence.

[0201] Optionally, the second correspondence may include the correspondence between the number of code block bits S and the CRC polynomial.

[0202] The second correspondence can be predefined; or, when the first communication device is a terminal-side device (e.g., a terminal, or a module or unit applied to a terminal, or a device capable of realizing the functions of a terminal), the second correspondence can be configured by a network-side device (e.g., a network device, or a module or unit applied to a network device, or a device capable of realizing the functions of a network device).

[0203] For example, the second correspondence may include one or more correspondences, each of which may be a correspondence between the number of bits in a code block and the CRC polynomial.

[0204] For example, as shown in Table 3, the second correspondence includes the correspondence between different code block bit number intervals and CRC polynomials. Different intervals correspond to different CRC polynomials. Different CRC polynomials mean that the number of CRC bits is different or the number of CRC bits is the same but the generator polynomial is different.

[0205] The CRC polynomial is determined based on the number of bits in the code block, thus avoiding the situation where the CRC check passes after the receiving end receives the information, but the information transmission is incorrect, thereby improving the reliability of information transmission.

[0206] Table 3

[0207] Optionally, there may or may not be a second correspondence between the code block bit range and the CRC polynomial. For example, as shown in Table 4, when the range of S is 1 to 11, there is no second correspondence between this range and the CRC polynomial, meaning the first communication device does not need to determine the CRC bits.

[0208] Table 4

[0209] It should be understood that in the above second correspondence, the number of intervals of code block bits, the range of each interval, and the CRC polynomial corresponding to each interval are merely examples of the correspondence between the number of code block bits and the CRC polynomial in the embodiments of this application, and the embodiments of this application do not limit this.

[0210] For example, after the first communication device determines the CRC polynomial corresponding to the information subsequence, it generates CRC bits based on the information subsequence and the CRC polynomial.

[0211] The first communication device adds CRC bits to the code block, where the CRC bits can be located at the end of the code block or scattered throughout the code block. For example, at least one information bit in the code block has CRC bits before and after it.

[0212] The code block with added CRC can be called the second sequence. If step 503 is not performed, the second sequence is the same as the code block without added CRC.

[0213] Optionally, step 503 can also be skipped, that is, the first communication device does not perform step 503.

[0214] Optionally, the network-side device (e.g., a network device, or a module or unit applied to the network device, or a device capable of implementing the functions of the network device) indicates whether to perform step 503.

[0215] Step 504: The first communication device performs a first scrambling on the second sequence.

[0216] Optionally, when the first communication device is a network-side device (e.g., a network device, or a module or unit applied to a network device, or a device capable of implementing the functions of a network device), the first communication device performs a first scrambling on the first sequence. For example, the first communication device uses the UE ID to perform the first scrambling on the first sequence. The UE ID can be an ID that can identify the UE, such as a Radio Network Temporary Identifier (RNTI).

[0217] RNTI can be scrambled at any position in the first sequence. For example, a 16-bit RNTI can be scrambled on the last 16 bits of the first sequence, that is, the 16-bit RNTI is XORed bit by bit with the last 16 bits of the first sequence.

[0218] By applying the first scrambling, the terminal device can identify its own information by descrambling the received sequence.

[0219] Optionally, when the first communication device is a terminal-side device (e.g., a terminal, or a module or unit applied to a terminal, or a device capable of realizing the functions of a terminal), step 504 may not be executed, or the network-side device (e.g., a network device, or a module or unit applied to a network device, or a device capable of realizing the functions of a network device) may instruct whether to execute step 504.

[0220] The second sequence after the first scrambling can be called the third sequence. If step 504 is not executed, the third sequence is the same as the second sequence.

[0221] Optionally, step 504 can be moved between steps 501 and 502. In this case, the first communication device performs a first scrambling on the first sequence in step 501 and performs code block segmentation on the first scrambling sequence, while step 505 processes the second sequence that has not undergone the first scrambling. Since the first communication device only performs the first scrambling on the first sequence, it does not need to perform the first scrambling on each of the multiple code blocks after code block segmentation, which can reduce the number of first scrambling operations and reduce complexity.

[0222] Step 505: The first communication device performs channel coding on the third sequence.

[0223] The first communication device performs channel coding on the third sequence. The channel coding process includes RM coding and, optionally, pre-transformation and / or concatenation coding.

[0224] For example, the steps for performing channel coding can be:

[0225] Pre-transformation—concatenated coding—RM coding, or

[0226] Pre-transformation—RM encoding—concatenated encoding, or

[0227] Cascaded coding—pre-transformation—RM coding, or

[0228] RM encoding—pre-transformation—concatenated encoding

[0229] In the above execution steps, the output sequence of the previous step is used as the input sequence of the next step.

[0230] It is understandable that if pre-transformation and / or concatenated coding are not performed, then the pre-coding and / or concatenated transformation in the above execution steps will not exist, and the new execution steps will still satisfy the condition that the output sequence of the previous step is used as the input sequence of the next step.

[0231] The pre-transformation is performed as follows:

[0232] For example, the first communication device reorders or performs operations on the pre-transformed input sequence according to predetermined rules, specifically including but not limited to interleaving or encoding with a code rate of 1, and obtains a pre-transformed output sequence after pre-transformation. Combining pre-transformation with RM encoding can further improve encoding performance.

[0233] When the channel coding execution steps are "pre-transformation - concatenated coding - RM coding" or "pre-transformation - RM coding - concatenated coding", the pre-transformation input sequence is the aforementioned third sequence; when the channel coding execution steps are "concatenated coding - pre-transformation - RM coding", the pre-transformation input sequence is the concatenated coding output sequence; when the channel coding execution steps are "RM coding - pre-transformation - concatenated coding", the pre-transformation input sequence is the RM coding output sequence.

[0234] Optionally, the pre-transformation can also be skipped, meaning the first communication device does not perform the pre-transformation.

[0235] Optionally, the network-side device (e.g., a network device, or a module or unit applied to the network device, or a device capable of implementing the functions of the network device) indicates whether to perform a pre-transformation.

[0236] The execution method of concatenated encoding is as follows:

[0237] For example, the first communication device performs concatenated coding on the input sequence. The code used for concatenated coding is not limited in this invention; it can be a linear block code, a convolutional code, a polar code, etc. The concatenated coding yields a concatenated coding output sequence. Combining concatenated coding with RM coding can further improve coding performance.

[0238] When the channel coding execution steps are "pre-transformation-concatenated coding-RM coding" or "RM coding-pre-transformation-concatenated coding", the concatenated coding input sequence is the pre-transformation output sequence; when the channel coding execution steps are "concatenated coding-pre-transformation-RM coding", the concatenated coding input sequence is the aforementioned third sequence; when the channel coding execution steps are "pre-transformation-RM coding-concatenated coding", the concatenated coding input sequence is the RM coding output sequence.

[0239] Optionally, concatenation coding can also be skipped, meaning the first communication device does not perform concatenation coding.

[0240] Optionally, the network-side device (e.g., a network device, or a module or unit applied to the network device, or a device capable of implementing the functions of the network device) indicates whether to perform concatenation coding.

[0241] The execution method of RM encoding is as follows:

[0242] The first communication device determines the first parameter m of the RM code based on at least one of the following: the RM-encoded input sequence length K, the target code length E, the code rate R, the modulation and coding scheme (MCS), the maximum code length parameter, and the minimum code length parameter. Wherein, the code rate R = K / E, and the code length N = 2. m The m, K, E, maximum code length parameter, and minimum code length parameter are all positive integers, and the code rate R is a positive number less than 1.

[0243] Optionally, the first communication device determines the first parameter m based on the length K of the RM-encoded input sequence.

[0244] Optionally, the first communication device determines the first parameter m based on the target code length E.

[0245] For example, the first parameter m is the smallest candidate first parameter in the candidate first parameter set that satisfies the second condition. The candidate first parameter set includes at least one candidate first parameter m′. The second condition is that the code length of the RM code corresponding to the first parameter m is not less than the target code length.

[0246] For example, the first parameter can take the following values:

[0247] Where m represents the first parameter, m′ represents the candidate first parameters included in the candidate first parameter set, 2 m′ Let m' represent the code length of the RM code corresponding to m', and E represent the target code length.

[0248] The set of candidate first parameters can be predefined or configured by network-side devices (such as network devices, or modules or units applied to network devices, or devices that can implement the functions of network devices).

[0249] For example, the first parameter can be:

[0250] For example, the first parameter m is the largest candidate first parameter in the candidate first parameter set that satisfies the second condition. The candidate first parameter set includes at least one candidate first parameter m′. The second condition is that the code length of the RM code corresponding to the first parameter m is not greater than the target code length.

[0251] For example, the first parameter can take the following values:

[0252] Where m represents the first parameter, m′ represents the candidate first parameters included in the candidate first parameter set, 2 m′ Let m' represent the code length of the RM code corresponding to m', and E represent the target code length.

[0253] The set of candidate first parameters can be predefined or configured by network-side devices (such as network devices, or modules or units applied to network devices, or devices that can implement the functions of network devices).

[0254] For example, the first parameter can be:

[0255] Optionally, the first communication device determines the first parameter m based on the target code length E and the code rate R.

[0256] For example, when the bit rate R is less than the third threshold,

[0257] When the bit rate R is not less than the third threshold

[0258] For example, when the bit rate R is not greater than the third threshold,

[0259] When the bit rate R is greater than the third threshold

[0260] Optionally, the third threshold is predefined or configured by the network-side device, and the third threshold is a positive number.

[0261] Optionally, the first communication device determines the first parameter m according to the modulation and coding strategy.

[0262] Optionally, the first communication device further determines the first parameter m based on the maximum code length parameter and / or the minimum code length parameter, wherein the maximum code length parameter and / or the minimum code length parameter may be predefined or configured by the network-side device (e.g., a network device, or a module or unit applied to the network device, or a device capable of implementing the functions of the network device), and both the maximum code length parameter and the minimum code length parameter are positive integers.

[0263] For example, if the first parameter m, determined based on the target code length E or based on the target code length E and the code rate R, is greater than or equal to the maximum code length parameter, then the first parameter m takes the value of the maximum code length parameter.

[0264] For example, if the first parameter m, determined based on the target code length E or based on the target code length E and the code rate R, is less than or equal to the minimum code length parameter, then the first parameter m takes the value of the minimum code length parameter.

[0265] It should be understood that the above-mentioned method of determining the first parameter m is merely an example of the embodiments of this application. The embodiments of this application do not limit the specific method by which the first communication device determines the first parameter m based on at least one of the RM encoded input sequence length K, target code length E, code rate R, modulation and coding strategy, maximum code length parameter, and minimum code length parameter.

[0266] It should be understood that the above RM encoding method alone can achieve RM codes of flexible length to suit different scenarios.

[0267] Optionally, the first communication device determines the second parameter r, which is also the order, based on the first parameter m and the length K of the RM-encoded input sequence.

[0268] The third parameter q of the RM code corresponding to the first parameter m and the second parameter r is:

[0269] In this embodiment of the application, the third parameter q is not less than the length K of the RM-encoded input sequence.

[0270] Optionally, the second parameter r is the smallest candidate second parameter in the candidate second parameter set that satisfies the third condition. The candidate second parameter set includes at least one candidate second parameter r′. The third condition is that the third parameter corresponding to the second parameter r is not less than the length K of the RM-encoded input sequence.

[0271] For example, the second parameter can take the following values:

[0272] Where r represents the second parameter, and r′ represents the candidate second parameters included in the candidate second parameter set. This represents the third parameter corresponding to r′, and K represents the length of the RM-encoded input sequence, where K is a positive integer.

[0273] The set of candidate second parameters can be predefined or configured by network-side devices (such as network devices, or modules or units applied to network devices, or devices that can implement the functions of network devices).

[0274] Optionally, the second parameter r of the RM code is predefined or configured by the network-side device.

[0275] The first communication device determines the RM code generation matrix based on the first parameter and the second parameter.

[0276] The first communication device performs RM encoding on the RM-encoded input sequence based on the RM code generation matrix to obtain the RM-encoded output sequence.

[0277] When the channel coding execution steps are "pre-transformation-concatenated coding-RM coding", the RM coding input sequence is the concatenated coding output sequence; when the channel coding execution steps are "RM coding-pre-transformation-concatenated coding", the RM coding input sequence is the aforementioned third sequence; when the channel coding execution steps are "concatenated coding-pre-transformation-RM coding" or "pre-transformation-RM coding-concatenated coding", the RM coding input sequence is the pre-transformation output sequence.

[0278] For example, the first communication device can obtain the RM-encoded output sequence as follows: d = cG

[0279] Where c is the RM-encoded input sequence, G is the RM code generation matrix, and d is the RM-encoded output sequence.

[0280] For example, c is an RM-encoded input sequence of length K [c0, c1, ..., c K-1 G is K*2 m Given a matrix, based on the above encoding method, a matrix of length N=2 can be obtained. m The RM-encoded output sequence [d0,d1,…,d N-1 ].

[0281] For example, the first communication device can also obtain the RM-encoded output sequence as follows: d = Gc

[0282] Where c is the RM-encoded input sequence, G is the RM code generation matrix, and d is the RM-encoded output sequence.

[0283] For example, c is an RM-encoded input sequence of length K [c0, c1, ..., c K-1 ] T G is 2 m Given a matrix of length *K, based on the above encoding method, a matrix of length N=2 can be obtained. m The RM-encoded output sequence [d0,d1,…,d N-1 ] T .

[0284] It should be understood that the above-described RM encoding of the RM-encoded input sequence based on the RM code generation matrix is ​​merely an example of an embodiment of this application. This application does not limit this, as long as the elements of the RM-encoded output sequence are the same as the elements in the above sequence d.

[0285] Overall, the output sequence of channel coding in step 505 can be referred to as the fourth sequence.

[0286] It can be seen that the RM encoding process has made corresponding improvements compared to existing technologies, making the code length after RM encoding more flexible and adaptable to different application scenarios of future communication systems.

[0287] Step 506: The first communication device performs rate matching on the fourth sequence.

[0288] The rate matching process includes bit selection; optionally, the rate matching process also includes preprocessing and / or bit interleaving.

[0289] For example, the steps for rate matching can be:

[0290] Preprocessing — Bit selection — Bit interleaving

[0291] This invention does not limit the specific preprocessing method, bit selection method, or bit interleaving method. That is, the rate matching output sequence of length E can be obtained from the RM encoded output sequence of length N, where E is a positive integer.

[0292] Optionally, preprocessing can also be skipped, meaning the first communication device does not perform preprocessing.

[0293] Optionally, the network-side device (e.g., a network device, or a module or unit applied to the network device, or a device capable of implementing the functions of the network device) indicates whether preprocessing should be performed.

[0294] Optionally, bit interleaving can also be skipped, meaning the first communication device does not perform bit interleaving.

[0295] Optionally, the network-side device (e.g., a network device, or a module or unit applied to the network device, or a device capable of implementing the functions of the network device) indicates whether bit interleaving should be performed.

[0296] Step 507: The first communication device performs rate matching and then operates.

[0297] The first communication device performs rate-matching post-operations on the rate-matched output sequence, the rate-matching post-operations including second scrambling, and optionally, code block concatenation and / or interleaving.

[0298] For example, the execution steps of the rate-matched operation can be:

[0299] Code block concatenation—second scrambling—interleaving, or

[0300] Code block concatenation—interleaving—second scrambling, or

[0301] Second scrambling—interleaving—code block concatenation, or

[0302] Second scrambling—code block concatenation—interleaving, or

[0303] Interleaving—Second Scrambling—Code Block Concatenation

[0304] In the above execution steps, the output sequence of the previous step is used as the input sequence of the next step.

[0305] It is understandable that if code block concatenation or interleaving is not performed, then code block concatenation or interleaving in the above execution steps will not exist, and the new execution steps will still satisfy the condition that the output sequence of the previous step is used as the input sequence of the next step.

[0306] The execution method for code block concatenation is as follows:

[0307] For example, the first communication device concatenates the code block concatenation input sequence to obtain the code block concatenation output sequence. If code block segmentation was not performed in the previous step, i.e. there is only one code block, then code block concatenation is not required, and the code block concatenation output sequence is associated with only one code block.

[0308] When the execution steps after rate matching are "code block concatenation - second scrambling - interleaving" or "code block concatenation - interleaving - second scrambling", the code block concatenation input sequence is the rate matching output sequence; when the execution steps after rate matching are "second scrambling - interleaving - code block concatenation", the code block concatenation input sequence is the interleaving output sequence; when the execution steps after rate matching are "second scrambling - code block concatenation - interleaving" or "interleaving - second scrambling - code block concatenation", the code block concatenation input sequence is the second scrambling output sequence.

[0309] The second scrambling method is as follows:

[0310] The first communication device performs a second scrambling on the second scrambling input sequence using a scrambling code sequence. Specifically, it performs a bit-by-bit XOR operation on the second scrambling input sequence and the scrambling code sequence to obtain a second scrambling output sequence, wherein the scrambling code sequence is a pseudo-random sequence. This second scrambling randomizes the input sequence, thereby randomizing interference between cells and improving cell performance.

[0311] When the step after rate matching is "code block concatenation - second scrambling - interleaving", the second scrambling input sequence is the code block concatenation output sequence; when the step after rate matching is "code block concatenation - interleaving - second scrambling" or "interleaving - second scrambling - code block concatenation", the second scrambling input sequence is the interleaving output sequence; when the step after rate matching is "second scrambling - interleaving - code block concatenation" or "second scrambling - code block concatenation - interleaving", the second scrambling input sequence is the rate matching output sequence.

[0312] The execution method for interleaving is as follows:

[0313] Optionally, the first communication device interleaves the interleaved input bits to obtain an interleaved output sequence, such as row-column interleaving, upper triangular interleaving, etc., which are not limited in this invention. If bit interleaving is performed during rate matching, the post-rate matching operation does not include interleaving.

[0314] When the step after rate matching is "code block concatenation - second scrambling - interleaving" or "second scrambling - interleaving - code block concatenation", the interleaving input sequence is the second scrambling output sequence; when the step after rate matching is "code block concatenation - interleaving - second scrambling" or "second scrambling - code block concatenation - interleaving", the interleaving input sequence is the code block concatenation output sequence; when the step after rate matching is "interleaving - second scrambling - code block concatenation", the interleaving input sequence is the rate matching output sequence.

[0315] Optionally, the network-side device (e.g., a network device, or a module or unit applied to the network device, or a device capable of implementing the functions of the network device) indicates whether to perform rate-matched interleaving. If the device indicates to perform rate-matched interleaving, bit interleaving is not performed during rate matching.

[0316] The steps “code block concatenation—second scrambling—interleaving” and “code block concatenation—interleaving—second scrambling” can achieve TB-level second scrambling and TB-level interleaving; the steps “second scrambling—interleaving—code block concatenation” and “interleaving—second scrambling—code block concatenation” can achieve CB-level second scrambling and CB-level interleaving; the step “second scrambling—code block concatenation—interleaving” can achieve CB-level second scrambling and TB-level interleaving.

[0317] After the first communication device completes the rate matching operation described above, it can modulate and process the output sequence of the rate matching operation before sending it to the second communication device. If the first communication device is a terminal-side device (e.g., a terminal, or a module or unit applied to a terminal, or a device capable of realizing the functions of a terminal), then the second communication device is a network-side device (e.g., a network device, or a module or unit applied to a network device, or a device capable of realizing the functions of a network device); if the first communication device is a network-side device (e.g., a network device, or a module or unit applied to a network device, or a device capable of realizing the functions of a network device), then the second communication device is a terminal-side device (e.g., a terminal, or a module or unit applied to a terminal, or a device capable of realizing the functions of a terminal).

[0318] Figure 5 illustrates a sending-end method, and the receiving-end method is the reverse process of the sending-end method. For example, when the first communication device acts as the receiving end, the following steps are performed:

[0319] The process includes: rate matching descrambling (involving descrambling, deinterleaving, and code block concatenation) — rate matching descrambling — channel decoding (involving pre-transformation descrambling, concatenated decoding, and RM decoding) — descrambling — CB CRC check — code block merging — TB CRC check.

[0320] Figure 6 illustrates a possible exemplary block diagram of the communication device involved in the embodiments of this application. As shown in Figure 6, the communication device 600 may include modules or units for implementing the method embodiments described above. In one possible design, the communication device 600 includes a processing unit 601. Optionally, the communication device 600 may also include an interface unit 603. Optionally, the communication device 600 may also include a storage unit 602 for storing device program code and / or data.

[0321] The communication device 600 can perform the sending end method and / or receiving end method described above.

[0322] For example, processing unit 601 may perform the following steps:

[0323] Add CRC to the information sequence — code block segmentation — add CRC to the code block — second scrambling — channel coding — rate matching — post-rate matching operations.

[0324] The communication device 600 can be a terminal-side device (e.g., a terminal, or a module or unit applied to a terminal, or a device capable of realizing the functions of a terminal) or a network-side device (e.g., a network device, or a module or unit applied to a network device, or a device capable of realizing the functions of a network device) as described in the above embodiments.

[0325] In one possible design, the functionality of processing unit 601 can be implemented by one or more processors. Specifically, the processor may include a modem chip, a system-on-a-chip (SoC) chip containing a modem core, or a system-in-package (SIP) chip. The functionality of interface unit 603 can be implemented by transceiver circuitry.

[0326] In one possible design, when the communication device 600 is a circuit or chip in a terminal responsible for communication functions, such as a modem chip or a system-on-a-chip (SoC) or SIP chip containing a modem core, the function of the processing unit 601 can be implemented by a circuit system in the aforementioned chip that includes one or more processors or processor cores. The function of the interface unit 603 can be implemented by the interface circuit or data transceiver circuit on the aforementioned chip.

[0327] The functional units in the above communication devices may be one or more integrated circuits configured to implement the above methods, such as: one or more application-specific integrated circuits (ASICs), or one or more central processing units (CPUs), one or more microcontroller units (MCUs), one or more digital signal processors (DSPs), or one or more field-programmable gate arrays (FPGAs), or a combination of at least two of these integrated circuit forms.

[0328] Storage unit 602 may include random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory and / or registers, etc.

[0329] It is understood that the division of units in the aforementioned communication device is merely a logical functional division. One function can correspond to one functional unit, or two or more functions can be integrated into one functional unit. In actual implementation, all or some units can be integrated onto a single physical entity, or distributed across different physical entities. Furthermore, the aforementioned functional units can be implemented in hardware, software, or a combination of both. Whether a function is executed in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for specific applications, but such implementations should not be considered beyond the scope of this application.

[0330] It is understood that the aforementioned processor may include one or more of the following: a central processing unit (CPU), a digital signal processor (DSP), a microprocessor unit (MPU), a microcontroller unit (MCU), a graphics processing unit (GPU), a field-programmable gate array (FPGA), an artificial intelligence processor (AI processor), a neural processing unit (NPU), or any other form of processor known in the art.

[0331] It is understood that the aforementioned memory may include one or more of the following storage media: random access memory (RAM), static random access memory (SRAM), dynamic random access memory (DRAM), phase-change memory (PCM), resistive random access memory (ReRAM), magnetoresistive random access memory (MRAM), ferroelectric random access memory (FRAM), cache, register, read-only memory (ROM), flash memory, erasable programmable read-only memory (EPROM), hard disk, or any other form of storage media known in the art.

[0332] It is understandable that the memory and processor are coupled, and the memory and processor can exist as discrete components in the communication device, or the memory can be a component of the processor. Similarly, the aforementioned interface unit and processor can exist as discrete components in the communication device, or the aforementioned interface unit can be a component of the processor.

[0333] The methods in this application can be implemented, in whole or in part, by software, hardware, firmware, or any combination thereof. When implemented in software, they can be implemented, in whole or in part, as a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in this application are performed, in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user equipment, a core network device, or other programmable device. The computer program or instructions can be stored in a computer-readable storage medium or transmitted through the computer-readable storage medium. The computer-readable storage medium can be any available medium accessible to a computer or a data storage device such as a server or data center integrating one or more available media. The available medium can be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; it can also be an optical medium, such as a digital video optical disc; or it can be a semiconductor medium, such as a solid-state drive. The computer-readable storage medium can be a volatile or non-volatile storage medium, or it can include both volatile and non-volatile types of storage media.

[0334] Obviously, those skilled in the art can make various modifications and variations to this application without departing from the scope of this application. Therefore, if such modifications and variations fall within the scope of the claims of this application and their equivalents, this application also intends to include such modifications and variations.

Claims

1. An information processing method, characterized in that, include: The first communication device acquires a third sequence and performs channel coding on the third sequence. The channel coding process includes RM coding. The first parameter m of the RM code corresponding to the RM coding is obtained based on at least one of the following: the RM coding input sequence length K, the target code length E, the code rate R, the modulation and coding strategy, the maximum code length parameter, and the minimum code length parameter. The code rate R = K / E, and the code length N = 2. m The m, K, E, maximum code length parameter, and minimum code length parameter are all positive integers, and the code rate R is a positive number less than 1.

2. The method according to claim 1, characterized in that, The first parameter m is the smallest candidate first parameter in the candidate first parameter set that satisfies the second condition. The candidate first parameter set includes at least one candidate first parameter. The second condition is that the code length of the RM code corresponding to the first parameter m is not less than the target code length.

3. The method according to claim 1 or 2, characterized in that, The first parameter 4. The method according to claim 1, characterized in that, The first parameter m is the largest candidate first parameter in the candidate first parameter set that satisfies the second condition. The candidate first parameter set includes at least one candidate first parameter. The second condition is that the code length of the RM code corresponding to the first parameter m is not greater than the target code length.

5. The method according to claim 1 or 4, characterized in that, The first parameter 6. The method according to claim 2 or 4, characterized in that, The candidate first parameter set is predefined or configured by the network-side device.

7. The method according to claim 1, characterized in that, The first parameter m is determined based on the target code length E and the code rate R.

8. The method according to claim 7, characterized in that, When the code rate R is less than the third threshold, the first parameter The third threshold is an integer.

9. The method according to claim 7, characterized in that, When the code rate R is not less than the third threshold, the first parameter The third threshold is an integer.

10. The method according to any one of claims 1 to 9, characterized in that, The second parameter *r* of the RM code corresponding to the RM code is the smallest candidate second parameter in the candidate second parameter set that satisfies the third condition. The candidate second parameter set includes at least one candidate second parameter. The third condition is that the third parameter corresponding to the second parameter *r* is not less than the length *K* of the RM-encoded input sequence.

11. The method according to claim 10, characterized in that, The set of candidate second parameters is predefined or configured by the network-side device.

12. The method according to any one of claims 1 to 11, characterized in that, The channel coding process also includes pre-transformation and / or concatenated coding.

13. The method according to claim 12, characterized in that, The channel coding execution steps are: "pre-transformation - concatenated coding - RM coding" or "pre-transformation - RM coding - concatenated coding" or "concatenated coding - pre-transformation - RM coding" or "RM coding - pre-transformation - concatenated coding".

14. The method according to any one of claims 1 to 13, characterized in that, The third sequence is either a second sequence that has not undergone the first scrambling or has undergone the first scrambling.

15. The method according to claim 14, characterized in that, The second sequence is a code block with or without a second CRC.

16. The method according to claim 15, characterized in that, The code block is either the first sequence or one of multiple code blocks obtained by the first communication device after dividing the first sequence into code blocks.

17. The method according to claim 14 or 15, characterized in that, The number of bits in the second CRC has a second correspondence with the number of bits in the code block. The second correspondence includes one or more correspondences, each of which is a correspondence between the range of the number of bits in the code block and the CRC polynomial.

18. The method according to claim 16 or 17, wherein when the first condition is met, the first communication device performs code block segmentation on the first sequence to obtain the plurality of code blocks.

19. The method of claim 18, wherein the first condition includes at least one of the following conditions: The length A of the first sequence is greater than or equal to a first threshold, where the first threshold is a positive integer; The target code length E is greater than or equal to a second threshold, where the second threshold is a positive integer.

20. The method according to any one of claims 16 to 19, wherein the first sequence is an information sequence with or without a first CRC.

21. The method according to claim 20, wherein the number of bits of the first CRC has a first correspondence with the number of bits of the information sequence, the first correspondence including one or more correspondences, each of the correspondences being a correspondence between the range of bits of the information sequence and the CRC polynomial.

22. The method according to any one of claims 1 to 21, wherein the first communication device performs rate matching on the fourth sequence to obtain a rate-matched output sequence of length E, the fourth sequence being the channel-coded output sequence, and the first communication device performs a rate-matching post-operation on the rate-matched output sequence, the rate-matching post-operation including a second scrambling.

23. The method of claim 22, wherein the post-rate matching operation further comprises code block concatenation and / or interleaving.

24. The method according to claim 23, wherein the execution steps of the rate matching operation are: "code block concatenation - second scrambling - interleaving" or "code block concatenation - interleaving - second scrambling" or "second scrambling - interleaving - code block concatenation" or "second scrambling - code block concatenation - interleaving" or "interleaving - second scrambling - code block concatenation".

25. A communication device, characterized in that, Includes modules or units for performing the method as described in any one of claims 1 to 24.

26. A communication device, characterized in that, It includes at least one processor coupled to at least one memory for executing computer instructions stored in the memory to cause the communication device to perform the method as described in any one of claims 1 to 24.

27. A chip or chip system, characterized in that, It includes at least one processing circuit, the at least one processing circuit being used to run a computer program, causing the chip or chip system to perform the method as described in any one of claims 1 to 24.

28. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program or instructions that, when executed on a computer, cause the computer to perform the method as described in any one of claims 1 to 24.

29. A computer program product, characterized in that, When the computer program product is run on a computer, it causes the computer to perform the method as described in any one of claims 1 to 24.

Images