Data processing method and apparatus

Abstract

A data processing method and apparatus, relating to the field of communication technology. In this method, a first communication device adjusts the distributed matcher code rate to a second distributed matcher code rate R. DM2 Furthermore, based on the code rate R of the second distribution matcher DM2 The information bit sequence is processed by distribution matching to obtain a second bit sequence. This second bit sequence is then encoded using a low-density parity-check code to obtain a third bit sequence. Finally, the third bit sequence is modulated to obtain a first symbol sequence. This embodiment of the application, which adjusts the distribution matcher code rate to minimize the number of shortened bits in the sequence to be encoded, ensures the integrity of the base map, thus improving encoding / decoding performance and consequently enhancing communication performance.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a data processing method and apparatus. Background Technology

[0002] Low-density parity-check (LDPC) codes are channel coding schemes very close to Shannon lines, characterized by high performance and low complexity. They have been selected by the 3rd Generation Partnership Project (3GPP) as the data channel coding scheme for fifth-generation (5G) communication technology. Quasi-cyclic (QC)-LDPC codes, as a type of structured LDPC code, can have their parity-check matrix obtained by expanding the base graph (BG) with a lifting size.

[0003] Probabilistic shaping (or probabilistic reshaping) is a coding and modulation optimization technique. By cascading a precoder before the channel coding encoder, it maps the information bit sequence to a sequence following a specific distribution. Then, after systematic code encoding (e.g., LDPC encoding) by the channel coding encoder, this distributed sequence directly appears in the final coded sequence. Typically, the bit sequence to be encoded becomes longer after precoding. Since the length of information bit sequences in wireless communication is very flexible, ranging from tens to thousands of bits, there can be situations where the number of shortened bits corresponding to the bit sequence to be encoded is very large. The larger the number of shortened bits, the more likely it is to degrade communication performance. Summary of the Invention

[0004] This application provides a data processing method and apparatus that can reduce the number of shortened bits, thereby improving communication performance.

[0005] The present application is described below from different aspects. It should be understood that the different implementation methods and beneficial effects described below can be referenced from each other.

[0006] Firstly, this application provides a data processing method that can be applied to a first communication device. For example, the first communication device can be a terminal, or a component within the terminal (e.g., a processor, chip, chip system, circuit, or functional module), such as a communication module / processing module within the terminal, or a circuit or chip within the terminal responsible for communication functions (e.g., a modem chip, also known as a baseband chip, or a system-on-chip (SoC) chip containing a modem core, or a system-in-package (SIP) chip), or a circuit or chip within the terminal responsible for processing functions (e.g., a graphics processing unit (GPU), an artificial intelligence (AI) processor, or an application-specific integrated circuit (ASIC), or a sensing function processor). Alternatively, the first communication device can also be an access network device, which can be an access network equipment, a module within the access network equipment (e.g., a circuit, chip, or chip system), or a logical node, logical module, or software capable of implementing all or part of the functions of the access network device. In this method, the first communication device can, based on the second distributed matcher code rate R... DM2 The information bit sequence is pre-encoded to obtain a second bit sequence. Then, the second bit sequence is encoded using a low-density parity-check code to obtain a third bit sequence. Next, the third bit sequence is modulated to obtain a first symbol sequence, which is then output / transmitted. The second distributed matcher code rate R... DM2 Determined based on one or more of the following parameters: First distribution matcher code rate R DM1 The length K of the information bit sequence, the first boost value Zc, the number of information columns kb of the base map corresponding to the information bit sequence, the length S of the first symbol sequence, and the length K of the first bit sequence. FEC1 Or a first code rate threshold; the first boost value Zc is a boost value in the boost value set, and the length K of the first bit sequence FEC1 With the first distribution matcher code rate R DM1 Related.

[0007] Optionally, the precoding process in this embodiment can also be described as a distributed matching process. In this embodiment, the distributed matcher code rate is adjusted to the second distributed matcher code rate R. DM2 And based on the second distribution matcher code rate R DM2By performing distribution matching on the information bit sequence, the number of bits can be shortened as much as possible, which means the number of bits can be reduced to kb×Zc′-K. FEC2 The size of K FEC2 The length of the second bit sequence obtained after distribution matching can be adjusted by R. DM2 Change, or K FEC2 =K+(1-R) DM2 It should be understood that reducing the number of bits helps ensure the integrity of the low-density parity-check code base map, thus improving encoding / decoding performance and consequently enhancing communication performance.

[0008] In one possible implementation, the code rate R of the second distributed matcher DM2 Based on the second lift value Zc′, the number of information columns kb of the base map corresponding to the information bit sequence, the length S of the first symbol sequence, and the length K of the information bit sequence are determined. In one possible implementation, the second lift value Zc′ is a value less than a certain value in the lift value set. The maximum lift value is chosen to maintain the channel coding rate at a constant level, thus ensuring more stable communication performance. In another possible implementation, the second lift value Zc′ is a value greater than the maximum lift value in the set of lift values. The minimum lift value is used to improve the shaping effect, which in turn helps to improve communication performance.

[0009] In one possible implementation, if the second lift value Zc′ is less than the first lift value Zc, then the second lift value Zc′ is a value less than a certain value in the set of lift values. The maximum lift value. In another possible implementation, if the second lift value Zc′ is greater than the first lift value Zc, then the second lift value Zc′ is the lift value greater than the first lift value Zc in the set of lift values. The minimum lift value.

[0010] In one possible implementation, the code rate R of the second distributed matcher DM2 It is equal to the first code rate threshold. Since excessively high code rates may impair decoding performance, in this implementation, the code rate R of the second distributed matcher is limited. DM2 Setting the code rate to the same level as the first code rate threshold can prevent the channel coding code rate from exceeding the threshold, thereby helping to improve communication performance.

[0011] In one possible implementation, the first bit rate threshold is one of the following values: or This implementation improves protocol compatibility.

[0012] In one possible implementation, the code rate R of the second distributed matcher DM2 satisfy:

[0013] x2=kb×Zc′-K-(1-R DM2 )×S; or,

[0014] x2=kb-K / Zc′-(1-R DM2 )×S / Zc′; or,

[0015] x2=kb×Zc′-K FEC2 ;or,

[0016] x2=kb-K FEC2 / Zc;

[0017] Wherein, x2 is the second index, and K FEC2 is the length of the second bit sequence.

[0018] In one possible implementation, based on the code rate R of the second distribution matcher DM2 The determined second metric x2 is less than or equal to the code rate R of the first distribution matcher. DM1 The first metric, x1, is determined. This implementation helps reduce the number of shortened bits, thereby improving the stability of communication performance.

[0019] In one possible implementation, the first index x1 satisfies:

[0020] x1=kb×Zc-K-(1-R DM1 )×S; or,

[0021] x1=kb-K / Zc-(1-R DM1 )×S / Zc; or,

[0022] x1=kb×Zc-K FEC1 ;or,

[0023] x1=kb-K FEC1 / Zc.

[0024] In one possible implementation, In this case,

[0025] Wherein, the Z max W0 is the maximum boost value in the set of boost values, where W0 is a positive integer less than a first value, and the first value is equal to log2(Z). max / a0), where a0 is the Z maxThe base of the boost value group. This implementation avoids excessive fluctuations in Zc' and reduces the gap between Zc' and Zc, thus helping to improve the stability of communication performance.

[0026] In one possible implementation, In this case, Among them, the set of boost values ​​is in the interval All the boost values ​​within are sorted in ascending order as follows: The `kmax` is the maximum lift value in the lift value set with `a0` as the base, divided by `a0` and raised to the power of 2. `a1` is a base value other than `a0`. a1 For the set of boost values ​​based on a1 that are less than or equal to The maximum lift value divided by a1 and raised to the power of 2, where a2 is a base other than a0 and a1, k a2 For the set of enhancement values ​​based on a2 that are less than or equal to The maximum lift value divided by a2 and raised to the power of 2, where a3 is the base of the lift value group that is not a0, a1, a2, and k a3 For the group of boost values ​​based on a3 that are less than or equal to The maximum increase value divided by a3 and raised to the power of 2, the For the set of boost values ​​less than The maximum increase value, the For the set of boost values ​​greater than The minimum lift value, the 2 k0 For the set of boost values ​​that are in the interval The greatest common divisor of all the lift values ​​within the range, the The

[0027] This implementation avoids excessive fluctuations in Zc' and reduces the gap between Zc' and Zc, thus helping to improve the stability of communication performance.

[0028] In one possible implementation, the first lift value Zc is a value from the set of lift values ​​that satisfies kb×Zc≥K+(1-R). DM1 The improvement value is )×S. This implementation is beneficial for improving protocol compatibility.

[0029] In one possible implementation, the first lift value Zc is a value from the set of lift values ​​that satisfies kb×Zc≥K+(1-R). DM1 The minimum lift value of )×S. This implementation is beneficial for improving protocol compatibility.

[0030] In one possible implementation, the code rate R according to the second distribution matcher DM2 Precoding the information bit sequence includes: under at least one of the following conditions, according to the second distribution matcher code rate R... DM2 Pre-encode the information bit sequence:

[0031] In the range Where T is greater than the The value, the For the set of boost values ​​less than The maximum increase value; or,

[0032] Modulation order Q m Greater than or equal to the modulation order threshold; or,

[0033] Modulation order Q m The preset modulation order is used, and the MCS index is greater than the MCS index threshold; or,

[0034] The K FEC1 The corresponding first coding rate R FEC1 Greater than or equal to the second bitrate threshold; or,

[0035] The payload rate R is greater than or equal to the second rate threshold.

[0036] In this implementation, performance is improved in cases where the number of shortened bits has a significant impact. Specifically, in cases with high code rates or high modulation orders, the solution provided in this application is adopted to adjust the number of shortened bits, which helps to reduce processing overhead.

[0037] In one possible implementation, the second bit rate threshold is one of the following values: or This implementation is beneficial for protocol compatibility.

[0038] In one possible implementation, the The y is an integer and the y∈[1,2] t -1], where t≥1. Under this implementation, it is beneficial to minimize the number of shortened bits, thereby helping to improve the stability of communication performance.

[0039] In one possible implementation, the

[0040] In one possible implementation, T is related to the segment in which the second boost value Zc′ is located. This implementation helps to ensure a more stable proportion of shortened bits to the total code length, thereby contributing to improved communication performance stability.

[0041] In one possible implementation, the T corresponding to the second lift value Zc′ belonging to the first segment is greater than the T corresponding to the second lift value Zc′ belonging to the second segment, the tolerance of the coefficients contained in the first segment is less than the tolerance of the coefficients contained in the second segment, and the coefficients in the first segment and the coefficients in the second segment are contained in the lift value set within the interval... Divide all boost values ​​within by 2 k0 The coefficients obtained later.

