Communication method, communication apparatus, and communication system

Abstract

The present application relates to the technical field of communications. Disclosed are a communication method, a communication apparatus, and a communication system. On the basis of the method, an operation of sub-block interleaving is added to an encoded bit sequence, such that after sub-block interleaving, a bit sequence used for determining symbols of modulated constellation points precedes a bit sequence related to probability shaping, and thus during retransmission, the bit sequence used for determining the symbols of the modulated constellation points is less likely to be selected for retransmission, which is conducive to ensuring the performance of retransmission.

Description

A communication method, communication device and communication system

[0001] Cross-references to related applications

[0002] This application claims priority to Chinese Patent Application No. 202411565853.X, filed on November 1, 2024, entitled "A Communication Method, Communication Device and Communication System", the entire contents of which are incorporated herein by reference. Technical Field

[0003] This application relates to the field of communication technology, and in particular to a communication method, communication device and communication system. Background Technology

[0004] Polar codes were selected as the control channel coding scheme in the 5th generation (5G) communication standard. Polar codes were the first coding scheme to be rigorously proven to "achieve" the Shannon channel capacity, offering advantages such as good decoding performance and low complexity. Low-density parity-check (LDPC) codes were selected as the data channel coding scheme in the 5G communication standard. LDPC codes are linear block codes with a sparse parity-check matrix, possessing not only good performance approaching the Shannon limit but also low decoding complexity and flexible structure.

[0005] As mentioned above, polar codes and LDPC codes are two coding schemes for 5G. A probabilistic shaping transmission scheme can be implemented by combining polar codes and LDPC codes. For example, polar codes can be used to implement probabilistic shaping, and LDPC codes can be used to implement channel coding.

[0006] After introducing probabilistic shaping, how to ensure retransmission performance when retransmission is required remains to be solved. Summary of the Invention

[0007] This application provides a communication method, communication device, and communication system to ensure retransmission performance after the introduction of probabilistic shaping.

[0008] In a first aspect, embodiments of this application provide a communication method, which can be executed by a first communication device. Unless otherwise specified, the "first communication device" in this application can refer to a communication device (e.g., a network device, a terminal device, an encoding device, etc.), a component within that communication device (e.g., a processor, a chip, or a chip system, etc.), or a logic module or software capable of implementing all or part of the functions of the communication device. The method includes: performing sub-block interleaving on an encoded bit sequence to obtain a sub-block interleaved bit sequence; wherein the sub-block interleaved bit sequence includes multiple sub-blocks, the multiple sub-blocks including a first sub-block and at least one second sub-block, the first sub-block including a bit sequence for determining symbols for a modulation constellation point, the at least one second sub-block being a probability-shaping related bit sequence, and the first sub-block preceding the at least one second sub-block; determining a bit sequence to be modulated based on the sub-block interleaved bit sequence; modulating the bit sequence to be modulated to obtain a modulation symbol sequence; and transmitting the modulation symbol sequence.

[0009] Based on the above scheme, a sub-block interleaving operation is added to the encoded bit sequence. After sub-block interleaving, the bit sequence used to determine the modulation constellation point is placed before the probabilistic shaping related bit sequence. This makes it less likely that the bit sequence used to determine the modulation constellation point will be selected for retransmission during retransmission. Since the reliability of the bit sequence used to determine the modulation constellation point is higher than that of the probabilistic shaping related bit sequence, choosing not to retransmit the bit sequence used to determine the modulation constellation point has a greater gain than choosing not to retransmit the probabilistic shaping related bit sequence. This is because the high-reliability bit sequence is more likely to be transmitted successfully and therefore less likely to be retransmitted. Therefore, this scheme, by adding a sub-block interleaving operation, reduces the probability of retransmitting the high-reliability bit sequence used to determine the modulation constellation point, thus helping to ensure retransmission performance.

[0010] In one possible implementation, the encoded bit sequence does not include the information bits corresponding to the shortened bits.

[0011] Based on the above scheme, it helps to simplify the implementation complexity of sub-block interleaving.

[0012] In one possible implementation, the encoded bit sequence does not include information bits corresponding to columns in the check matrix whose column weights are greater than the column weight threshold.

[0013] Based on the above solution, transmission performance can be improved.

[0014] In one possible implementation, the multiple sub-blocks are of the same size and are related to the modulation order and the initial transmission length.

[0015] Based on the above scheme, it is helpful to achieve probabilistic shaping of modulation symbols, reduce transmission power, and improve transmission performance.

[0016] In one possible implementation, determining the bit sequence to be modulated based on the bit sequence after the sub-block interleaving includes: obtaining the bit sequence to be modulated from the bit sequence after the sub-block interleaving based on a redundancy version start point, wherein the redundancy version start point is used to indicate the starting position of the bit sequence to be modulated.

[0017] Based on the above scheme, it helps to simplify the process of determining the bit sequence to be modulated.

[0018] In one possible implementation, the starting point of the redundant version is related to whether the probabilistic shaping function is enabled.

[0019] Based on the above scheme, redundant versions of the starting point can be designed for whether probability shaping is enabled or not, thereby improving retransmission performance.

[0020] In one possible implementation, the starting point of the redundant version is related to the initial transmission length and / or modulation order.

[0021] Based on the above solution, retransmission performance can be improved.

[0022] In one possible implementation, the plurality of sub-blocks further includes at least one third sub-block, which is a parity bit sequence, and the at least one third sub-block is located after the at least one second sub-block.

[0023] In one possible implementation, the plurality of sub-blocks further includes at least one fourth sub-block, which is a portion of bits in the check bit sequence. The first sub-block also includes another portion of bits in the check bit sequence, and the at least one fourth sub-block is located after the at least one second sub-block.

[0024] In one possible implementation, the probability shaping-related bit sequence is the probability-shaped bit sequence; or, the probability shaping-related bit sequence consists of the probability-shaped bit sequence and a bit sequence used to assist probability shaping.

[0025] Based on the above scheme, it is helpful to improve the shaping effect of modulation constellation points, thereby improving transmission performance.

[0026] Secondly, embodiments of this application provide a communication method, which can be executed by a second communication device. Unless otherwise specified, the "second communication device" in this application can refer to a communication device (e.g., a terminal device, network device, decoding device, etc.), a component within that communication device (e.g., a processor, chip, or chip system, etc.), or a logic module or software capable of implementing all or part of the functions of the communication device. The method includes: receiving a modulation symbol sequence, wherein the modulation symbol sequence is determined based on a bit sequence to be modulated, the bit sequence to be modulated is determined based on a sub-block interleaved bit sequence, the sub-block interleaved bit sequence being obtained by sub-block interleaving an encoded bit sequence, the sub-block interleaved bit sequence comprising multiple sub-blocks, the multiple sub-blocks including a first sub-block and at least one second sub-block, the first sub-block including a bit sequence for determining a modulation constellation point, the at least one second sub-block being a probability shaping related bit sequence, and the first sub-block being located before the at least one second sub-block; demodulating the modulation symbol sequence to obtain a demodulated symbol sequence; and decoding the demodulated symbol sequence to recover the original information bit sequence.

[0027] Based on the above scheme, a sub-block interleaving operation is added to the encoded bit sequence. After sub-block interleaving, the bit sequence used to determine the modulation constellation point is placed before the probabilistic shaping related bit sequence. This makes it less likely that the bit sequence used to determine the modulation constellation point will be selected for retransmission during retransmission. Since the reliability of the bit sequence used to determine the modulation constellation point is higher than that of the probabilistic shaping related bit sequence, choosing not to retransmit the bit sequence used to determine the modulation constellation point has a greater gain than choosing not to retransmit the probabilistic shaping related bit sequence. This is because the high-reliability bit sequence is more likely to be transmitted successfully and therefore less likely to be retransmitted. Therefore, this scheme, by adding a sub-block interleaving operation, reduces the probability of retransmitting the high-reliability bit sequence used to determine the modulation constellation point, thus helping to ensure retransmission performance.

[0028] In one possible implementation, the encoded bit sequence does not include the information bits corresponding to the shortened bits.

[0029] Based on the above scheme, it helps to simplify the implementation complexity of sub-block interleaving.

[0030] In one possible implementation, the encoded bit sequence does not include information bits corresponding to columns in the check matrix whose column weights are greater than the column weight threshold.

[0031] Based on the above solution, transmission performance can be improved.

[0032] In one possible implementation, the multiple sub-blocks are of the same size and are related to the modulation order and the initial transmission length.

[0033] Based on the above scheme, it is helpful to achieve probabilistic shaping of modulation symbols, reduce transmission power, and improve transmission performance.

[0034] In one possible implementation, the bit sequence to be modulated is determined based on the redundant version start point and the bit sequence after sub-block interleaving, wherein the redundant version start point is used to indicate the starting position of the bit sequence to be modulated.

[0035] Based on the above scheme, it helps to simplify the process of determining the bit sequence to be modulated.

[0036] In one possible implementation, the starting point of the redundant version is related to whether the probabilistic shaping function is enabled.

[0037] Based on the above scheme, redundant versions of the starting point can be designed for whether probability shaping is enabled or not, thereby improving retransmission performance.

[0038] In one possible implementation, the starting point of the redundant version is related to the initial transmission length and / or modulation order.

[0039] Based on the above solution, retransmission performance can be improved.

[0040] In one possible implementation, the plurality of sub-blocks further includes at least one third sub-block, which is a parity bit sequence, and the at least one third sub-block is located after the at least one second sub-block.

[0041] In one possible implementation, the plurality of sub-blocks further includes at least one fourth sub-block, which is a portion of bits in the check bit sequence. The first sub-block also includes another portion of bits in the check bit sequence, and the at least one fourth sub-block is located after the at least one second sub-block.

[0042] In one possible implementation, the probability shaping-related bit sequence is the probability-shaped bit sequence; or, the probability shaping-related bit sequence consists of the probability-shaped bit sequence and a bit sequence used to assist probability shaping.

[0043] Based on the above scheme, it is helpful to improve the shaping effect of modulation constellation points, thereby improving transmission performance.

[0044] Thirdly, embodiments of this application provide a communication method, which can be executed by a first communication device. Unless otherwise specified, the "first communication device" in this application can refer to a communication device (e.g., a network device, a terminal device, an encoding device, etc.), a component within that communication device (e.g., a processor, a chip, or a chip system, etc.), or a logic module or software capable of implementing all or part of the functions of the communication device. The method includes: channel coding a bit sequence to be encoded to obtain an encoded bit sequence, wherein the bit sequence to be encoded includes a probability shaping related bit sequence and a bit sequence for determining symbols of modulation constellation points, the bit sequence for determining symbols of modulation constellation points being located before the probability shaping related bit sequence; determining a bit sequence to be modulated based on the encoded bit sequence; modulating the bit sequence to be modulated to obtain a modulation symbol sequence; and transmitting the modulation symbol sequence.

[0045] Based on the above scheme, before encoding, the bit sequence is interleaved to obtain the unencoded bit sequence. The unencoded bit sequence includes a probability shaping-related bit sequence and a bit sequence for determining the symbols used to determine the modulation constellation point. The bit sequence for determining the symbols precedes the probability shaping-related bit sequence, making it less likely to be retransmitted during retransmission. Since the reliability of the bit sequence for determining the modulation constellation point is higher than that of the probability shaping-related bit sequence, choosing not to retransmit the bit sequence for determining the modulation constellation point has a greater gain than choosing not to retransmit the probability shaping-related bit sequence. This is because the high-reliability bit sequence is more likely to be successfully transmitted and therefore less likely to be retransmitted. Therefore, this scheme, by adding sub-block interleaving, reduces the probability of retransmitting the high-reliability bit sequence for determining the modulation constellation point, thus helping to ensure retransmission performance.

[0046] In one possible implementation, the encoded bit sequence does not include information bits corresponding to columns in the check matrix whose column weights are greater than the column weight threshold.

[0047] Based on the above solution, transmission performance can be improved.

[0048] In one possible implementation, determining the bit sequence to be modulated based on the encoded bit sequence includes: obtaining the bit sequence to be modulated from the encoded bit sequence based on a redundancy version start point, wherein the redundancy version start point is used to indicate the starting position of the bit sequence to be modulated.

[0049] Based on the above scheme, it helps to simplify the process of determining the bit sequence to be modulated.

[0050] In one possible implementation, the starting point of the redundant version is related to whether the probabilistic shaping function is enabled.

[0051] Based on the above scheme, redundant versions of the starting point can be designed for whether probability shaping is enabled or not, thereby improving retransmission performance.

[0052] In one possible implementation, the starting point of the redundant version is related to the initial transmission length and / or modulation order.

[0053] Based on the above solution, retransmission performance can be improved.

[0054] In one possible implementation, the probability shaping-related bit sequence is the probability-shaped bit sequence; or, the probability shaping-related bit sequence consists of the probability-shaped bit sequence and a bit sequence used to assist probability shaping.

[0055] Based on the above scheme, it is helpful to improve the shaping effect of modulation constellation points, thereby improving transmission performance.

[0056] Fourthly, embodiments of this application provide a communication method, which can be executed by a second communication device. Unless otherwise specified, the "second communication device" in this application can refer to a communication device (e.g., a terminal device, network device, decoding device, etc.), a component within that communication device (e.g., a processor, chip, or chip system, etc.), or a logic module or software capable of implementing all or part of the functions of the communication device. The method includes: receiving a modulation symbol sequence, wherein the modulation symbol sequence is determined based on a bit sequence to be modulated, the bit sequence to be modulated is determined based on an encoded bit sequence, the encoded bit sequence is obtained by channel coding the bit sequence to be encoded, the bit sequence to be encoded includes a probability shaping related bit sequence and a bit sequence for determining a modulation constellation point, the bit sequence for determining the modulation constellation point being located before the probability shaping related bit sequence; demodulating the modulation symbol sequence to obtain a demodulated symbol sequence; and decoding the demodulated symbol sequence to recover the original information bit sequence.

