Communication method and communication apparatus

Abstract

A communication method and a communication apparatus. In the method, a receiving end and a sending end construct, on the basis of L, a bit sequence to be encoded having a length of N: formula (I), wherein E is a transformed codeword sequence, the bit sequence to be encoded comprises a first bit sequence having a length of K and a bit sequence to be transformed having a length of (E-K), and L is a positive integer. In the method, the first L bit positions may be pre-frozen, and the first bit sequence is placed on K bit positions with high reliability selected from among the remaining bit positions on the basis of reliability. In addition, among all remaining bit positions except the K bit positions with high reliability, the bit sequence to be transformed is placed on bit positions other than those corresponding to a rate matching index set, wherein the rate matching index set indicates the first (N-E) bit positions. The method may be used to implement polar-DM transformation, and the performance of a polar-DM may be improved on the basis of a corresponding polar code construction mode, thereby improving communication performance.

Description

Communication methods and communication devices

[0001] This application claims priority to Chinese Patent Application No. 202411629647.0, filed on November 13, 2024, entitled "Communication Method and Communication Device", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of coding, and more specifically, to a communication method and a communication device. Background Technology

[0003] Polar codes, as a distribution matcher (DM), offer excellent performance and are simple to implement. In current Polar channel coding, the rate-matching method of repeating Polar codes in new radio (NR) signals can improve the stability of Polar code construction (i.e., the Polar code construction corresponding to a code length E just exceeding the mother code length N, for example, E equals 530 and N equals 512). However, in transform implementations such as Polar-DM, when the length of the transformed (or shaped) codeword sequence just exceeds the mother code, the rate-matching method leads to suboptimal Polar-DM performance, thus affecting communication quality. Summary of the Invention

[0004] Embodiments of this application provide a communication method and a communication device that can improve communication quality.

[0005] In a first aspect, a communication method is provided, which can be executed by a transmitting device. Unless otherwise specified, the term "transmitting device" in this application can refer to the transmitting device itself (e.g., a network device, a terminal device), a component in the transmitting device (e.g., a processor, a chip, or a chip system), or a logic module or software that can implement all or part of the functions of the transmitting device.

[0006] The method includes: determining the length N of the bit sequence to be encoded, E is the length of the transformed codeword sequence. This indicates rounding up. The bit sequence to be encoded includes a first bit sequence of length K and a bit sequence to be transformed of length (EK), where K and E are positive integers. Based on the bit sequence to be encoded, a first codeword sequence is obtained. The first bit sequence is carried on bits corresponding to the first sequence number set. The first sequence number set consists of the K most reliable sub-channels determined by reliability from the first candidate sequence number set. The first candidate sequence number set includes the remaining sequence numbers in the first reliability sequence excluding the second sequence number set. The first reliability sequence includes the sequence numbers of N sub-channels. The sequence numbers of the N sub-channels are arranged in the first reliability sequence according to the reliability of the N sub-channels. The second sequence number set includes L integers from 0 to (L-1), where L is a positive integer. The bit sequence to be transformed is carried on the corresponding bit bits of the third sequence number set. The third sequence number set includes the remaining sequence numbers in the fourth sequence number set excluding the first rate matching sequence number set. The fourth sequence number set is the remaining sequence numbers in the first reliability sequence excluding the first sequence number set. The first rate matching sequence number set includes (NE) integers from 0 to (NE-1).

[0007] It can also be understood that the K sub-channels with high reliability can be the K sub-channels with the highest reliability or the K sub-channels with relatively high reliability; this application does not impose any restrictions.

[0008] It can also be understood that the first candidate sequence set can be seen as pre-freezing the first L bits of the N bits of the bit sequence to be encoded, that is, the first L bits must not be placed in the first bit sequence.

[0009] The above technical solution can be used to implement polar-DM conversion. Based on the above polar code construction method, the performance of polar-DM can be improved, thereby improving communication performance.

[0010] In some implementations of the first aspect, the bits carried on the bit positions corresponding to the first rate matching sequence number set are 0.

[0011] In some implementations of the first aspect, L is greater than or equal to N / 2.

[0012] In the above technical solution, if L is greater than or equal to N / 2, pre-freezing the first L bits of the N bits of the bit sequence to be encoded based on L can effectively reduce the length of the Polar code mother code.

[0013] Example, Where, n = max{min{n1, n2, n... max}, n min}, n min =5, n during uplink transmission max =10, n during downlink transmission max =9, if And K / E < 9 / 16, otherwise, Among them, R min =1 / 8.

[0014] For example, L is determined based on L0 and / or L1, where, when And when K / E < 9 / 16, then Otherwise, L0 = 0, when hour, To meet Maximum 2 n Otherwise, L1 = 0.

[0015] For example, L is equal to the maximum of L0 and L1, or L is equal to either L0 or L1.

[0016] In some implementations of the first aspect, the method further includes: performing bit selection on the first codeword sequence to obtain a transformed codeword sequence, the transformed codeword sequence including the last E bits of the first codeword sequence.

[0017] It is understood that the bit selection method described above is a puncturing method. In this application, the bit selection method can also be called a rate matching method, which will not be elaborated on further in subsequent sections.

[0018] It's also understandable that when L is not equal to 0, enabling sub-block interleaving will degrade the performance of the polar code. For example, with E=530 and N=1024, interleaving the 1024 bits after encoding will result in poorer puncturing positions in the polar code, thus degrading its performance.

[0019] In some implementations of the first aspect, the above transformation is a polar code-based distributed matcher (DM) transformation.

[0020] In some implementations of the first aspect, the value of the first flag bit is a first numerical value, which indicates that the polar code is used to implement the DM function.

[0021] The above technical solution introduces a flag bit. Taking I_shaping as an example, when polar codes are used to implement polar-DM transformation, I_shaping is set to 1; when polar codes are used for channel coding, I_shaping is set to 0.

[0022] Secondly, a communication method is provided, which can be executed by a transmitting device. Unless otherwise specified, the term "transmitting device" in this application can refer to the transmitting device itself (e.g., a network device, a terminal device), a component in the transmitting device (e.g., a processor, a chip, or a chip system), or a logic module or software that can implement all or part of the functions of the transmitting device.

[0023] The method includes: determining the length N of the bit sequence to be encoded, E is the length of the transformed codeword sequence. This indicates rounding up. The bit sequence to be encoded includes a first bit sequence of length K and a bit sequence to be transformed of length (EK), where K and E are positive integers. If L = 0, the first codeword sequence is obtained based on the bit sequence to be encoded. The first bit sequence is carried on the bits corresponding to the fifth sequence number set. The fifth sequence number set consists of the sequence numbers of the K sub-channels with high reliability determined according to reliability in the second candidate sequence number set. When K / E < 7 / 16 and E ≥ 3N / 4, the second candidate sequence number set includes the remaining sequence numbers in the first reliability sequence excluding the second rate matching sequence number set and the sixth sequence number set. The sixth sequence number set includes numbers from 0 to... In The second candidate sequence number set includes the remaining sequences in the first reliability sequence excluding the second rate matching sequence number set and the seventh sequence number set. The seventh sequence number set includes numbers from 0 to... In The set of 200 integers is given. When K / E ≥ 7 / 16, the second candidate sequence number set includes the remaining sequence numbers in the first reliability sequence excluding the second rate matching sequence number set. When K / E < 7 / 16, the second rate matching sequence number set is the first (NE) sequence numbers in the sequence number set obtained after sub-block interleaving of the sequence numbers in the natural sequence number set. When K / E ≥ 7 / 16, the second rate matching sequence number set is the last (NE) sequence numbers in the sequence number set obtained after sub-block interleaving of the sequence numbers in the natural sequence number set. The natural sequence number set includes N different integers from 0 to (N-1) in ascending order. The bit sequence to be transformed is carried on the bit bits corresponding to the eighth sequence number set. The eighth sequence number set is the remaining sequence numbers in the ninth sequence number set excluding the second rate matching sequence number set. The ninth sequence number set includes the remaining sequence numbers in the first reliability sequence excluding the fifth sequence number set.

[0024] In some implementations of the second aspect, the bits carried on the bit positions corresponding to the second rate matching sequence number set are 0.

[0025] In some implementations of the second aspect, the method further includes: performing sub-block interleaving on the first codeword sequence to obtain a second codeword sequence; performing bit selection on the second codeword sequence to obtain a transformed codeword sequence, wherein if K / E < 7 / 16, the transformed codeword sequence includes the last E bits of the second codeword sequence, and if K / E ≥ 7 / 16, the transformed codeword sequence includes the first E bits of the second codeword sequence.

[0026] In some implementations of the first or second aspect, the first bit sequence is obtained by decoding the log-likelihood ratio (LLR) value corresponding to the target distribution and the bit sequence to be transformed, or the first bit sequence is a random bit sequence, which is not restricted here.

[0027] Thirdly, a communication method is provided, which can be executed by a receiving device. Unless otherwise specified, the term "receiving device" in this application can refer to the receiving device itself (e.g., a network device, a terminal device), a component in the receiving device (e.g., a processor, a chip, or a chip system), or a logic module or software that can implement all or part of the functions of the receiving device.