[0042] Secondly, this application provides a data processing method that can be applied to a second communication device. For example, the second communication device can be a terminal, or a component within the terminal (e.g., a processor, chip, chip system, circuit, or functional module), such as a communication module / processing module within the terminal, or a circuit or chip responsible for communication functions within the terminal (e.g., a modem chip, also known as a baseband chip, or a SoC chip or SIP chip containing a modem core), or a circuit or chip responsible for processing functions within the terminal (e.g., a GPU, AI processor, or ASIC). Alternatively, the second communication device can also be an access network device, which can be an access network equipment, a module within the access network equipment (e.g., a circuit, chip, or chip system), or a logical node, logical module, or software capable of implementing all or part of the access network device's functions. In this method, the second communication device receives information to be demodulated and demodulates the information to be demodulated to obtain information to be decoded. Then, the information to be decoded can be decoded based on a low-density parity-check code to obtain a second bit sequence, and the second bit sequence can be processed according to the second distribution matcher code rate R. DM2 The second bit sequence is subjected to dedistribution matching processing to obtain the information bit sequence. The code rate R of the second distribution matcher is... DM2 Determined based on one or more of the following parameters: First distribution matcher code rate R DM1 The length K of the information bit sequence, the first boost value Zc, the number of information columns kb of the base map corresponding to the information bit sequence, the length S of the first symbol sequence, and the length K of the first bit sequence. FEC1 Or a first code rate threshold; the first boost value Zc is a boost value in the boost value set, and the first bit sequence is matched with the first distribution matcher code rate R. DM1 Related.

[0043] In this embodiment, corresponding to the transmitting end, the receiving end uses the adjusted distribution matcher code rate (i.e., the second distribution matcher code rate R). DM2 Performing solution distribution matching processing can improve decoding performance.

[0044] In one possible implementation, the code rate R of the second distributed matcherDM2 Based on the second lift value Zc′, the number of information columns kb of the base map corresponding to the information bit sequence, the length S of the first symbol sequence, and the length K of the information bit sequence are determined; wherein, the second lift value Zc′ is a value less than a certain value in the lift value set. The maximum lift value, or the second lift value Zc′ is greater than the maximum lift value in the set of lift values. The minimum lift value.

[0045] In one possible implementation, if the second lift value Zc′ is less than the first lift value Zc, then the second lift value Zc′ is a value less than a certain value in the set of lift values. The maximum lift value; or, if the second lift value Zc′ is greater than the first lift value Zc, the second lift value Zc′ is the lift value greater than the first lift value Zc in the set. The minimum lift value.

[0046] In one possible implementation, the code rate r of the second distribution matcher DM2 It is equal to the first bit rate threshold.

[0047] In one possible implementation, the first bit rate threshold is one of the following values: or

[0048] In one possible implementation, the code rate r of the second distribution matcher DM2 satisfy:

[0049] x2=kb×Zc′-K-(1-R DM2 )×S; or,

[0050] x2=kb-K / Zc′-(1-R DM2 )×S / Zc′; or,

[0051] x2=kb×Zc′-K FEC2 ;or,

[0052] x2=kb-K FEC2 / Zc;

[0053] Wherein, x2 is the second index, and K FEC2 is the length of the second bit sequence.

[0054] In one possible implementation, based on the code rate R of the second distribution matcher DM2 The determined second metric x2 is less than or equal to the code rate R of the first distribution matcher. DM1 The first definite indicator is x1.

[0055] In one possible implementation, the first index x1 satisfies:

[0056] x1=kb×Zc-K-(1-R DM1 )×S; or,

[0057] x1=kb-K / Zc-(1-R DM1 )×S / Zc; or,

[0058] x1=kb×Zc-K FEC1 ;or,

[0059] x1=kb-K FEC1 / Zc.

[0060] In one possible implementation, In this case,

[0061] Wherein, the Z max W0 is the maximum boost value in the set of boost values, where W0 is a positive integer less than a first value, and the first value is equal to log2(Z). max / a0), where a0 is the Z max The base of the boost value group.

[0062] In one possible implementation, In this case, Among them, the set of boost values ​​is in the interval All the boost values ​​within are sorted in ascending order as follows: The `kmax` is the maximum lift value in the lift value set with `a0` as the base, divided by `a0` and raised to the power of 2. `a1` is a base value other than `a0`. a1 For the set of boost values ​​based on a1 that are less than or equal to The maximum lift value divided by a1 and raised to the power of 2, where a2 is a base other than a0 and a1, k a2 For the set of enhancement values ​​based on a2 that are less than or equal to The maximum lift value divided by a2 and raised to the power of 2, where a3 is the base of the lift value group that is not a0, a1, a2, and k a3 For the group of boost values ​​based on a3 that are less than or equal to The maximum increase value divided by a3 and raised to the power of 2, the For the set of boost values ​​less than The maximum increase value, the For the set of boost values ​​greater than The minimum lift value, the 2k0 For the set of boost values ​​that are in the interval The greatest common divisor of all the lift values ​​within the range, the The

[0063] In one possible implementation,

[0064] The first lift value Zc is a value in the set of lift values ​​that satisfies kb×Zc≥K+(1-R) DM1 The increase value of )×S.

[0065] In one possible implementation, the first lift value Zc is a value from the set of lift values ​​that satisfies kb×Zc≥K+(1-R). DM1 The minimum lift value of )×S.

[0066] In one possible implementation, the code rate R according to the second distribution matcher DM2 Precoding the information bit sequence includes: under at least one of the following conditions, according to the second distribution matcher code rate R... DM2 Pre-encode the information bit sequence:

[0067] In the range Where T is greater than the The value, the For the set of boost values ​​less than The maximum increase value; or,

[0068] Modulation order Q m Greater than or equal to the modulation order threshold; or,

[0069] Modulation order Q m The preset modulation order is used, and the MCS index is greater than the MCS index threshold; or,

[0070] The K FEC1 The corresponding first coding rate R FEC1 Greater than or equal to the second bitrate threshold; or,

[0071] The payload rate R is greater than or equal to the second rate threshold.

[0072] In one possible implementation, the second bit rate threshold is one of the following values: or

[0073] In one possible implementation, the The y is an integer and the y∈[1,2] t -1], where t≥1.

[0074] In one possible implementation, the

[0075] In one possible implementation, T is related to the segment in which the second boost value Zc′ is located.

[0076] In one possible implementation, the T corresponding to the second lift value Zc′ belonging to the first segment is greater than the T corresponding to the second lift value Zc′ belonging to the second segment, the tolerance of the coefficients contained in the first segment is less than the tolerance of the coefficients contained in the second segment, and the coefficients in the first segment and the coefficients in the second segment are contained in the lift value set within the interval... Divide all boost values ​​within by 2 k0 The coefficients obtained later.

[0077] Thirdly, this application provides a communication device comprising units or modules for performing any of the methods described in the first to second aspects, or any possible implementation thereof.

[0078] Fourthly, this application provides a communication device including a processor and a communication interface. The communication interface is used to receive signals from other communication devices outside the communication device and transmit them to the processor, or to send signals from the processor to other communication devices outside the communication device. The processor uses logic circuits and / or executes computer programs or instructions to implement the method shown in any of the first to second aspects, or any possible implementation of any of the aspects.

[0079] Optionally, the communication interface can be a transceiver, interface circuit, input / output interface, input / output module, chip pin, or other type of communication interface.

[0080] Optionally, the communication device further includes a memory storing computer programs or instructions; the processor is used to invoke the computer program in the memory, causing the communication device to perform the method shown in any of the first or second aspects, or any possible implementation thereof.

[0081] In one possible design, the communication device can be a chip, a chip system, or a device containing a chip that implements the above method.

[0082] Fifthly, this application provides a computer-readable storage medium storing a computer program or instructions that, when executed by a computer, implement the method shown in any of the first to second aspects, or any possible implementation thereof.

[0083] Sixthly, this application provides a computer program product that, when read and executed by a computer, causes the computer to perform any of the methods of the first to second aspects, or any possible implementation thereof.

[0084] In a seventh aspect, this application provides a chip system including at least one processor and an interface, the processor being configured to read and execute instructions stored in a memory, wherein when the instructions are executed, the chip performs the method as described in any one of the first or second aspects, or the method shown in any possible implementation of either aspect.

[0085] Eighthly, this application provides a communication system that may include a first communication device and a second communication device. The first communication device is used to perform the method shown in the first aspect or any possible implementation thereof. The second communication device is used to perform the method shown in the second aspect or any possible implementation thereof. Attached Figure Description

[0086] Figure 1 This is a schematic diagram of the architecture of a communication system provided in this application;

[0087] Figure 2 This is a schematic diagram of the architecture of another communication system provided in this application;

[0088] Figure 3 This is a schematic diagram of the right circular shift of the identity matrix provided in an embodiment of this application;

[0089] Figure 4 This is a schematic diagram of a communication system provided in this application;

[0090] Figure 5 This is another communication system schematic diagram provided in this application;

[0091] Figure 6 This is a flowchart illustrating a data processing method provided in an embodiment of this application;

[0092] Figure 7 This is another schematic flowchart of the data processing method provided in the embodiments of this application;

[0093] Figure 8 This is a schematic diagram of a possible communication device provided by an embodiment of this application;

[0094] Figure 9 This is another schematic diagram of the possible communication device provided by the embodiments of this application;

[0095] Figure 10This is yet another schematic diagram of a possible communication device provided by an embodiment of this application. Detailed Implementation

[0096] The technical solutions in the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings.

[0097] In the description of this application, terms such as "first" and "second" are used only to distinguish different objects, not to describe a specific order. Furthermore, unless otherwise stated, " / " means "or," for example, A / B can mean A or B. "And / or" in this document is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, and B alone. Additionally, "at least one" refers to one or more, and "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 multiple items. For example, at least one of a, b, or c can represent: a, b, c; a and b; a and c; b and c; or a and b and c. Where a, b, and c can be single or multiple.

[0098] The terms “comprising” and “having”, and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the steps or units listed, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to such process, method, product, or apparatus.

[0099] 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," "for example," or "for example" in this application should not be construed as being more preferred or advantageous than other embodiments or designs. Rather, the use of the words "exemplary," "for example," or "for example" is intended to present the relevant concepts in a specific manner.

[0100] It is understood that in this application, "when," "if," and "if" all refer to the device making a corresponding action under certain objective circumstances, and are not time-limited, nor do they require the device to make a judgment when it is implemented, nor do they imply any other limitations.

[0101] In this application, the use of singular pronouns for elements is intended to indicate "one or more," rather than "one and only one," unless otherwise specified. The terms "system" and "network" in the embodiments of this application are used interchangeably.

[0102] It is understood that in the embodiments of this application, "B corresponding to A" means that there is a correspondence between A and B, and B can be determined based on A. Determining B based on A does not mean that B can be determined solely based on A; B can also be determined based on A and / or other information.

[0103] To better understand the embodiments of this application, the system architecture involved in the embodiments of this application will be described first below:

[0104] The technical solutions of the embodiments of this application can be applied to various communication systems, such as: Long Term Evolution (LTE) systems, LTE Frequency Division Duplex (FDD) systems, and LTE Time Division Duplex (TDD) systems. The technical solutions of the embodiments of this application can also be applied to other communication systems, such as Public Land Mobile Network (PLMN) systems, LTE Advanced (LTE-A) systems, the 5th generation (5G) systems, New Radio (NR) systems, Machine-to-Machine (M2M) systems, or other future communication systems, or other wireless communication systems employing wireless access technologies, all of which can adopt the technical solutions of the embodiments of this application.