[0057] Based on the above scheme, before encoding, the bit sequence is interleaved to obtain the unencoded bit sequence. The unencoded bit sequence includes a probability shaping-related bit sequence and a bit sequence for determining the symbols used to determine the modulation constellation point. The bit sequence for determining the symbols precedes the probability shaping-related bit sequence, making it less likely to be retransmitted during retransmission. Since the reliability of the bit sequence for determining the modulation constellation point is higher than that of the probability shaping-related bit sequence, choosing not to retransmit the bit sequence for determining the modulation constellation point has a greater gain than choosing not to retransmit the probability shaping-related bit sequence. This is because the high-reliability bit sequence is more likely to be successfully transmitted and therefore less likely to be retransmitted. Therefore, this scheme, by adding sub-block interleaving, reduces the probability of retransmitting the high-reliability bit sequence for determining the modulation constellation point, thus helping to ensure retransmission performance.

[0058] In one possible implementation, the encoded bit sequence does not include information bits corresponding to columns in the check matrix whose column weights are greater than the column weight threshold.

[0059] Based on the above solution, transmission performance can be improved.

[0060] In one possible implementation, the bit sequence to be modulated is determined based on a redundancy version start point and the encoded bit sequence, wherein the redundancy version start point is used to indicate the starting position of the bit sequence to be modulated.

[0061] Based on the above scheme, it helps to simplify the process of determining the bit sequence to be modulated.

[0062] In one possible implementation, the starting point of the redundant version is related to whether the probabilistic shaping function is enabled.

[0063] Based on the above scheme, redundant versions of the starting point can be designed for whether probability shaping is enabled or not, thereby improving retransmission performance.

[0064] In one possible implementation, the starting point of the redundant version is related to the initial transmission length and / or modulation order.

[0065] Based on the above solution, retransmission performance can be improved.

[0066] In one possible implementation, the probability shaping-related bit sequence is the probability-shaped bit sequence; or, the probability shaping-related bit sequence consists of the probability-shaped bit sequence and a bit sequence used to assist probability shaping.

[0067] Based on the above scheme, it is helpful to improve the shaping effect of modulation constellation points, thereby improving transmission performance.

[0068] Fifthly, this application provides a communication device that performs the functions described in the first or third aspect above. For example, the communication device includes modules, units, or means corresponding to the operations described in the first or third aspect above. The functions, units, or means can be implemented by software, hardware, or hardware executing corresponding software.

[0069] In one possible design, the communication device includes a processing unit and a communication unit, wherein the communication unit can be used to transmit and receive signals to enable communication between the communication device and other devices; the processing unit can be used to perform some internal operations of the communication device. The functions performed by the processing unit and the communication unit may correspond to the operations involved in the first or third aspect described above.

[0070] In one possible design, the communication device includes a processor that may be coupled to a memory. The memory may store computer programs or instructions necessary to implement the functions described in the first aspect above. The processor may execute the computer programs or instructions stored in the memory, causing the communication device to implement the methods in any possible design or implementation of the first or third aspect above.

[0071] In one possible design, the communication device includes a processor and a memory, the memory of which can store the necessary computer programs or instructions for implementing the functions described in the first aspect above. The processor can execute the computer programs or instructions stored in the memory, and when the computer programs or instructions are executed, cause the communication device to implement the methods in any possible design or implementation of the first or third aspect above.

[0072] In one possible design, the communication device includes a processor and an interface circuit, wherein the processor is configured to communicate with other devices via the interface circuit and to execute the methods in any possible design or implementation of the first or third aspect described above.

[0073] Understandably, the processor in the fifth aspect can be implemented in hardware or software. When implemented in hardware, the processor can be a logic circuit, integrated circuit, etc.; when implemented in software, the processor can be a general-purpose processor that reads software code stored in memory. Furthermore, there can be one or more processors, and one or more memories. The memory can be integrated with the processor or separated from it. In specific implementations, the memory can be integrated with the processor on the same chip or disposed on different chips. This application does not limit the type of memory or the arrangement of the memory and processor.

[0074] Sixthly, this application provides a communication device that performs the functions described in the second or fourth aspect above. For example, the communication device includes modules, units, or means corresponding to the operations described in the second or fourth aspect above. The functions, units, or means can be implemented by software, hardware, or hardware executing corresponding software.

[0075] In one possible design, the communication device includes a processing unit and a communication unit, wherein the communication unit can be used to transmit and receive signals to enable communication between the communication device and other devices; the processing unit can be used to perform some internal operations of the communication device. The functions performed by the processing unit and the communication unit may correspond to the operations involved in the second or fourth aspect described above.

[0076] In one possible design, the communication device includes a processor that may be coupled to a memory. The memory may store computer programs or instructions necessary to implement the functions described in the second aspect above. The processor may execute the computer programs or instructions stored in the memory, causing the communication device to implement the methods in any possible design or implementation of the second or fourth aspect above.

[0077] In one possible design, the communication device includes a processor and a memory, the memory of which can store the necessary computer programs or instructions for implementing the functions described in the second aspect above. The processor can execute the computer programs or instructions stored in the memory, and when the computer programs or instructions are executed, cause the communication device to implement the methods in any possible design or implementation of the second or fourth aspect above.

[0078] In one possible design, the communication device includes a processor and an interface circuit, wherein the processor is configured to communicate with other devices via the interface circuit and to perform the methods in any possible design or implementation of the second or fourth aspect described above.

[0079] Understandably, the processor in the sixth aspect can be implemented in hardware or software. When implemented in hardware, the processor can be a logic circuit, integrated circuit, etc.; when implemented in software, the processor can be a general-purpose processor that reads software code stored in memory. Furthermore, there can be one or more processors, and one or more memories. The memory can be integrated with the processor or separated from it. In specific implementations, the memory can be integrated with the processor on the same chip or disposed on different chips. This application does not limit the type of memory or the arrangement of the memory and processor.

[0080] In a seventh aspect, this application provides a communication system that may include a first communication device and a second communication device; wherein the first communication device is configured to perform the method described in the first aspect, and the second communication device is configured to perform the method described in the second aspect. Alternatively, the first communication device is configured to perform the method described in the third aspect, and the second communication device is configured to perform the method described in the fourth aspect.

[0081] Eighthly, this application provides a computer-readable storage medium storing a computer program (or computer-readable instructions) in which, when a computer reads and executes some or all of the computer-readable instructions, the method in any of the possible designs in the first to fourth aspects described above is executed.

[0082] For example, a computer-readable storage medium can be any available medium that a computer can access. This includes, but is not limited to, non-transient computer-readable media, random-access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), CD-ROM or other optical disc storage, magnetic disk storage media, or other magnetic storage devices, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer.

[0083] Ninthly, this application provides a computer program product that, when read and executed by a computer, causes any of the possible designs in the first to fourth aspects to be performed.

[0084] In a tenth aspect, this application provides a chip (or chip system) including a processor coupled to a memory storing a computer program; the processor is configured to invoke part or all of the computer program in the memory, such that any of the possible designs in the first to fourth aspects described above are executed. Attached Figure Description

[0085] Figure 1 is a schematic diagram of the architecture of the communication system applicable to the embodiments of this application;

[0086] Figure 2(a) is a schematic diagram of a processing flow for information sources and receivers;

[0087] Figure 2(b) is a schematic diagram of another processing flow for the information source and the information sink;

[0088] Figure 2(c) shows the distribution of constellation points after reshaping;

[0089] Figure 3(a) is a schematic diagram of an 8×8 polarization transformation matrix;

[0090] Figure 3(b) is a schematic diagram of the SC decoding calculation process;

[0091] Figure 3(c) is a schematic diagram of the decoding path in the SCL decoding method;

[0092] Figure 3(d) is a schematic diagram for determining the values ​​of the auxiliary bits;

[0093] Figure 4 is a schematic diagram of the BG adopted in NR;

[0094] Figure 5 is a flowchart illustrating the communication method provided in an embodiment of this application;

[0095] Figure 6(a) is a schematic diagram of sub-block interweaving;

[0096] Figure 6(b) shows another schematic diagram of sub-block interweaving;

[0097] Figure 6(c) is another schematic diagram of sub-block interweaving;

[0098] Figure 6(d) is an example diagram of the RV starting point of a circular buffer;

[0099] Figure 7(a) is an example diagram of bit interleaving;

[0100] Figure 7(b) shows another example of bit interleaving;

[0101] Figure 7(c) shows another example of bit interleaving;

[0102] Figure 7(d) shows another example of bit interleaving;

[0103] Figure 8 is a flowchart illustrating the communication method provided in an embodiment of this application;

[0104] Figure 9(a) is a schematic diagram of the bit sequence before encoding;

[0105] Figure 9(b) is an example diagram of the RV starting point of a circular buffer;

[0106] Figure 10 is an exemplary block diagram of a communication device involved in an embodiment of this application;

[0107] Figure 11 is a schematic diagram of the structure of a communication device provided in an embodiment of this application. Detailed Implementation

[0108] In the embodiments of this application, words such as "exemplarily" and "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design scheme described as an "example" in this application should not be construed as being more preferred or advantageous than other embodiments or design schemes. Specifically, the use of the term "example" is intended to present concepts in a concrete manner. In the embodiments of this application, "of," "corresponding, relevant," and "corresponding" may sometimes be used interchangeably, and it should be noted that their intended meanings are consistent unless their distinction is emphasized.

[0109] The technical solutions of this application can be applied to various wireless communication systems, such as Universal Mobile Telecommunications System (UMTS), Wireless Local Area Network (WLAN), short-range wireless communication systems (such as sidelink, wireless fidelity, Wi-Fi, Bluetooth, etc.), wired networks, vehicle-to-everything (V2X) communication systems, device-to-device (D2D) communication systems, vehicle-to-everything (V2X) communication systems, 4th generation (4G) mobile communication systems (such as Long Term Evolution (LTE) systems), LTE Frequency Division Duplex (FDD) systems, LTE Time Division Duplex (TDD) systems, Worldwide Interoperability for Microwave Access (WiMAX) communication systems, 5G mobile communication systems (such as New Radio (NR) systems), Future Communications systems, or other similar communication systems, without limitation. This application describes the communication system shown in Figure 1 as an example. When applying the technical solution of this application to other communication systems, the devices, components, modules, etc. in the embodiment can be replaced with corresponding devices, components, modules in other communication systems without limitation.

[0110] Figure 1 is a schematic diagram of the architecture of the communication system applied in the embodiments of this application. As shown in Figure 1, the communication system includes an access network 100. Optionally, the communication system may also include a core network 200 and an Internet 300. The access network 100 may include at least one network device, such as 110a and 110b in Figure 1, and may also include at least one terminal device, such as 120a-120j in Figure 1. Specifically, 110a is a base station, 110b is a micro-station, 120a, 120e, 120f, and 120j are mobile phones, 120b is a car, 120c is a fuel dispenser, 120d is a home access point (HAP) deployed indoors or outdoors, 120g is a laptop computer, 120h is a printer, and 120i is a drone. The same terminal device or network device can provide different functions in different application scenarios. For example, the mobile phones in Figure 1 are 120a, 120e, 120f and 120j. Mobile phone 120a can access base station 110a, connect to car 120b, communicate directly with mobile phone 120e and access HAP. Car 120b can access HAP and communicate directly with mobile phone 120a. Mobile phone 120f can access micro-station 110b, connect to laptop 120g and printer 120h. Mobile phone 120j can control drone 120i.

[0111] (1) Network equipment

[0112] A network device is a network-side device with wireless transceiver capabilities. A network device can be a device in a radio access network (RAN) that provides wireless communication capabilities to terminal devices; this is called RAN equipment. The RAN can be an access network within the 3rd Generation Partnership Project (3GPP), such as 4G, 5G, or future networks. The RAN can also be an open RAN (O-RAN or ORAN), a cloud radio access network (CRAN), or a communication network combining two or more of these.

[0113] RAN equipment can also be a base station, an evolved NodeB (eNodeB), a transmission reception point (TRP), a next-generation NodeB (gNB) in a 5G mobile communication system, a base station in a future mobile communication system, or an access node in a WiFi system, etc.

[0114] RAN equipment can also be modules or units that perform some of the functions of a base station. For example, it can be a central unit (CU), a distributed unit (DU), or a radio unit (RU). The CU performs the functions of the radio resource control (RRC) and PDCP protocols of the base station, and can also perform the functions of the service data adaptation protocol (SDAP). The CU can be further divided into a CU control plane (CP) (i.e., CU-CP) and a CU user plane (UP) (i.e., CU-UP). The DU performs the functions of the RLC and MA layers of the base station, and can also perform some or all of the physical layer functions. For specific descriptions of the above protocol layers, please refer to the relevant 3GPP technical specifications. CU and DU can be set up separately, or they can be included in the same network element, such as in a baseband unit (BBU). The RU can be included in radio frequency equipment or radio frequency units, such as in a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH). In different systems, CU, 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, and RU can also be called O-RU. Any of the CU (or CU-CP, CU-UP), DU, and RU units in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules. The RA device can be a macro base station (as shown in Figure 1, 110a), a micro base station or an indoor station (as shown in Figure 1, 110b), or a relay node or donor node, etc. The embodiments of this application do not limit the specific technology or specific device form used in the network equipment.

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

[0116] (2) Terminal equipment

[0117] A terminal device is a user-side device with wireless transceiver capabilities. Terminal devices can also be called terminals, user equipment (UE), mobile stations, mobile terminals, etc. Terminal devices can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), the Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, intelligent transportation, and smart cities. Terminal devices can be mobile phones, tablets, computers with wireless transceiver capabilities, wearable devices, vehicles, drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, etc. In the embodiments of this application, the device used to implement the functions of the terminal device can be the terminal device itself, or it can be a device that supports the terminal device in implementing that function, such as a chip system or a combination of devices or components that can implement the functions of the terminal device. This device can be installed in the terminal device. The embodiments of this application do not limit the specific technology or specific device form used in the terminal device.

[0118] In this embodiment of the application, the functions of the terminal device can also be performed by modules (such as chips or modems) in the terminal device, or by a device containing the functions of the terminal device.

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

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

[0121] Network devices and terminal devices, network devices and network devices, and terminal devices can communicate through licensed spectrum, unlicensed spectrum, or both simultaneously, without limitation.

[0122] The network architecture and business scenarios described in this application are intended to more clearly illustrate the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0123] The following is an explanation of the relevant terms used in the embodiments of this application. Unless otherwise specified, these explanations are provided to support the meaning of the relevant terms and to make the embodiments of this application easier to understand, and should not be regarded as a strict limitation of the relevant terms within the scope of protection claimed by this application.