[0028] The method includes: obtaining a second bit sequence of length E, where E is the length of the transformed codeword sequence and E is a positive integer; obtaining a third bit sequence of length E based on the second bit sequence, the third bit sequence including a transformed bit sequence of length (EK) and K being a positive integer, wherein the bits carrying the transformed bit sequence in the third bit sequence are determined based on a third sequence number set, the third sequence number set including the remaining sequences in a fourth sequence number set excluding the first rate matching sequence number set, and the fourth sequence number set being the remaining sequences in the first reliability sequence excluding the first sequence number set. The remaining sequence numbers are as follows: the first rate matching sequence number set includes (NE) integers from 0 to (NE-1); the first sequence number set consists of the K most reliable sub-channels determined by reliability from the first candidate sequence number set; the first candidate sequence number set includes the remaining sequence numbers from the first reliability sequence excluding the second sequence number set; the first reliability sequence includes the sequence numbers of N sub-channels, which are arranged according to their reliability; and the second sequence number set includes L integers from 0 to (L-1), where L is a positive integer.

[0029] For the beneficial effects of the third aspect, please refer to the description of the first aspect, which will not be repeated here.

[0030] In some implementations of the third aspect, L is greater than or equal to N / 2.

[0031] Example, Where, n = max{min{n1, n2, n...max}, n min}, n min =5, n during uplink transmission max =10, n during downlink transmission max =9, if And K / E < 9 / 16, otherwise, Indicates rounding up. Among them, R min =1 / 8.

[0032] For example, L equals the maximum of L0 and L1, where, when And when K / E < 9 / 16, then Otherwise, L0 = 0. Indicates rounding up, when hour, To meet Maximum 2 n Otherwise, L1 = 0.

[0033] In some implementations of the third aspect, the transformation is a polar code-based distributed matcher DM transform.

[0034] In some implementations of the third aspect, the first flag bit is set to a first value, which indicates that the polar code is used to implement the DM conversion.

[0035] Fourthly, a communication method is provided, which can be executed by a receiving device. Unless otherwise specified, the term "receiving device" in this application can refer to the receiving device itself (e.g., a network device, a terminal device), a component in the receiving device (e.g., a processor, a chip, or a chip system), or a logic module or software that can implement all or part of the functions of the receiving device.

[0036] The method includes: obtaining a second bit sequence of length E, where E is the length of the transformed codeword sequence and E is a positive integer; obtaining a third bit sequence of length E based on the second bit sequence, the third bit sequence including a transformed bit sequence of length (EK), where K is a positive integer. If L = 0, the bits of the transformed bit sequence carried by the third bit sequence are determined based on an eighth sequence set. The eighth sequence set includes the remaining sequences in the ninth sequence set excluding the second rate matching sequence set. The ninth sequence set includes the remaining sequences in the first reliability sequence excluding the fifth sequence set. The fifth sequence set consists of the sequences of the K sub-channels with high reliability determined based on reliability in the second candidate sequence set. When K / E < 7 / 16 and E ≥ 3N / 4, the second candidate sequence set includes the remaining sequences in the first reliability sequence excluding the second rate matching sequence set and the sixth sequence set. The sixth sequence set includes sequences from 0 to... In The second candidate sequence number set includes the remaining sequences in the first reliability sequence excluding the second rate matching sequence number set and the seventh sequence number set. The seventh sequence number set includes numbers from 0 to... In The second candidate sequence number set includes the remaining sequence numbers in the first reliability sequence excluding the second rate matching sequence number set. When K / E ≥ 7 / 16, the second rate matching sequence number set is the first (NE) sequence numbers in the sequence number set obtained by sub-block interleaving of the sequence numbers in the natural sequence number set. When K / E ≥ 7 / 16, the second rate matching sequence number set is the last (NE) sequence numbers in the sequence number set obtained by sub-block interleaving of the sequence numbers in the natural sequence number set. The natural sequence number set includes N integers from 0 to (N-1) in ascending order.

[0037] In some implementations of the third or fourth aspect Where, n = max{min{n1, n2, n... max}, n min}, n min =5, n during uplink transmission max =10, n during downlink transmission max =9, if And K / E < 9 / 16, otherwise, Among them, R min =1 / 8.

[0038] In some implementations of the third or fourth aspect, L is determined based on L0 and / or L1, where, when And when K / E < 9 / 16, then Otherwise, L0 = 0, when hour, To meet Maximum 2 n Otherwise, L1 = 0.

[0039] For example, L is equal to the maximum of L0 and L1, or L is equal to either L0 or L1.

[0040] Fifthly, a communication apparatus is provided for performing the method provided in any of the above aspects or their implementations. Specifically, the apparatus may include units and / or modules for performing the method provided in any of the above aspects or their implementations, such as processing units and / or transceiver units.

[0041] In one implementation, the device is either a transmitting device or a receiving device. When the device is a transmitting device or a receiving device, the transceiver unit can be a transceiver, an input / output interface, or a communication interface; the processing unit can be at least one processor. Optionally, the transceiver is a transceiver circuit. Optionally, the input / output interface is an input / output circuit.

[0042] In another implementation, the device is a chip, chip system, or circuit used in a transmitting or receiving device. When the device is a chip, chip system, or circuit used in a transmitting or receiving device, the transceiver unit can be an input / output interface, interface circuit, output circuit, input circuit, pin, or related circuit on the chip, chip system, or circuit; the processing unit can be at least one processor, processing circuit, or logic circuit.

[0043] In a sixth aspect, a communication device is provided, comprising: a memory for storing a program; and at least one processor for executing the computer program or instructions stored in the memory to perform the method provided in any of the foregoing aspects or their implementations.

[0044] In one implementation, the device is either a transmitting device or a receiving device.

[0045] In another implementation, the device is a chip, chip system, or circuit used in a transmitting or receiving device.

[0046] In a seventh aspect, a communication device is provided, comprising: at least one processor and a communication interface, the at least one processor being configured to obtain a computer program or instructions stored in a memory via the communication interface to execute the method provided in any of the foregoing aspects or their implementations. The communication interface may be implemented in hardware or software.

[0047] In one implementation, the device further includes the memory.

[0048] Eighthly, a processor is provided for executing the methods provided in the above aspects.

[0049] Unless otherwise specified, or if it does not contradict its actual function or internal logic in the relevant description, the transmission and acquisition / reception operations involved in the processor can be understood as processor output and reception, input and other operations, or as transmission and reception operations performed by radio frequency circuits and antennas. This application does not limit them in this regard.

[0050] Ninthly, a computer-readable storage medium is provided that stores program code for execution by a device, the program code including methods for performing any of the foregoing aspects or their implementations.

[0051] In a tenth aspect, a computer program product containing instructions is provided, which, when run on a computer, causes the computer to perform the method provided in any of the foregoing aspects or their implementations.

[0052] Eleventhly, a chip is provided, comprising a processor and a communication interface. The processor reads instructions stored in memory through the communication interface and executes the methods provided in any of the above aspects or their implementations. The communication interface can be implemented in hardware or software.

[0053] Optionally, as one implementation, the chip also includes a memory that stores computer programs or instructions. The processor is used to execute the computer programs or instructions stored in the memory. When the computer programs or instructions are executed, the processor is used to perform the methods provided by any of the above aspects or their implementations.

[0054] When the method provided in this application is executed by a chip, this application does not limit the specific number of chips implementing the method. For example, it can be executed by one chip, or by two or more chips. Furthermore, when the number of chips implementing the method is two or more, the chip manufacturers are not limited; they can be from the same manufacturer or different manufacturers.

[0055] In a twelfth aspect, a communication system is provided, comprising at least one of the transmitting end device or receiving end device described above. Attached Figure Description

[0056] Figure 1 is a schematic diagram of the network architecture applicable to an embodiment of this application.

[0057] Figure 2 is a schematic diagram of the information transmission process.

[0058] Figure 3 is a schematic diagram of a Polar code encoding of length 8.

[0059] Figure 4 is a schematic diagram of SC decoding.

[0060] Figure 5 is a schematic flowchart of probabilistic shaping technology.

[0061] Figure 6 shows the constellation distribution after probabilistic shaping.

[0062] Figure 7 is a schematic diagram of the DM implementation based on Polar codes.

[0063] Figures 8 and 9 are schematic flowcharts of a communication method provided in this application.

[0064] Figures 10 and 11 are schematic block diagrams of a communication device provided in an embodiment of this application. Detailed Implementation

[0065] To facilitate understanding of the embodiments of this application, the following points will be explained before introducing the embodiments of this application.