[0105] Please see Figure 1 , Figure 1 This is a schematic diagram of the architecture of a communication system provided in this application. It should be noted that... Figure 1 This is a schematic diagram of one possible, non-limiting system. For example... Figure 1 As shown, the communication system 10 includes a radio access network (RAN) 100 and a core network (CN) 200. Optionally, the communication system 10 may also include an Internet 300. The RAN 100 includes at least one RAN node (e.g., Figure 1 110a and 110b (collectively referred to as 110) and at least one terminal (such as Figure 1 RAN 100, denoted as RAN 120a-120j, is collectively referred to as RAN 120. RAN 100 may also include other RAN nodes, such as wireless relay equipment and / or wireless backhaul equipment. Figure 1(Not shown in the image). Terminal 120 is connected to RAN node 110 wirelessly. RAN node 110 is connected to core network 200 wirelessly or via wired connection. The core network elements 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, or they can be a single physical device integrating some core network element functions and some RAN node 110 functions. Terminals can be interconnected with each other, and RAN nodes 110 can be interconnected with each other via wired or wireless connection. Figure 1 This is just a schematic diagram. The communication system may also include other network devices, such as wireless repeaters and wireless backhaul devices. Each device may also contain different functional units. Figure 1 It is not shown in the middle.

[0106] RAN 100 can be a cellular system related to the 3rd Generation Partnership Project (3GPP), such as 4G, 5G mobile communication systems, or future-oriented evolution systems. RAN 100 can also be an open access network (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.

[0107] RAN node 110, sometimes also referred to as radio access network equipment, access network device, access network apparatus, 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 10 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... Figure 1 Network element 120i can be a helicopter or a drone, and it can be configured as a mobile base station. For terminals 120j that access RAN 100 through network element 120i, network element 120i is a base station; however, for base station 110a, network element 120i is a terminal. RAN node 110 and terminal 120 are sometimes referred to as communication devices, for example... Figure 1 Network elements 110a and 110b can be understood as communication devices with base station functions, while network elements 120a-120j can be understood as communication devices with terminal functions.

[0108] In one possible scenario, RAN node 110 can be a base station, an evolved NodeB (eNodeB), an access point (AP), a transmission reception point (TRP), a next-generation NodeB (gNB), a base station in a future mobile communication system, or an access node in a WiFi system, etc. Figure 1 110a), micro base stations or indoor stations (such as Figure 1 The RAN node 110 can be a relay node or donor node, or a wireless controller in a CRAN scenario. Optionally, the RAN node 110 can also be a server, wearable device, vehicle, or in-vehicle equipment. For example, the access network device in vehicle-to-everything (V2X) technology can be a roadside unit (RSU). All or part of the functions of the RAN node 110 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 110 in this application can also be a logical node, logical module, or software capable of implementing all or part of the functions of the RAN node 110.

[0109] In another possible scenario, multiple RAN nodes 110 collaborate to assist the terminal in achieving wireless access, with each RAN node 110 implementing a portion of the base station's functions. For example, a RAN node 110 can be a centralized unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU), etc. CUs and DUs can be configured separately or included in the same network element, such as a baseband unit (BBU). RUs can be included in radio equipment or radio units, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs).

[0110] 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. For example, in an ORAN system, CU can also be called O-CU (open CU), DU can also be called O-DU, CU-CP can also be called O-CU-CP, CU-UP can also be called O-CU-UP, and RU can also be called O-RU. For ease of description, this application uses CU, CU-CP, CU-UP, DU, and RU as examples. 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.

[0111] For example, please see Figure 2 , Figure 2 This is a schematic diagram of the architecture of another communication system provided in this application. Figure 2 This is just an illustration; the O-RAN system may also include... Figure 2 Other components besides those shown. For example... Figure 2 As shown, the access network device (e.g., an eNB, gNB, or next-generation access network device) communicates with the core network elements in the CN via a backhaul link and with the terminal via an air interface.

[0112] Specifically, the BBU in the access network device communicates with the core network elements in the CN via a backhaul link, and the RU in the access network device communicates with at least one terminal via an air interface. The BBU communicates with at least one RU via a fronthaul link. The BBU and RU may or may not be co-located. The BBU includes at least one CU and at least one DU, which can communicate via at least one midhaul link.

[0113] In some examples, the CU is a logical node carrying the radio resource control (RRC) layer, service data adaptation protocol (SDAP) layer, packet data convergence protocol (PDCP) layer, and other control functions of the access network device. The CU connects to network nodes such as the core network through interfaces, which may be interfaces such as E2 interfaces. Optionally, the CU may have some core network functions. The CU (e.g., the PDCP layer and higher layers) connects to the DU (e.g., the RLC layer and lower layers) through interfaces, which may be interfaces such as the F1 interface. In some examples, these interfaces (e.g., the F1 interface) can provide control plane (C-Plane) and user plane (U-Plane) functions (e.g., interface management, system information management, UE context management, RRC message transmission, etc.). F1AP is the application protocol of the F1 interface, defining the F1 signaling procedures in some examples. The F1 interface supports control plane F1-C and user plane F1-U.

[0114] In some examples, the CU can be split into CU-CP (control unit-control plane) and CU-UP (control unit-user plane). CU-CP is a logical node carrying the RRC layer and PDCP-C (control plane part of PDCP) layer, used to implement the CU's control plane functions. CU-CP can interact with network elements in the core network used to implement control plane functions. These network elements in the core network can be access and mobility function (AMF) network elements, such as the access and mobility management function (AMF) in a 5G system. The AMF network element is responsible for mobility management in the mobile network, such as terminal location updates, terminal registration with the network, and terminal handover. CU-UP is a logical node carrying the SDAP layer and PDCP-U (user plane part of PDCP) layer, used to implement the CU's user plane functions. CU-UP can interact with network elements in the core network used to implement user plane functions. These network elements in the core network, such as the user plane function (UPF) in a 5G system, are responsible for data forwarding and receiving in the terminal. The above CU and DU configurations are merely examples; the functions of the CU and DU can be configured as needed. For instance, the CU or DU can be configured to have more protocol layer functions, or only some protocol layer processing functions. For example, some RLC layer functions and protocol layer functions above the RLC layer can be placed in the CU, while the remaining RLC layer functions and protocol layer functions below the RLC layer can be placed in the DU. Furthermore, the functions of the CU or DU can be divided according to service type or other system requirements, such as by latency. Functions that require low latency can be placed in the DU, while functions that do not require low latency can be placed in the CU.

[0115] In some examples, a DU is a logical node that carries the radio link control (RLC) layer, medium access control (MAC) layer, higher physical layer (Higher PHY) layer, and other functions. In some examples, a DU can control at least one RU. The DU connects to the RU through interfaces, which can be fronthaul interfaces. In some examples, the Higher PHY layer includes the physical (PHY) layer processing, such as forward error correction (FEC) encoding and decoding, scrambling, modulation, and demodulation.

[0116] In some examples, the RU is a logical node that carries both lower physical layer (PHY) and radio frequency (RF) processing. In some examples, the RU can be a 3GPP transmission reception point (TRP), a remote radio head (RRH), or other similar entities. In some examples, the Low-PHY includes PHY processing functions such as fast Fourier transform (FFT), inverse fast Fourier transform (IFFT), digital beamforming, and filtering. The RU communicates with one or more terminals via a wireless link.

[0117] The DU and RU can be co-located or not. The DU and RU exchange control plane and user plane information via a fronthaul link through the Lower-Layer Split CUS-Plane (LLS-CUS) interface. LLS-CUS may include LLS-C and LLS-U interfaces providing the control plane (C-Plane) and user plane (U-Plane), respectively. In some examples, the control plane (C-Plane) refers to real-time control between the DU and RU. The DU and RU exchange management information via an LLS-M interface on the fronthaul link; the management plane (M-Plane) refers to non-real-time management operations between the DU and RU.

[0118] DU and RU can cooperate to implement the functions of the PHY layer. A DU can be connected to one or more RUs. The functions of DU and RU can be configured in various ways depending on the design. For example, a DU can be configured to implement baseband functions, and an RU can be configured to implement mid-RF functions. Another example is that a DU can be configured to implement higher-level functions in the PHY layer, and an RU can be configured to implement lower-level functions in the PHY layer, or to implement both lower-level and RF functions. Higher-level functions in the physical layer can include a portion of the physical layer's functions that are closer to the MAC layer, while lower-level functions in the physical layer can include another portion of the physical layer's functions that are closer to the mid-RF side.

[0119] A terminal is a device or module that connects to the aforementioned communication system and possesses corresponding communication functions. Terminals can also be called terminal equipment, user equipment (UE), mobile station (MS), mobile terminal (MT), etc., and can be devices used to provide voice or data connectivity to users, or handheld devices and vehicle-mounted devices with wireless connectivity. 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, and smart cities. Currently, terminals can include: mobile phones, tablets, laptops, PDAs, mobile internet devices (MIDs), computers with wireless transceiver capabilities, wearable devices (such as smartwatches, smart bracelets, pedometers, smart glasses, etc.), in-vehicle equipment (such as cars, bicycles, electric vehicles, airplanes, ships, trains, high-speed trains, etc.), satellite terminals, virtual reality (VR) devices, augmented reality (AR) devices, point-of-sale (POS) machines, customer-premises equipment (CPE), light user equipment (UE), reduced capability UE (REDCAP UE), wireless terminals in industrial control, smart home devices (such as refrigerators, televisions, air conditioners, electricity meters, etc.), smart robots, robotic arms, workshop equipment, wireless terminals in autonomous driving, wireless terminals in telemedicine, and smart grids. Wireless terminals can be used in various applications, including wireless terminals in grids, transportation security, smart cities, smart homes, and flying equipment (e.g., intelligent robots, hot air balloons, drones, airplanes). Terminals can also be vehicle-mounted devices, such as complete vehicle units, vehicle modules, vehicle chips, on-board units (OBUs), or telematics boxes (T-BOXs). Furthermore, terminals can be other devices with terminal functions; for example, a terminal can be a device that functions as a terminal in D2D communication.The embodiments of this application do not limit the device form of the terminal. The device used to implement the functions of the terminal can be the terminal itself; it can also be a device that supports the terminal in implementing the functions, such as a chip system. The device can be installed in the terminal or used in conjunction with the terminal. In the embodiments of this application, the chip system can be composed of chips or can include chips and other discrete devices. All or part of the functions of the terminal in this application can also be implemented by software functions running on hardware, or by virtualization functions instantiated on a platform (e.g., a cloud platform).

[0120] For ease of description, the following description uses a base station as an example of RAN node 110. Base stations and terminals can be fixed or mobile. Base stations and terminals 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 satellites. The embodiments of this application do not limit the application scenarios of the base stations and terminals.

[0121] The roles of base stations and terminals can be relative, for example, Figure 1 The helicopter or drone 120i can be configured as a mobile base station. For terminals 120j accessing the wireless access network 100 via 120i, terminal 120i is a base station; however, for base station 110a, 120i is a terminal, meaning that 110a and 120i communicate via a wireless air interface protocol. Of course, 110a and 120i can also communicate via a base station-to-base station interface protocol; in this case, 120i is also a base station relative to 110a. Therefore, both base stations and terminals can be collectively referred to as communication devices. Figure 1 The 110a and 110b in the text can be referred to as communication devices with base station functions. Figure 1 The 120a-120j in the text can be referred to as communication devices with terminal functions.

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

[0123] In the embodiments of this application, the functions of the base station can be executed by modules (such as chips) within the base station, or by a control subsystem that includes base station functions. This control subsystem, including base station 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 can be executed by modules (such as chips or modems) within the terminal, or by a device that includes terminal functions.

[0124] In this application, the base station sends downlink signals or downlink information to the terminal, with the downlink information carried on the downlink channel; the terminal sends uplink signals or uplink information to the base station, with the uplink information carried on the uplink channel. To communicate with the base station, the terminal needs to establish a radio connection on a cell controlled by the base station. The cell with which the terminal has established a radio connection is called the terminal's serving cell. When the terminal communicates with this serving cell, it is also susceptible to interference from signals from neighboring cells.

[0125] In this application, "sending information" can be understood as one device sending information to another device, or it can also be understood as one logical module within a device sending information to another logical module. For example, "base station sending information" can be understood as the base station sending information to another device (such as a terminal), or it can be understood as logical module 1 in the base station sending information to logical module 2 in the base station.

[0126] In this application, "receiving information" can be understood as one device receiving information from another device, or it can also be understood as a logical module within a device receiving information from another logical module. For example, "base station receiving information" can be understood as the base station receiving information from another device (such as a terminal), or it can be understood as logical module 1 in the base station receiving information from logical module 2 in the base station.

[0127] The communication between different devices involved in this application can refer to direct communication between different devices (i.e., without the need for relaying or forwarding by other devices), or communication between different devices through other devices (i.e., requiring relaying or forwarding by other devices), or communication between a functional unit within a device and other devices through another functional unit. In other words, "sending information to… (e.g., a terminal)" or the relevant illustrations in the accompanying drawings can be understood as the destination of the information being the terminal. This can include sending information directly or indirectly to the terminal. "Receiving information from… (e.g., a terminal)" or "receiving information from… (e.g., a terminal)" or "receiving information sent (e.g., by a terminal)" or the relevant illustrations in the accompanying drawings can be understood as the source of the information being the terminal. This can include receiving information directly or indirectly from the terminal. Information may undergo necessary processing between the source and destination, such as format changes, analog-to-digital conversion, amplification, filtering, etc., but the destination can understand the valid information from the source. Similar expressions in this application can be understood in a similar way, and will not be elaborated further here.

[0128] To facilitate understanding of the embodiments of this application, some knowledge / terms used in the solutions of this application are introduced 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 limiting the scope of protection claimed by this application.

[0129] 1. Sparse matrix

[0130] A matrix is ​​sparse when the number of elements 0 is significantly greater than the number of other elements (i.e., elements with non-zero values). For example, in a matrix composed of elements 0 and 1, if the number of elements 0 is significantly greater than the number of elements 1, then the matrix is ​​sparse. Similarly, in a matrix composed of elements 0 and 1, if the number of elements 1 is significantly greater than the number of elements 0, then the matrix is ​​also sparse.

[0131] 2. LDPC code

[0132] LDPC code is a linear block code. Its parity check matrix (also called parity check matrix, LDPC code matrix, or LDPC matrix) is a sparse matrix. The columns of the parity check matrix correspond to bits (including information bits and parity bits). The number of matrix columns corresponding to information bits (or information bit sequence) is the number of information columns (or the number of information columns in the base graph). In the embodiments of this application, the number of information columns in the base graph is represented by kb.

[0133] 3. Quasi-cyclic low-density parity-check (QC-LDPC) code

[0134] QC-LDPC codes are a type of structured LDPC codes whose parity-check matrix can be obtained by expanding the basegraph (BG) with a boosting value Z. Generally, the BG can include m×n matrix elements (entries), which can be represented by an m x n matrix. The values ​​of the matrix elements can be 0 or 1. Elements with a value of 0 are called zero elements (or element "0"), and elements with a value of 1 are called non-zero elements (or element "1"). In other words, the BG corresponding to a QC-LDPC code only contains elements "0" and "1".

[0135] Expanding the block size (BG) by increasing the shift value (Z) involves replacing the positions of elements "0" with a Z×Z matrix of all zeros and the positions of elements "1" with a Z×Z cyclic shift matrix (also known as a QC block or QC matrix). The resulting QC-LDPC code parity-check matrix contains multiple Z×Z matrices of all zeros and multiple Z×Z QC matrices. In short, the parity-check matrix of an LDPC code can be obtained from the block size (BG) and the shift value.

[0136] The Z×Z QC matrix is ​​obtained by cyclically shifting the Z×Z identity matrix to the right. By setting the shift value of each QC matrix (i.e., the step size of the cyclic shift of the Z×Z identity matrix to the right), bad structures such as short cycles can be avoided, thus improving the code distance. For an example, please refer to [link to example]. Figure 3 , Figure 3 This is a schematic diagram of a rightward cyclic shift of the identity matrix provided in an embodiment of this application. For example... Figure 3 As shown, taking a 4×4 identity matrix as an example, the results of its right circular shift by translation values ​​of 0, 1, 2, and 3 times are as follows: Figure 3 As shown in (a), (b), (c), and (d).

[0137] Optionally, Z can be a positive integer, and it can also be called the expansion factor, lifting factor, expansion value, expansion coefficient, lifting size, etc. For example, Z can be... a j ∈{2,3,5,7,9,11,13,15}, max(k j )∈{7,7,6,5,5,5,4,4}. j is an integer greater than or equal to 0.

[0138] For example, Z can be k j∈{0,1,2,3,4,5,6,7}.

[0139] For example, Z can be k j ∈{0,1,2,3,4,5,6,7}.

[0140] For example, Z can be k j ∈{0,1,2,3,4,5,6}.

[0141] For example, Z can be k j ∈{0,1,2,3,4,5}.

[0142] For example, Z can be k j ∈{0,1,2,3,4,5}.

[0143] For example, Z can be k j ∈{0,1,2,3,4,5}.

[0144] For example, Z can be k j ∈{0,1,2,3,4}.

[0145] For example, Z can be k j ∈{0,1,2,3,4}.

[0146] Optionally, there is a correlation between Z and the translation value. For example, a set of multiple Z values ​​(e.g., a lift value set or lift value list) can correspond to a translation value, such as the row number of the lift value set corresponding to the column number of the translation value. Optionally, the column number of the translation value can be described as a set index. Specifically, in Table 1, the lift value set can correspond to a set index. For example, {2,4,8,16,32,64,128,256} corresponds to 0, {3,6,12,24,48,96,192,384} corresponds to 1, and {5,10,20,40,80,160,320} corresponds to 2, and so on. For ease of description, Table 1 can be understood as a set of boosted values ​​in the following text. Each row in Table 1 can be understood as a boosted value group. For example, {2,4,8,16,32,64,128,256} is one boosted value group, {3,6,12,24,48,96,192,384} is another boosted value group, and so on. The rest are similar and will not be elaborated here. For ease of description, in the following text, {2,4,8,16,32,64,128,256} will be referred to as lift group 0, {3,6,12,24,48,96,192,384} as lift group 1, {5,10,20,40,80,160,320} as lift group 2, {7,14,28,56,112,224} as lift group 3, {9,18,36,72,144,288} as lift group 4, {11,22,44,88,176,352} as lift group 5, {13,26,52,104,208} as lift group 6, and {15,30,60,120,240} as lift group 7.

[0147] Table 1. Set of Lifting Values ​​in LDPC (setofLDPCliftingsizeZ)

[0148] <![CDATA[setindex(i Ls )]]> The set of lifting sizes (Z) 0 {2,4,8,16,32,64,128,256} 1 {3,6,12,24,48,96,192,384} 2 {5,10,20,40,80,160,320} 3 {7,14,28,56,112,224} 4 {9,18,36,72,144,288} 5 {11,22,44,88,176,352} 6 {13,26,52,104,208} 7 {15,30,60,120,240}

[0149] 4. Shorten bits

[0150] When performing rate matching for LDPC codes, if the length of the information bit sequence is K, the number of information columns is kb, and the boost value used is Z, then the bits corresponding to positions K+1 to kb×Z need to be shortened (i.e., the transmitter does not transmit, and the receiver defaults to a bit value of 0 or 1 at this position; the specific value is predefined by the communication protocol, commonly defined as 0). In other words, the length of the shortened bits (or the number of shortened bits) is kb×ZK. Generally, as the number of shortened bits increases, the difference between the row and column weight distributions of the base map and the mother code also increases, thus worsening the decoding threshold. However, the information length (i.e., the length of the information bits, or the length of the information bit sequence) in wireless communication scenarios is very flexible, ranging from tens to thousands of bits. Therefore, there are cases where the number of shortened bits is very large, leading to unstable communication performance.

[0151] 5. Channel coding rate and distribution matcher (DM) rate

[0152] Channel coding rate refers to the ratio of information bits to codeword bits, or the ratio of the number of input bits to the number of output bits in channel coding.

[0153] For example, please see Figure 4 , Figure 4 This is a schematic diagram of a communication system provided in this application. For example... Figure 4 As shown, the first communication device can sequentially process the bit stream (or information bit stream, or information bit sequence, or payload information bits, etc.) generated by the information source through source coding (or source coding encoder, where source coding is an optional operation), channel coding (or channel coding encoder), rate matching, and modulation, and then transmit the information to the second communication device through the channel. Correspondingly, after receiving the information, the second communication device sequentially performs demodulation, rate matching, channel decoding, and source decoding (where source decoding is an optional operation, which is related to the existence of source coding) to obtain the destination information, that is, to recover the bit stream generated by the information source. It should be noted that when there is no source coding, the information bits refer to the bits before source coding; when there is source coding, the information bits refer to the output bit sequence of source coding.

[0154] Optionally, the modulation can be higher-order modulation, which refers to mapping multiple bits onto the same symbol, thereby further improving spectral efficiency. Common higher-order modulation schemes include quadrature amplitude modulation (QAM), such as 16QAM, 64QAM, and 256QAM. Optionally, at least one of the first communication device and the second communication device can be... Figure 1 The terminal or RAN node in the process.

[0155] It should be understood that Figure 4 The number of input bits in the channel coding is equal to the length of the information bit sequence. Figure 4 The channel coding code rate is the ratio of the length of the information bit sequence to the number of output bits of the channel coding. Figure 4 The mid-channel coding rate is also called the payload rate. For ease of distinction, the payload rate can be represented by R in this application. For example, suppose the length of the information bit sequence is K, the payload rate is R, and the modulation order is Q. m (Where, when only the real or imaginary part of the modulation symbol is considered, QAM16 represents Q...) m =2, QAM64 represents Q m =3, QAM256 represents Q m =4, ..., or when both the real and imaginary parts of the modulation symbol are considered, QAM16 represents Q. m =4, QAM64 represents Q m =6, QAM256 represents Q m =8, ... not limited). Regarding the first communication device, based on Figure 4 The corresponding communication system schematic shows that after the information bit sequence is processed on the first communication device side, the number N of the output bits of the channel coding satisfies: N = K / R or K = N × R, where when K / R is a floating-point number, N can be the value of K / R rounded up or rounded down, or N can be Q. m When K is an integer multiple of N×r, or when N×R is a floating-point number, K can be a value rounded up or down from N×r. The length of the modulated output symbol sequence is S = N / Q. m .

[0156] Probabilistic shaping (or probabilistic reshaping) is a coding and modulation optimization technique that cascades a distribution matcher (or precoder, or some kind of transformer, etc.) between source coding (which is optional) and channel coding. This maps the information bit sequence to a sequence that follows a specific distribution. Then, after using systematic code encoding (e.g., LDPC code encoding) during channel coding, the aforementioned sequence following the specific distribution can ultimately appear directly in the coded sequence. For an example, please refer to [link to example]. Figure 5 , Figure 5 This is another communication system schematic diagram provided in this application. For example... Figure 5As shown, the first communication device can sequentially process the bit stream generated by the information source through source coding (or source coding encoder), distribution matching, channel coding (or channel coding encoder), rate matching, and modulation, and then transmit the information to the second communication device through the channel. Correspondingly, after receiving the information, the second communication device sequentially performs demodulation, rate matching dematching, channel decoding, distribution matching dematching, and source decoding to obtain the destination information, i.e., recovering the bit stream generated by the information source. The distribution matching code rate can refer to... Figure 5 The ratio of the number of input bits to the number of output bits of the distributed matcher.

[0157] It should be understood that Figure 5 The input bits of the intermediate channel coding are the output bits of the distributed matching unit, therefore Figure 5 The channel coding code rate is the ratio of the number of output bits of the distributed matcher to the number of output bits of the channel coding. For ease of distinction, in the embodiments of this application... Figure 5 The corresponding channel coding rate can be represented by R. FEC express.

[0158] Currently, one possible implementation of probabilistic shaping technology is based on the distributed matcher code rate R. DM To complete probabilistic shaping, more specifically, a column can be added to the modulation and coding scheme (MCS) table to indicate the distribution matcher code rate R. DM And redesign the channel coding rate R FEC This allows for the initial application of R in practical use. DM The information bit sequence is subjected to distribution matching processing, and then the bit sequence to be encoded output by the distribution matcher is channel-coded to obtain the encoded sequence. Let the length of the bit sequence to be encoded output by the distribution matcher be K. FEC Then we have K FEC =K+(1-R) DM The actual channel coding rate is R × S. FEC =K FEC / N.

[0159] Optionally, the channel coding can be a systematic coding scheme such as LDPC code or Polar code. This application mainly uses LDPC code as an example for illustrative purposes. Figure 5 For example, an information bit sequence of length K is processed by a pre-encoder to obtain a bit sequence of length K to be encoded. FEC It will become larger because K FEC =K+(1-R) DMTherefore, the channel coding rate will increase by )×S. With the increase in channel coding rate, the performance instability caused by the reduction in the number of bits will become more serious, thus affecting the communication performance.

[0160] Based on this, this application proposes a data processing method and apparatus that can reduce the number of shortened bits, thereby improving communication performance.

[0161] It should be noted that the operators "×" and "*" in this application are interchangeable, both representing multiplication. "A / B" and " The descriptions of “A divided by B” can also be used interchangeably, both meaning A divided by B, or B divided by A.

[0162] The data processing method and apparatus provided in this application will be further described below with reference to the accompanying drawings. It is understood that this application uses a first communication device and a second communication device as examples of the execution entities in the interactive illustration. For instance, the first communication device can be an access network device and a terminal, and the second communication device can also be an access network device and a terminal, but this application does not limit the execution entities in the interactive illustration. For example, the method executed by the access network device in this application can be implemented by the access network equipment or modules (e.g., circuits, chips, or chip systems) within the access network equipment, or by logic nodes, logic modules, or software that can implement all or part of the functions of the access network equipment; the method executed by the terminal in this application can also be implemented by the communication / processing module in the terminal or by circuits or chips (such as modem chips (also known as baseband chips), or SoC chips / SIP chips containing modem cores, or GPU / AI processors / ASICs) in the terminal responsible for communication / processing functions.

[0163] Please see Figure 6 , Figure 6 This is a flowchart illustrating a data processing method provided in an embodiment of this application. For example... Figure 6 As shown, the data processing method may include the following steps:

[0164] S601, The first communication device, according to the code rate R of the second distribution matcher... DM2 The information bit sequence is pre-encoded to obtain the second bit sequence.

[0165] Here, the second bit sequence can be understood as the bit sequence to be encoded or the sequence to be encoded. The code rate R of the second distribution matcher... DM2 It can be determined based on one or more of the following parameters: the first distribution matcher code rate R DM1 The length K of the information bit sequence, the first boost value Zc, the number of information columns kb in the base map corresponding to the information bit sequence, the length S of the first symbol sequence, and the length K of the first bit sequence. FEC1, or the first code rate threshold. It should be understood that the symbol R in the embodiments of this application... DM1 This is an exemplary representation of the code rate of the first distribution matcher, and this application does not limit the symbolic representation of each parameter. Similarly, the symbols K, Zc, kb, S, K... FEC1 These are, respectively, the length of the information bit sequence, the first boost value, the number of information columns in the base map, the length of the first symbol sequence, and an exemplary representation of the length of the first bit sequence. This application embodiment does not limit these parameters and other symbols can also be used. Optionally, the second distributed matcher code rate R... DM2 It can be predefined, such as protocol predefined.

[0166] Optionally, the first distribution matcher code rate R DM1 It can be predefined, such as protocol predefined; more specifically, the first distribution matcher code rate R. DM1 A new column, distribution matcher code rate R, can be added to the predefined MCS table of the protocol. DM Alternatively, the first distribution matcher code rate R can also be obtained through other means. DM1 For example, based on R and R FEC Determine the code rate R of the first distribution matcher DM1 , such as R FEC =R+(1-R) DM ) / Q m This application addresses the code rate R of the first distribution matcher. DM1 There are no restrictions on how it can be obtained.