[0124] (1) Channel coding and channel decoding

[0125] Figure 2(a) is a schematic diagram of a processing flow for the source and sink. As shown in Figure 2(a), the transmitting end (i.e., the source) obtains the bit sequence to be encoded (i.e., the information bit sequence) through source coding, and then performs channel coding on the information bit sequence to obtain the encoded bit sequence. Correspondingly, after the receiving end (i.e., the sink) obtains the symbol sequence to be decoded, it performs channel decoding on the symbol sequence to be decoded to obtain the information bit sequence, and then performs source recovery on the information bit sequence to obtain useful information.

[0126] Since source coding does not consider interference resistance, if the bit sequence output from source coding is directly transmitted through the channel, noise interference in the channel will cause bit errors, reducing communication reliability. Therefore, channel coding, which encodes the bit sequence output from source coding again, can improve communication reliability. Channel decoding is the inverse process of channel coding.

[0127] There are various channel coding methods, such as using polar codes or LDPC codes. Polar codes were chosen as the control channel coding method in the 5G standard. Polar codes are a coding scheme that can be rigorously proven to "achieve" the Shannon channel capacity, and have the advantages of good decoding performance and low complexity. LDPC codes were chosen as the data channel coding method in the 5G standard. LDPC codes are linear block codes with a sparse parity-check matrix, which not only have good performance approaching the Shannon limit, but also have low decoding complexity and flexible structure.

[0128] (2) Modulation and demodulation

[0129] Referring to Figure 2(a), the transmitting end can also map the encoded bit sequence to the modulation symbol sequence, and then send the modulation symbol sequence; correspondingly, the receiving end can receive the modulation symbol sequence and then demodulate it to obtain the symbol sequence to be decoded.

[0130] Modulation refers to the process by which the transmitting end maps the encoded bit sequence to a constellation based on a constellation diagram to obtain a modulated symbol sequence. Demodulation is the reverse process of modulation. Common modulation methods include quadrature amplitude modulation (QAM) and amplitude shift keying (ASK) modulation.

[0131] For example, the encoded bit sequence can be mapped to the modulation symbol sequence by referring to a lookup table or according to a preset rule. Here, only a lookup table is used as an illustration. As shown in Table 1, for the 16ASK modulation scheme, after determining the encoded bit sequence, the transmitting end can refer to Table 1 to map every four encoded bits (represented by b0, b1, b2, b3) to one modulation symbol. For example, bit 1111 is mapped to modulation symbol -15, bit 1110 is mapped to modulation symbol -13, and so on. In practical applications, only one or more rows of Table 1 may be used, and this application does not make specific limitations here.

[0132] Table 1: Mapping between bit values ​​and modulation symbols

[0133] When using 16ASK modulation, the encoded bit sequence can be mapped to the modulation symbol sequence according to the bit values, referring to Table 1. When using QAM (such as 16QAM, 64QAM, etc.) modulation, the QAM constellation diagram has real and imaginary parts, which can be mapped to the modulation symbol sequence according to Table 1 or other tables, respectively. This application will not elaborate on this further.

[0134] It should be noted that different bits have different functions when mapping the encoded bit sequence to the modulation symbol sequence. For example, in Table 1, bit b0 is used to determine the quadrant of the modulation symbol, so bit b0 is also called the symbol bit. Bits b1, b2, and b3 are used to determine the amplitude of the modulation symbol, so bits b1, b2, and b3 are also called amplitude bits. Furthermore, the transmission reliability of bits b0, b1, b2, and b3 decreases in that order, that is, the transmission reliability satisfies the following relationship: transmission reliability of b0 > transmission reliability of b1 > transmission reliability of b2 > transmission reliability of b3.

[0135] It should be noted that the values ​​of the modulation symbols in Table 1 (i.e., the magnitude of x) are only examples. In actual applications, x can be adjusted according to power consumption requirements, such as scaling up or down the multiple x values ​​shown in Table 1 by the same proportion.

[0136] (3) Probability shaping

[0137] Higher-order modulation maps multiple bits to the same modulation symbol, thereby further improving spectral efficiency. Common higher-order modulation schemes include 16QAM and 64QAM, without specific limitations. 16QAM maps 4 bits to one modulation symbol, while 64QAM maps 6 bits to one modulation symbol.

[0138] In higher-order modulation, different symbols may have different energies. As shown in Table 1 above, the energies of the modulation symbols from highest to lowest are: modulation symbol -15 (modulation symbol 15), modulation symbol -13 (modulation symbol 13), modulation symbol -11 (modulation symbol 11), modulation symbol -9 (modulation symbol 9), modulation symbol -7 (modulation symbol 7), modulation symbol -5 (modulation symbol 5), modulation symbol -3 (modulation symbol 3), and modulation symbol -1 (modulation symbol 1). Among them, modulation symbol -15 has the same energy as modulation symbol 15, modulation symbol -13 has the same energy as modulation symbol 13, modulation symbol -11 has the same energy as modulation symbol 11, modulation symbol -9 has the same energy as modulation symbol 9, modulation symbol -7 has the same energy as modulation symbol 7, modulation symbol -5 has the same energy as modulation symbol 5, modulation symbol -3 has the same energy as modulation symbol 3, and modulation symbol -1 has the same energy as modulation symbol 1.

[0139] By transmitting more low-energy symbols and fewer high-energy symbols, average energy can be saved. Theoretical analysis shows that for a Gaussian white noise channel, the information transmitted per unit energy is maximized when the transmitted symbol distribution follows a Gaussian distribution. Compared to a uniform distribution, the Gaussian distribution has the best performance, theoretically offering a performance gain of 1.53 dB.

[0140] Probabilistic shaping is a common "shaping" technique. A typical flowchart is shown in Figure 2(b), which illustrates another processing flow for the source and sink. The difference between Figure 2(b) and Figure 2(a) is that in Figure 2(b), the transmitting end requires probabilistic shaping (or distribution matching), and the receiving end requires deprobabilistic shaping (or dedistribution matching). As shown in Figure 2(b), by cascading a precoder before channel coding, the information bits are mapped (or "shaped") to a bit sequence that follows a specific distribution. Therefore, the precoder is also called a distribution matcher (DM). Then, during channel coding, systematic coding is used, so that the sequence satisfying the specific distribution ultimately appears directly in the coded sequence, thus shaping the final modulation symbols. The constellation distribution after "shaping" is shown in Figure 2(c). It can be seen that the probability of low-energy symbols appearing is higher than that of high-energy symbols.

[0141] In this application, probabilistic shaping can also be simply referred to as shaping, which will be explained uniformly here and will not be elaborated on later.

[0142] For example, for 500 information bits, 100 information bits are not probabilistically shaped, and the other 400 information bits are probabilistically shaped to obtain a bit sequence that follows a specific distribution, which includes 512 bits; then, channel coding is performed on the 100 information bits and the shaped 512 bits.

[0143] (4) Rate matching

[0144] Taking polar codes as an example, as mentioned above, the encoding length of a polar code is an integer power of 2. In practical applications, the required length may be a non-encoded length. In this case, it is necessary to remove some bits from the encoded bit sequence without transmitting them, or to repeatedly transmit some bits. This process is usually called rate matching. The rate matching methods will be further explained below in three categories.

[0145] Punching: Punching refers to directly creating holes in certain bit positions within the encoded bit sequence without transmitting them, thus generating bit sequences of arbitrary length. On the decoding side, since there is no information at the corresponding punctured positions, the LLR of the corresponding bit is set to 0.

[0146] Shortening: Shortening is another common rate-matching method. This method involves designing the polar code so that certain bit positions in the encoded bit sequence are fixed values, thus eliminating the need for transmission. On the decoding side, since the corresponding "shortened" positions are essentially known at the receiver (usually 0), the LLR of the corresponding bit is set to infinity.

[0147] Repetition: "Repetition" refers to obtaining a longer bit sequence by repeatedly sending a portion of the encoded bit sequence.

[0148] (5) Polar codes

[0149] Regarding polar codes, this involves polar code encoding, polar code decoding, and polar codes as distributed matchers, which will be explained below.

[0150] (5.1) Polar code encoding

[0151] Polar codes employ coding strategies that utilize noiseless channels to transmit useful user information, or utilize noisy channels to transmit agreed-upon information or no information at all. A polar code is a linear block code whose generator matrix is ​​G. N Its encoding process is as follows It is a binary row vector with a length of N (i.e., code length); and Defined as the Kronecker product of log₂N matrices F₂, x₁ N These are the encoded bits (also called codewords). With the generating matrix G N Multiplying them together yields the encoded bits; the process of multiplication is the encoding process.

[0152] During the encoding process of polar codes, A portion of the bits are used to carry information, called the information bit set, and the set of indices of these bits is denoted as A; the other portion of the bits are set to fixed values ​​agreed upon in advance by the receiver and the transmitter, called the fixed bit set or frozen bit set, and the set of its bit indices is denoted by the complement of A, denoted as A'. c These freeze bits are typically set to 0, but they can be set arbitrarily as long as the receiver and sender agree in advance.

[0153] Currently, in NR, the frozen bits and information bits of the polar code are determined based on the reliability sequence corresponding to the mother code length. The reliability sequence corresponding to the mother code length can be calculated offline to reduce encoding complexity. The mother code length is an integer power of 2, which is the length of the bit sequence after polar code encoding; the mother code length can also be called the encoding length. Taking a mother code length of 8 as an example, assuming the reliability sequence is [0 1 2 4 3 5 6 7], it means that the reliability of the bits from highest to lowest is: the bit corresponding to bit number 7, the bit corresponding to bit number 6, ..., the bit corresponding to bit number 1, and the bit corresponding to bit number 0. Here, a bit can be understood as a bit sub-channel. The bit number can be understood as the index or identifier of the bit. For example, when constructing a polar code with a master code length of 8 and an information length of 4, the bits corresponding to bit number 7, bit number 6, bit number 5, and bit number 3 are selected from the end to the beginning as information bits, while the bits corresponding to bit number 4, bit number 2, bit number 1, and bit number 0 are selected as frozen bits.

[0154] It should be noted that the Polar code distribution matching (Polar-DM) is used as an example for illustration here. This invention is not limited to Polar-DM, and can also be implemented using other DM methods such as constant composition distribution matching (CCDM), enumerative sphere shaping (ESS), and trellis shaping.

[0155] Figure 3(a) shows an 8×8 polarization transformation matrix. The left side can be understood as the side to be encoded, with the bits on the left denoted by u. The right side can be understood as the encoding side (or codeword side), with the bits on the right denoted by x. The process from left to right is the process of the transmitter encoding the bit sequence to be encoded. The information bits to be encoded are represented by the sequence u(0, 0, 0, 0, 0, 0, 1, 1). After the polarization transformation matrix, the encoded bits are represented by the sequence x(0, ​​1, 0, 1, 0, 1, 0, 1). Then, x is mapped to a modulation symbol for transmission in channel W. The bits corresponding to high channel reliability are used to map information bits, and the bits corresponding to low channel reliability are used to map frozen bits. As shown in Figure 3(a), {u0, u1, u2, u4} are frozen bits, i.e., the positions of frozen bits, and {u3, u5, u6, u7} are information bits, i.e., the positions of information bits. In this embodiment, information bits are also called information bits. Frozen bits are also called frozen bits.

[0156] Referring to Figure 3(a), in the encoding process, two adjacent columns constitute a coding layer. The left column of bits represents the input bits of the coding layer, and the right column represents the output bits. For example, in the leftmost coding layer, the input bit sequence is (0, 0, 0, 0, 0, 0, 1, 1), and the output bit sequence is (0, 0, 0, 0, 0, 0, 0, 1). The operation symbols in the middle of the coding layer... This represents the XOR operation, specifically... express The bits in the current row and A single XOR operation between the bits in the row. The bits on the right represent the result of the operation. For example, in the leftmost coding layer, the first input bit (value 0) and the second input bit (value 0) are processed... The operation yields the first output bit (with a value of 0).

[0157] (5.2) Polar code decoding

[0158] There are several methods for decoding polar codes, such as successive cancellation (SC) decoding and successive cancellation list (SCL) decoding.

[0159] The SC decoding method involves calculating the LLR of each decoded bit based on the log likelihood ratio (LLR) sequence corresponding to the bit sequence to be decoded, and then making a bit-by-bit decision. When the decoded bit is an information bit, if the LLR of the decoded bit is greater than 0, then the decoded bit is 0; if the LLR of the decoded bit is less than 0, then the decoded bit is 1. When the decoded bit is a fixed bit, the decoding result is set to 0 regardless of the LLR value. Figure 3(b) is a schematic diagram of the SC decoding calculation process. Taking a decoded bit of 4 bits as an example, there are 8 calculation nodes in Figure 3(b), including 4 F nodes and 4 G nodes. The F nodes and G nodes correspond to the F operation and the G operation, respectively. The operation of the F node requires the two LLR inputs on its right side, and the operation of the G node requires the two LLR inputs on its right side and the output of the previous stage as inputs. The output can only be calculated after the inputs are calculated. According to the above calculation rules, the decoded bits obtained by calculating sequentially from the right side in Figure 3(b) are ①→②→③→④, and the decoding is completed.

[0160] The SCL decoding method refers to using the LLR sequence corresponding to the bit sequence to be decoded. When decoding each information bit, the decoding results corresponding to 0 and 1 are saved as two branch decoding paths (referred to as path splitting). Figure 3(c) shows a schematic diagram of the decoding paths in the SCL decoding method. As shown in Figure 3(c), each level represents one decoded bit. If the decoding result is 0, the path is developed along the left subtree; if the decoding result is 1, the path is developed along the right subtree. When the total number of decoding paths exceeds the preset path width L (generally L = 2, 4, 8, 16, or 32), the L paths with the best path metric (PM) value are selected, saved, and the path is further developed to decode subsequent bits. The PM value is used to judge the quality of the path, and the PM value is calculated using LLR. For each level of decoded bits, the PM values ​​of the L paths are sorted in ascending order, and the correct path is selected based on the PM value. This process is repeated until the last bit is decoded.