[0066] The terms "for indicating" or "instruction" can include both direct and indirect indication, or they can be explicit and / or implicit. The various numerical designations such as "first," "second," etc., are merely for descriptive convenience and are not intended to limit the scope of the embodiments of this application, such as distinguishing different messages or different information. The term "protocol" can refer to standard protocols in the field of communications, such as the Long Term Evolution (LTE) protocol, the New Radio (NR) protocol, and related protocols applied to future communication systems; this application does not limit this. Words such as "exemplary," "for example," "exemplarily," and "as (another) example" are used to indicate that something is an example, illustration, or description. Any embodiment or design described as "exemplary" in this application should not be construed as being more preferred or advantageous than other embodiments or designs. The terms "comprising," "including," "having," and variations thereof all mean "including but not limited to," unless otherwise specifically emphasized. "At least one" means one or more, and "more than one" means two or more. "At most one" means one or zero. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can mean: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, and c can mean: a, or, b, or, c, or, a and b, or, a and c, or, b and c, or, a, b, and c. Here, a, b, and c can be single or multiple. Descriptions involving network element A sending messages, information, or data to network element B, and network element B receiving messages, information, or data from network element A, aim to specify which network element the message, information, or data is to be sent to, without specifying whether they are sent directly or indirectly through other network elements. Descriptions such as “when…”, “under…”, “if”, and “if” all indicate that the device will take corresponding actions under certain objective circumstances. They are not time-limited, nor do they require the device to make a judgment action when implementing the action, nor do they imply any other limitations.

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

[0068] The following describes a communication system to which embodiments of this application can be applied.

[0069] The embodiments of this application can be applied to various communication systems, including but not limited to: 5th generation (5G) systems, LTE systems, long term evolution-advanced (LTE-A) systems, LTE frequency division duplex (FDD) systems, LTE time division duplex (TDD) systems, and future communication systems. Furthermore, they can also be applied to device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, machine-to-machine (M2M) communication, machine-type communication (MTC), Internet of Things (IoT) communication systems, narrowband Internet of Things (NB-IoT) systems, or other communication systems. Furthermore, it can be extended to similar wireless communication systems, such as Wireless-Fidelity (WiFi), Worldwide Interoperability for Microwave Access (WIMAX), and communication systems related to the 3rd Generation Partnership Project (3GPP), without limitation.

[0070] The communication system applicable to embodiments of this application may include one or more transmitting devices and one or more receiving devices. Optionally, one of the transmitting device and the receiving device may be a terminal device, and the other may be a network device. Optionally, both the transmitting device and the receiving device may be terminal devices. Optionally, both the transmitting device and the receiving device may be network devices.

[0071] Figure 1 is a schematic diagram of a network architecture applicable to an embodiment of this application. As shown in Figure 1, the embodiments of this application can be applied to both uplink and downlink data transmission. Figure 1 only uses uplink or downlink data transmission between one network device and two terminal devices (such as terminal device 1 and terminal device 2) as an example. In uplink data transmission, the sending device is the terminal device and the receiving device is the network device; conversely, in downlink data transmission, the sending device is the network device and the receiving device is the terminal device. Furthermore, the applicability of the embodiments of this application in other communication scenarios is not limited; for example, they can also be applied to sidelink communication.

[0072] The terminal equipment in this application can also be referred to as user equipment (UE), access terminal, user unit, user station, mobile station, mobile station, mobile terminal (MT), remote station, remote terminal, mobile device, user terminal, terminal, drone, wireless communication equipment, user agent, or user device, etc. The terminal equipment in the embodiments of this application can be a device that provides voice and / or data connectivity to a user, and can be used to connect people, objects, and machines, such as handheld devices with wireless connectivity, vehicle-mounted devices, etc. The terminal devices in the embodiments of this application may be mobile phones, tablets, laptops, handheld computers, mobile internet devices (MIDs), wearable devices, virtual reality (VR) devices, augmented reality (AR) devices, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical surgery, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, etc.

[0073] The network equipment in this application can be a device with wireless transceiver capabilities, which can be a device that provides wireless communication services. It is usually located on the network side, including but not limited to next-generation base stations (gNodeB, gNB) in 5G systems, base stations in sixth-generation mobile communication systems, base stations in future mobile communication systems, or access nodes in wireless fidelity (WiFi) systems, evolved node B (eNB), radio network controller (RNC), node B (NB), base station controller (BSC), home base station (e.g., home evolved NodeB or home Node B, HNB), base band unit (BBU), transmission reception point (TRP), transmitting point (TP), base transceiver station (BTS), satellites, drones, etc. in long term evolution (LTE) systems. In a network architecture, network equipment may include centralized unit (CU) nodes, distributed unit (DU) nodes, or RAN equipment including CU and DU nodes, or RAN equipment including control plane CU nodes, user plane CU nodes, and DU nodes. Alternatively, network equipment may also be a radio controller, relay station, vehicle-mounted equipment, or wearable device in a cloud radio access network (CRAN) scenario. Furthermore, a base station may be a macro base station, micro base station, relay node, donor node, or a combination thereof. A base station may also refer to a communication module, modem, or chip installed within the aforementioned equipment or apparatus. A base station may also be a mobile switching center and equipment performing base station functions in D2D, V2X, and M2M communications, network-side equipment in future communication networks, or equipment performing base station functions in future communication systems. A base station may support networks with the same or different access technologies, without limitation.

[0074] Unless otherwise specified, the means for implementing the functions of a terminal device or network device in this application can refer to the terminal device or network device itself, or it can refer to a means that enables the terminal device or network device to implement the functions, such as a chip system or chip, specifically a system-on-a-chip (SoC) or a modem. This means can be installed in the terminal device or network device. In the embodiments of this application, the chip system can be composed of chips, or it can include chips and other discrete devices.

[0075] It should also be noted that some embodiments in this article use a 5G system as an example to introduce specific solution details. It is understood that when this solution is used in other communication systems, such as LTE systems, or future communication systems, the messages, channels, or information in the solution can be replaced with messages, channels, or information in other communication systems that can achieve the corresponding functions, and this application does not limit this.

[0076] Furthermore, the embodiments of this application can be applied to various application scenarios, such as high-throughput scenarios, high-reliability scenarios, low-latency scenarios, high-reliability low-latency scenarios, or low-power scenarios. Among them, high-throughput scenarios can be, for example, enhanced mobile broadband (eMBB) scenarios, high-reliability low-latency scenarios can be, for example, URLLC (ultra-reliable low-latency communication) scenarios, and low-power scenarios can be, for example, M2M scenarios, MTC scenarios, or IoT scenarios.

[0077] Figure 2 is a schematic diagram of the information transmission process. As shown in Figure 2, information is sent from the source and undergoes processing such as source coding, channel coding, modulation, air interface transmission, demodulation, channel decoding, and source recovery before reaching the destination, completing the transmission of information from the source to the destination. The processing shown in the upper layer of Figure 2 (including source coding, channel coding, and modulation) is performed at the transmitting end device, while the processing shown in the lower layer (including demodulation, channel decoding, and source recovery) is performed at the receiving end device. The embodiments of this application mainly involve the source coding, channel coding, channel decoding, and source recovery shown in Figure 2.

[0078] Currently, Polar codes are the first channel coding scheme that can be rigorously proven to "achieve" Shannon channel capacity. They possess advantages such as good error correction performance and low decoding complexity, and have been selected by 3GPP as the coding scheme for the control channel in 5G eMBB scenarios (uplink / downlink). The following is a brief introduction to the encoding, construction, and decoding process of Polar channel coding (Polar-code) with reference to Figures 3 and 4.

[0079] Figure 3 is a schematic diagram of an 8-bit Polar code encoding. The encoding process includes several polarization kernel operations (the polarization kernels are indicated by a gray background). The polarization kernel ANDs the two input bits... Multiplying them yields two output bits. It can be seen that the Polar code is constructed recursively. An 8-length Polar code can be seen as a result of coupling two 4-length Polar codes (corresponding to the two dashed boxes in the diagram), and a 4-length Polar code can be seen as a result of coupling two 2-length Polar codes.

[0080] The construction process of Polar codes is used to determine the information bits and frozen bits. Currently, the standard specifies a reliability sequence Q, where each value represents the index of a sub-channel. The position of the index in sequence Q characterizes the reliability of the corresponding sub-channel. For example, for a sequence of length 8, Q = [0 1 2 4 3 5 6 7], it means that the sub-channel with index 7 is the most reliable, and the sub-channel with index 6 is the second most reliable. For example, a Polar code of length N is constructed, where N is the parent code sequence. Based on the reliability sequence Q of length N, the K indices corresponding to the K most reliable sub-channels are determined. The K information (data) bits are placed in the bits corresponding to the K indices in the N bits, and the remaining (NK) bits are placed with frozen bits, which are typically 0. In this application, the position carrying K information bits can be called an information bit position, and the position carrying frozen bits can be called a frozen bit position. The frozen bit positions are known at both the transmitting and receiving ends during actual transmission. For example, as shown in Figure 3, N = 8, and 8 bits are used to carry 8 bits to be encoded. These 8 bits are the leftmost bits u0 to u7, including 4 information bits (u7, u6, u5, u3). The remaining 4 bits are used to place frozen bits (u4, u2, u1, u0). As shown in Figure 3, after encoding, the rightmost 8 codeword bits 01010101 are denoted as c0 to c7, and the transmitting device sends c0 to c7 to channel W.

[0081] For Polar code decoding, a successive cancellation decoding (SC) algorithm can be used as an example. In SC, the decoding result is determined directly by hard decision. Specifically, the log-likelihood ratio (LLR) of the information bits is calculated step by step. For an information bit, if LLR > 0, the bit is determined to be 0; if LLR < 0, the bit is determined to be 1. For frozen bits, the bit is set to 0 regardless of the LLR value.