[0167] Optionally, the information bit sequence can be understood as a bit stream generated by the information source, or it can also be called an information bit stream, or payload information bits, etc., without limitation. The length K of the information bit sequence can also be called the number of bits K in the information bit stream, or the number of payload information bits K.

[0168] Optionally, the first lift value Zc is a lift value in the set of lift values. In one possible implementation, the first lift value Zc can be a lift value in the set of lift values ​​that satisfies kb×Zc≥K+(1-R). DM1 The first lift value Zc is the lift value of kb×S. More specifically, the first lift value Zc can be any value in the set of lift values ​​that satisfies kb×Zc≥K+(1-R). DM1 The minimum lift value of kb×S. For ease of understanding, the following text mainly uses the first lift value Zc as the lift value that satisfies kb×Zc≥K+(1-R). DM1 Let's take the minimum lift value of )×S as an example for understanding.

[0169] Optionally, the boost value set involved in the embodiments of this application may be the boost value set shown in Table 1 above, or the boost value set involved in the embodiments of this application may be an extended set of the boost value set shown in Table 1 above. That is, in addition to the boost values ​​shown in Table 1 above, the boost value set involved in the embodiments of this application may also include other boost values. Alternatively, the boost value set involved in the embodiments of this application may also be a newly defined boost value set, which is not limited thereto. For ease of understanding, the boost value set involved in the embodiments of this application shown in Table 1 will be used as an example for illustrative explanation in the following text.