[0161] (5.3) Polar codes as distributed matching devices

[0162] Polar codes can be used as distribution matchers to implement probabilistic shaping transmission. As mentioned earlier, the function of a distribution matcher can be understood as mapping K information bits to N shaped bits, where the K information bits follow a uniform distribution, and the N shaped bits follow a specific distribution (generally not a uniform distribution).

[0163] When constructing a polar code-based distribution matcher, referring to Figure 3(d), the K positions with low reliability are selected as information bits, and the remaining NK positions are selected as auxiliary bits. During distribution matching, the K original information bits to be formed are placed in the information bit positions. The decoder uses the N LLR values ​​(also called the LLR value sequence) corresponding to the target distribution as the sequence of symbols to be decoded, and obtains NK auxiliary bits through SC or SCL decoding. The sequence of symbols to be decoded and the K original information bits to be formed are both known quantities. Further, based on the K original information bits to be formed and the NK auxiliary bits obtained from decoding, the bit sequence to be encoded is obtained; this bit sequence is the formed bit sequence.

[0164] By controlling the LLR value sequence of the decoder, the shaping effect of the polar code as a distribution matcher can be controlled, thereby further improving the shaping performance. There are generally two implementation methods:

[0165] Method 1: When the LLR values ​​in the decoder input LLR value sequence are the same, the resulting bit sequence also follows the same distribution.

[0166] Method 2: When the LLR values ​​in the input LLR value sequence of the decoder are not exactly the same, finer shaping can be achieved. Generally, the larger the LLR value, the greater the distribution bias of the bits corresponding to that LLR value, that is, the more uneven the distribution.

[0167] Polar codes, as distributed shapers, offer the following advantages: First, they can reuse existing SC or SCL decoders in current devices for shaping, eliminating the need for additional chip area. Second, they can leverage the fast decoding algorithms of SC or SCL decoders, reducing decoding complexity. Third, by using different LLR value sequences as input to the SC or SC decoder and introducing joint design, the performance of probabilistic shaping can be improved without increasing complexity.

[0168] (6) LDPC code

[0169] Regarding LDPC codes, the following sections cover LDPC parity-check matrix, LDPC code encoding, LDPC rate matching, LDPC interleaving, and LDPC symbol mapping, which will be explained in detail below.

[0170] (6.1) Parity-check matrix of LDPC code

[0171] LDPC codes are linear block codes determined by an m x n sparse matrix H, where H consists of elements 0 and 1. Because most elements in the matrix are 0 except for a few 1s, it is called a sparse matrix, and the sparse matrix H can also be called the parity check matrix of the LDPC code. H satisfies one or more of the following conditions:

[0172] 1) The ratio of the row weight of the matrix (i.e. the number of 1s in each row of the matrix) to the code length is much less than 1.

[0173] 2) The ratio of the column weight of the matrix (i.e. the number of 1s in each column of the matrix) to the code length is much less than 1.

[0174] 3) Any two rows (columns) of a matrix have at most one 1 in the same position.

[0175] 4) Maximize the number of any linearly independent columns.

[0176] Commonly used LDPC codes typically have a quasi-cyclic (QC) structure, also known as QC-LDPC. QC-LDPC is represented using a base graph (BG). In practice, QC expansion is performed based on the lifting size and its corresponding cyclic shift value parameter to obtain the final parity-check matrix. The lifting size can also be called the boosting factor or other names; the specific name is not limited. The lifting size can be represented by Z. cThe elements in BG are either 0 or 1. QC expansion involves expanding the element 1 in BG to a unit matrix of the "lift value" size and cyclically shifting it according to the cyclic shift parameter; and expanding the element 0 to a zero matrix of the corresponding size (i.e., a square matrix of all zeros multiplied by the expansion factor). Compared to directly storing the parity check matrix, this method reduces storage overhead and facilitates decoding.

[0177] Figure 4 shows a schematic diagram of the BG (Browser Grid) adopted in NR (New Radio). A brief description follows: Part A corresponds to the high-bitrate information column region, and Part B corresponds to the high-bitrate core verification region. Part C is a zero matrix, Region D is the incremental redundancy part of the matrix, corresponding to the low-bitrate matrix, and Part E is the incremental redundancy region, which is an identity matrix structure.

[0178] The encoding process based on NR's BG includes: expanding the base matrix to obtain the parity check matrix H (the parity check matrix also satisfies the partitioning characteristics in Figure 4). Encoding is then performed based on the parity check matrix. Specifically, the information bits are first placed in the corresponding information bits of part A, and the parity bit sequences corresponding to B and C are encoded. The information bit sequence corresponding to part A (X...) is then... A The parity bit sequence [X] corresponding to B and C. B ,X C The output is used as the encoded codeword X = [X A ,X B ,X C ]. [X A ,X B ,X C [X] satisfies the constraints of the parity check matrix H, i.e., [X] A ,X B ,X C ]*H=0.

[0179] (6.2) LDPC code encoding

[0180] Let the sequence of bits to be encoded be denoted as vector c, and c = [c0, c1, c2, ..., c K-1 ] T Where K is the number of information bits to be encoded. The bit sequence after LDPC encoding is denoted as vector d, and d = [d0, d1, d2, ..., dn]. N-1 ] T For LDPC base map 1 (BG1 for short), N = 66Z c For LDPC base map 2 (BG2 for short), N = 50Z c Z c This represents the expansion factor.

[0181] In this context, base graph 1 is also called base matrix 1, and base graph 2 is also called base matrix 2.

[0182] in ， The process of encoding vector c using LDPC code to obtain vector d is as follows:

[0183] Step 1: Select Z c .

[0184] Step 2: Based on the first 2Z of vector c c Other than the bit values, determine the first K-2Z of vector d. c Each bit value, the process is as follows:

[0185] This section uses pseudocode to illustrate the implementation process of this step. This pseudocode is merely an example; in practical applications, other expressions are possible, as long as they convey the meaning or idea of ​​the step. The pseudocode used in other steps is also just an example and can have other expressions; this is explained uniformly here and will not be elaborated upon further.

[0186] Step 3: Generate vectors And it satisfies:

[0187] The 0 on the right side of the above formula (1) represents a column vector with all elements being 0.

[0188] The parity-check matrix H is obtained by using the basis matrix H BG Replace each element in with Z c ×Z c The matrix obtained is as follows:

[0189] a) Basis matrix H BG Each element with a value of 0 is replaced with an element of size Z. c ×Z c A zero matrix;

[0190] b) Basis matrix H BG Each element with a value of 1 in the array is replaced with an element of size Z. c ×Z c The identity matrix, or replaced with a matrix of size Z. c ×Z c The cyclic shift matrix is ​​obtained from the identity matrix.

[0191] Where, when matrix H BG If it is BG1, then H BG It is a matrix with 46 rows and 68 columns. When matrix H... BG If it is BG2, then H BG It is a matrix with 42 rows and 52 columns.

[0192] Step 4: Based on vector w, obtain the other N+2Z of vector d.c -K bits, the process is as follows:

[0193] From the above four steps of LDPC encoding, it can be seen that:

[0194] First, the above formula (1) implies a one-to-one correspondence between an information bit and a column in the parity check matrix H, that is, c0 corresponds to the first column of H, c1 corresponds to the second column of H, and so on.

[0195] Second, the encoded bit sequence (i.e., vector d) does not contain the first 2^Z of the information bit sequence to be encoded (i.e., vector c). c The first 2Z bits, that is, the first 2Z bits of the information bit sequence to be encoded. c Each bit is punched. For example, the first 2Z bits of the information bit sequence to be encoded are... c Each bit corresponds to a column with a larger column weight in the parity check matrix.

[0196] (6.3) LDPC rate matching

[0197] The encoded bit sequence (i.e., vector d) is placed in a circular buffer, and a bit sequence of the corresponding length is read from it as the bit sequence after rate matching. This will be explained in detail below.

[0198] The encoded bit sequence d0, d1, d2, ..., d N-1 Write to a circular buffer, the length of which is denoted as N. cb .

[0199] The redundancy version (RV) currently being transmitted is denoted as rv. id , among which, rv id = 0, 1, 2 or 3.

[0200] The bit sequence after rate matching of the ring buffer output is denoted as e = e0, e1, e2, ..., e E-1 The process of generating this sequence is as follows:

[0201] Where k0 represents the bit sequence e0, e1, e2, ..., e after rate matching from the ring buffer. E-1 The starting bit position, that is, starting from the bit indicated by k0, is used to read e0, e1, e2, ..., e E-1 The value of k0 is related to rv. id And related to the LDPC basis matrix. Table 2 below shows the relationship between the values ​​of k0 and rv. idAnd an example of the relationship between the LDPC basis matrices.

[0202] Table 2: Values ​​of k0 and rv id and the relationship between the LDPC basis matrix

[0203] It should be noted that the shortened bits of the current LDPC encoded bits are also stored in the ring buffer.

[0204] (6.4) LDPC interleaving

[0205] After LDPC encoding, for e0, e1, e2, ..., e E-1 Interleaving is performed, and the interleaved bit sequence can then be used for modulation to obtain a modulation symbol sequence.

[0206] As can be seen from the preceding text, e0, e1, e2, ..., e E-1 The information bits are arranged in the order of information bits first, followed by parity bits. Through row and column interleaving, the information bits are preferentially mapped to the sign bits in the modulation symbol, and the parity bits are preferentially mapped to the least reliable amplitude bits in the modulation symbol, thereby achieving the requirement of "system bit protection".

[0207] As one implementation method, based on the following process, the bit sequence e0, e1, e2, ..., e E-1 Interleaved into bit sequences f0, f1, f2, ..., f E-1 :

[0208] Among them, Q m This indicates the modulation order.

[0209] (6.5) LDPC symbol mapping

[0210] Given the bit sequence f0, f1, f2, ..., f E-1 Constellation mapping is performed to obtain the modulation symbol sequence.

[0211] As mentioned above, polar codes and LDPC codes are two coding schemes for 5G. A possible future standard direction is to combine polar codes and LDPC codes to achieve a probabilistic shaping-based transmission scheme. For example, polar codes could be used for probabilistic shaping, and LDPC codes for channel coding.

[0212] After introducing probabilistic shaping, how to ensure retransmission performance when retransmission is required remains to be solved.

[0213] To address the aforementioned issues, this application provides corresponding solutions.

[0214] The methods provided in the embodiments of this application are described in detail below. The methods provided in the embodiments of this application involve a first communication device and / or a second communication device. The first communication device is a signal transmitter, and the second communication device is a signal receiver. Unless otherwise specified, the term "first communication device" in this application can refer to a communication device (e.g., a network device, a terminal device, an encoding device, etc.), a component within that communication device (e.g., a processor, a chip, or a chip system, etc.), or a logic module or software capable of implementing all or part of the functions of the communication device. Similarly, the term "second communication device" in this application can refer to a communication device (e.g., a terminal device, a network device, a decoding device, etc.), a component within that communication device (e.g., a processor, a chip, or a chip system, etc.), or a logic module or software capable of implementing all or part of the functions of the communication device. For example, the first communication device may be a network device, and the second communication device may be a terminal device; or, the first communication device may be a terminal device, and the second communication device may be a network device.

[0215] Figure 5 is a flowchart illustrating a communication method provided in an embodiment of this application. The method includes the following steps:

[0216] Step 501: The first communication device performs sub-block interleaving on the encoded bit sequence to obtain the sub-block interleaved bit sequence.

[0217] The encoded bit sequence can be a bit sequence encoded by LDPC, a bit sequence encoded by polar code, or a bit sequence encoded by other encoding methods. This application does not limit the specific encoding method.

[0218] Optionally, the encoded bit sequence does not include the information bits corresponding to the shortened bits. The information bits corresponding to the shortened bits are also called the shortened information bits.

[0219] Optionally, the encoded bit sequence does not include information bits corresponding to columns in the parity check matrix whose column weights are greater than the column weight threshold. For example, if the parity check matrix has N columns whose column weights are greater than the column weight threshold, then the encoded bit sequence does not include information bits corresponding to those N columns.

[0220] The bit sequence after sub-block interleaving comprises multiple sub-blocks, each of which is also referred to as a sub-bit sequence. These multiple sub-blocks include a first sub-block and at least one second sub-block. The first sub-block includes a bit sequence for determining the symbols of the modulation constellation points, and the at least one second sub-block is a probability shaping-related bit sequence. The first sub-block precedes the at least one second sub-block. The probability shaping-related bit sequence is either a probability-shaped bit sequence or it consists of a probability-shaped bit sequence and a bit sequence used to assist in probability shaping. Figure 6(a) is a schematic diagram of sub-block interleaving. Referring to Figure 6(a), before sub-block interleaving, the first sub-block (i.e., the bit sequence for determining the symbols of the modulation constellation points) follows at least one second sub-block (i.e., the probability shaping-related bit sequence). After sub-block interleaving, the first sub-block precedes at least one second sub-block.

[0221] In one implementation, the plurality of sub-blocks includes, in addition to a first sub-block and at least one second sub-block, at least one third sub-block, which is a parity bit sequence. After sub-block interleaving, the at least one third sub-block is located after the aforementioned at least one second sub-block. Figure 6(b) is another schematic diagram of sub-block interleaving. Referring to Figure 6(b), before sub-block interleaving, the first sub-block (i.e., the bit sequence of symbols used to determine the modulation constellation point) is located after at least one second sub-block (i.e., the probability shaping related bit sequence), and at least one third sub-block (i.e., the parity bit sequence) is located after the first sub-block. After sub-block interleaving, the first sub-block is located before at least one second sub-block, and at least one second sub-block is located before at least one third sub-block.

[0222] As another implementation, the multiple sub-blocks include, in addition to a first sub-block and at least one second sub-block, at least one fourth sub-block. This at least one fourth sub-block is a portion of the bits in the parity bit sequence. The first sub-block also includes another portion of the bits in the parity bit sequence, which can be the initially transmitted parity bits. That is, a portion of the bits in the parity bit sequence is located in at least one fourth sub-block, and another portion is located in the first sub-block. After sub-block interleaving, the at least one fourth sub-block is located after the aforementioned at least one second sub-block. Figure 6(c) is another schematic diagram of sub-block interleaving. Referring to Figure 6(c), before sub-block interleaving, the first sub-block (i.e., the bit sequence used to determine the modulation constellation point) is located after at least one second sub-block (i.e., the probability shaping related bit sequence), and at least one fourth sub-block (i.e., a portion of the bits in the parity bit sequence) is located after the first sub-block. After sub-block interleaving, the first sub-block is located before at least one second sub-block, and at least one second sub-block is located before at least one fourth sub-block. The first sub-block also includes another portion of the bits in the parity bit sequence, which can be the initially transmitted parity bits.