[0082] Figure 4 is a schematic diagram of SC decoding. There are 8 computation nodes in the diagram, including 4 f nodes and 4 g nodes. The computation of an f node requires two LLR inputs to its right, and the computation of a g node requires two LLR inputs to its right and one "Partial Sum" input above it. It can be understood that the output term can only be calculated after the input terms are calculated. According to the above rules, starting from the received signal on the right, the 8 nodes are calculated sequentially, and the order of the decoded bits obtained is ①→②→③→④. This process is the SC decoding process. In addition, the industry has proposed the Successive Cancellation List (SCL) decoding algorithm. The SCL algorithm is an extension of the SC algorithm. The SCL algorithm does not directly determine the decoding result through hard decision in the intermediate process, but instead saves the decoding results corresponding to 0 and 1 as two branch decoding paths. Using the above method, if the SCL algorithm stores a total of List decoding paths and finally filters out the correct path using the path metric (PM), the List paths can be sorted from smallest to largest PM. The decoding path that appears earlier in the sorted list is more likely to be the correct codeword. That is, the path with the optimal PM (i.e., the first path, the path with the smallest PM) is output as the final codeword.

[0083] As is understandable, after obtaining the encoded codeword sequence, a rate matching operation needs to be performed on the codeword sequence to obtain a codeword sequence of length E, where E is the actual transmission bitstream length of the channel. Rate matching will be introduced below.

[0084] Currently, the rate matching scheme for Polar codes in NR includes two steps: sub-block interleaving and bit selection. We will first introduce sub-block interleaving, assuming the codeword sequence after Polar code encoding is d0, d1, d2, ..., d... N-1 The rate is matched to the input bitstream (i.e., d0, d1, d2, ..., d). N-1 The codeword sequence is divided into 32 sub-blocks, each with a length of N / 32. Then, it is interleaved according to the interleaving pattern shown in Table 1. The resulting codeword sequence is y0, y1, y2, ..., y N-1 The pseudocode for sub-block interleaving is shown below:

[0085] Table 1

[0086] Next, we will introduce bit selection. Bit selection involves choosing to discard or repeat some bits based on the relationship between the rate-matched input bitstream length N and the actual transmitted bitstream length E of the channel. There are three modes of rate matching: puncture, shortening, and repetition.

[0087] Specifically, when E ≥ N, the repetition mode is used, requiring the addition of repeated bits to the original bitstream; when E < N, the relationship between K / E needs to be compared. If K / E ≤ 7 / 16, the puncturing mode is used, directly extracting the codeword sequence y0, y1, y2, ..., y N-1 The last E bits; if K / E > 7 / 16, then the shortening mode is used, and the codeword sequence y0, y1, y2, ..., y is directly extracted. N-1 The first E bits.

[0088] Currently, when E < N, the process of constructing Polar codes for rate-matched Polar codes by the transmitting device is as follows: First, according to the bit selection method, the (NE) bits that need to be punctured or shortened from the N bits corresponding to the N bits to be encoded are pre-frozen (in this application, these (NE) bits can be called rate-matching pre-frozen bits; in rate matching involving sub-block interleaving, the rate-matching pre-frozen bits are determined based on J(n) in the pseudocode of sub-block interleaving, and these bits must not be used as information bits); then, an additional portion of bits are pre-frozen; finally, K bits are selected from the remaining bits to carry K information bits, and the sub-channel corresponding to these K bits is the most reliable sub-channel among the sub-channels corresponding to the remaining bits. If rate matching includes sub-block interleaving, the pseudocode of the above process is as follows:

[0089] Here, Q1 and Q2 represent the sets containing all the indices in set Q1 that are also in set Q2, and these will not be elaborated upon further in the following text. Additionally, Given a reliability sequence of length N, This is the set of sub-channel sequence numbers corresponding to the information bits. This is the set of subchannel sequence numbers corresponding to the frozen bits.

[0090] Currently, Polar codes can be used as encoding methods for transforms (such as DM transforms) to achieve probabilistic shaping transmission. In high-order modulation, different symbols may have different energies; by transmitting more low-energy symbols and fewer high-energy symbols, transmission power can be reduced. Probabilistic shaping is a common "shaping" technique that saves transmission power by changing the distribution of symbols. A typical flowchart is shown in Figure 5. As shown in Figure 5, by cascading a precoder before the channel encoder, the information bits are mapped ("shaped") to a sequence following a specific distribution. These information bits can also be called the bits to be shaped. The precoder can be called a DM, or a probabilistic shaping pretransform, etc. Then, systematic coding is used during the encoding process, so that the sequence satisfying the specific distribution ultimately appears directly in the encoded sequence, thus shaping the final modulation symbols. It should be noted that Figure 5 shows one possible implementation of the probabilistic shaping pretransform; other pretransform methods are also possible, and this is only an example. In Figure 5, the bit sequence to be encoded is u1u2…u K The bit sequence u1u2…u z As input for channel coding; another part of the bit sequence u z+1 u z+2 …u K As the input to the probabilistic shaping pretransform, the output of the probabilistic shaping pretransform is the bit sequence p1p2…p s Without probabilistic shaping pretransformation, the input to channel coding is a bit sequence u1u2…u z At this point, the input length of the channel coding is K1 = z = K; however, when the probabilistic shaping pretransform is enabled, the input of the channel coding is a bit sequence u1u2…u z The bit sequence p1p2…p of the output of the probabilistic shaping pretransform s In these two parts, the input length for channel coding is K1 = z + s. Figure 6 shows a schematic diagram of the constellation distribution after probabilistic shaping. It can be seen that the probability of low-energy symbols appearing is higher than that of high-energy symbols, thus achieving the effect of saving average energy.

[0091] Figure 7 is a schematic diagram of the implementation of the Polar code-based DM function (hereinafter referred to as Polar-DM). When the Polar code is used as a distribution matcher, a Polar code of length N can be constructed, as shown in Figure 7. For N bits, the A bits with the lowest reliability are selected to carry the original information bits to be shaped, and the remaining (NA) bits are used to carry auxiliary bits. During distribution matching, the A original information bits to be shaped are placed in the A bits with the lowest reliability. The decoder uses the LLR value corresponding to the target distribution as the sequence of symbols to be decoded (the LLR input on the right side of Figure 7), and then performs SC decoding to obtain the decoding result of the auxiliary bits corresponding to the remaining (NA) bits. Afterwards, the original information bits to be shaped and the decoded auxiliary bit sequence are polar encoded to obtain the encoded bit sequence, which is output as the shaped result. Polar-DM has the following advantages: ① It can reuse the existing SC decoder in the current device for shaping, without requiring additional chip area. ② The decoding complexity can be reduced by using the fast decoding algorithm of the SC decoder.

[0092] It is understandable that, as described above, the K information bits in Polar-code need to be placed on the K bits with high reliability, excluding the pre-frozen bits, and the A original information bits to be shaped in Polar-DM need to be placed on the A bits with the lowest reliability out of the N bits.

[0093] In future communication systems, low-complexity probabilistic shaping based on Polar-DM transform (also known as polar-DM function) is a possible standard trend. In current Polar-code, NR Polar codes improve the stability of Polar code construction by introducing a shortened mother code (the Polar code construction corresponding to E greater than N). However, in implementations based on Polar-DM transform, when the length of the shaped bit sequence just exceeds the length of the mother code, forcibly shortening the mother code will result in repeated bits in the Polar-DM output sequence, leading to suboptimal Polar-DM construction.

[0094] In view of this, this application provides a communication method that can effectively solve the above-mentioned technical problems. The embodiments of the method proposed in this application are described below.

[0095] Figure 8 is a schematic flowchart of a communication method 800 provided in this application. The method includes the following steps.

[0096] It is understood that method 800 can be executed by the sending device. Unless otherwise specified, "sending device" can refer to the sending device itself or a device that enables the sending device to perform this function. For ease of description, the term "sending device" will be used uniformly below. The sending device can be a terminal device or a network device.

[0097] S801, the transmitting device determines the length N of the bit sequence to be encoded.

[0098] in, E is the length of the transformed codeword sequence. This indicates rounding up. The bit sequence to be encoded includes a first bit sequence of length K and a bit sequence to be transformed of length (EK), where K and E are positive integers.

[0099] The transformations described in this application can also be replaced by shaping or forming, and this application does not specifically limit them.

[0100] The transformation in this application may be referred to as a polar code-based DM transformation, or a polar code-based DM function, or a polar code-based DM precoding.

[0101] It's understandable, when If E = 530, then N = 1024. If E = 512, then N = 512.

[0102] It can also be understood that the transformed codeword can be understood as a codeword sequence after rate matching.

[0103] For example, the first bit sequence in this application may also be referred to as the auxiliary bit sequence. This application does not specifically limit the name of the first bit sequence.

[0104] S802, the transmitting device determines the bit sequence to be encoded as u = [u0, u1, u2...u...]. N-1 The first codeword sequence d = [d0, d1, d2...d] is obtained. N-1 ].