[0170] Optionally, the understanding of the number of information columns kb in the base graph can be found in point 4 of the aforementioned glossary, which will not be repeated here.

[0171] Optionally, the first symbol sequence involved in the embodiments of this application can be understood as the symbol sequence output after modulation (or the transmitted symbol sequence), such as... Figure 4 or Figure 5 The output symbol sequence after modulation.

[0172] Optionally, the length K of the first bit sequence FEC1 With the first distribution matcher code rate R DM1 Association / Relevance. For example, the length K of the first bit sequence... FeC1 This can be determined based on the sending resources. Alternatively, it can be the length K of the first bit sequence. FEC1 It can also be based on the code rate R of the first distribution matcher DM1 Determine, for example, K FEC1 =K+(1-R) DM1 )×S, that is, R can be determined first. dM1 Then determine K FEC1 For example, in R DM1 If the protocol is predefined, it can be based on R DM1 Determine K FEC1 For example, the first distribution matcher code rate R DM1 It can also be predefined, such as protocol predefined. Or, the first distribution matcher code rate R DM1 It can also be based on the length K of the first bit sequence. FEC1 Determine, for example, R DM1 =K / K FEC1 In other words, K can be determined first. FEC1 Then determine R DM1 For example, in K FEC1 If the protocol is predefined, it can be based on K FFC1 Determine R DM1 .

[0173] Optionally, the first bitrate threshold can be defined, such as predefined by the protocol. For example, the first bitrate threshold can be one of the following values: or Optionally, the embodiments of this application do not limit the value of the first bit rate threshold.

[0174] In one possible design (a), the code rate R of the second distributed matcher is... DM2 The second boosting value Zc′, the number of information columns in the basemap kb, the length of the first symbol sequence S, and the length of the information bit sequence K can be determined based on the second boosting value Zc′, the number of information columns kb in the basemap, the length of the first symbol sequence S, and the length of the information bit sequence K. For example, the second distributed matcher code rate R... DM2 It can satisfy: K FEC2 =K+(1-R) DM2 )×S,kb×Zc′≥k+(1-R DM2 )×S.

[0175] Optionally, the second lift value Zc′ mentioned above can be any value less than a certain value in the lift value set. The maximum lift, or the second lift Zc′, can also be a value greater than the maximum lift value in the set of lift values. The minimum lift value. In one possible implementation, if the second lift value Zc′ is less than the first lift value Zc, then the second lift value Zc′ is the lift value less than the first lift value Zc in the set. The maximum lift value. In another possible implementation, if the second lift value Zc′ is greater than the first lift value Zc, then the second lift value Zc′ is the lift value greater than the first lift value Zc in the set. The minimum lift value.

[0176] Optionally, since the purpose of adjusting the DM bit rate is to reduce the number of shortened bits, therefore in In this case, In other words, adjust the distribution matcher code rate (i.e., from the first distribution matcher code rate R) DM1 Adjust to the second distribution matcher code rate R DM2 The corresponding boost value remains within the boost value interval after () . Specifically, for boost values ​​in the set that satisfy kb×Zc≥K+(1-R) DM1 For the minimum lift value (i.e., the first lift value Zc) of )×S, there exists a unique W0 such that Among them, Z max Z represents the maximum lift value in the set of lift values, where W0 is a positive integer less than the first value. max The power of the result after dividing by a0 to the base 2 (i.e., the first value is equal to log2(Z)) max / a0), or the first value equal to Z max (Divide by a0 and take the logarithm to the base 2), where a0 is Z. maxThe base of the boost value group, or the first value of which is Z. max The largest power among the power of each lift value in the lift value group divided by a0 and raised to the base 2, is kmax.

[0177] In this application, the value #A is the power of the value #B divided by the value #C, which is also known as the base 2 power. It can also be described as the value #A being equal to the base 2 logarithm of the value #B divided by the value #C, i.e., value #A = log2(value #B / value #C).

[0178] For example, taking the set of boost values ​​shown in Table 1 as an example, the maximum boost value in this set is 384, which is Z. max =384, Z max The promotion group is the promotion group corresponding to the value 1 of `set index`, which includes the promotion values ​​{3, 6, 12, 24, 48, 96, 192, 384}. Alternatively, the promotion values ​​included in promotion group 1 can also be represented as... k j ∈{0,1,2,3,4,5,6,7}, where 3 is the basis of lift set 1. Here, kmax = 7, meaning the first value is 7. Therefore, in the lift set shown in Table 1, W0 can take any value from 1, 2, 3, 4, 5, 6. For example, taking W0 = 1, then... Accordingly,