[0223] As one implementation method, the multiple sub-blocks are of the same size, that is, the aforementioned first, second, third, and fourth sub-blocks are all the same, and the size of the sub-block is related to the modulation order Qm and the initial transmission length E. For example, the size of each sub-block is equal to E / (Qm / 2). Since the initial transmission length E is determined based on Nre and the modulation order Qm, it can also be understood that the size of the sub-block is related to the modulation order Qm and Nre.

[0224] Step 502: The first communication device determines the bit sequence to be modulated based on the bit sequence after sub-block interleaving.

[0225] For example, the first communication device inputs the bit sequence after sub-block interleaving into a circular buffer and determines a redundancy version start point (also called the RV start point). The redundancy version start point is used to indicate the starting position of the bit sequence to be modulated. Then, starting from the bit indicated by the redundancy version start point in the circular buffer, a bit sequence of a first length is obtained as the bit sequence to be modulated. This first length can be the initial transmission length or the retransmission length, and it is related to the size of the scheduled resources. Based on this scheme, by selecting an appropriate redundancy version start point, it helps to improve the retransmission performance during probabilistic shaping transmission.

[0226] As one implementation method, the redundant version starting point is related to whether the probabilistic shaping function is enabled. That is, when the probabilistic shaping function is enabled, there is one configuration method for the redundant version starting point; when the probabilistic shaping function is disabled, there is another configuration method for the redundant version starting point.

[0227] For example, when probabilistic shaping is enabled, the starting point of the redundant version can be related to the initial transmission length E. For instance, the starting point of the redundant version could be the first bit position after the initial transmission, meaning transmission continues along the previous path, thus improving transmission performance. Alternatively, when probabilistic shaping is enabled, the starting point of the redundant version can be independent of the initial transmission length E. For example, the starting point of the redundant version could be equal to 19*Zc, or equal to 20*Zc, etc., where Zc represents the enhancement factor.

[0228] For example, when probabilistic shaping is enabled, the redundancy version starting point can be related to the modulation order Qm; for instance, the redundancy version starting point equals... For example, when Qm = 4, the redundant version starting point is equal to E / 2. As another example, when Qm = 8, the redundant version starting point is equal to 3E / 4.

[0229] For example, when the probabilistic shaping function is not enabled, the configuration method of the redundant version starting point can refer to the existing technology, and will not be repeated here.

[0230] Optionally, the first communication device and the second communication device can synchronize whether probabilistic shaping is enabled or disabled through 1 bit of control information. For example, the first communication device sends 1 bit of control information to the second communication device to indicate whether probabilistic shaping is enabled or disabled, or the second communication device sends 1 bit of control information to the first communication device to indicate whether probabilistic shaping is enabled or disabled.

[0231] As an alternative implementation, the redundant version starting point is independent of whether probabilistic shaping is enabled. That is, regardless of whether probabilistic shaping is enabled, the configuration method for the redundant version starting point is the same. For example, the redundant version starting point can be configured according to the configuration method of existing technologies. Based on this implementation method, it is compatible with existing systems.

[0232] For example, taking the example shown in Figure 6(c), after the bit sequence after interleaving the sub-blocks shown in Figure 6(c) is input into the circular buffer, as shown in Figure 6(d). Referring to Figure 6(d), an RV start point is selected. The RV start point is used to indicate the starting position of the bit sequence to be modulated. Then, starting from the bit indicated by the RV start point in the circular buffer, a bit sequence of a first length is obtained as the bit sequence to be modulated. Generally, for retransmission, the position of the RV start point is not located at the beginning position of the circular buffer. For example, in Figure 6(d), the position of the RV start point is located at a bit position in at least one second sub-block.

[0233] Step 503: The first communication device modulates the bit sequence to be modulated to obtain a modulated symbol sequence.

[0234] In step 504, the first communication device transmits a modulation symbol sequence. Correspondingly, the second communication device receives the modulation symbol sequence.

[0235] Step 505: The second communication device demodulates the modulated symbol sequence to obtain the demodulated symbol sequence.

[0236] Step 506: The second communication device decodes the demodulated symbol sequence to recover the original information bit sequence.

[0237] Based on the above scheme, a sub-block interleaving operation is added to the encoded bit sequence. After sub-block interleaving, the bit sequence used to determine the modulation constellation point is placed before the probabilistic shaping related bit sequence. This makes it less likely that the bit sequence used to determine the modulation constellation point will be selected for retransmission during retransmission. Since the reliability of the bit sequence used to determine the modulation constellation point is higher than that of the probabilistic shaping related bit sequence, choosing not to retransmit the bit sequence used to determine the modulation constellation point has a greater gain than choosing not to retransmit the probabilistic shaping related bit sequence. This is because the high-reliability bit sequence is more likely to be transmitted successfully and therefore less likely to be retransmitted. Therefore, this scheme, by adding a sub-block interleaving operation, reduces the probability of retransmitting the high-reliability bit sequence used to determine the modulation constellation point, thus helping to ensure retransmission performance.

[0238] The embodiment of Figure 5 above will be described below with reference to a specific example.

[0239] This example includes steps 1 through 10.

[0240] Step 1: The first communication device acquires the information bit sequence to be encoded: a0, a1, a2, ..., a K-1 , where K represents the length.

[0241] For example, a0, a1, a2, ..., a K-1 It can be a bit sequence that has been CRC encoded.

[0242] Step 2: The first communication device communicates with a0, a1, a2, ..., a K-1 Divide the data into groups to obtain at least two bit sequence subgroups.

[0243] The at least two bit sequence subgroups include a first bit sequence subgroup, which includes a bit sequence for probability shaping. During modulation, the bits in the first bit sequence subgroup are used as amplitude bits. During channel coding, the bits in the first bit sequence subgroup are only passed through the distributed matching unit and are not encoded by forward error correction (FEC) codes. For example, the first bit sequence subgroup uses a 0,0 ,a 0,1 ,a 0,2 ,...,a 0,K0-1 This means that the first bit sequence subgroup includes K0 bits, where K0 is a positive integer.

[0244] Optionally, the at least two bit sequence subgroups further include a second bit sequence subgroup, which includes a bit sequence for auxiliary probability shaping. During modulation, the bits in the second bit sequence subgroup are used as amplitude bits. During channel coding, the bits in the first bit sequence subgroup are passed through a distribution matching unit and also through FEC coding. Exemplarily, the second bit sequence subgroup uses a... 1,0 ,a 1,1 ,a 1,2 ,...,a 1,K1-1 This means that the second bit sequence subgroup includes K1 bits, where K1 is a positive integer. It should be noted that when the at least two bit sequence subgroups do not include the second bit sequence subgroup, it can be understood that the second bit sequence subgroup is an empty set.

[0245] The at least two bit sequence subgroups also include a third bit sequence subgroup, which includes information bits from the information bit sequence to be encoded other than the first bit sequence subgroup, or includes information bits from the information bit sequence to be encoded other than the first and second bit sequence subgroups. The third bit sequence subgroup includes a bit sequence for determining the symbols of the modulation constellation points. Optionally, the third bit sequence subgroup also includes information bits corresponding to columns in the parity check matrix whose column weight is greater than a column weight threshold; during rate matching, these information bits are perforated. Optionally, the third bit sequence subgroup also includes a bit sequence for modulation amplitude bits. During channel coding, the bits in the third bit sequence subgroup do not pass through a distribution matcher but are FEC-coded. For example, the third bit sequence subgroup uses a... 2,0 ,a 2,1 ,a 2,2 ,...,a 2,K2-1 This means that the third bit sequence subgroup includes K2 bits, where K2 is a positive integer.

[0246] Step 3: The first communication device communicates with the first bit sequence subgroup (i.e., a) 0,0 ,a 0,1 ,a 0,2 ,...,a 0,K0-1 Probabilistic shaping is performed to obtain the probabilistically shaped bit sequence.

[0247] The resulting bit sequence after probability shaping consists of M bits, denoted by a' 0,0 ,a' 0,1 ,a' 0,2 ,...,a' 0,M-1 This indicates that M is an integer greater than 1. For example, M = 2 * Nre, which corresponds to one real bit and one imaginary bit in each of the Nre complex modulation symbols used to determine the amplitude.

[0248] Among them, a 0,0 ,a 0,1 ,a 0,2 ,...,a 0,K0-1 Follows a uniform distribution, a' 0,0 ,'a 0,1 ,a' 0,2 ,...,a' 0,M-1 It follows a non-uniform distribution.

[0249] For example, if the second bit sequence subgroup is not an empty set, the first bit sequence subgroup can be probabilistically shaped based on the second bit sequence subgroup to obtain the probabilistically shaped bit sequence.

