Polarization code coding method and device

Abstract

The invention discloses a polar code coding method and device, relates to the technical field of communication, and can enable a nested PC-Polar code to multiplex a sub-block interleaving rate matching mode of an NR PC-Polar code and improve NR compatibility. The method comprises the following steps: mapping an information bit sequence with the length of k to k bits of a first sequence with the length of N according to a reliability sequence with the length of N to obtain a second sequence; wherein the second sequence comprises k information bits, x parity check PC bits and N-k-x frozen bits, and k, N and x are all positive integers; m information bits in the k information bits are the first m bits ranked according to the reliability from high to low in the second sequence, and the remaining (k-m) information bits in the k information bits are the bits corresponding to the first (k-m) information bits ranked according to the reliability from high to low in the preset information bit set in the second sequence; the x PC bits are x PC bits in a preset PC bit set; and performing polarization coding on the second sequence to obtain a third sequence.

Description

Technical Field

[0001] The embodiments of the present application relate to the field of communication technology, and in particular to a method and device for encoding a polarization code. Background Art

[0002] In order to reduce the coding complexity in the communication system, a coding scheme based on parity check polar codes (PC-Polar codes) is proposed. Among them, the PC-Polar code can include the PC-Polar code in the new radio (NR) standard and the nested PC-Polar code.

[0003] Among them, NR PC-Polar code can first perform rate matching, and then determine the information bits, frozen bits, and PC bits according to the code length and code rate after rate matching. Different from NR PC-Polar code, the information bits, frozen bits, and PC bits of nested PC-Polar code are independent of the code length and code rate after rate matching. The PC bits and PC equations corresponding to different numbers of information bit sequences are nested. Nested PC-Polar code can first determine the information bits, frozen bits, and PC bits, and then perform rate matching.

[0004] However, the rate matching method of the nested PC-Polar code is a nested puncturing sequence designed based on performance, and the sub-block interleaving rate matching method of the NR PC-Polar code cannot be reused, resulting in poor NR compatibility. Summary of the invention

[0005] The present application provides a polar code encoding method and device, which can enable nested PC-Polar code to multiplex the sub-block interleaving rate matching method of NR PC-Polar code, thereby improving NR compatibility.

[0006] In a first aspect, an embodiment of the present application provides a polar code encoding method, which can be performed by a transmitting end device. Unless otherwise specified, the “transmitting end device” in the present application can refer to the transmitting end device itself, or a component in the transmitting end device (for example, a processor, a chip, or a chip system, etc.), or a logic module or software that can implement all or part of the functions of the transmitting end device. The method comprises: mapping an information bit sequence of length k to k bits of a first sequence of length N according to a reliability sequence of length N to obtain a second sequence; wherein the second sequence comprises k information bits, x parity check PC bits and Nkx frozen bits, and k, N and x are all positive integers; m information bits of the k information bits are the first m bits in the second sequence sorted from high to low according to reliability, and the remaining (km) information bits of the k information bits are the bits in the second sequence corresponding to the first (km) information bits in a preset information bit set sorted from high to low according to reliability; the x PC bits are the x PC bits in the preset PC bit set; and polarization coding is performed on the second sequence to obtain a third sequence.

[0007] Based on the first aspect, a polar code encoding scheme with nested characteristics is provided, and different numbers of information bit sequences can construct polar codes based on the same m information bits, preset information bit sets and preset PC bit sets, and the m information bits, preset information bit sets and preset PC bit sets have nested characteristics for different numbers of information bit sequences, and will not change with the number of information bit sequences. At the same time, the PC-Polar code with nested characteristics obtained based on the m information bits, preset information bit sets and preset PC bit sets can reuse the sub-block interleaving rate matching method of the NR PC-Polar code, and the PC-Polar code with nested characteristics still has good rate matching performance under the sub-block interleaving rate matching method of the NR PC-Polar code, which can simplify the rate matching operation, improve NR compatibility, and improve communication performance.

[0008] In one possible design, the value of k is any of the following: 7, 8, 9, 10, or 11.

[0009] In one possible design, the m information bits are the following bits in the second sequence: 15, 23, 27, 29, 30, 31.

[0010] Based on this possible design, the transmitting end device can determine the m information bits in the second sequence according to the specific value of m and the reliability sequence. For example, the transmitting end device can determine the first m bits in the second sequence sorted from high to low according to the reliability as the m information bits. The m information bits have a nested characteristic for information bit sequences of different numbers (such as k equals 7, 8, 9, 10, or 11), and will not change with the change of the length of the information bit sequence, thereby reducing the decoding complexity and improving the decoding performance.

[0011] In one possible design, the preset information bit set corresponds to the following bit positions in the second sequence: 11, 19, 13, 14, and 22.

[0012] Based on this possible design, the preset information bit set has a nested characteristic for information bit sequences of different numbers (such as k equals 7, 8, 9, 10, or 11), and will not change with the length of the information bit sequence, thereby reducing the decoding complexity and improving the decoding performance.

[0013] In one possible design, the difference between the numbers of any two bits of the PC bit check is not 1.

[0014] Based on this possible design, by setting the difference between the numbers of any two bits of any PC bit check in the preset PC bit set not to be 1, the decoding performance and rate matching performance can be improved.

[0015] In one possible design, the preset PC bit set corresponds to the following bits in the second sequence: 21, 26, 25, and 28.

[0016] Based on this possible design, the preset PC bit set has a nested characteristic for information bit sequences of different numbers (such as k equals 7, 8, 9, 10, or 11), and will not change with the length of the information bit sequence, thereby reducing the decoding complexity and improving the decoding performance.

[0017] In one possible design, when the PC bit is the 21st bit in the second sequence, the bit checked by the PC bit is one or more of the following bit positions in the second sequence: 11, 14; or, when the PC bit is the 26th bit in the second sequence, the bit checked by the PC bit is one or more of the following bit positions in the second sequence: 13, 19; or, when the PC bit is the 25th bit in the second sequence, the bit checked by the PC bit is one or more of the following bit positions in the second sequence: 13, 22; or, when the PC bit is the 28th bit in the second sequence, the bit checked by the PC bit is one or more of the following bit positions in the second sequence: 11, 13, 19.

[0018] Based on this possible design, a better example is provided for the PC bit and the bit of the PC bit check, which can improve the decoding performance and rate matching performance.

[0019] In one possible design, bit 7 of the second sequence is a frozen bit.

[0020] Based on this possible design, if a rate matching method based on sub-block interleaving and puncturing from front to back is adopted, bit 7 is located relatively forward. When E=24, 23, 22, 21, 20, 19 or 18, bit 7 will be punctured, so bit 7 is pre-frozen, and bit 7 of the second sequence can be set to a frozen bit (or it can also be called a pre-frozen bit).

[0021] In the second aspect, the embodiment of the present application provides a polarization code encoding method, which can be executed by a transmitting device. Unless otherwise specified, the "transmitting device" in the present application can refer to the transmitting device itself, or a component in the transmitting device (such as a processor, a chip, or a chip system, etc.), or a logic module or software that can realize all or part of the functions of the transmitting device. The method includes: according to a reliability sequence of length N, mapping an information bit sequence of length k to k bits of a first sequence of length N to obtain a fourth sequence; wherein the fourth sequence includes k information bits, 0 parity check PC bits and Nk frozen bits, k and N are both positive integers; polarization encoding the fourth sequence to obtain a fifth sequence; and rate matching the fifth sequence in a forward-to-backward puncturing manner to obtain a sixth sequence.

[0022] Based on the second aspect, a polar code encoding scheme with nested characteristics is provided, and information bit sequences of different numbers k can determine k information bits and 0 PC bits to construct polar codes based on the same reliability sequence, and the k information bits and 0 PC bits have nested characteristics for information bit sequences of different numbers, and will not change with the change of the number of information bit sequences. At the same time, the PC-Polar code with nested characteristics obtained based on the k information bits and 0 PC bits can adopt the sub-block interleaving rate matching punching method of the NR PC-Polar code from front to back to ensure the nested characteristics of the information bits. The PC-Polar code with nested characteristics still has good rate matching performance under the sub-block interleaving rate matching punching method of the NR PC-Polar code, which can simplify the rate matching operation, improve NR compatibility, and improve communication performance.

[0023] In one possible design, the value of k is any of the following: 3, 4, 5, or 6.

[0024] In a possible design, before performing rate matching on the fifth sequence in a puncturing manner from front to back, the method further includes: performing sub-block interleaving on the fifth sequence according to a first interleaving pattern; wherein the first interleaving pattern is used to indicate that the values ​​on the Ath sub-block of the fifth sequence are swapped and placed on the Bth sub-block of the interleaved fifth sequence; the mapping relationship between A and B is: (31, 31), (30, 30), (29, 29), (27, 28), (28, 27), (26, 26), (25, 25), (2 4, 24), (23, 23), (15, 22), (22, 21), (14, 20), (21, 19), (13, 18), (20, 17), (12, 16), (19, 15), (11, 14), (18, 13), (10, 12), (17, 11), (9, 10), (16, 9), (8, 8), (7, 7), (6, 6), (5, 5), (3, 4), (4, 3), (2, 2), (1, 1), (0, 0).