[0179] Let the set of boost values ​​be in the interval All the boost values ​​within are sorted in ascending order as follows: Where a0 is Z max The basis of the lift group, a1, a2, a3, etc., are the basis of other lift groups (or a1, a2, a3, etc. are the basis other than a0, or the non-a0 basis), are the lift groups with a1 as the basis that are less than or equal to a0. The maximum lift value divided by a1 and raised to the power of 2, k a2 For the boost value set based on a2, less than or equal to The maximum lift value divided by a² and raised to the power of 2, k a3 For the boost value set based on a3, less than or equal to The maximum increase is the power of a3 divided by a3, and so on, with the result raised to the base 2. Let Zc be in the interval [0, 1]. The more specific scope is Then Zc′ is also in In other words, In this case, in, For the set of boost values ​​less than The maximum increase value, For the set of boost values ​​greater than The minimum lift value, 2 k0 For the set of boost values ​​in the interval The greatest common divisor of all lift values ​​within the range,

[0180] For example, assuming W0 = 1, with respect to the first lift value Zc, then there exists Let Z max =a0*2 kmax ,but Suppose that each boost value group in the boost value set is within the interval The greatest common divisor of all the lift values ​​is 2. k0 Then the set of boost values ​​contains all values ​​in the interval The promotion values ​​within, when sorted in ascending order, can be written as: Where a x The base of the promotion group that is not a0. For a x The largest lift in the base lift set divided by a x Then, the power of the product to the base 2, where x is a positive integer, for example, x = 1, 2, ... For a concrete example, taking the set of lift values ​​shown in Table 1, Z... max =384, when W0=1, the interval Specifically, the range is [192, 384]. Among the boost values, boost group 0 contains a boost value of 256 within the range [192, 384], boost group 1 contains boost values ​​of 192 and 384 within the range [192, 384], boost group 2 contains boost values ​​of 320 within the range [192, 384], boost group 3 contains boost values ​​of 224 within the range [192, 384], and boost group 4 contains boost values ​​of [192, 384]... 288. The boost values ​​in boost group 5 that fall within the interval [192, 384] are 352, those in boost group 6 are 208, and those in boost group 7 are 240. Arranging all boost values ​​within the interval [192, 384] in ascending order yields: 192, 208, 224, 240, 256, 288, 320, 352, 384. The greatest common divisor of these values ​​is 2. 4 , that is, 2 k0 =2 4 Therefore, all the promotion values ​​listed above, arranged in ascending order and located within the interval [192, 384], can be written as 12 × 2. 4 13×2 4 14×2 4 15×2 4 16×2 4 18×2 4 20×2 4 22×2 4 24×2 4 Interval For example, it could be [12×2] 4 13×2 4 ], or [13×2 4 14×2 4 ], or [14×2 44 15×2 4 ], or [15×2 4 16×2 4 ], or [16×2 4 18×2 4 ], or [18×2 4 20×2 4 ], or [20×2 4 22×2 4 ], or [22×2 4 24×24 ].

[0181] In one possible implementation 1.1 of the above design (I), when the second lift value Zc′ is less than the first lift value Zc, the second lift value Zc′ is the lift value less than in the set of lift values. The maximum increase value, for example if but At this point, the code rate R of the second distribution matcher is... DM2 Based on The number of information columns kb in the base diagram, the length S of the first symbol sequence, and the length K of the information bit sequence are determined above. For the set of boost values ​​less than The maximum increase value.

[0182] In one possible implementation 1.2 of the above design (I), when the second lift value Zc′ is greater than the first lift value Zc, the second lift value Zc′ is the lift value greater than the first lift value Zc in the set. The minimum lift value, for example, in In the case of, if Then the code rate R of the second distribution matcher DM2 Based on The number of information columns kb in the base diagram, the length S of the first symbol sequence, and the length K of the information bit sequence are determined above. For the set of boost values ​​greater than The minimum lift value.

[0183] In one possible design (ii), the code rate R of the second distributed matcher DM2 It is equal to the first code rate threshold. That is, the second distribution matcher code rate R... DM2 Take the first bit rate threshold. In design (II), in one possible implementation 2.1, when the second boost value Zc′ is greater than the first boost value Zc, the second distribution matcher bit rate R DM2 It is equal to the first bit rate threshold.

[0184] Optionally, if the second boost value Zc′ is greater than the first boost value Zc, the second distribution matcher code rate R DM2 It can also be the smaller value in implementations 1.2 and 2.1.

[0185] Optionally, in the embodiments of this application, the code rate R of the second distributed matcher is... DM2 Also satisfies:

[0186] x2=kb×Zc′-K-(1-R DM2 )×S; or,

[0187] x2=kb-K / Zc′-(1-R DM2 )×S / Zc′; or,

[0188] x2=kb×Zc′-K FEC2 ;or,

[0189] x2=kb-K FEC2 / Zc;

[0190] Where x2 is the second indicator, K FEC2 is the length of the second bit sequence.

[0191] Optionally, the second metric x2 is less than or equal to the code rate R of the first distribution matcher. DM1 A first metric x1 is determined. For example, the first metric x1 can be based on the first distribution matcher code rate R. DM1 Determined. Specifically, the first indicator x1 can be determined based on the length K of the information bit sequence and the code rate R of the first distribution matcher. DM1 The first boost value Zc, the number of information columns in the base graph kb, and the length S of the first symbol sequence are determined. For example, the first index x1 satisfies:

[0192] x1=kb×Zc-K-(1-R DM1 )×S; or,

[0193] x1=kb-K / Zc-(1-R DM1 )×S / Zc; or,

[0194] x1=kb×Zc-K FEC1 ;or,

[0195] x1=kb-K FEC1 / Zc.

[0196] Optionally, if the base map corresponding to the information bit sequence supports multiple information columns, the first index x1 can be calculated using the above formula for each information column, and the minimum value among all calculated values ​​can be selected as the final first index x1. Alternatively, the second index x2 can be calculated using the above formula for each information column, and the minimum value among all calculated values ​​can be selected as the final second index x2.

[0197] Optionally, in the embodiments of this application, the above-mentioned method based on the second distribution matcher code rate R... DM2 Precoding the information bit sequence can be performed under at least one of the following conditions:

[0198] Condition 1: In the range Where T is greater than The value, For the set of boost values ​​less than The maximum increase value. More specifically, if Then in In the range In this case, it is necessary to adjust the DM rate, that is, to determine the second distribution matcher rate R. DM2 This is used for precoding information bit sequences. The threshold T involved in condition 1 can be determined in the following two ways:

[0199] Method (1-1): y is an integer and y∈[1,2] t -1], t≥1. Specifically:

[0200] When y = 1 and t = 1,

[0201] When y = 3 and t = 2,

[0202] When y = 1 and t = 2,

[0203] When y = 1 and t = 3,

[0204] When y = 3 and t = 3,

[0205] When y = 5 and t = 3,

[0206] When y = 7 and t = 3,

[0207] More specifically, for ease of understanding, the embodiments of this application can be described as follows: For example, in In the range In this case, determine the code rate R of the second distribution matcher. DM2 It is used for precoding information bit sequences.

[0208] Method (1-2): T is related to the segment in which the second lift value Zc′ is located. Generally speaking, the T corresponding to the second lift value Zc′ belonging to the first segment is greater than the T corresponding to the second lift value Zc′ belonging to the second segment, where the tolerance of the coefficients contained in the first segment is less than the tolerance of the coefficients contained in the second segment. The coefficients in the first segment and the coefficients in the second segment are contained in the lift value set within the interval... Divide all boost values ​​within by 2 k0 The coefficients obtained later. Taking the case of W0=1 as an example, the lift value set is in the interval Divide all boost values ​​within by 2k0 The resulting coefficients form a piecewise arithmetic sequence, where the common difference of the coefficients in the first segment is half the common difference of the coefficients in the second segment. For example, if the common difference of the coefficients in the first segment is v, the common difference of the coefficients in the second segment is 2v. That is, the coefficients in the first segment can be 2. kmax-k0- 1 a0*2 k0 ,(2 kmax-k0-1 a0+v)*2 k0 ,(2 kmax-k0-1 a0+2v)*2 k0 ,…,(2 kmax-k0 a0+gv)*2 k0 The coefficient in the second segment can be (2 kmax-k0-1 a0+(g+2)v)*2 k0 ,(2 kmax-k0-1 a0+(g+4)v)*2 k0 ,…,2 kmax-k0 a0*2 k0 g is a positive integer.

[0209] For a concrete example, continuing with the previous example where W0 = 1 and the lift value set is the same as the lift value set in Table 1, all lift values ​​in the lift value set corresponding to the interval [192, 384] in Table 1, arranged in ascending order, can be written as 12 × 2. 4 13×2 4 14×2 4 15×2 4 16×2 4 18×2 4 20×2 4 22×2 4 24×2 4 Therefore, the first segment can be 12×2 4 13×2 4 14×2 4 15×2 4 16×2 4 The second segment can be 18×2 4 20×2 4 22×2 4 24×2 4 The coefficients in the first segment are 12, 13, 14, 15, 16, and the coefficients in the second segment are 18, 20, 22, 24. Therefore, the common difference of the coefficients in the first segment is 1, and the common difference of the coefficients in the second segment is 2.

[0210] Condition 2: Modulation order Q mThe modulation order threshold is greater than or equal to the modulation order threshold. For example, the modulation order threshold can be 3, 4, or 5. For instance, taking a modulation order threshold of 5 as an example, the modulation order Q in the MCS table can be... m The first distribution matcher code rate R in the row containing the MCS index (or MCS ID) greater than 5 DM1 Adjustments are made to obtain the second distribution matcher code rate R. DM2 Used for precoding information bit sequences.

[0211] Condition 3: Modulation order Q m The preset modulation order is used, and the MCS index is greater than the MCS index threshold. For example, if the preset modulation order is 4 and the MCS index threshold is 12, then the modulation order Q in the MCS table can be set as follows: m The first distribution matcher code rate R in the row where the MCS index is 4 and the MCS index is greater than 12 is 4. DM1 Adjustments are made to obtain the second distribution matcher code rate R. DM2 This is used for precoding the information bit sequence. Optionally, condition 3 can also be the modulation order Q. m To preset the modulation order, and with the number of MCS indices greater than a threshold value, for example, the threshold value can be 1, 2, or 3. For instance, if the preset modulation order is 4 and the MCS index threshold value is 1, then the modulation order Q in the MCS table can be... m The first distribution matcher code rate R in the row containing the largest 1 MCS index of 4 DM1 Adjustments are made to obtain the second distribution matcher code rate R. DMz Used for precoding information bit sequences. For example, assuming a preset modulation order of 4 and an MCS index threshold of 2, then the modulation order Q in the MCS table can be... m The first distribution matcher code rate R in the row containing the two largest MCS indices of 4 DM1 Adjustments are made to obtain the second distribution matcher code rate R. DM2 Used for precoding information bit sequences.

[0212] Condition 4:K 2EC1 The corresponding coding rate R FEC Greater than or equal to the second bitrate threshold. For example, the second bitrate threshold is one of the following values: or For example, using the second bitrate threshold as For example, we can analyze K in the MCS table. FEC1 The corresponding first coding rate R FEC1 Greater than or equal to The first distribution matcher code rate R in the row where the MCS index is located DM1 Adjustments are made to obtain the second distribution matcher code rate R. DM2 Used for precoding information bit sequences.

[0213] Condition 5: The payload bitrate R is greater than or equal to the second bitrate threshold. For example, the second bitrate threshold is one of the following values: or For example, using the second bitrate threshold as For example, the bitrate R of the payload information in the MCS table can be greater than or equal to... The first distribution matcher code rate R in the row where the MCS index is located DM1 Adjustments are made to obtain the second distribution matcher code rate R. DM2 Used for precoding information bit sequences.