[0250] Step 4: The first communication device transmits the probabilistically shaped bit sequence (i.e., a') 0,0 ,a' 0,1 ,a' 0,2 ,...,a' 0,M-1 The first bit sequence to be encoded is obtained by interleaving the second bit sequence subgroup and the third bit sequence subgroup.

[0251] The first bit sequence to be encoded consists of L bits, denoted by b0, b1, b2, ..., b6. L-1 Let L be an integer greater than 1, and L = K - K0 + M.

[0252] It should be noted that if the second bit sequence subgroup is an empty set, then the first bit sequence to be encoded does not include the second bit sequence subgroup.

[0253] In one implementation method, when Q m When the value is 8 or 10, b0, b1, b2, ..., b L-1 It can be: a 2,0 ,a 2,1 ,a 2,2 ,...,a 2,Q-1 ,a' 0,0 ,a' 0,1 ,a' 0,2 ,...,a' 0,M-1 a 1,0 ,a 1,1 ,a 1,2 ,...,a 1,K1-1 a 2,Q ,a 2,1 ,a 2,2 ,...,a 2,K2-1That is, the first Q bits of the third bit sequence subgroup are placed at the beginning of the first bit sequence to be encoded. For example, Q = 2 * Zc, or Q = 3 * Zc, etc., and this application does not limit the size of Q. Figure 7(a) is an example diagram of bit interleaving. Referring to Figure 7(a), the first Q bits are a 2,0 ,a 2,1 ,a 2,2 ,...,a 2,Q-1 Then M bits are a' 0,0 ,a' 0,1 ,a' 0,2 ,...,a' 0,M-1 Then K1 bits are a 1,0 ,a 1,1 ,a 1,2 ,...,a 1,K1-1 The last K2-Q bits are a 2,Q ,a 2,1 ,a 2,2 ,...,a 2,K2-1 .

[0254] In another implementation method, when Q m When the value is 8 or 10, b0, b1, b2, ..., b L-1 It can be: a' 0,0 ,a' 0,1 ,a' 0,2 ,...,a' 0,M-1 a 1,0 ,a 1,1 ,a 1,2 ,...,a 1,K1-1 a 2,0 ,a 2,1 ,a 2,2 ,...,a 2,K2-1 In this case, it can be understood as placing the first Q bits of the third bit sequence subgroup at the very beginning of the first bit sequence to be encoded, and Q = 0. Figure 7(b) shows another example of bit interleaving. Referring to Figure 7(b), the first M bits are a' 0,0 ,a' 0,1 ,a' 0,2 ,...,a' 0,M-1 Then K1 bits are a 1,0 ,a 1,1 ,a 1,2 ,...,a 1,K1-1 The last K2 bits are a 2,0 ,a 2,1 ,a 2,2 ,...,a 2,K2-1 .

[0255] In another implementation method, when Qm When the digits are 4, 6, 8, 10, or 12, b0, b1, b2, ..., b L-1 It can be: a 2,0 ,a 2,1 ,a 2,2 ,...,a 2,Q-1 ,a' 0,0 ,a' 0,1 ,a' 0,2 ,...,a' 0,M-1 a 2,Q ,a 2,1 ,a 2,2 ,...,a 2,K2-1 That is, the first Q bits of the third bit sequence subgroup are placed at the beginning of the first bit sequence to be encoded. And there is no second bit sequence subgroup, that is, the second bit sequence subgroup is an empty set. For example, Q = 2*Zc, or Q = 3*Zc, etc., the size of Q is not limited in this application. Figure 7(c) is another example diagram of bit interleaving. Referring to Figure 7(c), the first Q bits are a 2,0 ,a 2,1 ,a 2,2 ,...,a 2,Q-1 Then M bits are a' 0,0 ,a' 0,1 ,a' 0,2 ,...,a' 0,M-1 The last K2-Q bits are a 2,Q ,a 2,1 ,a 2,2 ,...,a 2,K2-1 .

[0256] In another implementation method, when Q m When the digits are 4, 6, 8, 10, or 12, b0, b1, b2, ..., b L-1 It can be: a' 0,0 ,a' 0,1 ,a' 0,2 ,...,a' 0,M-1 a 2,0 ,a 2,1 ,a 2,2 ,...,a 2,K2-1 In this case, there is no second bit sequence subgroup, meaning the second bit sequence subgroup is an empty set. For this situation, it can be understood as placing the first Q bits of the third bit sequence subgroup at the very beginning of the first bit sequence to be encoded, and Q = 0. Figure 7(d) shows another example of bit interleaving. Referring to Figure 7(d), the first M bits are a' 0,0 ,a' 0,1 ,a' 0,2 ,...,a' 0,M-1The last K2 bits are a 2,0 ,a 2,1 ,a 2,2 ,...,a 2,K2-1 .

[0257] Step 5: The first communication device transmits the first bit sequence to be encoded (i.e., b0, b1, b2, ..., b...) to the first communication device. L-1 T*Zc-L shortened bits (usually set to 0) are concatenated to form the second bit sequence to be encoded.

[0258] Where T represents the number of information columns in the LDPC, and this application does not limit the value of T, for example, T = 22 or 23, etc. Zc represents the boosting factor. L is the number of bits in the first bit sequence to be encoded. Where T*Zc ​​represents the number of information bits in the LDPC.

[0259] Step 6: The first communication device performs LDPC encoding based on the second bit sequence to be encoded to obtain the encoded bit sequence.

[0260] For example, the second bit sequence to be encoded is input into the FEC encoder to obtain the encoded bit sequence.

[0261] For example, using c0, c1, c2, ..., c N-1 This represents the encoded bit sequence.

[0262] Step 7: The first communication device removes the first Q bits and T*Zc-L shortened bits of the encoded bit sequence to obtain NQT*Zc-L bits, and then performs sub-block interleaving on the first E bits of the NQT*Zc-L bits and inputs them into the ring buffer.

[0263] Here, Q can be equal to 0 or not equal to 0. For example, in the examples of Figure 7(a) and Figure 7(c), Q is not equal to 0, while in the examples of Figure 7(b) and Figure 7(d), Q is equal to 0.

[0264] Step 7 is a specific example of step 501 in the embodiment of Figure 5 above.

[0265] First, the sub-block size sub1 of the sub-block interleaving is determined based on the modulation order Qm and the initial transmission length E.

[0266] Then, based on the sub-block size, multiple sub-blocks within the circular buffer are interleaved such that the bit sequence related to probability shaping (i.e., at least one second sub-block) follows a bit sequence of length sub1 that is not related to probability shaping (i.e., the first sub-block). The bit sequence related to probability shaping includes a' 0,0 ,a' 0,1 ,a' 0,2,...,a' 0,M-1 (i.e., the bit sequence after probabilistic shaping). Optionally, the bit sequence related to probabilistic shaping also includes a 1,0 ,a 1,1 ,a 1,2 ,...,a 1,K1-1 (i.e., bits used to assist in probability shaping) are some or all of the bits. A bit sequence of length sub1 that is unrelated to probability shaping includes a 2,0 ,a 2,1 ,a 2,2 ,...,a 2,K2-1 The bit sequence used to determine the symbols of the modulation constellation points. Optionally, a bit sequence of length sub1 that is unrelated to probabilistic shaping may also include some or all of the bits in the LDPC-encoded check bit sequence. Examples of the sub-block relationships in the bit sequence after sub-block interleaving can be found in the descriptions of Figures 6(a) to 6(c). For example, for the examples in Figures 7(a) to 7(d), after sub-block interleaving, a result illustrated in one of Figures 6(a) to 6(c) can be obtained. Exemplarily, the sub-block interleaving sequence can be determined based on the number of bits in the probabilistically shaped bit sequence. The sub-block interleaving sequence indicates the method of sub-block interleaving. Based on this method, the requirements for probabilistic shaping retransmission can be adapted.

[0267] As an example, sub1 = E / (Qm / 2). For instance, when Qm = 4, the sub-block interleaving sequence can be [1 0]. Here, "0" represents the first sub-block, and "1" represents the second sub-block. [1 0] indicates interleaving the first and second sub-blocks. Wherein, when the sub-block interleaving sequence is [1 0], the sub-block represented by "1" is a specific example of the first sub-block in the embodiment of Figure 5, and the sub-block represented by "0" is a specific example of at least one second sub-block in the embodiment of Figure 5. For another example, when Qm = 6, the sub-block interleaving sequence can be [2 0 1], [1 0 2]. Here, "0" represents the first sub-block, "1" represents the second sub-block, and "2" represents the third sub-block. [2 0 1] indicates interleaving the first and third sub-blocks, that is, placing the third sub-block before the first sub-block. [1 0 2] indicates interleaving the first and second sub-blocks, that is, placing the second sub-block before the first sub-block. Wherein, when the sub-block interleaving sequence is [2 0 1], the sub-block represented by "2" is a specific example of the first sub-block in the embodiment of Figure 5. When the sub-block interleaving sequence is [1 0 2], the sub-block represented by "1" is a specific example of the first sub-block in the embodiment of Figure 5. For example, when Qm = 8, the sub-block interleaving sequence can be [3 0 1 2], [2 0 1 3], [1 0 2 3]. Wherein, "0" represents the first sub-block, "1" represents the second sub-block, "2" represents the third sub-block, and "3" represents the fourth sub-block. [3 0 1 2] means interleaving the first sub-block with the fourth sub-block, that is, placing the fourth sub-block in front of the first sub-block. [2 0 1 3] means interleaving the first sub-block with the third sub-block, that is, placing the third sub-block in front of the first sub-block. [1 0 2 3] means interleaving the first sub-block with the second sub-block, that is, placing the second sub-block in front of the first sub-block. In this context, when the sub-block interleaving sequence is [3 0 1 2], the sub-block represented by "3" is a specific example of the first sub-block in the embodiment of Figure 5. When the sub-block interleaving sequence is [2 0 1 3], the sub-block represented by "2" is a specific example of the first sub-block in the embodiment of Figure 5. When the sub-block interleaving sequence is [1 0 2 3], the sub-block represented by "1" is a specific example of the first sub-block in the embodiment of Figure 5. For example, when Qm = 10, the sub-block interleaving sequence can be [4 0 1 2 3], [3 0 1 2 4], [2 0 1 3 4], [1 0 2 3 4]. Here, "0" represents the first sub-block, "1" represents the second sub-block, "2" represents the third sub-block, "3" represents the fourth sub-block, and "4" represents the fifth sub-block. [4 0 1 2 3] indicates that the first sub-block and the fifth sub-block are interleaved, that is, the fifth sub-block is placed in front of the first sub-block.[3 0 1 2 4] indicates that the first sub-block is interleaved with the fourth sub-block, that is, the fourth sub-block is placed in front of the first sub-block. [2 0 1 3 4] indicates that the first sub-block is interleaved with the third sub-block, that is, the third sub-block is placed in front of the first sub-block. [1 0 2 3 4] indicates that the first sub-block is interleaved with the second sub-block, that is, the second sub-block is placed in front of the first sub-block. Wherein, when the sub-block interleaving sequence is [4 0 1 2 3], the sub-block represented by "4" is a specific example of the first sub-block in the embodiment of Figure 5. When the sub-block interleaving sequence is [3 0 1 2 4], the sub-block represented by "3" is a specific example of the first sub-block in the embodiment of Figure 5. When the sub-block interleaving sequence is [2 0 1 3 4], the sub-block represented by "2" is a specific example of the first sub-block in the embodiment of Figure 5. When the sub-block interleaving sequence is [1 0 2 3 4], then the sub-block represented by "1" is a specific example of the first sub-block in the embodiment of Figure 5.

[0268] As another example, sub1 = E / Qm. For instance, when Qm = 4, the sub-block interleaving sequence could be [2 3 0 1], etc. Here, "0" represents the first sub-block, "1" represents the second sub-block, "2" represents the third sub-block, and "3" represents the fourth sub-block. [2 3 0 1] indicates that the third and fourth sub-blocks are interleaved to the beginning of the sequence. Wherein, when the sub-block interleaving sequence is [2 3 0 1], the sub-block represented by "2" is a specific example of the first sub-block in the embodiment of Figure 5. For another example, when Qm = 6, the sub-block interleaving sequence could be [4 5 0 1 2 3], [2 3 0 1 4 5], etc. Here, "0" represents the first sub-block, "1" represents the second sub-block, "2" represents the third sub-block, "3" represents the fourth sub-block, "4" represents the fifth sub-block, and "5" represents the sixth sub-block. [4 5 0 1 2 3] indicates that the fifth and sixth sub-blocks are interleaved to the beginning of the sequence. [2 3 0 1 4 5] indicates that the third and fourth sub-blocks are interleaved to the beginning of the sequence. When the sub-block interleaving sequence is [4 5 0 1 2 3], the sub-block represented by "4" is a specific example of the first sub-block in the embodiment of Figure 5. When the sub-block interleaving sequence is [2 3 0 1 4 5], the sub-block represented by "2" is a specific example of the first sub-block in the embodiment of Figure 5. For example, when Qm = 8, the sub-block interleaving sequence can be [6 7 0 1 2 3 4 5], [4 5 0 1 2 3 6 7], [2 3 0 1 4 5 6 7], etc. In this sequence, "0" represents the first sub-block, "1" represents the second sub-block, "2" represents the third sub-block, "3" represents the fourth sub-block, "4" represents the fifth sub-block, "5" represents the sixth sub-block, "6" represents the seventh sub-block, and "7" represents the eighth sub-block. [6 7 0 1 2 3 4 5] indicates that the seventh and eighth sub-blocks are interleaved to the beginning of the sequence. [4 5 0 1 2 3 6 7] indicates that the fifth and sixth sub-blocks are interleaved to the beginning of the sequence. [2 3 0 1 4 5 6 7] indicates that the third and fourth sub-blocks are interleaved to the beginning of the sequence. When the sub-block interleaving sequence is [6 7 0 1 2 3 4 5], the sub-block represented by "6" is a specific example of the first sub-block in the embodiment shown in Figure 5. When the sub-block interleaving sequence is [4 5 0 1 2 3 6 7], the sub-block represented by "4" is a specific example of the first sub-block in the embodiment of Figure 5. When the sub-block interleaving sequence is [2 3 0 1 4 5 6 7], the sub-block represented by "2" is a specific example of the first sub-block in the embodiment of Figure 5.For example, when Qm = 10, the sub-block interleaving sequence can be [8 9 0 1 2 3 4 5 6 7], [6 7 0 1 2 3 4 5 8 9], [4 5 0 1 2 3 6 7 8 9], [2 3 0 1 4 5 6 7 8 9], etc. Here, "0" represents the first sub-block, "1" represents the second sub-block, "2" represents the third sub-block, "3" represents the fourth sub-block, "4" represents the fifth sub-block, "5" represents the sixth sub-block, "6" represents the seventh sub-block, "7" represents the eighth sub-block, "8" represents the ninth sub-block, and "9" represents the tenth sub-block. [8 9 0 1 2 3 4 5 6 7] means interleaving the ninth and tenth sub-blocks to the beginning of the sequence. [6 7 0 1 2 3 4 5 8 9] indicates that the seventh and eighth sub-blocks are interleaved to the beginning of the sequence. [4 5 0 1 2 3 6 7 8 9] indicates that the fifth and sixth sub-blocks are interleaved to the beginning of the sequence. [2 3 0 1 4 5 6 7 8 9] indicates that the third and fourth sub-blocks are interleaved to the beginning of the sequence. Wherein, when the sub-block interleaving sequence is [8 9 0 1 2 3 4 5 6 7], the sub-block represented by "8" is a specific example of the first sub-block in the embodiment of Figure 5. When the sub-block interleaving sequence is [6 7 0 1 2 3 4 5 8 9], the sub-block represented by "6" is a specific example of the first sub-block in the embodiment of Figure 5. When the sub-block interleaving sequence is [4 5 0 1 2 3 6 7 8 9], the sub-block represented by "4" is a specific example of the first sub-block in the embodiment of Figure 5. When the sub-block interleaving sequence is [2 3 0 1 4 5 6 7 8 9], the sub-block represented by "2" is a specific example of the first sub-block in the embodiment of Figure 5.

[0269] Step 8: The first communication device performs row and column interleaving on the E bits in the ring buffer to obtain the bit sequence to be modulated.

[0270] For example, the E bits in the circular buffer are named e0, e1, e2, ..., e E-1 This indicates that for e0, e1, e2, ..., e E-1 Perform row and column interleaving to obtain the bit sequence to be modulated, f0, f1, f2, ..., f E-1 .

[0271] For example, Where i = 1, 2, ..., E-1. Q m This represents the modulation order. For details on the specific implementation of interleaving, please refer to the preceding description.

[0272] Step 8 is a specific example of step 502 in the embodiment of Figure 5 above. In this step, when selecting E bits, the first communication device first determines the starting point of the redundancy version, and then selects E bits starting from the starting point of the redundancy version, and performs row and column interleaving on the E bits to obtain the bit sequence to be modulated.

[0273] Step 9: The first communication device transmits the bit sequence to be modulated f0, f1, f2, ..., f E-1 Constellation mapping modulation is performed to obtain a modulation symbol sequence.

[0274] Step 9 is a specific example of step 503 in the embodiment of Figure 5 above.

[0275] Step 10: The first communication device transmits the modulation symbol sequence.

[0276] The following describes another embodiment with reference to Figure 8, which also ensures retransmission performance.

[0277] Figure 8 is a flowchart illustrating a communication method provided in an embodiment of this application. The method includes the following steps:

[0278] Step 801: The first communication device performs channel coding on the bit sequence to be encoded to obtain the encoded bit sequence.

[0279] The bit sequence to be encoded includes a probability shaping-related bit sequence and a bit sequence for determining the symbols of the modulation constellation points, with the bit sequence for determining the symbols of the modulation constellation points preceding the probability shaping-related bit sequence. The probability shaping-related bit sequence is either the probability-shaped bit sequence or it consists of the probability-shaped bit sequence and a bit sequence used to assist in probability shaping.

[0280] For example, the first communication device may perform bit interleaving on the information bit sequence before channel coding to obtain the bit sequence to be encoded.

[0281] The encoded bit sequence includes a probability shaping-related bit sequence and a bit sequence for determining the symbols of the modulation constellation points, with the bit sequence for determining the symbols of the modulation constellation points preceding the probability shaping-related bit sequence.

[0282] It should be noted that the encoded bit sequence and the bit sequence to be encoded have some identical bits. For example, they both contain a probability shaping related bit sequence and a bit sequence for determining the symbol of the modulation constellation point, and the bit sequence for determining the symbol of the modulation constellation point is located before the probability shaping related bit sequence.

[0283] Figure 9(a) is a schematic diagram of the bit sequence before encoding. Referring to Figure 9(a), the bit sequence before encoding includes a probability shaping related bit sequence, a bit sequence for determining the symbol of the modulation constellation point, and other bits, and the bit sequence for determining the symbol of the modulation constellation point is located before the probability shaping related bit sequence.

[0284] Optionally, the encoded bit sequence does not include information bits corresponding to columns in the parity check matrix whose column weights are greater than the column weight threshold. For example, if the parity check matrix has N columns whose column weights are greater than the column weight threshold, then the encoded bit sequence does not include information bits corresponding to those N columns.

[0285] Step 802: The first communication device determines the bit sequence to be modulated based on the encoded bit sequence.

[0286] For example, the first communication device inputs the encoded bit sequence into a ring buffer and determines a redundancy version start point (also called the RV start point). The redundancy version start point indicates the starting position of the bit sequence to be modulated. Then, starting from the bit indicated by the redundancy version start point in the ring buffer, a bit sequence of a first length is obtained as the bit sequence to be modulated. This first length can be the initial transmission length or the retransmission length, and it is related to the size of the scheduled resources. Based on this scheme, by selecting an appropriate redundancy version start point, it helps to improve the retransmission performance during probabilistic shaping transmission.

[0287] As one implementation method, the redundant version starting point is related to whether the probabilistic shaping function is enabled. That is, when the probabilistic shaping function is enabled, there is one configuration method for the redundant version starting point; when the probabilistic shaping function is disabled, there is another configuration method for the redundant version starting point.

[0288] For example, when probabilistic shaping is enabled, the starting point of the redundant version can be related to the initial transmission length E. For instance, the starting point of the redundant version could be the first bit position after the initial transmission, meaning transmission continues along the previous path, thus improving transmission performance. Alternatively, when probabilistic shaping is enabled, the starting point of the redundant version can be independent of the initial transmission length E. For example, the starting point of the redundant version could be equal to 19*Zc, or equal to 20*Zc, etc., where Zc represents the enhancement factor.

[0289] For example, when probabilistic shaping is enabled, the redundancy version starting point can be related to the modulation order Qm; for instance, the redundancy version starting point equals... For example, when Qm = 4, the redundant version starting point is equal to E / 2. As another example, when Qm = 8, the redundant version starting point is equal to 3E / 4.

[0290] For example, when the probabilistic shaping function is not enabled, the configuration method of the redundant version starting point can refer to the existing technology, and will not be repeated here.

[0291] Optionally, the first communication device and the second communication device can synchronize whether probabilistic shaping is enabled or disabled through 1 bit of control information. For example, the first communication device sends 1 bit of control information to the second communication device to indicate whether probabilistic shaping is enabled or disabled, or the second communication device sends 1 bit of control information to the first communication device to indicate whether probabilistic shaping is enabled or disabled.

[0292] As an alternative implementation, the redundant version starting point is independent of whether probabilistic shaping is enabled. That is, regardless of whether probabilistic shaping is enabled, the configuration method for the redundant version starting point is the same. For example, the redundant version starting point can be configured according to the configuration method of existing technologies. Based on this implementation method, it is compatible with existing systems.

[0293] For example, taking the example shown in Figure 9(a), the bit sequence to be encoded shown in Figure 9(a) is encoded, and the encoded bit sequence is input into a circular buffer, as shown in Figure 9(b). Referring to Figure 9(b), an RV start point is selected. The RV start point is used to indicate the starting position of the bit sequence to be modulated. Then, starting from the bit indicated by the RV start point in the circular buffer, a bit sequence of the first length is obtained as the bit sequence to be modulated. Generally, for retransmission, the position of the RV start point is not located at the starting position of the circular buffer. For example, in Figure 9(b), the position of the RV start point is located at a bit position in the probability shaping related bit sequence.

[0294] Step 803: The first communication device modulates the bit sequence to be modulated to obtain a modulated symbol sequence.

[0295] In step 804, the first communication device transmits a modulation symbol sequence. Correspondingly, the second communication device receives the modulation symbol sequence.

[0296] Step 805: The second communication device demodulates the modulated symbol sequence to obtain the demodulated symbol sequence.

[0297] Step 806: The second communication device decodes the demodulated symbol sequence to recover the original information bit sequence.

[0298] Based on the above scheme, before encoding, the bit sequence is interleaved to obtain the unencoded bit sequence. The unencoded bit sequence includes a probability shaping-related bit sequence and a bit sequence for determining the symbols used to determine the modulation constellation point. The bit sequence for determining the symbols precedes the probability shaping-related bit sequence, thus making it less likely to be selected for retransmission during retransmission. Since the reliability of the bit sequence for determining the modulation constellation point is higher than that of the probability shaping-related bit sequence, choosing not to retransmit the bit sequence for determining the modulation constellation point has a greater gain than choosing not to retransmit the probability shaping-related bit sequence. This is because the high-reliability bit sequence is more likely to be successfully transmitted and therefore less likely to be retransmitted. Therefore, this scheme, by adding sub-block interleaving operations, reduces the probability of retransmitting the high-reliability bit sequence for determining the modulation constellation point, thus helping to ensure retransmission performance.

[0299] Besides using the embodiments shown in Figures 5 and 8 to ensure retransmission performance, this application can also ensure retransmission performance through other methods. For example, the first communication device does not perform interleaving before encoding, nor does it perform sub-block interleaving after encoding. Instead, after inputting the encoded bit sequence into the ring buffer, when selecting the bits to be modulated, it does not select the bit sequence used to determine the symbol of the modulation constellation point, but instead selects the probability shaping related bit sequence, the parity bit sequence, or others, that is, it skips the selection of the bit sequence used to determine the symbol of the modulation constellation point. Based on this method, the bit sequence with higher reliability used to determine the symbol of the modulation constellation point is not retransmitted, but other bit sequences with lower reliability are retransmitted, thereby ensuring the correct transmission of the bit sequences with lower reliability and helping to improve retransmission performance.

[0300] Regarding the above embodiments, it is understood that:

[0301] (1) In the various embodiments of this application, unless otherwise specified or logically conflicting, the terminology and / or descriptions between different embodiments are consistent and can be referenced by each other. Technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationships. In addition, different implementations or different examples in the same embodiment can also be referenced or referenced by each other.

[0302] (2) The various numerical designations used in this application are merely for descriptive convenience and are not intended to limit the scope of this application. The step numbers in the above flowcharts are only examples of the execution process and do not constitute a restriction on the order of execution of the steps. That is, the size of each step number does not imply the order of execution; the execution order of each step should be determined by its function and internal logic. Furthermore, not all steps shown in the flowcharts are mandatory steps; some steps may be added or deleted based on actual needs.

[0303] The above mainly describes the solution provided by the embodiments of this application from the perspective of the interaction between the first communication device and the second communication device. It is understood that, in order to achieve the above functions, the first communication device and the second communication device may include hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should readily recognize that, in conjunction with the units and algorithm steps of the various examples described in the embodiments disclosed herein, the embodiments of this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0304] In this application embodiment, the first communication device and the second communication device can be divided into functional units according to the above method example. For example, each function can be divided into a separate functional unit, or two or more functions can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0305] In the case of using integrated units, FIG10 shows a possible exemplary block diagram of the device involved in the embodiments of this application. As shown in FIG10, the device 1000 may include a processing unit 1002 and a communication unit 1003. The processing unit 1002 is used to control and manage the operation of the device 1000. The communication unit 1003 is used to support communication between the device 1000 and other devices. Optionally, the communication unit 1003 is also called a transceiver unit, and may include a receiving unit and / or a sending unit, respectively used to perform receiving and sending operations. The device 1000 may also include a storage unit 1001 for storing the program code and / or data of the device 1000.