[0025] In the third aspect, the embodiment of the present application provides a communication device, which can be applied to the transmitting device of the first aspect or the second aspect to implement the functions performed by the transmitting device. The communication device can be a transmitting device, or a chip or chip system or system on chip of the transmitting device, etc. The communication device can perform the functions performed by the transmitting device through hardware, or can perform the corresponding software implementation through hardware. The hardware or software includes one or more modules corresponding to the above functions. For example, a transceiver module and a processing module. The transceiver module can independently complete the following transceiver operations, or cooperate with the processing module to complete the following transceiver operations; accordingly, the processing module can also independently complete the following processing operations, or cooperate with the transceiver module to complete the following processing operations, without limitation.

[0026] Exemplarily, a processing module is used to map an information bit sequence of length k to k bits of a first sequence of length N according to a reliability sequence of length N, to obtain a second sequence; wherein the second sequence includes k information bits, x parity check PC bits and Nkx frozen bits, and k, N, and x are all positive integers; m information bits of the k information bits are the first m bits in the second sequence sorted from high to low in terms of reliability, and the remaining (km) information bits of the k information bits are bits in the second sequence corresponding to the first (km) information bits in a preset information bit set sorted from high to low in terms of reliability; the x PC bits are x PC bits in a preset PC bit set; the processing module is also used to perform polarization encoding on the second sequence to obtain a third sequence.

[0027] In another example, the processing module is used to map an information bit sequence with a length of k to k bits of a first sequence with a length of N according to a reliability sequence with a length of N, to obtain a fourth sequence; wherein the fourth sequence includes k information bits, 0 parity check PC bits and Nk frozen bits, and k and N are both positive integers; the processing module is also used to perform polarization encoding on the fourth sequence to obtain a fifth sequence, and perform rate matching on the fifth sequence in a forward-to-backward puncturing manner to obtain a sixth sequence.

[0028] Optionally, the transceiver module and the processing module of the communication device in the third aspect may also perform the corresponding functions in the above-mentioned first aspect or any possible design of the first aspect, or perform the above-mentioned second aspect or any possible design of the second aspect. Please refer to the detailed description in the method example for details, and the beneficial effects that can be achieved may also be referred to the aforementioned related content.

[0029] In a fourth aspect, an embodiment of the present application provides a communication device, comprising one or more processors; the one or more processors are used to run a computer program or instruction, and when the one or more processors execute the computer instruction or instruction, the polar code encoding method described in any one of the first aspect to the second aspect is executed.

[0030] In one possible design, the communication device further includes one or more memories, the one or more memories are coupled to one or more processors, and the one or more memories are used to store the above-mentioned computer programs or instructions. In one possible implementation, the memory is located outside the communication device. In another possible implementation, the memory is located inside the communication device. In an embodiment of the present application, the processor and the memory may also be integrated into one device, that is, the processor and the memory may also be integrated together. In one possible implementation, the communication device further includes a transceiver, and the transceiver is used to receive information and / or send information.

[0031] In one possible design, the communication device also includes one or more communication interfaces, the one or more communication interfaces are coupled to the one or more processors, and the one or more communication interfaces are used to communicate with other modules outside the communication device.

[0032] In a fifth aspect, an embodiment of the present application provides a communication device, comprising an interface circuit and a logic circuit; the interface circuit is used to input and / or output information; the logic circuit is used to execute the polar code encoding method as described in any one of the first aspect or the second aspect, and process and / or generate information according to the information.

[0033] In a sixth aspect, an embodiment of the present application provides a computer-readable storage medium, which stores a computer instruction or a program. When the computer instruction or the program is executed on a computer, the polar code encoding method as described in any one of the first aspect or the second aspect is executed.

[0034] In a seventh aspect, an embodiment of the present application provides a computer program product comprising computer instructions, which, when executed on a computer, enables the polar code encoding method as described in any one of the first aspect or the second aspect to be executed.

[0035] In an eighth aspect, an embodiment of the present application provides a computer program, which, when executed on a computer, enables the polar code encoding method as described in any one of the first aspect or the second aspect to be executed.

[0036] In a ninth aspect, an embodiment of the present application provides a chip, including: a processor, the processor being coupled to a memory, the memory being used to store a program or an instruction, and when the program or the instruction is executed by the processor, the polar code encoding method as described in any one of the first aspect or the second aspect is executed.

[0037] Among them, the technical effects brought about by any design method in the fourth to ninth aspects can refer to the technical effects brought about by any one of the first or second aspects mentioned above, and will not be repeated here.

[0038] In the tenth aspect, an embodiment of the present application provides a communication system, which may include a communication device for executing the communication described in the first aspect or any possible design of the first aspect, or may also include a communication device for executing the communication described in the second aspect or any possible design of the second aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] Figure 1 A schematic diagram of a search process for an interlaced pattern provided in an embodiment of the present application;

[0040] Figure 2 A schematic diagram of a communication system provided in an embodiment of the present application;

[0041] Figure 3 A schematic diagram of encoding and decoding by a transmitting device and a receiving device provided in an embodiment of the present application;

[0042] Figure 4 A schematic diagram of the composition of a communication device provided in an embodiment of the present application;

[0043] Figure 5 A flowchart of a polar code encoding method provided in an embodiment of the present application;

[0044] Figure 6A schematic diagram of a PC bit and an information bit provided in an embodiment of the present application;

[0045] Figure 7 A schematic diagram of a PC bit and an information bit provided in an embodiment of the present application;

[0046] Figure 8 A performance comparison diagram provided for an embodiment of the present application;

[0047] Fig. 9 A performance comparison diagram provided for an embodiment of the present application;

[0048] Fig.10 A performance comparison diagram provided for an embodiment of the present application;

[0049] Fig.11 A performance comparison diagram provided for an embodiment of the present application;

[0050] Fig.12 A performance comparison diagram provided for an embodiment of the present application;

[0051] Fig.13 A schematic diagram of a polar code encoding method provided in an embodiment of the present application;

[0052] Fig.14 A schematic diagram of an information bit provided in an embodiment of the present application;

[0053] Fig.15 A performance comparison diagram provided for an embodiment of the present application;

[0054] Fig.16 A performance comparison diagram provided for an embodiment of the present application;

[0055] Fig.17 A performance comparison diagram provided for an embodiment of the present application;

[0056] Fig.18 A performance comparison diagram provided for an embodiment of the present application;

[0057] Fig.19 A performance comparison diagram provided for an embodiment of the present application;

[0058] Fig. 20 A schematic diagram of a communication device provided in an embodiment of the present application;

[0059] Fig.21 A diagram of the structure of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0060] Before describing the embodiments of the present application, the technical terms involved in the embodiments of the present application are described.

[0061] Parity check polar codes (PC-Polar codes): can effectively improve the code spectrum performance of Polar codes. They can include information bits, frozen bits, and parity check (PC) bits. Information bits can be used to carry information bits, frozen bits can be used to carry frozen bits, and PC bits can be used to carry PC bits.

[0062] Among them, a part of the set can be selected from the frozen bits as PC bits. The values ​​of the PC bits on these PC bits are different from other frozen bits. They are not fixed to 0, but are determined by the PC equation based on the value of the information bit of the information bit before the PC bit. Therefore, the PC bit can also be called a dynamic frozen bit (that is, the position comes from the frozen bit, but the value is not fixed to 0).

[0063] New radio parity check polar codes (NRPC-Polar codes) in the new radio interface standard: The transmitting device can first perform rate matching, and then determine the information bit, frozen bit and PC bit according to the code length and code rate after rate matching. After the PC bit is determined, the interval between the PC bit and the information bit checked by the PC bit is a fixed interval.

[0064] Among them, before performing rate matching, the transmitting end device can perform sub-block interleaving on the Polar code sequence with a mother code length of N, and perform rate matching on the sequence after the sub-block interleaving.

[0065] Exemplarily, the transmitting device may divide the Polar code sequence with a mother code length of N into 32 sub-blocks of the same length, where the size of each sub-block is N / 32, and then refer to the sub-block interleaving pattern shown in the following Table 1 to perform sub-block interleaving in units of sub-blocks to obtain a sequence after sub-block interleaving.

[0066] Table 1 Sub-block interleaving pattern

[0067] i P(i) i P(i) i P(i) i P(i) i P(i) i P(i) i P(i) i P(i) 0 0 4 3 8 8 12 10 16 12 20 14 24 24 28 27 1 1 5 5 9 16 13 18 17 20 21 22 25 25 29 29 2 2 6 6 10 9 14 11 18 13 22 15 26 26 30 30 3 4 7 7 11 17 15 19 19 21 23 23 27 28 31 31

[0068] It can be understood that the above Table 1 is defined starting from bit 0, and can also be defined starting from bit 1, that is, the above 0, 1, ..., 31 can be replaced by 1, 2, ..., 32 respectively without limitation.

[0069] Based on the above description, after performing sub-block interleaving, the transmitting end device can determine the corresponding rate matching mode according to the code rate R=K / E and the code length E after rate matching. Wherein, K represents the length of the information bit sequence, or can also be described as the number of information bit sequences. The code length E after rate matching can also be called the transmission length E.