[0214] Alternatively, the precoding process in this embodiment can also be described as distribution matching process, etc., without limitation.

[0215] S602. The first communication device encodes the second bit sequence based on a low-density parity-check code to obtain the third bit sequence.

[0216] The third bit sequence here can be understood as the encoded bit sequence. For details on the encoding process of the second bit sequence based on low-density parity-check codes, please refer to Chapters 5 and 6 of protocol 3GPP 38.212, which will not be elaborated here.

[0217] S603. The first communication device modulates the third bit sequence to obtain the first symbol sequence.

[0218] The first symbol sequence here can be understood as the transmitted symbol sequence. For details on how to modulate the third bit sequence, please refer to protocol 3Gpp 38.214; it will not be elaborated here.

[0219] Optionally, before modulation, the first communication device may also perform rate matching on the third bit sequence. The specific process for rate matching the third bit sequence can be found in sections 5 and 6 of 3GPP 38.212, and will not be elaborated here. Based on this, the modulation processing of the third bit sequence by the first communication device to obtain the first symbol sequence can be understood as follows: the first communication device modulates the rate-matched third bit sequence to obtain the first symbol sequence.

[0220] S604, The first communication device sends a first symbol sequence.

[0221] In this embodiment, for the transmitting side communication device (i.e., the first communication device), the distribution matcher code rate is adjusted to the second distribution matcher code rate R. DM2 And based on the second distribution matcher code rate R DM2 By performing distribution matching on the information bit sequence, the number of bits can be shortened as much as possible, which means the number of bits can be reduced to kb×Zc′-K. FEC2 The size of K FEC2 The length of the second bit sequence obtained after distribution matching can be adjusted by R. DM2 Change, or K FEC2 =K+(1-R) DM2 It should be understood that reducing the number of bits helps ensure the integrity of the base map, thus improving encoding / decoding performance and consequently enhancing communication performance.

[0222] The above Figure 6 The main focus here is on the data processing procedure at the transmitting end (i.e., the first communication device). The following section will combine... Figure 7 The process of processing the received data at the receiving end (i.e., the second communication device) is described.

[0223] Please see Figure 7 , Figure 7 This is another schematic flowchart of the data processing method provided in the embodiments of this application. For example... Figure 7 As shown, the data processing method may include the following steps:

[0224] S701, The second communication device receives the information to be demodulated.

[0225] The first communication device sends a first symbol sequence. After passing through the channel, the second communication device receives a first symbol sequence with noise added. In this embodiment, the first symbol sequence with noise added is described as information to be demodulated.

[0226] S702. Demodulate the information to be demodulated to obtain the information to be decoded.

[0227] The second communication device demodulates the information to be demodulated, thus obtaining the information to be decoded.

[0228] S703. Based on the low-density parity-check code, the information to be decoded is decoded to obtain the second bit sequence.

[0229] Alternatively, decoding can also be called decryption.

[0230] S704, According to the code rate R of the second distribution matcher DM2 The second bit sequence is subjected to distributive matching to obtain the information bit sequence.

[0231] Among them, the code rate R of the second distributed matcher DM2 Determined based on one or more of the following parameters: First distribution matcher code rate R DM1 The length of the information bit sequence K, the first boost value Zc, the number of information columns in the base map kb, the length of the first symbol sequence S, and the length of the first bit sequence K. FEC1 Or the first code rate threshold; the first boost value Zc is a boost value in the boost value set, and the first bit sequence is matched with the first distribution matcher code rate R. DM1 Correlation. Regarding the code rate R of the second distribution matcher. dM2 The first distribution matcher code rate R DM1 The length of the information bit sequence K, the first boost value Zc, the number of information columns in the base map kb, the length of the first symbol sequence S, and the length of the first bit sequence K. FEC1 For further explanation of terms such as the first bit rate threshold, please refer to the aforementioned text. Figure 6 The relevant descriptions in the corresponding embodiments will not be repeated here.

[0232] In this embodiment, for the receiving-side communication device (i.e., the second communication device), the adjusted distribution matcher code rate (i.e., the second distribution matcher code rate R) is adopted. DM2 Performing solution distribution matching processing can improve decoding performance.

[0233] Optionally, the above Figure 6 and Figure 7 The illustrated embodiments can also be applied to O-RAN scenarios. It should be understood that in O-RAN scenarios, when the first communication device is an access network device, Figure 6 The first communication device involved can be replaced by a CU (e.g., CU-CP or CU-UP), a DU, or a RU, etc. When the second communication device is an access network device... Figure 7 The second communication device involved can be replaced by a CU (e.g., CU-CP or CU-UP), a DU, or a RU, etc.

[0234] The following will combine Figures 8-10 The communication device provided in this application will be described in detail.

[0235] It is understood that, in order to achieve the functions in the above embodiments, the communication device includes hardware structures and / or software modules corresponding to each function. Those skilled in the art should readily recognize that, based on the units and method steps described in conjunction with the embodiments disclosed in this application, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed by hardware or by computer software driving hardware depends on the specific application scenario and design constraints of the technical solution.

[0236] Figure 8 and Figure 10 This is a schematic diagram illustrating the possible structures of communication devices provided in embodiments of this application. These communication devices can be used to implement the functions of the first or second communication device in the above method embodiments, and thus can also achieve the beneficial effects of the above method embodiments. Here, the first and second communication devices are collectively referred to as communication devices. In the embodiments of this application, the communication device can be as follows: Figure 1 One of the terminals 120a-120j shown, or it could be as follows: Figure 1 The RAN node shown is 110a or 110b. Optionally, the communication device can also be a module (such as a chip) applied to a terminal or access network device. For ease of description, the following text uses the first communication device as a terminal and the second communication device as an access network device as an example for illustrative purposes.

[0237] like Figure 8 As shown, the communication device 800 includes a processing unit 810 and a transceiver unit 820. The communication device 800 is used to implement the above-mentioned... Figure 6 or Figure 7 The method embodiments shown illustrate the functions of the terminal or access network device.

[0238] In one implementation, when the communication device 800 is used to implement... Figure 6 In the method embodiment shown, the function of the first communication device (e.g., a terminal) is as follows:

[0239] Processing unit 810 is configured to process the code rate R of the second distribution matcher. DM2 The information bit sequence is pre-encoded to obtain a second bit sequence; the processing unit 810 is used to encode the second bit sequence based on a low-density parity-check code to obtain a third bit sequence; the processing unit 810 is used to modulate the third bit sequence to obtain a first symbol sequence; the transceiver unit 820 is used to transmit the first symbol sequence; wherein, the second distributed matcher code rate R DM2 Determined based on one or more of the following parameters: First distribution matcher code rate R DM1 The length K of the information bit sequence, the first boost value Zc, the number of information columns kb of the base map corresponding to the information bit sequence, the length S of the first symbol sequence, and the length K of the first bit sequence. FEC1 Or a first code rate threshold; the first boost value Zc is a boost value in the boost value set, and the length K of the first bit sequence FEC1 With the first distribution matcher code rate R DM1 Related.

[0240] In one implementation, when the communication device 800 is used to implement... Figure 7In the method embodiment shown, the function of the second communication device (e.g., access network device) is as follows:

[0241] The transceiver unit 820 is used to receive information to be demodulated; the processing unit 810 is used to demodulate the information to be demodulated to obtain information to be decoded; the processing unit 810 is used to decode the information to be decoded based on a low-density parity-check code to obtain a second bit sequence; the processing unit 810 is used to determine the second bit sequence based on the second distribution matcher code rate R. DM2 The second bit sequence is subjected to dedistribution matching processing to obtain the information bit sequence; wherein, the code rate R of the second distribution matcher is... DM2 Determined based on one or more of the following parameters: First distribution matcher code rate R DM1 The length K of the information bit sequence, the first boost value Zc, the number of information columns kb of the base map corresponding to the information bit sequence, the length S of the first symbol sequence, and the length K of the first bit sequence. FEC1 Or a first code rate threshold; the first boost value Zc is a boost value in the boost value set, and the first bit sequence is matched with the first distribution matcher code rate R. DM1 Related.

[0242] For a more detailed description of the aforementioned processing unit 810 and transceiver unit 820, please refer to [reference needed]. Figure 6 or Figure 7 The relevant descriptions in the method embodiments shown.

[0243] like Figure 9 As shown, the communication device 900 includes a processor 910, and optionally an interface circuit 920. The processor 910 and the interface circuit 920 are coupled to each other. It is understood that the interface circuit 920 can be a transceiver or an input / output interface. Optionally, the communication device 900 may also include a memory 930 for storing instructions executed by the processor 910, or storing input data required by the processor 910 to execute instructions, or storing data generated after the processor 910 executes instructions.

[0244] When the communication device 900 is used to implement Figure 6 or Figure 7 In the method shown, the processor 910 is used to implement the functions of the processing unit 810, and the interface circuit 920 is used to implement the functions of the transceiver unit 820.

[0245] When the aforementioned communication device is a chip applied to a terminal, the terminal chip implements the functions of the terminal in the above method embodiments. The terminal chip receives information sent to the terminal by the access network device through other modules (such as an RF module or antenna) in the terminal; or, the terminal chip sends information to other modules (such as an RF module or antenna) in the terminal, which is information sent by the terminal to the access network device.

[0246] When the aforementioned communication device is a module applied to an access network device, the access network device module implements the functions of the access network device in the above method embodiments. The access network device module receives information from other modules (such as radio frequency modules or antennas) in the access network device, which is information sent by the terminal to the access network device; or, the access network device module sends information to other modules (such as radio frequency modules or antennas) in the access network device, which is information sent by the access network device to the terminal. Here, the access network device module can be the baseband chip of the access network device, or a CU, DU, or other module, or a device under an open radio access network (O-RAN) architecture, such as an open CU, open DU, etc.

[0247] It is understood that the processor in the embodiments of this application can be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), microprocessors (MPUs), microcontroller units (MCUs), graphics processing units (GPUs), field-programmable gate arrays (FPGAs), artificial intelligence processors (AI processors), neural network processors (NPUs), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. A general-purpose processor can be a microprocessor or any conventional processor.

[0248] like Figure 10As shown, the communication device 1000 includes a processor 1010, a memory 1020, and a transceiver 1030. The processor 1010 is mainly used for processing communication protocols and communication data; controlling the first / second communication device; executing software programs; and processing data from the software programs. The memory 1020 can store computer program code, software programs, and data. The transceiver 1030 includes a transmitter 1031, a receiver 1032, radio frequency circuitry (not shown in the figure), and an antenna 1033.

[0249] The processor 1010 can also be called a processing unit, processing board, processing module, or processing device. The transceiver 1030 can also be called a transceiver unit, transceiver, or transceiver device.

[0250] Optionally, the device in transceiver 1030 used to implement the receiving function can be considered as a receiving module, and the device in transceiver 1030 used to implement the transmitting function can be considered as a transmitting module. That is, transceiver 1030 includes a receiver and / or a transmitter. A transceiver may sometimes be called a transceiver unit, a transceiver module, or a transceiver circuit, etc. A receiver may sometimes be called a receiver unit, a receiving module, or a receiving circuit, etc. A transmitter may sometimes be called a transmitter, a transmitting module, or a transmitting circuit, etc.