[0306] The device 1000 can be the first communication device in the above embodiments. The processing unit 1002 can support the device 1000 in performing the operations of the first communication device in the above method embodiments. Alternatively, the processing unit 1002 mainly performs the internal operations of the first communication device in the method embodiments, and the communication unit 1003 can support communication between the device 1000 and other devices.

[0307] For example, in one embodiment, processing unit 1002 is used to perform sub-block interleaving on the encoded bit sequence to obtain a sub-block interleaved bit sequence; wherein, the sub-block interleaved bit sequence includes multiple sub-blocks, the multiple sub-blocks include a first sub-block and at least one second sub-block, the first sub-block includes a bit sequence for determining symbols for modulation constellation points, the at least one second sub-block is a probability shaping related bit sequence, and the first sub-block is located before the at least one second sub-block; based on the sub-block interleaved bit sequence, a bit sequence to be modulated is determined; the bit sequence to be modulated is modulated to obtain a modulation symbol sequence; and communication unit 1003 is used to transmit the modulation symbol sequence.

[0308] In one possible implementation, the encoded bit sequence does not include the information bits corresponding to the shortened bits.

[0309] In one possible implementation, the encoded bit sequence does not include information bits corresponding to columns in the check matrix whose column weights are greater than the column weight threshold.

[0310] In one possible implementation, the multiple sub-blocks are of the same size and are related to the modulation order and the initial transmission length.

[0311] In one possible implementation, the processing unit 1002 is configured to determine the bit sequence to be modulated based on the bit sequence after the sub-block interleaving, including: obtaining the bit sequence to be modulated from the bit sequence after the sub-block interleaving based on a redundancy version start point, wherein the redundancy version start point is used to indicate the starting position of the bit sequence to be modulated.

[0312] In one possible implementation, the starting point of the redundant version is related to whether the probabilistic shaping function is enabled.

[0313] In one possible implementation, the starting point of the redundant version is related to the initial transmission length and / or modulation order.

[0314] In one possible implementation, the plurality of sub-blocks further includes at least one third sub-block, which is a parity bit sequence, and the at least one third sub-block is located after the at least one second sub-block.

[0315] In one possible implementation, the plurality of sub-blocks further includes at least one fourth sub-block, which is a portion of bits in the check bit sequence. The first sub-block also includes another portion of bits in the check bit sequence, and the at least one fourth sub-block is located after the at least one second sub-block.

[0316] In one possible implementation, the probability shaping-related bit sequence is the probability-shaped bit sequence; or, the probability shaping-related bit sequence consists of the probability-shaped bit sequence and a bit sequence used to assist probability shaping.

[0317] For example, in another embodiment, processing unit 1002 is used to perform channel coding on the bit sequence to be encoded to obtain an encoded bit sequence, wherein the bit sequence to be encoded includes a probability shaping related bit sequence and a bit sequence for determining the symbols of the modulation constellation point, wherein the bit sequence for determining the symbols of the modulation constellation point is located before the probability shaping related bit sequence; determining the bit sequence to be modulated based on the encoded bit sequence; modulating the bit sequence to be modulated to obtain a modulation symbol sequence; and communication unit 1003 is used to transmit the modulation symbol sequence.

[0318] In one possible implementation, the encoded bit sequence does not include information bits corresponding to columns in the check matrix whose column weights are greater than the column weight threshold.

[0319] In one possible implementation, the processing unit 1002 is configured to determine the bit sequence to be modulated based on the encoded bit sequence, including: obtaining the bit sequence to be modulated from the encoded bit sequence based on a redundancy version start point, wherein the redundancy version start point is used to indicate the starting position of the bit sequence to be modulated.

[0320] In one possible implementation, the starting point of the redundant version is related to whether the probabilistic shaping function is enabled.

[0321] In one possible implementation, the starting point of the redundant version is related to the initial transmission length and / or modulation order.

[0322] In one possible implementation, the probability shaping-related bit sequence is the probability-shaped bit sequence; or, the probability shaping-related bit sequence consists of the probability-shaped bit sequence and a bit sequence used to assist probability shaping.

[0323] The device 1000 can be the second communication device in the above embodiments. The processing unit 1002 can support the device 1000 in performing the operations of the second communication device in the above method embodiments. Alternatively, the processing unit 1002 mainly performs the internal operations of the second communication device in the method embodiments, and the communication unit 1003 can support communication between the device 1000 and other devices.

[0324] For example, in one embodiment, a communication unit 1003 is configured to receive a modulation symbol sequence, which is determined based on a bit sequence to be modulated. The bit sequence to be modulated is determined based on a sub-block interleaved bit sequence, which is obtained by interleaving the encoded bit sequence. The sub-block interleaved bit sequence includes multiple sub-blocks, including a first sub-block and at least one second sub-block. The first sub-block includes a bit sequence for determining symbols for a modulation constellation point, and the at least one second sub-block is a probability shaping related bit sequence. The first sub-block is located before the at least one second sub-block. A processing unit 1002 is configured to demodulate the modulation symbol sequence to obtain a demodulated symbol sequence; and decode the demodulated symbol sequence to recover the original information bit sequence.

[0325] In one possible implementation, the encoded bit sequence does not include the information bits corresponding to the shortened bits.

[0326] In one possible implementation, the encoded bit sequence does not include information bits corresponding to columns in the check matrix whose column weights are greater than the column weight threshold.

[0327] In one possible implementation, the multiple sub-blocks are of the same size and are related to the modulation order and the initial transmission length.

[0328] In one possible implementation, the bit sequence to be modulated is determined based on the redundant version start point and the bit sequence after sub-block interleaving, wherein the redundant version start point is used to indicate the starting position of the bit sequence to be modulated.

[0329] In one possible implementation, the starting point of the redundant version is related to whether the probabilistic shaping function is enabled.

[0330] In one possible implementation, the starting point of the redundant version is related to the initial transmission length and / or modulation order.

[0331] In one possible implementation, the plurality of sub-blocks further includes at least one third sub-block, which is a parity bit sequence, and the at least one third sub-block is located after the at least one second sub-block.

[0332] In one possible implementation, the plurality of sub-blocks further includes at least one fourth sub-block, which is a portion of bits in the check bit sequence. The first sub-block also includes another portion of bits in the check bit sequence, and the at least one fourth sub-block is located after the at least one second sub-block.

[0333] In one possible implementation, the probability shaping-related bit sequence is the probability-shaped bit sequence; or, the probability shaping-related bit sequence consists of the probability-shaped bit sequence and a bit sequence used to assist probability shaping.

[0334] For example, in another embodiment, a communication unit 1003 is configured to receive a modulation symbol sequence, which is determined based on a bit sequence to be modulated. The bit sequence to be modulated is determined based on an encoded bit sequence, which is obtained by channel coding the bit sequence to be encoded. The bit sequence to be encoded includes a probability shaping related bit sequence and a bit sequence for determining the symbols of the modulation constellation point. The bit sequence for determining the symbols of the modulation constellation point is located before the probability shaping related bit sequence. A processing unit 1002 is configured to demodulate the modulation symbol sequence to obtain a demodulated symbol sequence; and decode the demodulated symbol sequence to recover the original information bit sequence.