[0105] The process of obtaining the first codeword sequence from the bit sequence to be encoded in this application is not specifically limited. For example, the transmitting device can perform polar code encoding on the bit sequence to be encoded to obtain the first codeword sequence. The following describes how to determine the bits carrying the first bit sequence and the bits of the bit sequence to be transformed from the N bits of the bit sequence to be encoded.

[0106] It is understood that this application introduces a parameter L, which is a non-negative integer. When L equals 0 and L does not equal 0, the corresponding polar code construction methods are different. Therefore, the bits carrying the first bit sequence and the bit sequence to be transformed in the N bits of the bit sequence to be encoded are different. Thus, the obtained bit sequence to be encoded u and the encoded first codeword sequence d are also different.

[0107] For example, when L is not equal to 0, L is greater than or equal to N / 2.

[0108] The following examples first provide two possible ways to determine L.

[0109] Method 1

[0110] (1) Calculate n1. If K / E < 9 / 16, and but otherwise, In this application, This indicates rounding up; further explanation will not be provided below.

[0111] (2) Calculate n2. Among them, R min =1 / 8.

[0112] (3) Calculate n. n = max{min{n1, n2, n... max}, n min}, where n min =5, n during uplink transmission max =10, n during downlink transmission max =9.

[0113] (4) Calculate L.

[0114] Understandable. So, if Then L = 0; if L is not equal to 0, because Then L≥N / 2

[0115] For example, when E = 534 and K = 267, n1 = 9 and n2 = 12, then n = max{min{9, 12, 10}, 5} = 9 and L = 512.

[0116] For example, when E = 534, K = 384, n1 = 10, n2 = 12, then n = max{min{10, 12, 10}, 5} = 10, L = 0.

[0117] Method 2

[0118] In one possible implementation, L is related to L0 and L1. For example, L is the maximum of L0 and L1, i.e., L = max(L0, L1).

[0119] In another possible implementation, L is only related to L0 or L1. For example, L = L0 or L = L1.

[0120] The following example illustrates how L0 and L1 are calculated.

[0121] (1) Calculate L0.

[0122] when And when K / E < 9 / 16, then Otherwise, L0 = 0.

[0123] For example, when E = 534 and K = 267, the above conditions are met, then L0 = 512.

[0124] For example, when E = 534 and K = 384, K / E < 9 / 16 is not satisfied. Therefore, L0 = 0.

[0125] For example, when E = 640, it does not satisfy the condition. Then L0 = 0.

[0126] (2) Calculate L1.

[0127] when Otherwise, L1 = 0. Wherein, To meet Maximum 2 n .

[0128] For example, when E = 534 and K = 267, the condition is not met. Then L1 = 0.

[0129] For example, when E = 534 and K = 384, the condition is not met. Then L1 = 0.

[0130] For example, when E = 512 and K = 16, it satisfies Then L1 = 384.

[0131] (3) Determine L.

[0132] For example, L = max(L0, L1). For example, when E = 534 and K = 267, L = 512. For example, when E = 534 and K = 384, L = 0.

[0133] In the two methods described above, L = 0 or L ≥ N / 2. When L ≥ N / 2, pre-freezing the first L bits of the N bits of the bit sequence to be encoded based on L can effectively reduce the length of the Polar code mother code.

[0134] The above provides an example illustrating how L is determined. In this application, when L = 0, the polar code corresponding to polar-DM can be constructed in the manner of polar-code. When L is not equal to 0, the polar code will be constructed based on L.

[0135] The following sections explain the construction methods of polar codes in different cases.

[0136] (1) Polar code construction method corresponding to L not being equal to 0:

[0137] ① Determine the candidate sequence number set #1 based on L.

[0138] The candidate sequence number set #1 includes the remaining sequence numbers in the first reliability sequence, excluding the sequence number set #1. The first reliability sequence includes the sequence numbers of N sub-channels, which are arranged according to their reliability. The sub-channel with sequence number S is associated with the S-th bit of the N bits in the bit sequence to be encoded. The sequence number set #1 includes L distinct integers from 0 to (L-1) (for example, if L = 5, then the sequence number set #1 is {0, 1, 2, 3, 4}).

[0139] It can also be understood that pre-freezing L bits can effectively reduce the length of the Polar code mother code. The difference between the pre-freezing scheme and the one corresponding to Polar code is that the number of pre-frozen bits is less than N / 2, so it cannot reduce the length of the mother code.

[0140] For example, the first reliability sequence of length 8 can be {0,1,2,4,3,5,6,7}. Among them, the channel with sequence number 7 is the most reliable sub-channel, the channel with sequence number 6 is the second most reliable channel, and the channel with sequence number 0 is the least reliable channel.

[0141] ② Determine the sequence number set #2 and sequence number set #3 based on the candidate sequence number set #1.

[0142] Sequence set #2 consists of the K most reliable sub-channels determined from candidate sequence set #1 based on reliability. The K bits corresponding to sequence set #2 out of the N bits of the bit sequence to be encoded are used to carry the first bit sequence of length K.

[0143] It is understood that the K sub-channels with high reliability can be either the K sub-channels with the highest reliability or the K sub-channels with relatively high reliability; this application does not impose any restrictions. The following descriptions of "high reliability" can be understood in the same way and will not be elaborated further.

[0144] It can also be understood that the candidate sequence number set #1 can be seen as pre-freezing the first L bits of the N bits of the bit sequence to be encoded, that is, the first L bits must not be placed in the first bit sequence.

[0145] Sequence set #3 includes the remaining (NK) sequence numbers in the first reliability sequence excluding sequence set #2. It can be understood that sequence set #3 includes the first rate matching sequence set and sequence set #4. The first rate matching sequence set includes (NE) distinct integers from 0 to (NE-1), i.e., the first rate matching sequence set is {0,1,2…NE-1}. Sequence set #4 includes the remaining (EK) sequence numbers in sequence set #3 excluding the first rate matching sequence set. The bits corresponding to sequence set #4 in the N bits of the bit sequence to be encoded are used to carry the bit sequence to be transformed of length (EK).

[0146] Based on the description of the polar code construction above, when L is not equal to 0, the first bit sequence of length K is carried in the K bits corresponding to sequence number #2 of the N bits of the bit sequence to be encoded, and the bit sequence of length (EK) to be transformed is carried in the bits corresponding to sequence number #4 of the N bits of the bit sequence to be encoded. For example, the bits in the N bits of the bit sequence to be encoded that correspond to the first rate matching sequence number are generally set to 0.

[0147] The following describes how to determine the bits in the K bits corresponding to sequence number #7 (i.e., how to determine the first bit sequence).

[0148] In one implementation, the first bit sequence can be obtained through decoding. Specifically, the bit sequence to be transformed is placed in the bit position corresponding to the sequence number set #4 among the N bit positions. The decoder uses the LLR value corresponding to the target distribution as the sequence of symbols to be decoded, and then performs decoding to obtain the decoding result of the first bit sequence corresponding to the K bit positions of the sequence number set #2.

[0149] As can be understood, the target distribution refers to the expected distribution pattern of the transformed codeword sequence. For example, the bit sequence to be transformed follows a uniform distribution, while the target distribution refers to a non-uniform distribution, such as a skewed distribution or a Gaussian distribution.

[0150] For example, the first bit sequence can be obtained by decoding using the SC decoding algorithm, the successive cancellation list (SCL) decoding algorithm, or any other algorithm. This application does not impose any restrictions.

[0151] In another implementation, the K bits corresponding to sequence number #2 out of the N bits in the bit sequence to be encoded (i.e., the first bit sequence) can be randomly selected. For example, all of them can be set to 0. This implementation method can reduce the implementation complexity on the transmitting side.

[0152] (2) Polar code construction method corresponding to L=0:

[0153] ① Determine the candidate sequence number set #2.

[0154] When K / E < 7 / 16 and E ≥ 3N / 4, the candidate sequence number set #2 includes the remaining sequences in the first reliability sequence excluding the second rate matching sequence number set and sequence number set #5. Sequence number set #5 includes sequences from 0 to... middle 1 distinct integer.

[0155] When K / E < 7 / 16 and E < 3N / 4, the candidate sequence number set #2 includes the remaining sequences in the first reliability sequence excluding the second rate matching sequence number set and sequence number set #6. Sequence number set #6 includes numbers from 0 to... middle 1 distinct integer.

[0156] When K / E≥7 / 16, the candidate sequence number set #2 includes the remaining sequence numbers in the first reliability sequence excluding the second rate matching sequence number set.

[0157] When K / E < 7 / 16, the second rate matching sequence number set is the first (NE) sequence numbers in the sequence number set obtained after sub-block interleaving of the sequence numbers in the natural sequence number set. When K / E ≥ 7 / 16, the second rate matching sequence number set is the last (NE) sequence numbers in the sequence number set obtained after sub-block interleaving of the sequence numbers in the natural sequence number set. The natural sequence number set includes N different integers from 0 to (N-1) in ascending order (i.e., the natural sequence number set is {0,1,2…N-1}).

[0158] For example, the numbers in the set of natural sequence numbers can be interleaved based on the sub-block interleaving pattern shown in Table 1.

[0159] For example, regarding the determination of the candidate sequence set #2, please refer to the pseudocode above. In this way.

[0160] ② Determine the sequence number set #7 and sequence number set #8 based on the candidate sequence number set #2.