[0251] Processor 1010 is used to perform the above Figure 6 The processing actions of the first communication device in the illustrated embodiment. The transceiver 1030 is used to perform the above-described actions. Figure 6 The embodiment shown illustrates the transmit and receive operations of the first communication device. Alternatively, the processor 1010 may be used to perform the above-described operations. Figure 7 The processing actions of the second communication device in the illustrated embodiment. The transceiver 1030 is used to perform the above-described actions. Figure 7 The transmitting and receiving operations of the second communication device in the illustrated embodiment.

[0252] When the communication device 1000 is a chip, the chip includes a processor and a transceiver. The transceiver can be an input / output circuit or a communication interface. The processor can be a processing module integrated on the chip, a microprocessor, or an integrated circuit. In the above method embodiments, the transmitting operation of the first communication device can be understood as the chip's output, and the receiving operation of the first communication device in the above method embodiments can be understood as the chip's input. Similarly, in the above method embodiments, the transmitting operation of the second communication device can be understood as the chip's output, and the receiving operation of the second communication device in the above method embodiments can be understood as the chip's input.

[0253] This application also provides a computer-readable storage medium storing a computer program or instructions for implementing the method executed by the first communication device or the second communication device in the above-described method embodiments.

[0254] For example, when the computer program is executed by a computer, it enables the computer to implement the method executed by the first communication device or the second communication device in the above method embodiments.

[0255] This application also provides a computer program product containing a program or instructions, which, when executed by a computer, causes the computer to implement the method executed by the first communication device or the second communication device in the above method embodiments.

[0256] This application also provides a communication system, which includes a first communication device and a second communication device as described in the above embodiments. The first communication device is used to perform some or all of the operations performed by the first communication device in the above method embodiments, and the second communication device is used to perform some or all of the operations performed by the second communication device in the above method embodiments.

[0257] This application also provides a chip device, including a processor, for calling a computer program or computer instructions stored in the memory, so that the processor executes the above-described... Figure 6 or Figure 7 The method provided in any of the embodiments shown.

[0258] In one possible implementation, the input of the chip device corresponds to the above. Figure 6 or Figure 7 The receiving operation in any of the embodiments shown in the figure corresponds to the output of the chip device described above. Figure 6 or Figure 7 The sending operation in any of the embodiments shown in the figure.

[0259] Optionally, the processor is coupled to the memory via an interface.

[0260] Optionally, the chip device further includes a memory storing computer programs or computer instructions.

[0261] It is understood that the processor in the embodiments of this application can be a CPU, or other general-purpose processors, DSPs, ASICs, FPGAs, or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. A general-purpose processor can be a microprocessor or any conventional processor.

[0262] The method steps in the embodiments of this application can be implemented in hardware or in software instructions executable by a processor. The software instructions can consist of corresponding software modules, which can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, registers, hard disks, portable hard disks, CD-ROMs, or any other form of storage medium known in the art. An exemplary storage medium is coupled to a processor, enabling the processor to read information from and write information to the storage medium. The storage medium can also be a component of the processor. The processor and storage medium can reside in an ASIC. Additionally, the ASIC can reside in a second communication device or a first communication device. The processor and storage medium can also exist as discrete components in the second or first communication device.

[0263] In the above embodiments, implementation can be achieved entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of 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 the embodiments of this application are performed entirely or partially. The computer can be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user equipment, or other programmable device. The computer program or instructions can be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions can be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates 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 may be a volatile or non-volatile storage medium, or may include both types of storage media.

[0264] In the various embodiments of this application, unless otherwise specified or in case of logical conflict, the terminology 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.

[0265] It is understood that the various numerical designations used in the embodiments of this application are merely for descriptive convenience and are not intended to limit the scope of the embodiments of this application. The order of the process numbers described above does not imply the order of execution; the execution order of each process should be determined by its function and internal logic.

Claims

1. A data processing method, characterized in that, include: According to the second distribution matcher code rate R DM2 The information bit sequence is pre-encoded to obtain the second bit sequence; The second bit sequence is encoded using a low-density parity-check code to obtain the third bit sequence. The third bit sequence is modulated to obtain the first symbol sequence; Output the first symbol sequence; Wherein, the code rate R of the second distributed matcher DM2 Determined based on one or more of the following parameters: First distribution matcher code rate R DM1， The length K of the information bit sequence, the first boost value Zc, the number of information columns kb of the base diagram corresponding to the information bit sequence, the length S of the first symbol sequence, and the length K of the first bit sequence. FEC1 Or a first code rate threshold; the first boost value Zc is a boost value in the boost value set, and the length K of the first bit sequence FEC1 With the first distribution matcher code rate R DM1 Related.

2. A data processing method, characterized in that, include: Receive the information to be demodulated; The demodulated information is demodulated to obtain the decoded information. The information to be decoded is processed based on a low-density parity-check code to obtain a second bit sequence. According to the second distribution matcher code rate R DM2 The second bit sequence is subjected to dedistribution matching processing to obtain the information bit sequence; Wherein, the code rate R of the second distributed matcher DM2 Determined based on one or more of the following parameters: First distribution matcher code rate R DM1 The length K of the information bit sequence, the first boost value Zc, the number of information columns kb of the base map corresponding to the information bit sequence, the length S of the first symbol sequence, and the length K of the first bit sequence. FEC1 Or a first code rate threshold; the first boost value Zc is a boost value in the boost value set, and the first bit sequence is matched with the first distribution matcher code rate R. DM1 Related.

3. The method according to claim 1 or 2, characterized in that, The second distributed matcher code rate R DM2 Based on the second boost value Zc′, the number of information columns kb of the base map corresponding to the information bit sequence, the length S of the first symbol sequence, and the length K of the information bit sequence are determined; Wherein, the second lift value Zc′ is a value less than in the set of lift values. The maximum lift value, or the second lift value Zc′ is greater than the maximum lift value in the set of lift values. The minimum lift value.

4. The method according to claim 3, characterized in that, When the second lift value Zc′ is less than the first lift value Zc, the second lift value Zc′ is a value less than the first lift value Zc in the set of lift values. The maximum increase value; or, When the second lift value Zc′ is greater than the first lift value Zc, the second lift value Zc′ is greater than the lift value set. The minimum lift value.

5. The method according to claim 1 or 2, characterized in that, The second distributed matcher code rate R DM2 It is equal to the first bit rate threshold.

6. The method according to claim 5, characterized in that, The first bitrate threshold is one of the following values: or 7. The method according to any one of claims 1-6, characterized in that, The second distributed matcher code rate R DM2 satisfy: x2=kb×Zc′-K-(1-R DM2 )×S; or, x2=kb-K / Zc′-(1-R DM2 )×S / Zc′; or, x2=kb×Zc′-K FEC2 ;or, x2=kb-K FEc2 / Zc; Wherein, x2 is the second index, and K FEC2 is the length of the second bit sequence.

8. The method according to claim 7, characterized in that, According to the second distribution matcher code rate R DM2 The determined second metric x2 is less than or equal to the code rate R of the first distribution matcher. DM1 The first definite indicator is x1.

9. The method according to claim 8, characterized in that, The first index x1 satisfies: x1=kb×Zc-K-(1-R DM1 )×S; or, x1=kb-K / Zc-(1-R DM1 )×S / Zc; or, x1=kb×Zc-K FEC1 ;or, x1=kb-K FEC1 / Zc。 10. The method according to claim 3 or 4, characterized in that, exist In this case, Wherein, the Z max W0 is the maximum boost value in the set of boost values, where W0 is a positive integer less than a first value, and the first value is equal to log2(Z). max / a0), where a0 is the Z max The base of the boost value group.

11. The method according to claim 10, characterized in that, exist In this case, Among them, the set of boost values ​​is in the interval All the boost values ​​within are sorted in ascending order as follows: The `kmax` is the maximum lift value in the lift value set with `a0` as the base, divided by `a0` and raised to the power of 2. `a1` is a base value other than `a0`. a1 For the set of boost values ​​based on a1 that are less than or equal to The maximum lift value divided by a1 and raised to the power of 2, where a2 is a base other than a0 and a1, k a2 For the set of enhancement values ​​based on a2 that are less than or equal to The maximum lift value divided by a2 and raised to the power of 2, where a3 is the base of the lift value group that is not a0, a1, a2, and k a3 For the group of boost values ​​based on a3 that are less than or equal to The maximum increase value divided by a3 and raised to the power of 2, the For the set of boost values ​​less than The maximum increase value, the For the set of boost values ​​greater than The minimum lift value, the 2 k0 For the set of boost values ​​that are in the interval The greatest common divisor of all the lift values ​​within the range, the The 12. The method according to any one of claims 1-11, characterized in that, The first lift value Zc is a value in the set of lift values ​​that satisfies kb×Zc≥K+(1-R) DM1 The increase value of )×S.

13. The method according to any one of claims 1-12, characterized in that, The first lift value Zc is a value in the set of lift values ​​that satisfies kb×Zc≥K+(1-R) DM1 The minimum lift value of )×S.

14. The method according to any one of claims 1-13, characterized in that, The code rate R of the second distribution matcher DM2 Precoding the information bit sequence includes: under at least one of the following conditions, according to the second distribution matcher code rate R... DM2 Pre-encode the information bit sequence: In the range Where T is greater than the The value, the For the set of boost values ​​less than The maximum increase value; or, Modulation order Q m Greater than or equal to the modulation order threshold; or, Modulation order Q m The preset modulation order is used, and the MCS index is greater than the MCS index threshold; or, The K FEC1 The corresponding first coding rate R FEC1 Greater than or equal to the second bitrate threshold; or, The payload rate R is greater than or equal to the second rate threshold.

15. The method according to claim 14, characterized in that, The second bitrate threshold is one of the following values: or 16. The method according to claim 14 or 15, characterized in that, The The y is an integer and the y∈[1,2] t -1], where t≥1.

17. The method according to claim 16, characterized in that, The 18. The method according to claim 14 or 15, characterized in that, The T is related to the segment in which the second boost value Zc′ is located.

19. The method according to claim 18, characterized in that, When the second lift value Zc′ belongs to the first segment, the corresponding T is greater than the corresponding T when the second lift value Zc′ belongs to the second segment. The tolerance of the coefficients contained in the first segment is less than the tolerance of the coefficients contained in the second segment. The coefficients in the first segment and the coefficients in the second segment are contained in the lift value set within the interval... Divide all boost values ​​within by 2 k0 The coefficients obtained later.

20. A communication device, characterized in that, Includes units or modules for performing the method as described in any one of claims 1-19.

21. A communication device, characterized in that, The device includes a processor and a communication interface, wherein the communication interface is used to receive signals from other communication devices besides the communication device and transmit them to the processor, or to send signals from the processor to other communication devices besides the communication device, and the processor uses logic circuits and / or executes computer programs or instructions to implement the method as described in any one of claims 1-19.

22. The apparatus according to claim 21, characterized in that, It also includes a memory for storing the computer program or instructions.

23. A computer-readable storage medium, characterized in that, The storage medium stores a computer program or instructions, and when the computer program or instructions are executed by a communication device, the method as described in any one of claims 1-19 is implemented.

24. A computer program product, characterized in that, Includes a computer program or instructions, wherein when the computer program or instructions are run on a computer, the method of any one of claims 1-19 is implemented.

Images