[0335] In one possible implementation, the encoded bit sequence does not include information bits corresponding to columns in the check matrix whose column weights are greater than the column weight threshold.

[0336] In one possible implementation, the bit sequence to be modulated is determined based on a redundancy version start point and the encoded bit sequence, wherein the redundancy version start point is used to indicate the starting position of the bit sequence to be modulated.

[0337] In one possible implementation, the starting point of the redundant version is related to whether the probabilistic shaping function is enabled.

[0338] In one possible implementation, the starting point of the redundant version is related to the initial transmission length and / or modulation order.

[0339] In one possible implementation, the probability shaping-related bit sequence is the probability-shaped bit sequence; or, the probability shaping-related bit sequence consists of the probability-shaped bit sequence and a bit sequence used to assist probability shaping.

[0340] It should be understood that the division of units in the above device is merely a logical functional division. In actual implementation, they can be fully or partially integrated into a single physical entity, or they can be physically separated. Furthermore, all units in the device can be implemented entirely through software calls from processing elements; all units can be implemented entirely in hardware; or some units can be implemented through software calls from processing elements, and some units can be implemented in hardware. For example, each unit can be a separate processing element, or it can be integrated into a chip within the device. Alternatively, it can be stored as a program in memory, called and executed by a processing element of the device. Moreover, these units can be fully or partially integrated together, or implemented independently. The processing element mentioned here can also be called a processor, which can be an integrated circuit with signal processing capabilities. In the implementation process, the operations of the above methods or the various units mentioned above can be implemented through integrated logic circuits in the processor element or through software calls from processing elements.

[0341] In one example, a unit in any of the above devices can be one or more integrated circuits configured to implement the methods described above, such as: one or more application-specific integrated circuits (ASICs), or one or more digital signal processors (DSPs), or one or more field-programmable gate arrays (FPGAs), or a combination of at least two of these forms of integrated circuits. As another example, when a unit in the device can be implemented in the form of a processing element scheduler, the processing element can be a processor, such as a general-purpose central processing unit (CPU), or other processor capable of calling programs. Furthermore, these units can be integrated together and implemented as a System-on-a-Chip (SoC).

[0342] The receiving unit described above is an interface circuit of the device, used to receive signals from other devices. For example, when the device is implemented as a chip, the receiving unit is an interface circuit for the chip to receive signals from other chips or devices. The transmitting unit described above is an interface circuit of the device, used to transmit signals to other devices. For example, when the device is implemented as a chip, the transmitting unit is an interface circuit for the chip to transmit signals to other chips or devices.

[0343] Based on the same technical concept, this application also provides a communication device for implementing the functions of the first or second communication device described above. As shown in FIG11, the device may be a communication equipment or a component within a communication equipment (e.g., a processor, chip, or chip system). The device includes a processor 1101 and a communication interface 1102, and optionally, a memory 1103. The memory 1103 may be independent of the processor 1101 or integrated into the processor 1101; no specific limitation is made. It is understood that FIG11 only shows the main components of the communication device. Furthermore, the communication device may further include input / output devices (not shown in the figure).

[0344] The processor 1101 is used to execute the program code stored in the memory 1103, specifically to perform the actions of the aforementioned processing unit 1002, which will not be described in detail here. The communication interface 1102 is specifically used to perform the actions of the aforementioned communication unit 1003, which will not be described in detail here.

[0345] Processor 1101 can be a CPU, a digital processing unit, etc. Processor 1101 can be used to process communication protocols and communication data, control the entire communication device, execute software programs, and process software program data, such as, but not limited to, baseband-related processing. Communication interface 1102 can be used for transmitting and receiving signals, such as, but not limited to, radio frequency transceiver. The above-mentioned devices can be disposed on separate chips, or at least partially or entirely on the same chip. For example, processor 1101 can be further divided into an analog baseband processor and a digital baseband processor. The analog baseband processor can be integrated with the transceiver on the same chip, while the digital baseband processor can be disposed on a separate chip. With the continuous development of integrated circuit technology, more and more devices can be integrated on the same chip. For example, a digital baseband processor can be integrated with multiple application processors (such as, but not limited to, graphics processors, multimedia processors, etc.) on the same chip. Such a chip can be called a system-on-a-chip (SoC). Whether to dispose of individual devices independently on different chips or integrate them on one or more chips often depends on the specific needs of the product design. The embodiments of the present invention do not limit the specific implementation of the above-mentioned devices.

[0346] The communication interface 1102 can be a transceiver, an interface circuit such as a transceiver circuit, or a transceiver chip, etc. Optionally, the communication interface 1102 may include a radio frequency (RF) circuit and an antenna. The RF circuit is mainly used for converting baseband signals to RF signals and processing RF signals. The antenna is mainly used for transmitting and receiving RF signals in the form of electromagnetic waves. Input / output devices, such as touch screens, displays, and keyboards, are mainly used for receiving user input data and outputting data to the user.

[0347] Memory 1103 is used to store the program executed by processor 1101. Memory 1103 can be non-volatile memory, such as a hard disk drive (HDD) or solid-state drive (SSD), or it can be volatile memory, such as random-access memory (RAM). Memory 1103 can be any other medium capable of carrying or storing desired program code in the form of instructions or data structures that can be accessed by a computer, but is not limited thereto.

[0348] When the communication device is powered on, the processor 1101 can read the software program in the memory 1103, interpret and execute the instructions of the software program, and process the data of the software program. When data needs to be transmitted wirelessly, the processor 1101 performs baseband processing on the data to be transmitted and outputs the baseband signal to the radio frequency (RF) circuit. The RF circuit processes the baseband signal and transmits the RF signal outward in the form of electromagnetic waves through the antenna. When data is sent to the communication device, the RF circuit receives the RF signal through the antenna, converts the RF signal into a baseband signal, and outputs the baseband signal to the processor 1101. The processor 1101 converts the baseband signal into data and processes the data.

[0349] In another implementation, the radio frequency circuitry and antenna can be set up independently of the processor performing baseband processing. For example, in a distributed scenario, the radio frequency circuitry and antenna can be arranged remotely, independent of the communication device.

[0350] This application embodiment does not limit the specific connection medium between the communication interface 1102, processor 1101, and memory 1103. In Figure 11, the memory 1103, processor 1101, and communication interface 1102 are connected via a bus 1104, which is represented by a thick line in Figure 11. The connection methods between other components are only illustrative and are not intended to be limiting. Buses can be divided into address buses, data buses, control buses, etc. For ease of illustration, only one thick line is used in Figure 11, but this does not mean that there is only one bus or one type of bus.

[0351] Optionally, the communication device described above can be a standalone device or part of a larger device. For example, the communication device can be:

[0352] (1) An independent integrated circuit (IC), or chip, or chip system or subsystem;

[0353] (2) A collection of one or more ICs, optionally including a storage component for storing data and instructions;

[0354] (3) Application-specific integrated circuit (ASIC), such as modem;

[0355] (4) Modules that can be embedded in other devices;

[0356] (5) Receivers, smart terminals, wireless devices, handheld devices, mobile units, vehicle-mounted devices, cloud devices, artificial intelligence devices, etc.;

[0357] (6) Others, etc.

[0358] In this application embodiment, "multiple" can refer to two or more. Therefore, in this application embodiment, "multiple" can also be understood as "at least two". "At least one" can be understood as one or more, such as one, two, or more. For example, "including at least one" means including one, two, or more. For example, including at least one of A, B, and C, then it could include A, B, C, A and B, A and C, B and C, or A, B, and C. "And / or" describes the association relationship between related objects. Specifically, there can be three relationships. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, or B existing alone. Additionally, the character " / ", unless otherwise specified, generally indicates that the preceding and following related objects have an "or" relationship.

[0359] Furthermore, the terms "system" and "network" in the embodiments of this application can be used interchangeably, as can "according to" and "based on". The ordinal numbers such as "first" and "second" mentioned in the embodiments of this application are generally used to distinguish different objects and are not used to limit the order, sequence, priority, or importance of multiple objects. For example, the first communication device and the second communication device in the embodiments of this application are used to distinguish between two communication devices, and do not limit the priority or importance of these two communication devices.

[0360] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0361] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to this application. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in one or more blocks of the flowchart illustrations and / or one or more blocks of the block diagrams.

[0362] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means that implement the functions specified in one or more flowcharts and / or one or more block diagrams.

[0363] These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process, such that the instructions, which execute on the computer or other programmable apparatus, provide steps for implementing the functions specified in one or more flowcharts and / or one or more block diagrams.

Claims

1. A communication method, characterized in that, include: The encoded bit sequence is sub-block interleaved to obtain the sub-block interleaved bit sequence; wherein, the sub-block interleaved bit sequence includes multiple sub-blocks, the multiple sub-blocks include a first sub-block and at least one second sub-block, the first sub-block includes a bit sequence for determining the symbols of the modulation constellation point, the at least one second sub-block is a probability shaping related bit sequence, and the first sub-block is located before the at least one second sub-block; Based on the bit sequence after the sub-block interleaving, determine the bit sequence to be modulated; The bit sequence to be modulated is modulated to obtain a modulated symbol sequence; The modulation symbol sequence is transmitted.

2. The method as described in claim 1, characterized in that, The encoded bit sequence does not include the information bits corresponding to the shortened bits.

3. The method as described in claim 1 or 2, characterized in that, The encoded bit sequence does not include information bits corresponding to columns in the check matrix whose column weights are greater than the column weight threshold.

4. The method according to any one of claims 1 to 3, characterized in that, The multiple sub-blocks are of the same size and are related to the modulation order and the initial transmission length.

5. The method according to any one of claims 1 to 4, characterized in that, Determining the bit sequence to be modulated based on the bit sequence after the sub-block interleaving includes: Based on the redundancy version start point, the bit sequence to be modulated is obtained from the bit sequence after the sub-block interleaving. The redundancy version start point is used to indicate the starting position of the bit sequence to be modulated.

6. The method as described in claim 5, characterized in that, The starting point of the redundant version is related to whether the probabilistic shaping function is enabled.

7. The method as described in claim 5 or 6, characterized in that, The starting point of the redundant version is related to the initial transmission length and / or modulation order.

8. The method according to any one of claims 1 to 7, characterized in that, The plurality of sub-blocks further includes at least one third sub-block, the at least one third sub-block being a parity bit sequence, and the at least one third sub-block being located after the at least one second sub-block.

9. The method according to any one of claims 1 to 7, characterized in that, The plurality of sub-blocks further includes at least one fourth sub-block, the at least one fourth sub-block being a portion of bits in the check bit sequence, the first sub-block further including another portion of bits in the check bit sequence, and the at least one fourth sub-block being located after the at least one second sub-block.

10. The method according to any one of claims 1 to 9, characterized in that, The bit sequence related to probability shaping is the bit sequence after probability shaping; or... The bit sequence associated with probability shaping consists of the bit sequence after probability shaping and the bit sequence used to assist in probability shaping.

11. A communication method, characterized in that, include: The receiver receives a modulation symbol sequence, which is determined based on a bit sequence to be modulated. The bit sequence to be modulated is determined based on a sub-block interleaved bit sequence, which is obtained by interleaving the encoded bit sequence into sub-blocks. The sub-block interleaved bit sequence includes multiple sub-blocks, which include a first sub-block and at least one second sub-block. The first sub-block includes a bit sequence for determining symbols for a modulation constellation point. The at least one second sub-block is a probability shaping related bit sequence. The first sub-block is located before the at least one second sub-block. The modulated symbol sequence is demodulated to obtain the demodulated symbol sequence; The demodulated symbol sequence is decoded to recover the original information bit sequence.

12. The method as described in claim 11, characterized in that, The encoded bit sequence does not include the information bits corresponding to the shortened bits.

13. The method as described in claim 11 or 12, characterized in that, The encoded bit sequence does not include information bits corresponding to columns in the check matrix whose column weights are greater than the column weight threshold.

14. The method according to any one of claims 11 to 13, characterized in that, The multiple sub-blocks are of the same size and are related to the modulation order and the initial transmission length.

15. The method according to any one of claims 11 to 14, characterized in that, The bit sequence to be modulated is determined based on the redundant version start point and the bit sequence after sub-block interleaving. The redundant version start point is used to indicate the starting position of the bit sequence to be modulated.

16. The method as described in claim 15, characterized in that, The starting point of the redundant version is related to whether the probabilistic shaping function is enabled.

17. The method as described in claim 15 or 16, characterized in that, The starting point of the redundant version is related to the initial transmission length and / or modulation order.

18. The method according to any one of claims 11 to 17, characterized in that, The plurality of sub-blocks further includes at least one third sub-block, the at least one third sub-block being a parity bit sequence, and the at least one third sub-block being located after the at least one second sub-block.

19. The method according to any one of claims 11 to 17, characterized in that, The plurality of sub-blocks further includes at least one fourth sub-block, the at least one fourth sub-block being a portion of bits in the check bit sequence, the first sub-block further including another portion of bits in the check bit sequence, and the at least one fourth sub-block being located after the at least one second sub-block.

20. The method according to any one of claims 11 to 19, characterized in that, The bit sequence related to probability shaping is the bit sequence after probability shaping; or... The bit sequence associated with probability shaping consists of the bit sequence after probability shaping and the bit sequence used to assist in probability shaping.

21. A communication device, characterized in that, The device includes a processor coupled to a memory storing a computer program; the processor is configured to invoke part or all of the computer program in the memory such that the method as claimed in any one of claims 1 to 10 is executed, or the method as claimed in any one of claims 11 to 20 is executed.

22. A communication system, characterized in that, The communication system includes a first communication device and a second communication device; wherein the first communication device is used to perform the method as described in any one of claims 1 to 10, and the second communication device is used to perform the method as described in any one of claims 11 to 20.

23. A computer-readable storage medium, characterized in that, The storage medium stores a computer program that, when some or all of the computer program is executed by a computer, causes the method as described in any one of claims 1 to 10 to be executed, or causes the method as described in any one of claims 11 to 20 to be executed.

24. A computer program product, characterized in that, When the computer reads and executes the computer program product, the method as described in any one of claims 1 to 10 is performed, or the method as described in any one of claims 11 to 20 is performed.

Images