[0161] Sequence set #7 includes the sequence numbers of the K most reliable sub-channels from candidate sequence set #2. The bits corresponding to sequence set #7 out of the N bits of the bit sequence to be encoded are used to carry the first bit sequence.

[0162] Sequence set #8 includes the remaining (NK) sequences from the first reliability sequence, excluding sequence set #7. It can be understood that sequence set #8 includes the second rate-matching sequence set and sequence set #9, and sequence set #9 includes the remaining (EK) sequences from sequence set #8, excluding the second rate-matching sequence set. The bits corresponding to sequence set #9 out of the N bits of the bit sequence to be encoded are used to carry the bit sequence to be transformed.

[0163] The process of polar code encoding is described in Figure 3, and will not be repeated here.

[0164] Based on the description of the polar code construction above, when L=0, the first bit sequence of length K is carried in the K bits corresponding to sequence number #7 of the N bits of the bit sequence to be encoded, and the bit sequence of length (EK) to be transformed is carried in the bits corresponding to sequence number #9 of the N bits of the bit sequence to be encoded. For example, the bits in the N bits of the bit sequence to be encoded that correspond to the bits in the second rate matching sequence number set are generally set to 0.

[0165] In one implementation, the first bit sequence can be obtained through decoding. In another implementation, the first bit sequence can be randomly selected. For details on both implementations, please refer to the description in "L ≠ 0", which will not be repeated here.

[0166] Optionally, the method also includes S803.

[0167] S803, the transmitting device performs a rate matching operation on the first codeword sequence to obtain the transformed codeword sequence.

[0168] (1) L is not equal to 0:

[0169] During rate matching, sub-block interleaving is not enabled; bit selection is performed on the first codeword sequence. As shown above, the first rate matching sequence number set is {0,1,2,3…NE-1}. Therefore, the transformed codeword sequence includes the last E bits of the first codeword sequence.

[0170] It is understandable that the bit was selected using a punched hole method.

[0171] It's also understandable that when L is not equal to 0, enabling sub-block interleaving will degrade the performance of the polar code. For example, with E=530 and N=1024, interleaving 1024 bits will result in poorer puncturing positions in the polar code, thus degrading its performance.

[0172] (2) L = 0:

[0173] When rate matching is enabled and sub-block interleaving is allowed, the first codeword sequence must first be sub-block interleaved before bit selection. For example, the first codeword sequence d = [d0, d1, d2...d...]. N-1 After sub-block interleaving, the second codeword sequence is obtained as y = [y0, y1, y2...y]. N-1 Then, bit selection is performed on the second codeword sequence y to obtain the transformed codeword sequence.

[0174] Specifically, if K / E < 7 / 16, and the bit selection method is puncturing, then the transformed codeword sequence, including the second codeword sequence, is y = [y0, y1, y2...y]. N-1 The last E bits of the codeword; if K / E ≥ 7 / 16, the bit selection method is shortening, and the transformed codeword sequence including the second codeword sequence is y = [y0, y1, y2...y]. N-1 The first E bits of ].

[0175] Optionally, when L=0, sub-block interleaving can be disabled during rate matching, and only bit selection is required. This approach is compatible with the natural order rate matching method. However, it should be noted that if sub-block interleaving is disabled, the second rate matching sequence number set in S803 needs to be replaced with the third rate matching sequence number set. Specifically, when K / E < 7 / 16, the third rate matching sequence number set includes 0 to (NE-1) distinct integers (NE); when K / E ≥ 7 / 16, the third rate matching sequence number set includes E to (N-1) distinct integers (NE).

[0176] The above method can be used to construct polar codes based on polar-DM functionality. Below are two possible pseudocode implementations that support polar-DM functionality.

[0177] One possible implementation is that the pseudocode can support both Polar-DM and Polar-code simultaneously. The description of Polar-DM functionality can be added to the description of Polar-code, keeping the existing Polar-code description unchanged and only adding new descriptions supporting Polar-DM functionality where they cannot be shared, thus supporting both Polar-DM and Polar-code simultaneously. A new parameter L can be introduced into the description of Polar-code. When Polar code is used to implement Polar-DM functionality, parameter L is calculated based on the method described above in S802. L equals 0 or a positive integer. If L = 0, the construction method of Polar code for Polar-DM is the same as that for Polar code for Polar code. If L is a positive integer, the construction method corresponding to L not equal to 0 is used. When Polar code is used to implement Polar code, L = 0, and the existing Polar code construction method for Polar code is used.

[0178] For example, a flag can be introduced into the description of the polar code. Taking I_shaping as an example, when the polar code is used to implement the polar-DM function, I_shaping = 1; when the polar code is used for polar-code, I_shaping = 0, and vice versa. Then, when I_shaping = 1, L can be calculated based on method one; otherwise, I_shaping = 0, and L = 0. Afterward, the subsequent polar code construction method can be determined based on whether L equals 0.

[0179] For example, this flag bit can be carried in the medium / media access control (MAC) control element (CE) or downlink control information (DCI). This application does not specifically limit the signaling carrying the flag bit.

[0180] For example, this flag can be associated with the modulation and coding scheme (MCS). When the MCS number is greater than a given value, the polar code is used to implement the polar-DM function (i.e., activate shaping); otherwise, the polar code is used for polar-code (i.e., do not activate shaping).

[0181] The pseudocode for this implementation is given below as an example.

[0182] 1) Determine the length N of the mother code.

[0183] 2) Freeze bits

[0184] in, Let N be a reliability sequence.

[0185] If polar codes are used for channel coding, then This is the set of sub-channel sequence numbers corresponding to the information bits. This is the set of subchannel sequence numbers corresponding to the frozen bits.

[0186] If polar codes are used to implement DM functions, then This is the set of subchannel numbers corresponding to the bits used to carry the first bit sequence. This is the set of sub-channel sequence numbers corresponding to the frozen bits. The frozen bits include a set of rate matching sequence numbers and a set of sub-channel sequence numbers corresponding to the bits used to carry the bit sequence to be transformed, which will not be elaborated here.

[0187] 3) Rate matching

[0188] a) Sub-block interweaving

[0189] b) Bit selection

[0190] Another possible implementation is that the pseudocode can support the Polar-DM function independently, and this code can reuse the description in the corresponding pseudocode of Polar-code.

[0191] The pseudocode for this implementation is similar to that of the implementation above, except that this implementation does not require the `I_shaping` check when determining the mother code length. For example, the pseudocode for determining the mother code length N is shown below:

[0192] For example, since N≥E is supported when Polar-DM functionality is enabled, when reusing the description of bit selection in Polar-code, descriptions of repeated bit selection methods when E≥N can be deleted, and other branches can be followed when N=E. Alternatively, the description of Polar-code when E≥N can be reused, and that branch can be followed when N=E.

[0193] Optionally, the method may further include the following S804 to S805.

[0194] S804, the transmitting device determines the symbol sequence based on the transformed codeword sequence.

[0195] It can be understood that the Polar-DM function can be regarded as precoding as shown in Figure 5. After obtaining the transformed codeword sequence (i.e. the codeword sequence after rate matching), the transmitting device can perform encoding, interleaving, modulation and other operations based on the transformed codeword sequence to obtain the modulation symbol sequence to be transmitted.

[0196] S805, the transmitting device maps the modulated symbol sequence onto physical resources and sends the symbol sequence to the receiving device.

[0197] It is understandable that when the transmitting device is a chip, it can output the symbol sequence to other modules (such as radio frequency modules or antennas) connected to the transmitting device, and these modules can then send the symbol sequence to the receiving device.

[0198] The method shown in Figure 8 above describes the encoding process at the sending end in detail. The decoding process at the receiving end will be described below.

[0199] Figure 9 is a schematic flowchart of a communication method 900 provided in this application. The method includes the following steps.

[0200] It is understood that method 900 can be executed by the receiving device. Unless otherwise specified, "receiving device" can refer to the receiving device itself or a device that enables the receiving device to perform this function. For ease of description, the term "receiving device" will be used uniformly below. The receiving device can be a terminal device or a network device.

[0201] S901, the receiving device acquires a second bit sequence of length E, where E is an integer.

[0202] It can be understood that the second bit sequence is the decoding result corresponding to the transformed codeword sequence in method 800, that is, the length of the second bit sequence is the same as the length E of the transformed bit sequence in method 800.

[0203] S902, the receiving device obtains a third bit sequence of length E based on the second bit sequence. This third bit sequence includes a first bit sequence of length K and a transformed bit sequence of length (EK), where K is a positive integer.

[0204] This step can be understood as obtaining a third bit sequence of length E by reversing the encoding process shown in Figure 3. The third bit sequence includes the bits carried in the remaining positions except for the rate matching bit in method 800.

[0205] It is understandable that when L equals 0 and L does not equal 0, due to the different construction methods of the polar code, the bits carrying the first bit sequence and the bit sequence to be transformed in the E bits of the third bit sequence are different.

[0206] The calculation method for L is described in S802 and will not be repeated here.

[0207] (1) L is not equal to 0:

[0208] The bits carrying the transformed bit sequence in the third bit sequence are determined based on the sequence number set #4. The sequence number set #4 includes the (EK) remaining sequences from the sequence number set #3 excluding the first rate matching sequence number set. The sequence number set #3 includes the (NK) remaining sequences from the first reliability sequence excluding the sequence number set #2. The first rate matching sequence number set includes (NE) different integers from 0 to (NE-1). The sequence number set #2 includes the sequences of the K most reliable sub-channels from the remaining sequences excluding the candidate sequence number set #1. The candidate sequence number set #1 includes the remaining sequences from the first reliability sequence excluding the sequence number set #1. The first reliability sequence includes the sequences of N sub-channels. The sequences of the N sub-channels in the first reliability sequence are arranged according to the reliability of the N sub-channels. The sequence number set #1 includes L different integers from 0 to (L-1).

[0209] For example, the E bits of the third bit sequence can be padded to N bits based on the first rate matching sequence number set, where the bits in the N bits that correspond to the bit position of sequence number set #4 are the bit sequence to be transformed (i.e. the bit sequence to be transformed corresponding to the transmitting device).

[0210] (2) L equals 0:

[0211] The bits carrying the transformed bit sequence in the third bit sequence are determined based on the sequence number set #9. The sequence number set #9 includes the remaining (EK) sequence numbers in the sequence number set #8 excluding the second rate matching sequence number set. The sequence number set #8 includes the remaining (NK) sequence numbers in the first reliability sequence excluding the sequence number set #7. The sequence number set #7 includes the sequence numbers of the K sub-channels with high reliability in the candidate sequence number set #2.

[0212] When K / E < 7 / 16 and E ≥ 3N / 4, the candidate sequence number set #2 includes the remaining sequences in the first reliability sequence excluding the second rate matching sequence number set and sequence number set #5. Sequence number set #5 includes sequences from 0 to... middle 1 distinct integer.

[0213] When K / E < 7 / 16 and E < 3N / 4, the candidate sequence number set #2 includes the remaining sequences in the first reliability sequence excluding the second rate matching sequence number set and sequence number set #6. Sequence number set #6 includes numbers from 0 to... middle 1 distinct integer.

[0214] When K / E≥7 / 16, the candidate sequence number set #2 includes the remaining sequence numbers in the first reliability sequence excluding the second rate matching sequence number set.

[0215] When K / E < 7 / 16, the second rate matching sequence number set is the first (NE) sequence numbers in the sequence number set obtained after sub-block interleaving of the sequence numbers in the natural sequence number set. When K / E ≥ 7 / 16, the second rate matching sequence number set is the last (NE) sequence numbers in the sequence number set obtained after sub-block interleaving of the sequence numbers in the natural sequence number set. The natural sequence number set includes N different integers from 0 to (N-1) in ascending order (i.e., the natural sequence number set is {0,1,2…N-1}).

[0216] For example, since sub-block interleaving occurs on the encoding side when L=0, the E bits of the second bit sequence can be padded to N bits based on the second rate matching sequence set. It can be understood that padding with N bits is only for determining the bits that will carry the bit sequence to be transformed later; no specific bit may be placed on the padded bits. Then, the N bits are deinterleaved, and the deinterleaved N bits include the E bits from the second bit sequence. Afterwards, the E bits from the second bit sequence carried on the deinterleaved N bits are subjected to the inverse operation corresponding to the encoding in Figure 3. The E bits in the N bits carry the bit sequence after the inverse operation of length E. At this point, the bits in the N bits corresponding to sequence set #9 are the transformed bit sequence (i.e., the bit sequence to be transformed corresponding to the transmitting end).

[0217] For details regarding any descriptions or parameters not covered in Figure 9, please refer to the descriptions in Figure 8. They will not be repeated here.

[0218] It is understood that the sequence number sets in the examples given in this application are all exemplarily numbered starting from 0. Optionally, the sequence number sets in this application can also be numbered starting from 1. That is, the sequence number sets in this application can be numbered starting from 1 or starting from 0. This application does not specifically limit this. Those skilled in the art can understand the implementation method when the sequence number set is numbered starting from 1 based on the content disclosed in this application, and will not elaborate further.

[0219] It is also understood that the steps in the above figures are merely illustrative and are not intended to be strictly limited. Furthermore, the sequence numbers of the above processes do not imply a specific order of execution; the execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0220] It is also understood that some optional features in the various embodiments of this application may not depend on other features in some scenarios, or may be combined with other features in some scenarios, without limitation.

[0221] It is also understood that, in the above-described method embodiments, the methods and operations implemented by the device (transmitting device or receiving device) can also be implemented by components of the device (such as chips or circuits), without limitation.

[0222] The method embodiments provided in this application have been described in detail above with reference to Figures 1 to 9. The apparatus embodiments of this application will now be described with reference to Figures 10 and 11. It is understood that, in order to implement the functions in the above embodiments, the apparatuses in Figures 10 and 11 include hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should readily recognize that, based on the units and method steps of the various examples described in conjunction with the embodiments disclosed in this application, this application can be implemented in hardware or a combination of hardware and computer software. It is understood that the technical features described in the above method embodiments are also applicable to the following apparatus embodiments.

[0223] Figures 10 and 11 are schematic diagrams of possible apparatus structures provided in embodiments of this application. These apparatuses can be used to implement the functions of the transmitting or receiving devices in the above method embodiments, and thus can also achieve the beneficial effects of the above method embodiments.

[0224] Figure 10 is a schematic block diagram of a communication device 1000 provided in an embodiment of this application. As shown in Figure 10, the device 1000 may include a communication unit 1010 and a processing unit 1020. The communication unit 1010 can communicate with the outside world, and the processing unit 1020 is used for data processing. The communication unit 1010 may also be referred to as a communication interface or a transceiver unit.

[0225] In one possible design, the device 1000 can implement the steps or processes corresponding to those performed by the transmitting device in the above method embodiments, wherein the processing unit 1020 is used to perform processing-related operations of the transmitting device in the above method embodiments, and the communication unit 1010 is used to perform transmission-related operations of the transmitting device in the above method embodiments.

[0226] In another possible design, the device 1000 can implement the steps or processes corresponding to those performed by the receiving device in the above method embodiments, wherein the communication unit 1010 is used to perform the receiving-related operations of the receiving device in the above method embodiments, and the processing unit 1020 is used to perform the processing-related operations of the receiving device in the above method embodiments.

[0227] It is understood that the device 1000 here is embodied in the form of a functional unit. The term "unit" here can refer to an application-specific integrated circuit (ASIC), electronic circuitry, a processor (e.g., a shared processor, a proprietary processor, or a group processor, etc.) and memory for executing one or more software or firmware programs, integrated logic circuitry, and / or other suitable components supporting the described functions. In an alternative example, those skilled in the art will understand that the device 1000 may specifically be the transmitting end device in the above embodiments, used to execute the various processes and / or steps corresponding to the transmitting end device in the above method embodiments; or, the device 1000 may specifically be the receiving end device in the above embodiments, used to execute the various processes and / or steps corresponding to the receiving end device in the above method embodiments. To avoid repetition, further details are omitted here.

[0228] The apparatus 1000 of each of the above-described schemes has the function of implementing the corresponding steps performed by the transmitting device in the above-described method, or the apparatus 1000 of each of the above-described schemes has the function of implementing the corresponding steps performed by the receiving device in the above-described method. The function can be implemented by hardware or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions; for example, the communication unit can be replaced by a transceiver (e.g., the transmitting unit in the communication unit can be replaced by a transmitter, and the receiving unit in the communication unit can be replaced by a receiver), and other units, such as processing units, can be replaced by a processor, respectively executing the transmission and reception operations and related processing operations in each method embodiment.

[0229] Furthermore, the aforementioned communication unit can also be a transceiver circuit (e.g., it may include a receiving circuit and a transmitting circuit), and the processing unit can be a processing circuit. In the embodiments of this application, the device in FIG10 can be the receiving end device or transmitting end device in the foregoing embodiments, or it can be a chip or a chip system, such as a system on chip (SoC). The communication unit can be an input / output circuit or a communication interface; the processing unit is a processor, microprocessor, or integrated circuit integrated on the chip. No limitations are imposed here.

[0230] Figure 11 is a schematic block diagram of a communication device 1100 provided in an embodiment of this application. The device 1100 includes a processor 1110 and a transceiver 1120. The processor 1110 and the transceiver 1120 communicate with each other through an internal connection path. The processor 1110 is used to execute instructions to control the transceiver 1120 to send and / or receive signals.

[0231] Optionally, the device 1100 may further include a memory 1130, which communicates with the processor 1110 and the transceiver 1120 via an internal connection path. The memory 1130 stores instructions, and the processor 1110 can execute the instructions stored in the memory 1130. In one possible implementation, the device 1100 is used to implement the various processes and steps corresponding to the transmitting device in the above method embodiments. In another possible implementation, the device 1100 is used to implement the various processes and steps corresponding to the receiving device in the above method embodiments.

[0232] Optionally, the memory 1130 may be integrated into the processor 1110.

[0233] In one possible scenario, device 1100 includes at least one processor with integrated memory, and other memory besides the memory integrated on the processor.