[0070] Exemplarily, the transmitting device may determine the mother code length N = max(min([N M , N R , N max ), 32) according to the length K of the information bit sequence and the code length E after rate matching. If E > N, the rate matching method is determined to be repetition, that is, after the transmitting device sends the mother code of length N, it resends the (E - N) bits after sub-block interleaving. If E < N, the transmitting device may determine whether to puncture from the front to the back or shorten from the back to the front based on the current code rate R for the sequence after sub-block interleaving. If R < 7 / 16, rate matching is performed by puncturing (N - E) bits from the front to the back for the sequence after sub-block interleaving; otherwise, (N - E) bits of the sequence after sub-block interleaving are shortened from the back to the front.

[0071] Among them, N M is related to the code rate R = K / E and N DM . If E ≤ 9 / 8 × N DM and R < 9 / 16, then N M = N DM / 2; otherwise, N M = N DM . N R is related to K and the lowest code rate R min . R min = 1 / 8. N max = 1024.

[0072] Based on the above description, the rate matching method of the NR PC - Polar code is related to the specific values of K and E, which means that the information bits, PC bits, and frozen bits corresponding to different K and E are different and cannot be nested.

[0073] Nested PC - Polar code: Different from the NR PC - Polar code, the information bits, frozen bits, and PC bits of the nested PC - Polar code are independent of the code length and code rate after rate matching. The PC bits and PC equations corresponding to different numbers K of information bit sequences or different lengths of the transmission length E (i.e., the code length after rate matching of the mother code length) are the same, and the PC bits and PC equations do not change with the change of K or E, that is, the PC bits and PC equations of the nested PC - Polar code are nested. The nested PC - Polar code can first determine the information bits, frozen bits, and PC bits to ensure the best performance of using the same PC equation for different numbers of information bit sequences under the mother code length, and then perform rate matching.

[0074] Among them, the rate matching method of the nested PC-Polar code is a nested puncturing sequence designed based on performance, which is designed for (K, E) one by one, with fine granularity and good performance. The following is the rate matching process obtained by the nested PC-polar code through performance search:

[0075] Step 1: Initialize the rate matching input sequence Interleave and obtain the interleaved sequence as e n =e0,e1,e2,…,e N-1 .

[0076] in, is the mother code long sequence of the nested PC-Polar code.

[0077] Exemplarily, the input sequence may be interleaved using the interleaving pattern P(n) shown in Table 2 below. The interleaved sequence e n You can obtain it by following the following method:

[0078] for n=0 to N-1

[0079] e n =d P(n)

[0080] end for

[0081] Table 2 Interlaced pattern

[0082] i P(i) i P(i) i P(i) i P(i) i P(i) i P(i) i P(i) i P(i) 0 29 4 19 8 14 12 0 16 12 20 24 24 16 28 9 1 20 5 22 9 4 13 13 17 3 21 10 25 30 29 11 2 18 6 23 10 1 14 8 18 6 22 21 26 7 30 26 3 15 7 25 11 2 15 17 19 27 23 31 27 28 31 5

[0083] It can be understood that the above Table 2 is defined starting from bit 0, and can also be defined starting from bit 1, that is, the above 0, 1, ..., 31 can be replaced by 1, 2, ..., 32 respectively without limitation.

[0084] Step 2: Interleaved sequence e n Perform rate matching operation, and the output sequence after rate matching is f0,f1,f2,…,f E-1 .

[0085] Wherein, E is the code length after rate matching.

[0086] For example, the output sequence f0,f1,f2,…,f E-1 You can obtain it by following the following method:

[0087] for k=0 to E-1

[0088] f k =e k mod N

[0089] end for

[0090] Based on the above description of the interleaving pattern corresponding to the nested PC-Polar code, the interleaving pattern corresponding to the nested PC-Polar code can be determined according to the sequence performance and the nesting characteristics by designing a search algorithm, that is, the interleaving pattern corresponding to the nested PC-Polar code has a nesting characteristic for information bit sequences of different numbers and does not change with the change of the length of the information bit sequence. The complexity can be greatly reduced on the basis of satisfying the optimal sequence performance and the nesting characteristics.

[0091] Exemplarily, a List search algorithm may be used to search for puncturing positions for multiple sequence samples (the multiple sequence samples may correspond to information bit sequences of different lengths, and the length of each information bit sequence is less than or equal to K). When the number of puncturing increases by one, the average sequence performance of all sequences is calculated, and the average sequence performance is used as a metric. The position corresponding to the optimal average sequence performance is determined as the puncturing position, and an interleaving pattern corresponding to the nested PC-Polar code is generated. The average performance may refer to the mean of the sequence SNR@BLER=1E-2, where SNR represents the signal-to-noise ratio and BLER represents the block error rate.

[0092] Optional, you can refer to the following Figure 1 The performance search process shown determines the interleaving pattern corresponding to the nested PC-Polar code:

[0093] Step 1: Initialize the search space of puncture positions to 0 to N-1, and the number of punctures to 0.

[0094] Step 2: Select a location from the current search space as a new punching location.

[0095] Step 3: Simulate the sequence performance of all sequences according to the current puncture position.

[0096] Step 4: Take the average of the sequence performance of all sequences to obtain the metrics corresponding to different puncturing positions under the current number of puncturing.

[0097] Step 5: Keep the punching positions corresponding to the optimal Metric in List as the candidate punching positions under the current number of punchings.

[0098] Step 6: Update the candidate search space of each List: Delete the current punching position from the search space.

[0099] Step 7: Increase the number of holes punched by one.

[0100] Step 8: Determine whether the number of punctures is less than the maximum number of punctures. If so, continue to execute from the above step 2 until the number of punctures is equal to the maximum puncture data; if not, output the interleaving pattern corresponding to the nested PC-Polar code (or it can also be called the optimal puncture pattern).

[0101] Based on the above description, the rate matching method of the nested PC-Polar code is a nested puncturing sequence designed based on performance. It is impossible to reuse the sub-block interleaving rate matching method of the NR PC-Polar code, and the NR compatibility is poor.

[0102] In order to solve the problems existing in the above-mentioned NR PC-Polar code and nested PC-Polar code, an embodiment of the present application proposes: a transmitting device can map an information bit sequence of length k to k bits of a first sequence of length N according to a reliability sequence of length N to obtain a second sequence; wherein the second sequence includes k information bits, x parity check PC bits and Nkx frozen bits, and k, N, and x are all positive integers; m information bits of the k information bits are the first m bits of the second sequence sorted from high to low in terms of reliability, and the remaining (km) information bits of the k information bits are bits in the second sequence corresponding to the first (km) information bits in a preset information bit set sorted from high to low in terms of reliability; the x PC bits are x PC bits in the preset PC bit set; and polarization encoding is performed on the second sequence to obtain a third sequence.

[0103] The embodiment of the present application provides a polar code encoding scheme with nested characteristics, and different numbers of information bit sequences can construct polar codes based on the same m information bits, preset information bit sets and preset PC bit sets. The m information bits, preset information bit sets and preset PC bit sets have nested characteristics for different numbers of information bit sequences and will not change with the number of information bit sequences. At the same time, the PC-Polar code with nested characteristics obtained based on the m information bits, preset information bit sets and preset PC bit sets can reuse the sub-block interleaving rate matching method of the NR PC-Polar code. The PC-Polar code with nested characteristics still has good rate matching performance under the sub-block interleaving rate matching method of the NR PC-Polar code, which can simplify the rate matching operation, improve NR compatibility, and improve communication performance.

[0104] The implementation of the embodiments of the present application will be described in detail below in conjunction with the accompanying drawings.

[0105] The polar code encoding method provided in the embodiment of the present application can be used in any communication system, and the communication system can be a third generation partnership project (3GPP) communication system, for example, a long term evolution (LTE) system, and can also be a fifth generation (5G) mobile communication system, a system of LTE and 5G hybrid networking, a NR system, an NR vehicle external connection (vehicle to everything, V2X) system, a device-to-device (D2D) communication system, a machine-to-machine (M2M) communication system, an Internet of Things (IoT), a narrowband Internet of Things system (NB-IoT), a global system for mobile communications (GSM), an enhanced data rate for GSM evolution (EDGE), a wideband code division multiple access system (WCDMA), a code division multiple access 2000 system (code division multiple The mobile communication systems include CDMA2000, time division-synchronization code division multiple access (TD-SCDMA), enhanced mobile broadband (eMBB), ultra-reliable and low-latency communication (URLLC), enhanced machine-type communication (eMTC) and various types of next-generation communication systems, such as the sixth generation (6G) mobile communication system, and non-terrestrial network (NTN) system and non-3GPP communication system, without restriction.

[0106] The polar code encoding method provided in the embodiment of the present application can be applied to various communication scenarios, and is particularly applicable to a channel coding scenario in which the Polar code is used as a short code in a communication system. For example, it can be applied to one or more of the following communication scenarios: coding of a control channel, coding of a data channel, etc., without limitation.

[0107] Below Figure 2 Taking the communication system provided in the embodiment of the present application as an example, the communication system is described.

[0108] Figure 2 A schematic diagram of a communication system provided in an embodiment of the present application is shown in FIG. Figure 2 As shown, the communication system may include at least one terminal device and at least one network device.

[0109] in, Figure 2 The terminal device can be located within the beam / cell coverage of the network device, and the network device can provide communication services for the terminal device. Exemplarily, the network device can use channel coding to encode the downlink data, and transmit it to the terminal device through the air interface after constellation modulation (that is, the network device is a transmitting device, and the terminal device is a receiving device); the terminal device can also use channel coding to encode the uplink data, and send it to the network device through the air interface after constellation modulation (that is, the terminal device is a transmitting device, and the network device is a receiving device). It can be understood that when network devices communicate with network devices, or when terminal devices communicate with terminal devices, they can also communicate based on channel coding, that is, the transmitting device and the receiving device can both be network devices, or both can be terminal devices, without limitation.

[0110] Figure 2 The terminal device in the term "terminal device" may be a device with wireless transceiver functions or a chip or chip system that can be set in the device, which can allow users to access the network and is a device used to provide voice and / or data connectivity to users. The terminal device may also be called user equipment (UE), subscriber unit (subscriber unit), terminal (terminal) or mobile station (MS) or mobile terminal (MT), etc.

[0111] For example, Figure 2The terminal device in the invention can be a mobile phone, a tablet computer or a computer with wireless transceiver function. The terminal device can also be a user station, a mobile station, a remote station, a remote terminal device, a mobile terminal device, a user terminal device, a wireless communication device, a user agent, a user device, a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device with wireless communication function, a computing device, a processing device connected to a wireless modem, a vehicle-mounted device, a wearable device, a terminal device in the Internet of Things, a household appliance, a virtual reality (VR) terminal, an augmented reality (AR) terminal, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in telemedicine, a wireless terminal in a smart grid, a wireless terminal in a smart city, a wireless terminal in a smart home, a vehicle with vehicle-to-vehicle (V2V) communication capability, an intelligent networked vehicle, a UAV to UAV (UAV to Unmanned aerial vehicles (UAV, U2U) with communication capabilities, terminal devices in future networks, or terminal devices in future evolved public land mobile networks (PLMN), etc. are not restricted.

[0112] in, Figure 2 The network device in the network can be any device deployed in the access network that can communicate wirelessly with the terminal device, or a chip or chip system that can be set in the above device, or a logical node or a logical module or a function implemented in software, which can be used to implement wireless physical control functions, resource scheduling and wireless resource management, wireless access control, mobility management, etc. Specifically, the network device can be a device that supports wired access or a device that supports wireless access.

[0113] Exemplarily, the network device may be composed of one or more access network (AN) / radio access network (RAN) nodes. The AN / RAN node may be: a gNB, a transmission reception point (TRP), an evolved NodeB (eNB), a radio network controller (RNC), a NodeB (NB), a basestation controller (BSC), a base transceiver station (BTS), a home base station (e.g., home evolved NodeB, or home NodeB, HNB), a base band unit (BBU), or a wireless fidelity (Wi-Fi) access point (AP), etc.

[0114] In another example, the network equipment may include a baseband unit (BBU) and a remote radio unit (RRU). The BBU and the RRU may be placed in different places, for example, the RRU is remotely located in an area with high traffic volume, and the BBU is placed in a central computer room. The BBU and the RRU may also be placed in the same computer room. The BBU and the RRU may also be different components under one rack.

[0115] In another example, the network device may also be a device including a centralized unit (CU) node, or a distributed unit (DU) node, or a CU node and a DU node. For example, the network device can be divided into CU and DU from the perspective of logical functions, with the functions of some protocol layers centrally controlled by the CU, and the functions of the remaining part or all of the protocol layers distributed in the DU, which is centrally controlled by the CU. Furthermore, the centralized unit CU can also be divided into a control plane (CU-CP) and a user plane (CU-UP). In different systems, CU (including CU-CP or CU-UP) or DU may also have different names. For example, in an open radio access network (O-RAN) system, CU may also be referred to as O-CU (open CU), DU may also be referred to as O-DU, CU-CP may also be referred to as O-CU-CP, and CU-UP may also be referred to as O-CU-UP.

[0116] Based on the above description of the terminal device and the network device, optionally, the polar code encoding method provided in the embodiment of the present application can be implemented by the above-mentioned terminal device or network device, or by a component of the terminal device or the network device, such as an application specific integrated circuit (ASIC) deployed in the terminal device or the network device, a field programmable gate array (FPGA), or software (such as a program code in a memory), etc., without limitation.

[0117] Optionally, in the embodiment of the present application, the transmitting end device (or referred to as the information source) and the receiving end device (or referred to as the information sink) may adopt the following Figure 3 The process shown is for encoding and decoding.

[0118] Among them, the transmitting device can perform source coding on the bits generated by itself to obtain a source bit stream, and channel code the source bit stream, and then after modulation, send the modulation symbols to the receiving device through a noisy channel. When the receiving device receives the modulation symbols through the noisy channel, it can demodulate, and then perform channel decoding to recover the source bit stream, and then perform source decoding to obtain the decoding result.

[0119] When it comes to specific implementation, Figure 2 As shown: Each terminal device and network device can use Figure 4 The structure shown, or including Figure 4 Parts shown. Figure 4 The present invention provides a schematic diagram of the composition of a communication device 400, which can be a terminal device or a chip or system on chip in a terminal device; or a network device or a chip or system on chip in a network device. Figure 4 As shown, the communication device 400 includes a processor 401 , a transceiver 402 and a communication line 403 .

[0120] Furthermore, the communication device 400 may further include a memory 404. The processor 401, the memory 404 and the transceiver 402 may be connected via a communication line 403.

[0121] The processor 401 is a central processing unit (CPU), a general-purpose processor, a network processor (NP), a digital signal processor (DSP), a microprocessor, a microcontroller, a programmable logic device (PLD), or any combination thereof. The processor 401 may also be other devices with processing functions, such as circuits, devices, or software modules, without limitation.

[0122] The transceiver 402 is used to communicate with other devices or other communication networks. The other communication networks may be Ethernet, radio access network (RAN), wireless local area network (WLAN), etc. The transceiver 402 may be a module, a circuit, a transceiver or any device capable of achieving communication.

[0123] The communication line 403 is used to transmit information between the components included in the communication device 400.

[0124] The memory 404 is used to store instructions, where the instructions may be computer programs.

[0125] Among them, the memory 404 can be a read-only memory (ROM) or other types of static storage devices that can store static information and / or instructions, or a random access memory (RAM) or other types of dynamic storage devices that can store information and / or instructions, or an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (including compressed optical disc, laser disc, optical disc, digital versatile disc, Blu-ray disc, etc.), magnetic disk storage medium or other magnetic storage devices, etc., without limitation.

[0126] It should be noted that the memory 404 may exist independently of the processor 401, or may be integrated with the processor 401. The memory 404 may be used to store instructions or program codes or some data, etc. The memory 404 may be located in the communication device 400, or may be located outside the communication device 400, without limitation. The processor 401 is used to execute the instructions stored in the memory 404 to implement the polar code encoding method provided in the following embodiments of the present application.

[0127] In one example, the processor 401 may include one or more CPUs, such as Figure 4 CPU0 and CPU1 in.

[0128] As an optional implementation, the communication device 400 includes multiple processors, for example, Figure 4 In addition to the processor 401, a processor 407 may also be included.

[0129] As an optional implementation, the communication device 400 further includes an output device 405 and an input device 406. Exemplarily, the input device 406 is a device such as a keyboard, a mouse, a microphone or a joystick, and the output device 405 is a device such as a display screen and a speaker.

[0130] It should be noted that the communication device 400 can be a desktop computer, a portable computer, a network server, a mobile phone, a tablet computer, a wireless terminal, an embedded device, a chip system or a Figure 4 In addition, Figure 4 The structure shown in the figure does not constitute a limitation on the communication device, except Figure 4 In addition to the components shown, the communication device may include more or fewer components than shown, or combine certain components, or arrange the components differently.

[0131] In the embodiment of the present application, the chip system may be composed of a chip, or may include a chip and other discrete devices.

[0132] In addition, the actions, terms, etc. involved in the various embodiments of the present application can refer to each other without limitation. The message name or parameter name in the message exchanged between the various devices in the embodiments of the present application is only an example, and other names can also be used in the specific implementation without limitation.

[0133] Combine the following Figure 2 The communication system shown, referring to the following Figure 5 , the encoding method of the polar code provided in the embodiment of the present application is described, wherein the transmitting end device can be Figure 2 Any terminal device or network device in the communication system shown, the receiving device can also be Figure 2Any terminal device or network device in the communication system shown. The sending end device or receiving end device described in the following embodiments may have Figure 4 Parts shown.

[0134] Figure 5 A flowchart of a polar code encoding method provided in an embodiment of the present application, such as Figure 5 As shown, the method may include:

[0135] Step 501: The transmitting end device maps an information bit sequence of length k to k bits of a first sequence of length N according to a reliability sequence of length N to obtain a second sequence.

[0136] The reliability sequence may be used to indicate the reliability corresponding to each bit of the sequence. The larger the reliability value is, the more reliable the bit corresponding to the reliability is. The length of the reliability sequence may be N, where N is a positive integer.

[0137] Optionally, the reliability sequence may be an NR reliability sequence.

[0138] For example, taking the length N of the reliability sequence as 32, the reliability sequence may be the reliability sequence shown in the following Table 3, where: Represents reliability, Indicates the bits corresponding to the reliability:

[0139] Table 3 Reliability sequence

[0140]

[0141] It can be understood that the above Table 3 is defined starting from bit 0, and can also be defined starting from bit 1, that is, the above 0, 1, ..., 31 can be replaced by 1, 2, ..., 32 respectively without limitation.

[0142] Referring to the above reliability sequence, the transmitting end device may map the information bit sequence of length k to k bits of the first sequence of length N to obtain a second sequence.

[0143] Among them, the second sequence may include k information bits, x parity check PC bits and Nkx frozen bits, where k, N, and x are all positive integers; m information bits among the k information bits are the first m bits in the second sequence sorted from high to low in terms of reliability, and the remaining (km) information bits among the k information bits are bits in the second sequence corresponding to the first (km) information bits in a preset information bit set sorted from high to low in terms of reliability; the x PC bits are the x PC bits in the preset PC bit set.

[0144] Exemplarily, the length k of the information bit sequence can be any of the following values: 7, 8, 9, 10, or 11.

[0145] Optionally, the specific value of m can be determined according to the row weight and reliability.

[0146] Exemplarily, the number of bits corresponding to one or more rows may be determined as a specific value of m in order of reliability from high to low, for example, the value of m may be 6.

[0147] For example, taking the order of reliability from high to low as shown in Table 3 above as an example, the row weight corresponding to bit 31 is 32, the row weight corresponding to bit (30, 29, 27, 23, 15) is 16, and the row weight corresponding to bit (28, 22, 25, 26, 21, 14, 13, 19, 11, 7) is 8. According to the order of reliability from high to low, the number of bits corresponding to the first two row weights can be confirmed as the specific value of m, that is, the number of bits 6 corresponding to the row weight of 32 and the row weight of 16 can be determined as the value of m, that is, m is equal to 6.

[0148] It is understandable that the sending end device may determine the specific value of m based on the row weight and reliability, or the specific value of m may be predefined by the protocol, and the sending end device determines the specific value of m based on the predefined protocol without limitation.

[0149] Based on the above description of the value of m, the transmitting end device can determine the m information bits in the second sequence according to the specific value of m and the reliability sequence.

[0150] Exemplarily, taking N as 32, m as 6, and the reliability sequence as shown in Table 3 above, m of the k information bits can be the first 6 bits in the second sequence sorted from high to low in terms of reliability, that is, the m information bits can be the following bits in the second sequence: 15, 23, 27, 29, 30, 31.

[0151] Based on the above description of the m information bits, the m information bits have a nested characteristic for information bit sequences of different numbers (such as k equals 7, 8, 9, 10, or 11), and will not change with the length of the information bit sequence, thereby reducing the decoding complexity and improving the decoding performance.

[0152] Optionally, the preset information bit set and the preset PC bit set may be determined according to row weight and reliability.

[0153] For NR PC-Polar code, if the number of PC bits that need to be determined is n, PC , we can first determine the minimum row weight w corresponding to k information bits min, if the number of bits remaining after removing the information bits with the same row weight from the bit set corresponding to the minimum row weight is greater than or equal to n PC , then the first n bits sorted from high to low in reliability can be selected from the bit set corresponding to the minimum row weight PC The positions are used as PC bits, and the information bits with the same row weight are shifted to the bits with lower reliability. If the number of remaining bits is less than n PC , then select the first bit in descending order of reliability from the bit set corresponding to the minimum row weight. bits are used as PC bits, and the remaining The PC bits can be obtained from K+n PC Select the first bit in descending order of reliability. bits are used as PC bits.

[0154] For example, Figure 6 As shown in (a), the number of PC bits that need to be determined is n, which is predefined by the protocol. PC =4, the number of information bits k=10 as an example, the row weights corresponding to the 10 information bits include 32, 16, and 8, among which the number of information bits corresponding to the row weights 32 and 16 is 6, and the minimum row weight w corresponding to the 10 information bits min =8, the bit set corresponding to the minimum row weight 8 includes 10 bits: (28, 22, 25, 26, 21, 14, 13, 19, 11, 7), and the bit set needs to include 10-6=4 information bits. After removing the information bits with the same row weight from the bit set (that is, removing 4 information bits), the number of remaining bits is 6, which is greater than n PC Therefore, we can select the first n bits sorted from high to low in terms of reliability from the bit set corresponding to the minimum row weight 8. PC The positions are used as PC bits, that is, bit positions 28, 22, 25, and 26 can be used as PC bits, and the information bits with the same row weight are shifted to the bits with lower reliability, that is, 4 bits among bit positions 21, 14, 13, 19, 11, and 7 can be determined as information bits.

[0155] However, if the rate matching method based on the sub-block interleaving and puncturing from front to back according to Table 1 is adopted, the position of bit 7 is relatively forward. When E=24, 23, 22, 21, 20, 19 or 18, bit 7 will be punctured, so bit 7 is pre-frozen, and bit 7 of the second sequence can be set as a frozen bit (or can also be called a pre-frozen bit). Therefore, for the second sequence determined according to the information bit sequence of length k, the 6 bits corresponding to the row weights 32 and 16 can be determined as m=6 information bits, and km bits are selected from the bit set (21, 14, 13, 19, 11) with a row weight of 8 as information bits.

[0156] However, when k is greater than or equal to 8, the corresponding performance of the PC bits and information bits determined based on the above method still needs to be improved. Therefore, the selection method of the PC bits and information bits can be changed. That is, the x PC bits of the second sequence can be determined according to the preset PC bit set, and the km information bits of the second sequence can be determined according to the preset information bit set to improve the decoding performance and rate matching performance.

[0157] For example, Figure 6 As shown in (b) of FIG. 1 , the preset PC bit set may correspond to the following bits in the second sequence: 21, 26, 25, and 28. The preset information bit set may correspond to the following bits in the second sequence: 11, 19, 13, 14, and 22.

[0158] Optionally, the difference between the numbers of any two bits of any PC bit check in the preset PC bit set is not 1.

[0159] Exemplarily, taking k=9 as an example, the information bits of the second sequence may include 13, 14, 22, 15, 23, 27, 29, 30, and 31. Compared with the PC bit check bits including 13 and 14 (or including 14 and 15), if the PC bit check bits include one of 13 and 14 (or include one of 14 and 15), the performance can be greatly improved, that is, when the difference between the numbers of any two bits of any PC bit check in the preset PC bit set is not 1, the decoding performance and rate matching performance can be improved.

[0160] Optionally, the interval between the PC bit and the bit of the PC bit check may be a prime number or an even number, without limitation.

[0161] Exemplarily, with k=11, the information bits of the second sequence may include 11, 19, 13, 14, 22, 15, 23, 27, 29, 30, and 31. Taking the PC bit as 21 as an example, for bit 11, the PC bit 21 and bit 11 do not meet the prime number requirement, but better performance can be obtained when PC bit 21 checks bit 11, that is, the interval between the PC bit and the information bit checked by the PC bit can also be an even number to improve decoding performance and rate matching performance.

[0162] Optionally, the bit of the PC bit check may be an information bit of the second sequence or a frozen bit of the second sequence, without limitation.

[0163] Based on the above description of the PC bit and the PC check bit, illustratively, Figure 7 According to the PC equation shown in (b), when the PC bit is the 21st bit in the second sequence, the bit for PC bit check may be one or more of the following bit in the second sequence: 11, 14; or, when the PC bit is the 26th bit in the second sequence, the bit for PC bit check may be one or more of the following bit in the second sequence: 13, 19; or, when the PC bit is the 25th bit in the second sequence, the bit for PC bit check may be one or more of the following bit in the second sequence: 13, 22; or, when the PC bit is the 28th bit in the second sequence, the bit for PC bit check may be one or more of the following bit in the second sequence: 11, 13, 19.

[0164] Among them, Figure 7 Compared with the information bits, PC bits and PC equations corresponding to the nested PC-Polar code shown in (a), the embodiment of the present application provides Figure 7 The information bits, PC bits, and PC equations shown in (b) can be compatible with the sub-block interleaving rate matching method of NR PC-Polar code on the basis of satisfying the nested characteristics, thereby improving the decoding performance and rate matching performance.

[0165] Based on the above description of the preset PC bit set, PC equation and preset information bit set, the preset PC bit set, PC equation and preset information bit set have nested characteristics for information bit sequences of different numbers (such as k equals 7, 8, 9, 10, or 11), and will not change with the length of the information bit sequence.

[0166] Based on the above description of information bits and PC bits, optionally, the transmitting device can map the information bit sequence of length k to the k information bits of the first sequence in sequence according to the reliability sequence, and set the values ​​of the remaining Nk bits of the first sequence (including x PC bits and Nkx frozen bits) to 0 to obtain a second sequence.

[0167] Exemplarily, the value of x can be 4.

[0168] For example, taking N=32 and k=11 as an example, the transmitting device can map an information bit sequence of length 11 to the following 11 information bits of the first sequence: (11, 19, 13, 14, 22, 15, 23, 27, 29, 30, 31), set the 4 PC bits (21, 26, 25, 28) of the first sequence to 0, and set the remaining 17 frozen bits to 0 to obtain a second sequence.

[0169] Step 502: The transmitting end device performs polarization encoding on the second sequence to obtain a third sequence.

[0170] The transmitting device may multiply the second sequence by the Polar coding matrix to obtain a third sequence.

[0171] Optionally, the transmitting device may also use a sub-block interleaving rate matching method of the NR PC-Polar code to perform rate matching on the third sequence.

[0172] Among them, the transmitting end device can refer to the sub-block interleaving pattern shown in the above Table 1, perform sub-block interleaving on the third sequence in units of sub-blocks, obtain a sub-block interleaved sequence, and perform rate matching on the sub-block interleaved sequence.

[0173] Based on the above Figure 5 The method shown provides a polar code encoding scheme with nested characteristics, and different numbers of information bit sequences can construct polar codes based on the same m information bits, preset information bit sets and preset PC bit sets. The m information bits, preset information bit sets and preset PC bit sets have nested characteristics for different numbers of information bit sequences and will not change with the number of information bit sequences. At the same time, the PC-Polar code with nested characteristics obtained based on the m information bits, preset information bit sets and preset PC bit sets can reuse the sub-block interleaving rate matching mode of the NR PC-Polar code. The PC-Polar code with nested characteristics still has good rate matching performance under the sub-block interleaving rate matching mode of the NR PC-Polar code, which can simplify the rate matching operation, improve NR compatibility, and improve communication performance.

[0174] Optional, based on the above Figure 5 The method shown below Figures 8 to 12The rate matching performance comparisons of different short code schemes (such as the length of the information bit sequence is 7, 8, 9, 10 or 11) are given respectively, wherein the cross mark indicates the performance of the LTE-RM code under FHT decoding, the circle mark indicates the performance of the nested PC-Polar code obtained based on the search under the nested perforation sequence obtained based on the search, the triangle mark curve pointing to the right indicates the performance of the nested PC-Polar code obtained based on the search under NR sub-block interleaving rate matching, the asterisk mark indicates the performance of the NR constructed Polar code (without PC check) under NR sub-block interleaving rate matching, the triangle mark pointing downward indicates the performance of the NR PC-Polar code under NR sub-block interleaving rate matching, and finally the triangle mark pointing to the left indicates the performance of the PC-Polar code with nested characteristics provided in the embodiment of the present application under the sub-block interleaving rate matching of the NR PC-Polar code.

[0175] The horizontal axis of the performance comparison diagram is the code length E after puncturing, ranging from 18 to N (eg, 32), and the vertical axis is the SNR required to achieve BLER=0.01. The lower the curve, the better the performance.

[0176] according to Figures 8 to 12 It can be found that the PC-Polar code with nested characteristics provided in the embodiment of the present application can obtain performance similar to that of the nested PC-Polar code obtained based on the search when adopting the NR sub-block interleaving rate matching method, and the performance can be close to the performance of the LTE-RM code under FHT decoding.

[0177] Fig.13 A schematic diagram of another polar code encoding method provided in an embodiment of the present application is shown as follows: Fig.13 As shown, the method may include:

[0178] Step 1301: The transmitting end device maps an information bit sequence of length k to k bits of a first sequence of length N according to a reliability sequence of length N to obtain a fourth sequence.

[0179] The reliability sequence may be used to indicate the reliability corresponding to each bit of the sequence. The larger the reliability value is, the more reliable the bit corresponding to the reliability is. The length of the reliability sequence may be N, where N is a positive integer.

[0180] Exemplarily, the reliability sequence may be an NR reliability sequence (or may also be described as a reliability sequence corresponding to an NR PC-Polar code). For example, taking the reliability sequence length N as 32 as an example, the reliability sequence may be the reliability sequence shown in Table 3 above.

[0181] In another example, the reliability sequence may also be a reliability sequence corresponding to the nested PC-Polar code. For example, taking the reliability sequence length N as 32 as an example, the reliability sequence may also be a reliability sequence shown in the following Table 4, where: Represents reliability, Indicates the bits corresponding to the reliability:

[0182] Table 4 Reliability sequence

[0183]

[0184] It can be understood that the above Table 4 is defined starting from bit 0, and can also be defined starting from bit 1, that is, the above 0, 1, ..., 31 can be replaced by 1, 2, ..., 32 respectively without limitation.

[0185] Referring to the above reliability sequence, the transmitting end device may map the information bit sequence of length k to k bits of the first sequence of length N to obtain a fourth sequence.

[0186] The fourth sequence may include k information bits, 0 PC bits and Nk frozen bits, where k and N are both positive integers.

[0187] Exemplarily, the value of k can be any one of the following: 3, 4, 5, or 6.

[0188] According to the reliability sequence shown in Table 3 or Table 4 above, Fig.14 As shown, it can be found that when the mother code length N of the ultra-short code is 32, and the value of k can be any one of the following: 3, 4, 5, or 6, whether the reliability sequence corresponding to the NR PC-Polar code shown in Table 3 or the reliability sequence corresponding to the nested PC-Polar code shown in Table 4 is used, the information bits finally determined are the same, and the rate matching methods corresponding to these k values ​​when the length E after rate matching is E={18, 19, 20, 21, …, 32} are all rate matching puncturing methods based on sub-block interleaving. Therefore, when the value of k can be any one of the following: 3, 4, 5, or 6, the rate matching method based on sub-block interleaving of the NR PC-Polar code can be directly multiplexed.

[0189] Based on the above description, the transmitting device can map the information bit sequence of length k to the first k bits in the first sequence of length N sorted from high to low according to the reliability sequence of length N, and set the remaining Nk bits to 0 to obtain a fourth sequence.

[0190] Optional, since the number of PC bits is 0, The number of is also 0; among them, Indicates n PCThe number of PC bits (i.e. the number of PC bits) that sacrifice the reliability of information bits.

[0191] For example, taking N=32 and K=3 as an example, when n PC =3, According to the reliability sequence, the three most reliable positions 31, 30, and 29 should be selected as information bits, because the minimum row weight in the information bit set is equal to 2. 4 =16, This means that you need to select a position with the highest reliability from the positions with a row weight of 16 as the PC position. The row weights of 30 and 29 in the information position are both 16, and the reliability of 30 is higher, so the 30th position becomes the PC position, and 28 becomes a new information position with reduced reliability.

[0192] Step 1302: The transmitting end device performs polarization encoding on the fourth sequence to obtain a fifth sequence.

[0193] Among them, the transmitting device can multiply the fourth sequence with the Polar coding matrix to obtain the fifth sequence.

[0194] Step 1303: The transmitting end device performs rate matching on the fifth sequence in a front-to-back puncturing manner to obtain a sixth sequence.

[0195] Among them, Fig.14 As shown in the figure, the information bits when k={3,4,5,6} are (29 30 31), (27 29 30 31), (23 27 29 30 31), and (15 23 27 29 30 31), respectively. That is, the information bits of k=3 are a subset of the information bits of k=4, the information bits of k=4 are a subset of the information bits of k=5, and the information bits of k=5 are a subset of the information bits of k=6. Therefore, if the sub-block interleaving rate matching method based on NRPC-Polar code adopts a shortening method from back to front, these positions will be shortened and the nesting characteristics of the information bits cannot be guaranteed. At the same time, because the code rate of the control information will not be too high, from the performance perspective, the performance will be better when the rate matching method in the medium and low code rate range adopts a puncturing method from front to back.

[0196] Optionally, before performing rate matching on the fifth sequence in a front-to-back puncturing manner, the transmitting end device may further perform sub-block interleaving on the fifth sequence according to the first interleaving pattern.

[0197] Exemplarily, the first interleaving pattern may be the interleaving pattern shown in Table 1 above, and the first interleaving pattern may also be described as: used to indicate that the values ​​on the Ath sub-block of the fifth sequence are swapped and placed on the Bth sub-block of the interleaved fifth sequence; the mapping relationship between A and B is: (31, 31), (30, 30), (29, 29), (27, 28), (28, 27), (26, 26), (25, 25), (24, 24), (23, 23), ( 15, 22), (22, 21), (14, 20), (21, 19), (13, 18), (20, 17), (12, 16), (19, 15), (11, 14), (18, 13), (10, 12), (17, 11), (9, 10), (16, 9), (8, 8), (7, 7), (6, 6), (5, 5), (3, 4), (4, 3), (2, 2), (1, 1), (0, 0).

[0198] Based on the above Fig.13 The method shown provides a polar code encoding scheme with nested characteristics. Different numbers of k information bit sequences can determine k information bits and 0 PC bits to construct polar codes based on the same reliability sequence. The k information bits and 0 PC bits have nested characteristics for different numbers of information bit sequences and will not change with the number of information bit sequences. At the same time, the PC-Polar code with nested characteristics obtained based on the k information bits and 0 PC bits can adopt the sub-block interleaving rate matching puncturing method of the NR PC-Polar code from front to back to ensure the nested characteristics of the information bits. The PC-Polar code with nested characteristics still has good rate matching performance under the sub-block interleaving rate matching puncturing method of the NR PC-Polar code, which can simplify the rate matching operation, improve NR compatibility, and improve communication performance.

[0199] Optional, based on the above Fig.13 The method shown below Figures 15 to 18The rate matching performance comparisons of different short code schemes (such as the length of the information bit sequence is 3, 4, 5 or 6) are given respectively, wherein the cross mark indicates the performance of the LTE-RM code under FHT decoding, the circle mark indicates the performance of the nested PC-Polar code obtained based on the search under the nested perforation sequence obtained based on the search, the triangle mark curve pointing to the right indicates the performance of the nested PC-Polar code obtained based on the search under NR sub-block interleaving rate matching, the asterisk mark indicates the performance of the NR constructed Polar code (without PC check) under NR sub-block interleaving rate matching, the triangle mark pointing downward indicates the performance of the NR PC-Polar code under NR sub-block interleaving rate matching, and finally the triangle mark pointing to the left indicates the performance of the PC-Polar code with nested characteristics provided in the embodiment of the present application under the sub-block interleaving rate matching of the NR PC-Polar code.

[0200] The horizontal axis of the performance comparison diagram is the code length E after puncturing, ranging from 18 to N (eg, 32), and the vertical axis is the SNR required to achieve BLER=0.01. The lower the curve, the better the performance.

[0201] according to Figures 15 to 18 It can be found that the PC-Polar code with nested characteristics provided in the embodiment of the present application can obtain performance similar to that of the nested PC-Polar code obtained based on the search when using the NR sub-block interleaving rate matching puncturing method, and the performance can be close to the performance of the LTE-RM code under FHT decoding.

[0202] Optional, based on the above Fig.13 The method shown below Fig.19 A comparison of rate matching performances of different short code schemes (such as the length of the information bit sequence is 3, 4, 5 or 6) is given, wherein the cross mark indicates the performance of the LTE-RM code under FHT decoding, the circle mark indicates the performance of the nested PC-Polar code obtained based on the search under the nested puncturing sequence obtained based on the search, the asterisk mark indicates the performance of the NR-constructed Polar code (without PC check) under NR sub-block interleaving rate matching, and the triangle mark corresponds to the performance of the PC-Polar code with nested characteristics provided in the embodiment of the present application under the NR sub-block interleaving rate matching puncturing method.

[0203] The horizontal axis of the performance comparison diagram is the code length E after puncturing, ranging from 18 to N (eg, 32), and the vertical axis is the SNR required to achieve BLER=0.01. The lower the curve, the better the performance.

[0204] according to Fig.19It can be found that the performance of the PC-Polar code with nested characteristics provided in the embodiment of the present application using the NR sub-block interleaving rate matching puncturing method is close to the performance of the puncturing sequence obtained based on the performance nested search before, and is better than the performance of the LTE-RM code under rate matching.

[0205] It should be noted that the above embodiments are all explained by taking the definition starting from bit 0 as an example. It is understandable that the definition can also be explained starting from bit 1, that is, the above 0, 1, ..., 31 can be replaced by 1, 2, ..., 32 respectively without limitation.

[0206] In addition, in the above method, very short codes (very shortcodes) with an information bit sequence length of 3 to 11 are used as an example for explanation. It can be understood that the length of the very short code is not limited to 3 to 11, but can also be other lengths. The information bit sequence can also be a pre-transformed polar code, a polarization adjusted convolutional (PAC) code, etc., without limitation.

[0207] It should be noted that the various embodiments of the present application can be implemented independently or in combination without limitation. If there is no special explanation or logical conflict, the terms and / or descriptions of the different embodiments provided in the present application are consistent and can be referenced to each other, and the technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationships.

[0208] It is understandable that in the embodiments of the present application, the execution subject may execute some or all of the steps in the embodiments of the present application, and these steps or operations are only examples. The embodiments of the present application may also execute other operations or variations of various operations. In addition, the various steps may be executed in different orders presented in the embodiments of the present application, and it is possible that not all operations in the embodiments of the present application need to be executed.

[0209] The above mainly introduces the solution provided by the embodiment of the present application from the perspective of interaction between devices. It is understandable that, in order to realize the above functions, each device includes a hardware structure and / or software module corresponding to each function. Those skilled in the art should easily realize that, in combination with the algorithm steps of each example described in the embodiments disclosed herein, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present application.

[0210] The embodiment of the present application can divide the functional modules of each device according to the above method example. For example, each functional module can be divided according to each function, or two or more functions can be integrated into one processing module. The above integrated module can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of modules in the embodiment of the present application is schematic and is only a logical function division. There may be other division methods in actual implementation.

[0211] In the case of dividing each functional module into corresponding functional modules, Fig. 20 A communication device 200 is shown, which can perform the above Figures 5 to 19 The actions performed by the sending end device in the method shown, all relevant contents of each step involved in the above method embodiment can be referred to the functional description of the corresponding functional module, and the technical effects that can be obtained can refer to the above method embodiment, which will not be repeated here.

[0212] Wherein, the communication device 200 may include a transceiver module 2001 and a processing module 2002. Exemplarily, the communication device 200 may be a communication device, or a chip applied to a communication device, or other combined devices, components, etc. having the functions of the above-mentioned communication device. When the communication device 200 is a communication device, the transceiver module 2001 may be a transceiver, and the transceiver may include an antenna and a radio frequency circuit, etc.; the processing module 2002 may be a processor (or a processing circuit), such as a baseband processor, and the baseband processor may include one or more CPUs. When the communication device 200 is a component having the functions of the above-mentioned communication device, the transceiver module 2001 may be a radio frequency unit; the processing module 2002 may be a processor (or a processing circuit), such as a baseband processor. When the communication device 200 is a chip system, the transceiver module 2001 may be an input and output interface of a chip (such as a baseband chip); the processing module 2002 may be a processor (or a processing circuit) of the chip system, and may include one or more central processing units. It should be understood that the transceiver module 2001 in the embodiment of the present application can be implemented by a transceiver or a transceiver-related circuit component; the processing module 2002 can be implemented by a processor or a processor-related circuit component (or, referred to as a processing circuit).

[0213] For example, the transceiver module 2001 can be used to perform Figures 5 to 19 All transceiver operations performed by the communication device in the embodiment shown, and / or other processes used to support the technology described herein; the processing module 2002 can be used to perform Figures 5 to 19 All operations except the transceiver operations performed by the communication device in the illustrated embodiment, and / or other processes for supporting the technology described herein.

[0214] As another possible way to achieve this, Fig. 20 The transceiver module 2001 in the embodiment can be replaced by a transceiver, and the transceiver can integrate the functions of the transceiver module 2001; the processing module 2002 can be replaced by a processor, and the processor can integrate the functions of the processing module 2002. Further, Fig. 20 The illustrated communication device 200 may also include a memory.

[0215] Alternatively, when the processing module 2002 is replaced by a processor and the transceiver module 2001 is replaced by a transceiver, the communication device 200 involved in the embodiment of the present application can also be Fig.21 The communication device 210 shown, wherein the processor may be a logic circuit 2101, and the transceiver may be an interface circuit 2102. Further, Fig.21 The illustrated communication device 210 may also include a memory 2103 .

[0216] The embodiments of the present application also provide a computer program product, which can implement the functions of any of the above method embodiments when executed by a computer.

[0217] The embodiments of the present application also provide a computer program, which can implement the functions of any of the above method embodiments when executed by a computer.

[0218] The embodiment of the present application also provides a computer-readable storage medium. All or part of the processes in the above method embodiments can be completed by a computer program to instruct the relevant hardware, and the program can be stored in the above computer-readable storage medium. When the program is executed, it may include the processes of the above method embodiments. The computer-readable storage medium can be an internal storage unit of a terminal (including a data sending end and / or a data receiving end) in any of the above embodiments, such as a hard disk or memory of the terminal. The above computer-readable storage medium can also be an external storage device of the above terminal, such as a plug-in hard disk equipped on the above terminal, a smart memory card (smart media card, SMC), a secure digital (secure digital, SD) card, a flash card (flash card), etc. Further, the above computer-readable storage medium can also include both an internal storage unit of the above terminal and an external storage device. The above computer-readable storage medium is used to store the above computer program and other programs and data required by the above terminal. The above computer-readable storage medium can also be used to temporarily store data that has been output or is to be output.

[0219] It should be noted that the terms "first" and "second" in the specification, claims and drawings of this application are used to distinguish different objects rather than to describe a specific order. "First" and "second" are used for descriptive purposes only and cannot be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Therefore, the features defined as "first" and "second" may explicitly or implicitly include one or more of the features. In the description of this embodiment, unless otherwise specified, "multiple" means two or more.

[0220] In addition, the terms "include" and "have" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device comprising a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to these processes, methods, products or devices.

[0221] It should be understood that in the present application, "at least one (item)" refers to one or more. "Multiple" refers to two or more. "At least two (items)" refers to two or three and more than three. "And / or" is used to describe the association relationship of associated objects, indicating that three relationships can exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the associated objects before and after are in an "or" relationship. "At least one of the following items" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple. “When” and “if” both mean that corresponding measures will be taken under certain objective circumstances. It does not limit the time, nor does it require any judgment when it is implemented, nor does it mean that there are other limitations.

[0222] In the embodiments of the present application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a concrete way for easy understanding.

[0223] In this application, "sending information to ... (terminal device)" can be understood as the destination of the information being the terminal device. It can include sending information to the terminal device directly or indirectly. "Receiving information from ... (terminal device)" can be understood as the source of the information being the terminal device, which can include receiving information from the terminal device directly or indirectly. The information may be processed as necessary between the source and destination of the information, such as format changes, but the destination can understand the valid information from the source.

[0224] Through the description of the above implementation methods, technical personnel in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional modules is used as an example. In actual applications, the above-mentioned functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above.

[0225] In the several embodiments provided in the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the modules or units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another device, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0226] The units described as separate components may or may not be physically separated, and the components shown as units may be one physical unit or multiple physical units, that is, they may be located in one place or distributed in multiple different places. Some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.

[0227] In addition, each functional unit in each embodiment of the present 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. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0228] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application can essentially or all or part of the technical solution can be embodied in the form of a software product, which is stored in a storage medium, including a number of instructions to enable a device (which can be a single-chip microcomputer, chip, etc.) or a processor (processor) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as USB flash drives, mobile hard drives, ROM, RAM, magnetic disks or optical disks.

Claims

1. A polar code encoding method, characterized in that: include: According to a reliability sequence of length N, an information bit sequence of length k is mapped to k bits of a first sequence of length N to obtain a second sequence; wherein the second sequence includes k information bits, x parity check PC bits and Nkx frozen bits, and k, N, and x are all positive integers; m information bits of the k information bits are the first m bits in the second sequence sorted from high to low in terms of reliability, and the remaining (km) information bits of the k information bits are the bits in the second sequence corresponding to the first (km) information bits in a preset information bit set sorted from high to low in terms of reliability; the x PC bits are the x PC bits in the preset PC bit set; Polarization encoding is performed on the second sequence to obtain a third sequence.

2. The method according to claim 1, characterized in that The value of k is any one of the following: 7, 8, 9, 10, or 11.

3. The method according to claim 1 or 2, characterized in that: The m information bits are the following bit positions in the second sequence: 15, 23, 27, 29, 30, 31.

4. The method according to any one of claims 1 to 3, characterized in that: The preset information bit set corresponds to the following bit positions in the second sequence: 11, 19, 13, 14, and 22.

5. The method according to any one of claims 1 to 4, characterized in that: The difference between the numbers of any two bits of the PC bit check is not 1.

6. The method according to any one of claims 1 to 5, characterized in that: The preset PC bit set corresponds to the following bits in the second sequence: 21, 26, 25, and 28.

7. The method according to claim 6, characterized in that When the PC bit is the 21st bit in the second sequence, the bit of the PC bit check is one or more of the following bits in the second sequence: 11, 14; or When the PC bit is the 26th bit in the second sequence, the bit of the PC bit check is one or more of the following bit positions in the second sequence: 13, 19; or When the PC bit is the 25th bit in the second sequence, the bit of the PC bit check is one or more of the following bit positions in the second sequence: 13, 22; or When the PC bit is the 28th bit in the second sequence, the bit of the PC bit check is one or more of the following bit positions in the second sequence: 11, 13, 19.

8. The method according to any one of claims 1 to 7, characterized in that: Bit 7 of the second sequence is a frozen bit.

9. A polar code encoding method, characterized in that: include: According to the reliability sequence of length N, an information bit sequence of length k is mapped to k bits of the first sequence of length N to obtain a fourth sequence; wherein the fourth sequence includes k information bits, 0 parity check PC bits and Nk frozen bits, where k and N are both positive integers; Performing polarization encoding on the fourth sequence to obtain a fifth sequence; The fifth sequence is rate matched according to a puncturing method from front to back to obtain a sixth sequence.

10. The method according to claim 9, characterized in that The value of k is any one of the following: 3, 4, 5, or 6.

11. The method according to claim 9 or 10, characterized in that: Before performing rate matching on the fifth sequence in a forward-to-backward puncturing manner, the method further includes: performing sub-block interleaving on the fifth sequence according to the first interleaving pattern; The first interleaving pattern is used to indicate that the values ​​on the Ath sub-block of the fifth sequence are swapped and placed on the Bth sub-block of the interleaved fifth sequence; the mapping relationship between A and B is: (31, 31), (30, 30), (29, 29), (27, 28), (28, 27), (26, 26), (25, 25), (24, 24), (23, 23), (15, 22), (22, 21), (14, 20), (21, 19), (13, 18), (20, 17), (12, 16), (19, 15), (11, 14), (18, 13), (10, 12), (17, 11), (9, 10), (16, 9), (8, 8), (7, 7), (6, 6), (5, 5), (3, 4), (4, 3), (2, 2), (1, 1), (0, 0).

12. A communication device, characterized in that: include: A processing module, configured to map an information bit sequence of length k to k bits of a first sequence of length N according to a reliability sequence of length N, to obtain a second sequence; wherein the second sequence includes k information bits, x parity check PC bits and Nkx frozen bits, and k, N, and x are all positive integers; m information bits of the k information bits are the first m bits in the second sequence sorted from high to low in terms of reliability, and the remaining (km) information bits of the k information bits are bits in the second sequence corresponding to the first (km) information bits in a preset information bit set sorted from high to low in terms of reliability; and the x PC bits are x PC bits in a preset PC bit set; The processing module is further configured to perform polarization encoding on the second sequence to obtain a third sequence.

13. The device according to claim 12, characterized in that The value of k is any one of the following: 7, 8, 9, 10, or 11.

14. The device according to claim 12 or 13, characterized in that The m information bits are the following bit positions in the second sequence: 15, 23, 27, 29, 30, 31.

15. The device according to any one of claims 12 to 14, characterized in that: The preset information bit set corresponds to the following bit positions in the second sequence: 11, 19, 13, 14, and 22.

16. The device according to any one of claims 12 to 15, characterized in that: The difference between the numbers of any two bits of the PC bit check is not 1.

17. The device according to any one of claims 12 to 16, characterized in that: The preset PC bit set corresponds to the following bits in the second sequence: 21, 26, 25, and 28.

18. The device according to claim 17, characterized in that When the PC bit is the 21st bit in the second sequence, the bit of the PC bit check is one or more of the following bits in the second sequence: 11, 14; or When the PC bit is the 26th bit in the second sequence, the bit of the PC bit check is one or more of the following bit positions in the second sequence: 13, 19; or When the PC bit is the 25th bit in the second sequence, the bit of the PC bit check is one or more of the following bit positions in the second sequence: 13, 22; or When the PC bit is the 28th bit in the second sequence, the bit of the PC bit check is one or more of the following bit positions in the second sequence: 11, 13, 19.

19. The device according to any one of claims 12 to 18, characterized in that: Bit 7 of the second sequence is a frozen bit.

20. A communication device, characterized in that: include: A processing module, configured to map an information bit sequence of length k to k bits of a first sequence of length N according to a reliability sequence of length N, to obtain a fourth sequence; wherein the fourth sequence includes k information bits, 0 parity check PC bits and Nk frozen bits, where k and N are both positive integers; The processing module is further used to perform polarization encoding on the fourth sequence to obtain a fifth sequence; The processing module is further configured to perform rate matching on the fifth sequence in a puncturing manner from front to back to obtain a sixth sequence.

21. The device according to claim 20, characterized in that The value of k is any one of the following: 3, 4, 5, or 6.

22. The device according to claim 20 or 21, characterized in that Before the processing module performs rate matching on the fifth sequence in a forward-to-backward puncturing manner, the processing module is further configured to: performing sub-block interleaving on the fifth sequence according to the first interleaving pattern; The first interleaving pattern is used to indicate that the values ​​on the Ath sub-block of the fifth sequence are swapped and placed on the Bth sub-block of the interleaved fifth sequence; the mapping relationship between A and B is: (31, 31), (30, 30), (29, 29), (27, 28), (28, 27), (26, 26), (25, 25), (24, 24), (23, 23), (15, 22), (22, 21), (14, 20), (21, 19), (13, 18), (20, 17), (12, 16), (19, 15), (11, 14), (18, 13), (10, 12), (17, 11), (9, 10), (16, 9), (8, 8), (7, 7), (6, 6), (5, 5), (3, 4), (4, 3), (2, 2), (1, 1), (0, 0).

23. A communication device, characterized in that: The communication device includes a processor; the processor is used to run a computer program or an instruction so that the polar code encoding method according to any one of claims 1 to 8 is executed, or the polar code encoding method according to any one of claims 9 to 11 is executed.

24. The communication device according to claim 23, characterized in that The communication device further comprises a memory for storing the computer program or instructions.

25. A communication device, characterized in that: The communication device includes an interface circuit and a logic circuit; the interface circuit is used to input and / or output information; the logic circuit is used to execute the polar code encoding method according to any one of claims 1 to 8, or execute the polar code encoding method according to any one of claims 9 to 11, and process and / or generate the information according to the information.

26. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer instruction or a program. When the computer instruction or the program is executed on a computer, the polar code encoding method according to any one of claims 1 to 8 is executed, or the polar code encoding method according to any one of claims 9 to 11 is executed.

27. A computer program product, characterized in that The computer program product includes computer instructions; when part or all of the computer instructions are executed on a computer, the polar code encoding method according to any one of claims 1 to 8 is executed, or the polar code encoding method according to any one of claims 9 to 11 is executed.

Images