[0234] It is understood that the device 1100 can specifically be the transmitting or receiving device in the above embodiments, or it can be a chip or a chip system. Correspondingly, the transceiver 1120 can be the transceiver circuit of the chip, which is not limited here. Specifically, the device 1100 can be used to execute the various steps and / or processes corresponding to the transmitting or receiving device in the above method embodiments.

[0235] Optionally, the memory 1130 may include read-only memory and random access memory, and provide instructions and data to the processor. The memory may include non-volatile random access memory. For example, the memory may also store device type information. The processor 1110 may be used to execute instructions stored in the memory, and when the processor 1110 executes instructions stored in the memory, the processor 1110 is used to perform the various steps and / or processes of the method embodiments corresponding to the transmitting or receiving devices described above.

[0236] In implementation, each step of the above method can be completed by integrated logic circuits in the processor's hardware or by instructions in software. The steps of the method disclosed in the embodiments of this application can be directly implemented by a hardware processor, or by a combination of hardware and software modules in the processor. The software modules can reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory, and the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above method. To avoid repetition, detailed descriptions are omitted here.

[0237] It should be noted that the processor in the embodiments of this application can be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above method embodiments can be completed by the integrated logic circuitry in the processor's hardware or by instructions in software form. The processor can be a general-purpose processor, digital signal processing (DSP), ASIC, field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. The processor in the embodiments of this application can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this application can be directly embodied as being executed by a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software modules can be located in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory, and the processor reads the information in the memory and, in conjunction with its hardware, completes the steps of the above methods.

[0238] It is understood that the memory in the embodiments of this application can be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. The non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. The volatile memory can be random access memory (RAM), which is used as an external cache. By way of example, but not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous linked dynamic random access memory (SLDRAM), and direct rambus RAM (DR RAM). It should be noted that the memory used in the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0239] Optionally, the memory (e.g., 1130) in this embodiment may be integrated into the processor (e.g., 1110).

[0240] In addition, this application also provides a computer-readable storage medium storing computer instructions, which, when executed on a computer, cause the operations and / or processes performed by the sending or receiving device in the various method embodiments of this application to be executed.

[0241] This application also provides a computer program product, which includes computer program code or instructions. When the computer program code or instructions are run on a computer, the operations and / or processes performed by the sending end device or the receiving end device in the various method embodiments of this application are executed.

[0242] Furthermore, this application also provides a chip including a processor. A memory for storing a computer program is provided independently of the chip, and the processor is used to execute the computer program stored in the memory, such that operations and / or processes performed by a transmitting or receiving device in any method embodiment are performed.

[0243] Furthermore, the chip may also include a communication interface. The communication interface may be an input / output interface or an interface circuit, etc. Furthermore, the chip may also include a memory.

[0244] In addition, this application also provides a communication system, including the transmitting end device and the receiving end device in the embodiments of this application.

[0245] It should also be noted that the memory described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0246] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application. Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here. In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative; for example, the division of units is merely a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the displayed or discussed mutual coupling or direct coupling or communication connection may be through some interfaces; the indirect coupling or communication connection of devices or units may be electrical, mechanical, or other forms. The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs. Furthermore, the functional units in the various embodiments of this application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0247] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, ROM, RAM, magnetic disks, or optical disks.

[0248] It is understood that the term "embodiment" used throughout the specification means that a specific feature, structure, or characteristic related to an embodiment is included in at least one embodiment of this application. Therefore, various embodiments throughout the specification do not necessarily refer to the same embodiment. Furthermore, these specific features, structures, or characteristics can be combined in any suitable manner in one or more embodiments.

[0249] It can also be understood that in this application, "when," "if," and "if" all refer to the network element making corresponding processing under certain objective circumstances, and are not time-limited, nor do they require the network element to make a judgment when it is implemented, nor do they mean that there are other limitations.

[0250] It can also be understood that in the various embodiments of this application, "B corresponding to A" means that B is associated with A, and B can be determined based on A. However, it can also be understood that determining B based on A does not mean that B is determined solely based on A; B can also be determined based on A and / or other information.

Claims

1. A communication method, characterized in that, include: Determine the length N of the bit sequence to be encoded, the E is the length of the transformed codeword sequence. This indicates rounding up. The bit sequence to be encoded includes a first bit sequence of length K and a bit sequence to be transformed of length (EK), where K and E are positive integers. Based on the bit sequence to be encoded, a first codeword sequence is obtained, wherein, The first bit sequence is carried on bits corresponding to the first sequence number set. The first sequence number set consists of the sequence numbers of K sub-channels determined according to reliability in the first candidate sequence number set. The first candidate sequence number set includes the remaining sequence numbers in the first reliability sequence excluding the second sequence number set. The first reliability sequence includes the sequence numbers of N sub-channels, which are arranged according to their reliability in the first reliability sequence. The second sequence number set includes L integers from 0 to (L-1), where L is a positive integer. The bit sequence to be transformed is carried on the bit bits corresponding to the third sequence set. The third sequence set includes the remaining sequence numbers in the fourth sequence set excluding the first rate matching sequence set. The fourth sequence set is the remaining sequence numbers in the first reliability sequence excluding the first sequence set. The first rate matching sequence set includes (NE) integers from 0 to (NE-1).

2. The method according to claim 1, characterized in that, The L is greater than or equal to N / 2.

3. The method according to claim 2, characterized in that, The in, The n = max{min{n1, n2, n max }, n min }, n min =5, n during uplink transmission max =10, n during downlink transmission max =9, like And K / E < 9 / 16, otherwise, Among them, R min =1 / 8.

4. The method according to claim 2, characterized in that, L is equal to the maximum value between L0 and L1, where, when And when K / E < 9 / 16, then Otherwise, L0 = 0. when hour, The To meet Maximum 2 n Otherwise, L1 = 0.

5. The method according to any one of claims 1 to 4, characterized in that, The method further includes: Bit selection is performed on the first codeword sequence to obtain the transformed codeword sequence, which includes the last E bits of the first codeword sequence.

6. The method according to any one of claims 1 to 5, characterized in that, The transformation is a polar code-based distributed matcher DM transform.

7. The method according to claim 6, characterized in that, The value of the first flag bit is a first numerical value, which indicates that the polar code is used to implement DM conversion.

8. A communication method, characterized in that, include: Obtain a second bit sequence of length E, where E is the length of the transformed codeword sequence and E is a positive integer; A third bit sequence of length E is obtained based on the second bit sequence. The third bit sequence includes a transformed bit sequence of length (EK), where K is a positive integer. The bits carrying the transformed bit sequence in the third bit sequence are determined based on a third sequence number set. This third sequence number set includes the remaining sequence numbers from a fourth sequence number set excluding the first rate matching sequence number set. The fourth sequence number set consists of the remaining sequence numbers from a first reliability sequence excluding the first sequence number set. The first reliability sequence includes the sequence numbers of N sub-channels. The first rate matching sequence number set includes (NE) integers from 0 to (NE-1). The first sequence number set is the sequence number of K sub-channels determined according to reliability in the first candidate sequence number set. The first candidate sequence number set includes the remaining sequence numbers in the first reliability sequence excluding the second sequence number set. The sequence numbers of the N sub-channels in the first reliability sequence are arranged according to the reliability of the N sub-channels. The second sequence number set includes L integers from 0 to (L-1), where L is a positive integer.

9. The method according to claim 8, characterized in that, The L is greater than or equal to N / 2.

10. The method according to claim 9, characterized in that, The in, The n = max{min{n1, n2, n max }, n min }, n min =5, n during uplink transmission max =10, n during downlink transmission max =9, like And K / E < 9 / 16, otherwise, Indicates rounding up. Among them, R min =1 / 8.

11. The method according to claim 9, characterized in that, L is equal to the maximum value between L0 and L1, where, when And when K / E < 9 / 16, then Otherwise, L0 = 0. Indicates rounding up. when hour, The To meet Maximum 2 n Otherwise, L1 = 0.

12. The method according to any one of claims 8 to 11, characterized in that, The transformation is a polar code-based distributed matcher DM transform.

13. The method according to claim 12, characterized in that, The value of the first flag bit is a first numerical value, which indicates that the polar code is used to implement the DM conversion.

14. A communication device, characterized in that, It includes modules or units for performing the method of any one of claims 1 to 7, or modules or units for performing the method of any one of claims 8 to 13.

15. A communication device, characterized in that, The device includes at least one processor and an interface circuit, the interface circuit being configured to receive signals from other communication devices besides the communication device and transmit them to the processor, or to send signals from the processor to other communication devices besides the communication device, the processor causing the method as described in any one of claims 1 to 7 to be implemented, or causing the method as described in any one of claims 8 to 13 to be implemented, through logic circuits or by executing code instructions.

16. The communication device according to claim 15, characterized in that, The communication device is a chip or chip system.

17. A computer-readable storage medium, characterized in that, The storage medium stores a computer program or instructions that, when executed, cause the method as described in any one of claims 1 to 7 to be implemented, or cause the method as described in any one of claims 8 to 13 to be implemented.

18. A computer program product, characterized in that, Includes a computer program that, when run, causes the method as described in any one of claims 1 to 7 to be implemented, or causes the method as described in any one of claims 8 to 13 to be implemented.

Images