An encoding method, a decoding method, a processing node, and a storage medium

Abstract

The application provides an encoding method, a decoding method, a processing node and a storage medium. The encoding method comprises: obtaining a source information bit sequence; obtaining a first bit sequence based on the source information bit sequence; obtaining a second bit sequence based on a first Polar sequence and the first bit sequence; performing polar code encoding on the second bit sequence to obtain a third bit sequence; and transmitting all or part of the bits of the third bit sequence; the second Polar sequence corresponding to a sub-block of the same length in the first Polar sequence is the same; the second Polar sequence corresponding to a sub-block with a length of Ns in the first Polar sequence is nested in the second Polar sequence corresponding to a sub-block with a length of Ns / 2, Ns is greater than 8 and Ns is equal to a power of 2; and there is no code rate belonging to a sub-code rate set in the code rate of each sub-code in the second bit sequence corresponding to the first Polar sequence, the sub-code rate set being used to indicate a sub-code rate that cannot be parallel decoded.

Description

Technical Field

[0001] This application relates to the field of data processing technology, such as an encoding method, a decoding method, a processing node, and a storage medium. Background Technology

[0002] With the development of virtual reality, augmented reality, intelligent transportation, intelligent industrial control, and large-scale artificial intelligence (AI) models, mobile communication technology has increasingly higher requirements for ultra-high data rates and ultra-low latency. Polar codes are a channel coding method with achievable capacity. Successive cancellation (SC) is a commonly used decoding algorithm for polar codes. Its process can be viewed as a depth-first traversal of a binary tree. The number of nodes traversed determines the decoding latency, and the idea of ​​serial decoding directly leads to the difficulty of achieving high throughput in SC decoding algorithms, increasing decoding latency. To achieve fast SC decoding, a fast successive cancellation (Fast-SC) algorithm was proposed. Fast-SC is a fast decoding method for polar codes, which can also be understood as a parallel decoding method. The decoding problem of a polar code of length N can be regarded as decoding multiple smaller subcodes. Parallel decoding methods exist for certain types of subcodes. In the Fast-SC algorithm, parallel decoding of specific types of subcodes can effectively reduce the number of nodes that need to be traversed, thereby reducing the decoding latency of polar codes and increasing the decoding data rate.

[0003] However, in fast decoding, the size of the sub-block directly affects the parallelism of the decoding process. Generally, larger sub-blocks result in higher parallelism, while smaller sub-blocks result in lower parallelism. However, for specific sub-block sizes and sub-code rates, parallel decoding remains challenging. Considering that the required parallelism for different types of user equipment should be selectable, how to achieve parallel decoding under different parallelism levels, and how to address specific sub-code rates that cannot be decoded in parallel, effectively handle application scenarios with varying parallelism requirements, and improve decoding speed are urgent problems to be solved. Summary of the Invention

[0004] This application provides an encoding method, a decoding method, a processing node, and a storage medium.

[0005] This application provides an encoding method, including:

[0006] Obtain the source information bit sequence;

[0007] A first bit sequence is obtained based on the source information bit sequence;

[0008] The second bit sequence is obtained based on the first Polar sequence and the first bit sequence;

[0009] The second bit sequence is polar-coded to obtain the third bit sequence;

[0010] Send all or part of the bits of the third bit sequence;

[0011] In the first Polar sequence, the second Polar sequences corresponding to sub-blocks of the same length are all identical;

[0012] In the first Polar sequence, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2, where Ns is greater than 8 and Ns is equal to a power of 2;

[0013] In the second bit sequence corresponding to the first Polar sequence, the code rate of each subcode does not belong to the code rate set of subcodes, which is used to indicate the code rates of subcodes that cannot be decoded in parallel.

[0014] This application also provides a decoding method, including:

[0015] Receive all or part of the data sequence to be decoded from the third bit sequence;

[0016] The data sequence to be decoded is polar-coded to obtain the decoded second bit sequence;

[0017] The first bit sequence is obtained by combining the decoded second bit sequence with the first Polar sequence.

[0018] The decoded source information bit sequence is obtained based on the decoded first bit sequence;

[0019] In the first Polar sequence, the second Polar sequences corresponding to sub-blocks of the same length are all identical;

[0020] In the first Polar sequence, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2, where Ns is greater than 8 and Ns is equal to a power of 2;

[0021] In the second bit sequence corresponding to the first Polar sequence, the code rate of each subcode does not belong to the code rate set of subcodes, which is used to indicate the code rates of subcodes that cannot be decoded in parallel.

[0022] This application embodiment also provides a processing node, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the above-described encoding method.

[0023] This application also provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described encoding method. Attached Figure Description

[0024] Figure 1 A schematic diagram of information bits and frozen bits in a bit index before Polar encoding is provided for one embodiment;

[0025] Figure 2 This is a schematic diagram illustrating an application scenario of an encoding and decoding method provided in one embodiment;

[0026] Figure 3 A flowchart illustrating an encoding method provided in one embodiment;

[0027] Figure 4 A schematic diagram of a polarization transformation factor corresponding to N=16 provided in one embodiment;

[0028] Figure 5 A flowchart illustrating a decoding method provided in one embodiment;

[0029] Figure 6 This is a schematic diagram of the block error rate curves corresponding to different bit lengths to be encoded, provided as an embodiment.

[0030] Figure 7 A schematic diagram of the block error rate curves corresponding to different bit lengths to be encoded, provided as an embodiment;

[0031] Figure 8 A schematic diagram of the structure of an encoding device is provided in one embodiment;

[0032] Figure 9 A schematic diagram of the structure of a decoding device provided in one embodiment;

[0033] Figure 10 This is a schematic diagram of the hardware structure of a processing node provided in one embodiment. Detailed Implementation

[0034] The present application will now be described in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are for illustrative purposes only and are not intended to limit the scope of the application. It should be noted that, unless otherwise specified, the embodiments and features described herein can be arbitrarily combined with each other. Furthermore, it should be noted that, for ease of description, only the parts relevant to the present application are shown in the accompanying drawings, not the entire structure.

[0035] The Polar sequence of a Polar code can be understood as an ascending order of bit index reliability. The Polar sequence of a Polar code can be represented as follows: Each element in the sequence This represents a bit index before Polar encoding, satisfying: i = 0, 1, ..., N max -1, the reliability of Polar code sequences satisfies: in, Represents bit index The reliability.

[0036] When the length of the information to be encoded is K, the bit index before Polar encoding with the highest reliability is selected to carry the information to be encoded, while the other lower-reliability bit indices before Polar encoding carry known frozen bit information. Since there is a problem of slow decoding under specific subcode sizes and rates, achieving fast decoding of a Polar sequence at arbitrary code lengths and rates is impractical. To ensure fast decoding at various code lengths and rates, the sequence is typically adjusted for fast decoding. This can be done by dynamically adjusting the reliability order of the sequence or using a sequence adjustment table to indicate the position of the pre-Polar bit index to be adjusted at the current code length and rate. However, these methods increase computation or storage requirements, and the Polar code sequence is not unique when the code rate changes. Besides these issues, these methods generally only solve the problem of fast decoding with fixed subcode sizes and cannot select the appropriate sub-block size based on the actual application scenario.

[0037] The advantage of Fast-SC decoding is that, during the decoding of Polar codes, the decoding output of a sub-code can be completed within one clock cycle or a very short time, depending on the characteristics of the sub-code. For example, for a master code length N equal to 16, a sub-block size P equal to 4, and a sub-block number of 4, based on the Polar code sequence, the K bits to be encoded are placed in the K most reliable positions in the bit indices before Polar encoding, and the remaining NK bits are placed with frozen bits 0. These N bits are then divided into 4 sub-blocks starting from the first bit, such as... Figure 1As shown, the leaf nodes correspond to the bit index numbers before Polar encoding. The bit index numbers before Polar encoding are 0, 1, ..., 15 from left to right. The solid circles in the leaf nodes represent the bit index positions where the information bits are placed. In this example, the information bits to be encoded are located at bit indices {7, 9, 10, 11, 12, 13, 14, 15}. The hollow circles in the leaf nodes represent the bit index positions where the frozen bit 0 is placed. In this example, it is located at bit indices {0, 1, 2, 3, 4, 5, 6, 8}.

[0038] Figure 1 This diagram illustrates the information bits and frozen bits in the bit index before Polar encoding, as provided in one embodiment. For example, the bit index carrying N bits before Polar encoding is divided into four sub-blocks starting from the first bit index. The bit indexes before Polar encoding for the first sub-block are {0,1,2,3}, for the second sub-block {4,5,6,7}, for the third sub-block {8,9,10,11}, and for the fourth sub-block {12,13,14,15}. The Fast-SC decoding approach involves a depth-first traversal decoding process in a binary tree. When decoding reaches the first sub-block, since all four bits in the first sub-block are frozen bits, they can be directly set to 0. The ratio of the number of information bits in the sub-block to the sub-block size is considered the sub-code rate, which is 0, i.e., the Rate-0 node in the diagram.

[0039] Then, the depth-first decoding continues to the second sub-block. The first three bits in the second sub-block carry the frozen bits, and the last bit carries the information bits. Assuming the information to be encoded in this sub-block is [0,0,0,u], then the encoded information for this sub-block is:

[0040]

[0041] It can be observed that all the information bits obtained after encoding the above sub-blocks are bits u. Therefore, when decoding to the second sub-block, all the corresponding soft information can be summed, and a threshold detection can be performed through sign judgment. The detection result is used as the decoding output of this sub-code. The code rate of this sub-code is 1 / 4. Figure 1 The REP node in the middle;

[0042] Continuing the depth-first decoding to the third sub-block, the first bit index in the third sub-block carries the frozen bit, and the last three bit indices carry the information bit. Assuming the information to be encoded in this sub-block is [0, u0, u1, u2], then the encoded information for this sub-block is:

[0043]

[0044] It can be observed that the checksum of the information bits obtained after encoding the above sub-block is equal to 0. Therefore, when decoding to the second sub-block, all corresponding input soft information can be hard-determined. If the checksum is not equal to 0, the estimated value of the least reliable bit is flipped. The result after hard-determining is used as the decoding output of this sub-code. The code rate of this sub-code is 3 / 4. Figure 1 SPC nodes in;

[0045] Continuing the depth-first traversal to the fourth sub-block, the four bits corresponding to this sub-block are all information bits to be encoded. Symbol determination can be directly performed on these four bits, and the resulting bits are used as the decoded output of this sub-block. The code rate of this sub-code is 1. Figure 1 The Rate-1 node in the data.

[0046] As the size of the sub-blocks and the number of information bits change, the sub-blocks obtained after segmenting the bit index before Polar encoding have various types of sub-code rates. Under the constraint of very small performance loss, not all sub-code rates can be decoded quickly. In order to ensure that fast decoding can be performed under various code lengths and rates, the existing fast polar code construction methods generally include the following steps: the (N,K) polar code constructed using the traditional polar code construction method is segmented according to the length P; all frozen bit positions are initialized to the active state, and the active bit positions can be converted into information bit positions; it is determined whether each segment belongs to the set of fast-decoding modes. If it does not belong to the set of fast-decoding modes, the least reliable information position of the current segment is converted into a frozen bit position, and the frozen bit positions in the active state in a subsequent segment are converted into information bit positions; the segment containing the frozen bit position converted into an information bit position should still belong to the set of fast-decoding modes after conversion. If it does not belong, the position is made inactive, and a new position is selected.

[0047] Existing solutions require running a rate adjustment algorithm for each code length and code rate configuration, resulting in high complexity. Furthermore, they are only applicable to fast decoding with the same sub-block size. Considering that different types of user equipment may require different degrees of parallelism, this application proposes a Polar code-based encoding method that does not require rate adjustment for various code lengths and code rates. Through a single Polar code sequence, fast decoding can be achieved at various sub-block sizes, such as 8, 16, and 32, thereby addressing usage scenarios with different parallelism requirements.

[0048] To facilitate understanding of this embodiment, the application scenarios of the encoding method disclosed in this embodiment will first be described in detail. The encoding method provided in this embodiment can be applied to any scenario requiring wireless data transmission. During data transmission, due to the influence of factors such as multipath, noise, and interference, Polar encoding can be used as a channel coding method to eliminate the distortion caused by data during transmission. The Polar encoding method provided in this embodiment can be applied to 5G-A, 6G mobile communication networks, or other communication networks.

[0049] Figure 2 This is a schematic diagram illustrating an application scenario of an encoding and decoding method provided in one embodiment. For example... Figure 2 As shown, the application scenario includes, but is not limited to, the first processing node 10 and the second processing node 20, wherein the first processing node 10 and the second processing node 20 can transmit and receive wireless signals and perform related interactions.

[0050] In one embodiment, the first processing node 10 and the second processing node 20 may include, but are not limited to, the following electronic devices: base station (BS), access point (AP), node B, g node B (generalized node B), radio network controller (RNC), evolved Node B (eNB), base station controller (BSC), base transceiver station (BTS), transceiver function (TF), radio router, radio transceiver, basic service set (BSS), extended service set (ESS), or radio base station (RBS). The first processing node and the second processing node may also be access terminals, user equipment (UE), user units, user stations, mobile stations, mobile stations, remote stations, remote terminals, mobile devices, user terminals, wireless communication equipment, user agents, or user devices. It can also be a cellular phone, cordless phone, Session Initiation Protocol (SIP) phone, Wireless Local Loop (WLL) station, Personal Digital Assistant (PDA), handheld device with wireless communication capabilities, computing device or other processing device connected to a wireless modem, in-vehicle device, wearable device, device in a 5G network or a future 6G or higher network, etc., without being specifically limited here.

[0051] In one example, the first processing node is a base station and the second processing node is a user equipment (UE); in another example, the first processing node is a UE and the second processing node is a base station.

[0052] Based on the above application scenarios, the main body executing the encoding method in this embodiment is generally an electronic device with certain computing power. In some possible implementations, the encoding method can be implemented by the processor calling computer-readable instructions stored in the memory.

[0053] It is understood that the execution entity of the encoding method provided in this embodiment may be, but is not limited to, [a specific entity]. Figure 2 The first processing node in the schematic diagram of the scenario shown, or the corresponding execution subject that can be selected and set by those skilled in the art according to the actual application scenario, is not limited in this embodiment. Here, in order to more conveniently describe the application scenario and principle of this disclosure, the first processing node is often used as the execution subject of the encoding method in the relevant parts of the following related embodiments, but it should not be construed as a limitation on the embodiments of this disclosure.

[0054] Based on the above implementation environment, the following shows the details of the data encoding technology and various specific embodiments.

[0055] Figure 3 This is a flowchart illustrating an encoding method provided in one embodiment. The method can be applied to a first processing node, which mainly refers to an encoding end or a sending end. Figure 3 As shown, the method provided in this embodiment includes:

[0056] Step 110: Obtain the source information bit sequence;

[0057] Step 120: Obtain the first bit sequence based on the source information bit sequence;

[0058] Step 130: Obtain the second bit sequence based on the first Polar sequence and the first bit sequence;

[0059] Step 140: Encode the second bit sequence using polar codes to obtain the third bit sequence;

[0060] Step 150: Send all or part of the bits of the third bit sequence;

[0061] Where the length of the source information bit sequence is A, and A is an integer greater than 0, the source information bit sequence can be represented as u = [u0, u1, u2, ..., u...]. A-1 The specific implementation method for obtaining the source information bit sequence can be set by those skilled in the art according to their needs. This application focuses on the process of data encoding the source information bit sequence, and does not describe any other limitations on how to determine the source information bit sequence.

[0062] The length of the first bit sequence is K, where K is an integer greater than or equal to A; the length of the second bit sequence is N, where N is an integer greater than K and N is a power of 2; the length of the third bit sequence is N, and the number of bits in the third bit sequence sent is E, where E is an integer greater than A.

[0063] In the first Polar sequence, the second Polar sequences corresponding to sub-blocks of the same length are all the same;

[0064] In the first Polar sequence, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2, where Ns is greater than 8 and Ns is equal to a power of 2.

[0065] In the second bit sequence corresponding to the first Polar sequence, the code rate of each subcode does not belong to the subcode code rate set, which indicates the subcode code rates that cannot be decoded in parallel. The encoding method of this application, by processing the first bit sequence with a Polar code Polar sequence to obtain the second bit sequence, allows multiple subcode sizes in the second bit sequence to be decoded quickly (i.e., in parallel), without any code rates that cannot be decoded quickly. This solves the problem in Polar encoding where fast decoding is only possible based on the same sub-block size. The sub-block size can be dynamically configured according to the user's capabilities, allowing different sub-block sizes to be selected for fast decoding under different parallelism requirements. For example, fast decoding can be performed with sub-block sizes of 8, 16, and 32, thus addressing different parallelism requirements, reducing decoding latency, and improving decoding efficiency.

[0066] In one embodiment, the source information bit sequence may include, but is not limited to, an uplink control information bit sequence, a downlink control information bit sequence, an uplink data information bit sequence, and a downlink data information bit sequence. Downlink may represent data transmission from a first processing node to a second processing node, and uplink may represent data transmission from a second transmission node to a first transmission node.

[0067] In one embodiment, the source information bit sequence may be information carried in one of the following physical channels: physical uplink control channel, physical uplink shared channel, physical downlink control channel, physical downlink shared channel, and physical broadcast channel.

[0068] In one embodiment, obtaining the first bit sequence based on the source information bit sequence includes: obtaining the first bit sequence based on the source information bit sequence according to at least one of the following methods: bit stuffing, first encoding method.

[0069] The purpose of padding bits is mainly to ensure that the length K of the first bit sequence can be decoded quickly. For example, there exists a sequence such that K equals any even number and can be decoded quickly. During decoding, the padding bits can be regarded as information bits, and a check relationship is formed based on the modulo-2 addition of some or all of the bits in the source information bit sequence. The padding bits can also serve as a check. If the padding bits only form a check relationship with the modulo-2 addition of the first half of the bits in the source information bit sequence, then a check can be performed when decoding to the first half of the source information bit sequence. If the check is not satisfied, decoding is terminated early to reduce unnecessary decoding overhead and improve decoding efficiency.

[0070] In one embodiment, obtaining the first bit sequence based on the source information bit sequence includes one of the following methods:

[0071] Method 1: Fill the source information bit sequence with bits, and encode the bit sequence after filling with bits using the first encoding method to obtain the first bit sequence;

[0072] Method 2: Encode the source information bit sequence using the first encoding method, and then fill the bit sequence after encoding using the first encoding method with bits;

[0073] Method 3: Encode the source information bit sequence using the first encoding method to obtain the first bit sequence;

[0074] Method 4: Fill the source information bit sequence with bits to obtain the first bit sequence;

[0075] Method 5: Use the source information bit sequence as the first bit sequence.

[0076] Based on the above method one: First, fill the source information bit sequence with bits, and then encode the filled bit sequence using the first encoding method to obtain the first bit sequence. The source information bit sequence can be represented as u = [u0, u1, u2, ..., u...]. A-1 The padding bits can be located in one of the following positions: before the source information bit sequence, after the source information bit sequence, or between the source information bit sequences.

[0077] Example 1: Filling bit u padding Located before the source information bits [u padding ,u0,u1,u2,...,u A-1 The padded bit sequence is then encoded using Cyclic Redundancy Check (CRC) to obtain the first bit sequence [c0, c1, c2, ..., c]. K-1 ] = [u padding ,u0,u1,u2,...,u A-1 ,r0,r1,...,r L-1 ], where [r0,r1,...,r L-1 ] represents the CRC check bit sequence, and L is the length of the CRC.

[0078] Example 2: Filling bit u padding Located after the source information bits [u0,u1,u2,...,u A-1 ,u padding The padded bit sequence is then CRC encoded to obtain the first bit sequence [c0, c1, c2, ..., c]. K-1] = [u0,u1,u2,...,u A-1 ,u padding ,r0,r1,...,r L-1 ], where [r0,r1,...,r L-1 ] represents the CRC check bit sequence, and L is the length of the CRC.

[0079] Example 3: Filling bit u padding Located between source information bits [u0, u1, u2, ..., u q-1 ,u padding ,...,u A-1 The padded bit sequence is then CRC encoded to obtain the first bit sequence [c0, c1, c2, ..., c]. K-1 ] = [u0,u1,u2,...,u q-1 ,u padding ,...,u A-1 ,r0,r1,...,r L-1 ], where [r0,r1,...,r L-1 ] represents the CRC check bit sequence, and L is the length of the CRC.

[0080] A feasible example based on Examples 1 and 2: u padding =u0⊕u1⊕u2⊕...⊕u A-1 The padding bits and the modulo-2 addition of all bits in the source information bit sequence form a check relationship.

[0081] Based on this, performing verification after decoding the information bits can reduce the false alarm rate of CRC check (false alarms mainly refer to the situation where the decoded data is incorrect but the CRC check passes). If CRC cannot correctly determine whether an error has occurred, the check relationship of the padding bits can be used for further verification.

[0082] In one possible embodiment, u padding =u0⊕u1⊕u2⊕...⊕u q-1 The padding bits and the modulo-2 sum of the first q bits in the source information bit sequence form a check relationship, where q is an integer greater than 0 and less than A. After decoding u... padding Then, a check is performed. If the check is satisfied, decoding continues; otherwise, decoding stops to reduce redundant calculations. The specific padding bits and which bits' modulo-2 additions form the check relationship are not specifically limited here. The above CRC encoding can also be a parity check encoding, or a combination of CRC encoding and parity check encoding; it is not limited to using only CRC encoding.

[0083] Based on the above-mentioned method two: First, the source information bit sequence is encoded using the first encoding method. Then, bits are padded to the bit sequence encoded using the first encoding method to obtain the first bit sequence. The source information bit sequence is represented as u = [u0, u1, u2, ..., u...]. A-1 The bit sequence obtained after encoding the source information bit sequence using the first encoding method can be represented as [u0, u1, u2, ..., u]. A-1 ,r0,r1,...,r L-1 ], where [r0,r1,...,r L-1 ] is the CRC check bit sequence, and the padding bits can be located in one of the following positions: before the bit sequence encoded by the first encoding method, after the bit sequence encoded by the first encoding method, or between the bit sequences encoded by the first encoding method.

[0084] Example 4: Filling bit u padding [u] is located before the bit sequence encoded by the first encoding method. padding ,u0,u1,u2,...,u A-1 ,r0,r1,...,r L-1 ].

[0085] Example 5: Filling bit u padding Located after the bit sequence encoded by the first encoding method [u0,u1,u2,...,u A-1 ,r0,r1,...,r L-1 ,u padding ].

[0086] Example 6: Filling bit u padding Located between the bit sequences [u0, u1, u2, ..., u] after encoding using the first encoding method q-1 ,u padding ,...,u A-1 ,r0,r1,...,r L-1 ].

[0087] Based on a feasible example from Examples 4 and 5, u padding =u0⊕u1⊕u2⊕...⊕u A-1 ⊕r0⊕r1⊕...⊕r L-1 The padding bits, modulo-2 sum of all bits in the bit sequence encoded by the first encoding method, form a check relationship. Beneficial effect: Performing verification after decoding the information bits reduces the false alarm rate of CRC check (the situation where the decoded data is incorrect, but the CRC check passes). Since CRC cannot correctly determine whether an error has occurred, the check relationship of the padding bits can be used for further verification.

[0088] In one possible embodiment, upadding =u0⊕u1⊕u2⊕...⊕u q-1 The padding bits, modulo-2 sum of the first q bits in the bit sequence encoded by the first encoding method, form a checksum, where q is an integer greater than 0 and less than A+L. After decoding u... padding A check is then performed. If the check is satisfied, decoding continues; otherwise, decoding stops to reduce redundant calculations. The specific fill bits and which bits' modulo-2 additions form the check relationship are not specifically defined here.

[0089] Based on the above method three: the source information bit sequence is encoded using the first encoding method to obtain the first bit sequence. In this example, no padding is needed for the source information bit sequence; the source information bit sequence is represented as u = [u0, u1, u2, ..., u...]. A-1 The bit sequence obtained after encoding the source information bit sequence using the first encoding method can be represented as [u0, u1, u2, ..., u]. A-1 ,r0,r1,...,r L-1 ], where [r0,r1,...,r L-1 ] is the CRC check bit sequence.

[0090] Based on the above method four: padding bits are added to the source information bit sequence to obtain the first bit sequence. In this example, no first encoding method is required; the source information bit sequence is represented as u = [u0, u1, u2, ..., u...]. A-1 The source information bit sequence is padded, and the padded bits can be located in one of the following positions: before the source information bit sequence, after the source information bit sequence, or between the source information bit sequence and the source information bit sequence.

[0091] Example 7: Filling bit u padding Located before the source information bit sequence [u padding ,u0,u1,u2,...,u A-1 ].

[0092] Example 8: Filling bit u padding Located after the source information bit sequence [u0,u1,u2,...,u A-1 ,u padding ].

[0093] Example 9: Filling bit u padding Located between the source information bit sequences [u0, u1, u2, ..., u P-1 ,u padding ,...,u A-1 ].

[0094] Based on a feasible example from Examples 7 and 8, u padding=u0⊕u1⊕u2⊕...⊕u A-1 The padding bits and the modulo-2 addition of all bits in the bit sequence encoded by the first encoding method form a check relationship.

[0095] Based on a feasible example from Example 9, u padding =u0⊕u1⊕u2⊕...⊕u q-1 The padding bits and the modulo-2 sum of the first q bits in the source information bit sequence form a check relationship, where q is an integer greater than 0 and less than A. After decoding u... padding A check is then performed. If the check is satisfied, decoding continues; otherwise, decoding stops to reduce redundant calculations. The specific fill bits and which bits' modulo-2 additions form the check relationship are not specifically defined here.

[0096] Based on the above method four: no first encoding method or bit stuffing is required, and the source information bit sequence is equal to the first bit sequence.

[0097] In one embodiment, the padded bits and the modulo-2 addition of some or all of the bits in the source information bit sequence constitute one of the following check relationships: odd check relationship, even check relationship.

[0098] In one embodiment, the first encoding method includes at least one of the following: cyclic redundancy check encoding and parity check encoding.

[0099] In one embodiment, the number of padded bits satisfies at least one of the following:

[0100] The number of padding bits is at most 1, such that the length of the first bit sequence is equal to an even number;

[0101] The number of padding bits is at most 1, such that the length of the first bit sequence is an odd number;

[0102] The number of padding bits is at most 3, such that the length of the first bit sequence is a multiple of 4;

[0103] The number of padding bits is at most 7, such that the length of the first bit sequence is a multiple of 8.

[0104] In this embodiment, a key purpose of padding bits is to ensure that the length of the first bit sequence always falls within a preset set of first bit sequence lengths. When the length of the first bit sequence falls within this set, it ensures that the Polar sequence in this embodiment can be used for fast decoding without needing to adjust the sequence. For example, if the set of first bit sequence lengths is equal to the set of all even numbers greater than 0 and less than N, then without adjusting the Polar sequence, fast decoding is possible when the length of the first bit sequence is equal to any of these even numbers. However, fast decoding cannot be guaranteed when the length of the first bit sequence is equal to an odd number.

[0105] In the embodiments of this application, being able to decode quickly can be understood as meaning that each sub-code rate in the second bit sequence does not belong to the sub-code rate set, and the sub-code rate set contains sub-code rates that cannot be decoded quickly, or it can be understood as meaning that the sub-code rate set contains sub-code rates that cannot be decoded in parallel.

[0106] The method in this application embodiment enables fast decoding under multiple different sub-block sizes. Each sub-block, within a preset set of first bit sequence lengths, has no sub-code rate that cannot be decoded quickly. For example, fast decoding can be performed under sub-block sizes of 8, 16, and 32, thereby addressing application scenarios with different parallelism requirements.

[0107] In this embodiment of the application, the length of the first bit sequence is K, the length of the first Polar sequence is N, the length of the second bit sequence is N, and Ns is greater than 8 and equal to a power of 2.

[0108] In the embodiments of this application, a sub-block refers to a sub-block obtained by dividing the second bit sequence from the first bit into blocks at the same interval P, where P is the size of the sub-block and P is divisible by N.

[0109] In one example, the second bit sequence can be represented as:

[0110] [x0,x1,...,x P-1 ,x P ,x P+1 ,...,x 2P-1 ,...,x N-1 ],

[0111] In this sequence, each element in the second bit sequence is a bit value, and the first sub-block corresponds to [x0, x1, ..., x]. P-1 The bits of the first sub-block are carried at the indices corresponding to bit indices 0, 1, ..., P-1, and the bits of the second sub-block correspond to [x]. P ,x P+1 ,...,x 2P-1The bits of the second sub-block are carried at the indices corresponding to the bit index numbers P, P+1, ..., 2P-1, and so on up to the last sub-block.

[0112] In one embodiment, the second Polar sequences corresponding to sub-blocks of the same length in the first Polar sequence are all identical;

[0113] For the i-th sub-block in the first Polar sequence, the second Polar sequence corresponding to the sub-block is obtained by subtracting the bit index corresponding to i*P from the first sequence. The first sequence is formed by the bit indices of the first Polar sequence belonging to the interval [i*P, (i+1)*P-1] according to the order in the first Polar sequence, and P is the size of the sub-block. For any i, the second Polar sequence is the same.

[0114] In this embodiment, the bit indices belonging to the interval [i*P, (i+1)*P-1] in the first Polar sequence are sorted according to the order in the first Polar sequence to form the first sequence. Subtracting the bit index corresponding to i*P from the first sequence yields the second Polar sequence. For any selectable i, the second Polar sequence is identical. i equals 0, 1, ..., N / P, where P is the sub-block size, and there are a total of N / P second Polar sequences.

[0115] In one example, the first Polar sequence is [0 1 2 4 3 5 6 8 7 9 10 12 11 13 14 15], P=4, N=16; the bit index before Polar encoding is located in the interval [0*P, (0+1)*P-1], and the i=0th second Polar sequence is [0 1 2 3]. The values ​​in the second Polar sequence are subtracted by 0 to form the second Polar sequence [0 1 2 3]. The bit index before Polar encoding is located in the interval [1*P, (1+1)*P-1], and the i=1th second Polar sequence is [4 5 6 7]. The values ​​in the second Polar sequence are subtracted by 4 to form the second Polar sequence [0 1 2 3]. [3]; The bit index before Polar encoding is located in the interval [2*P, (2+1)*P-1]. The second Polar sequence i=2 is [8 9 10 11]. Subtracting 8 from the values ​​in the second Polar sequence forms the second Polar sequence [0 1 2 3]. The bit index before Polar encoding is located in the interval [3*P, (3+1)*P-1]. The second Polar sequence i=3 is [12 13 14 15]. Subtracting 12 from the values ​​in the second Polar sequence forms the second Polar sequence [0 1 2 3]. Therefore, for any i, its second Polar sequence is the same.

[0116] In one embodiment, the second Polar sequence corresponding to a sub-block of length Ns in the first Polar sequence is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2. For a sub-block of length Ns in the first Polar sequence, the third Polar sequence is obtained by subtracting the bit index corresponding to i*Ns / 2 from the second sequence. The second sequence is formed by the bit indices of the second Polar sequence corresponding to the sub-block of length Ns that belong to the interval [i*Ns / 2, (i+1)*Ns / 2-1], according to the order in the second Polar sequence corresponding to the sub-block of length Ns. The third Polar sequence corresponding to i equals 0 is the same as the third Polar sequence corresponding to i equals 1, and the third Polar sequence is the same as the second Polar sequence corresponding to the sub-block of length Ns / 2.

[0117] In this embodiment, the bit indices belonging to the interval [i*Ns / 2, (i+1)*Ns / 2-1] in the second Polar sequence of sub-block length Ns are sorted according to the order of the second Polar sequence of sub-block length Ns to form a second sequence. The second sequence minus the bit index corresponding to i*Ns / 2 forms a third Polar sequence. The third Polar sequence corresponding to i equal to 0 is the same as the third Polar sequence corresponding to i equal to 1, and satisfies the following: the third Polar sequence is the same as the second Polar sequence of sub-block length Ns / 2. The length of the second Polar sequence of sub-block length Ns is Ns, and the length of the second Polar sequence of sub-block length Ns / 2 is Ns / 2.

[0118] In one example, the sub-block length Ns = 16, Ns / 2 = 8, the second Polar sequence with sub-block length Ns / 2 = 8 is [0,1,2,4,3,5,6,7], and the second Polar sequence with sub-block length Ns = 16 is [0,1,2,4,8,3,5,6,9,10,12,7,11,13,14,15]. When i = 0, the bit indexes belonging to the interval [0,7] are processed by subtracting 0 from the sequence formed by sorting the second Polar sequence with a sub-block length of 16 to form the third Polar sequence [0,1,2,4,3,5,6,7]. When i = 1, the bit indexes belonging to the interval [8,15] are processed by subtracting 8 from the sequence formed by sorting the second Polar sequence with a sub-block length of 16 to form the third Polar sequence [8,9,10,12,11,13,14,15] - 8 = [0,1,2,4,3,5,6,7]. The third Polar sequence corresponding to i = 0 and i = 1 is the same, and the third Polar sequence is also the same as the second Polar sequence with a sub-block length of Ns / 2 = 8.

[0119] In one embodiment, the second Polar sequence corresponding to a sub-block of length Ns in the first Polar sequence is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2; Ns satisfies at least one of the following:

[0120] When Ns equals 16, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2;

[0121] When Ns equals 32, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2;

[0122] When Ns equals 64, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2;

[0123] When Ns equals 64 or 32, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2.

[0124] When Ns equals 32 or 16, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2.

[0125] When Ns equals 64, 32, or 16, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2.

[0126] Based on the above, under the condition of continuous nesting, it is possible to quickly decode multiple nested sub-blocks of various sizes.

[0127] In one embodiment, obtaining a second bit sequence based on a first Polar sequence and a first bit sequence includes:

[0128] The first bit sequence is carried by the K most reliable indices in the first Polar sequence, and the remaining NK indices are carried by the frozen bits to obtain the second bit sequence of length N.

[0129] The sub-blocks in the second bit sequence represent the sub-blocks obtained by dividing the second bit sequence from the first bit at equal intervals P, where P is the size of the sub-block and P is divisible by N. Each sub-block corresponds to a specific sub-code rate, which can be defined as the ratio of the number of information bits in the sub-block to the size of the sub-block.

[0130] The code rate of each subcode in the second bit sequence does not belong to the code rate set of subcode codes. The code rate set of subcode codes is used to indicate the code rates of subcodes that cannot be decoded in parallel.

[0131] In one example, the first Polar sequence is [0,1,2,4,3,5,6,7], and the length K of the first bit sequence is equal to 4. The index [3,5,6,7] before Polar encoding carries the first bit sequence, and the index [0,1,2,4] before Polar encoding carries the frozen bits. If the sub-block size P is equal to 4, the first sub-block corresponds to index [0,1,2,3]. In the first sub-block, the first three indices carry the frozen bits, and the last index carries the information bits. The code rate of the first sub-code is 1 / 4. The second sub-block corresponds to index [4,5,6,7]. In the second sub-block, the first index carries the frozen bits, and the last three indices carry the information bits. The code rate of the second sub-code is 3 / 4.

[0132] In one embodiment, the code rate of the sub-code code rate set is determined according to at least one of the following parameters: the size P of the sub-block, and the second Polar sequence corresponding to the size P of the sub-block. The second Polar sequence corresponding to the sub-block length P refers to: the bit indices belonging to the interval [i*P, (i+1)*P-1] in the first Polar sequence are sorted according to the first Polar sequence to form a first sequence, and the sequence obtained by subtracting i*P from the first sequence.

[0133] In one embodiment, the second Polar sequence corresponding to the size of the sub-block includes at least one of the following:

[0134] When the size of the sub-block is equal to 8, the second Polar sequence is: [0 1 2 4 3 5 6 7];

[0135] When the size of the sub-block is equal to 16, the second Polar sequence is: [0 1 2 4 8 3 5 6 9 10 12 711 13 14 15];

[0136] With a sub-block size of 32, the second Polar sequence is: [0 1 2 4 8 16 3 5 6 9 10 17 12 7 18 20 24 11 13 19 14 21 22 25 26 28 23 15 27 29 30 31];

[0137] When the size of the sub-block is equal to 64, the second Polar sequence is: [0 1 2 4 8 16 3 32 5 6 9 10 17 12 7 33 18 34 20 24 36 11 40 13 19 21 14 48 35 22 25 37 38 41 26 28 42 23 49 44 39 15 50 27 52 56 29 43 30 45 51 46 53 54 57 58 31 60 55 47 59 61 62 63].

[0138] In one embodiment, the code rates in the subcode code rate set satisfy at least one of the following:

[0139] When the size of the sub-block is equal to 16, the sub-code rate set must contain at least the code rates {5 / 16, 9 / 16}.

[0140] When the size of the sub-block is equal to 32, the sub-code rate set must contain at least the code rates {6 / 32, 10 / 32, 19 / 32, 24 / 32}.

[0141] When the size of the sub-block is equal to 64, the sub-code rate set must contain at least the code rates {6 / 64, 11 / 64, 24 / 64, 29 / 64, 31 / 64, 39 / 64, 50 / 64, 55 / 64}.

[0142] If the second bit sequence is divided into sub-blocks of 32, and the code rate of each sub-code does not belong to {6 / 32, 10 / 32, 19 / 32, 24 / 32}, then when the sub-block length is 16, the code rate of each sub-code will definitely not belong to {5 / 16, 9 / 16}. This allows the first Polar sequence to be decoded quickly under different sub-block sizes to adapt to different parallelism requirements of the device.

[0143] It is understandable that the second Polar sequence can be selected according to actual needs, and the code rate in the subcode code rate set can be determined based on the second Polar sequence. Other second Polar sequences will not be listed here.

[0144] It is understandable that the sub-block size P is the minimum decoding parallelism. For example, if the sub-code rate of three consecutive sub-blocks is 0 and the sub-code rate of the next sub-block is 1 / P, then the above four sub-blocks can be decoded as a 4*P sub-block. The sub-code rate of this large sub-block is 1 / (4*P), and the sub-code rate of this large sub-block can also be used for fast decoding.

[0145] It is understandable that the length of the first bit sequence is not arbitrarily selectable. According to the above embodiments, the length of the first bit sequence can be even, odd, or other values. If the first Polar sequence can be quickly decoded when the first bit sequence has all even values, then the length of the first bit sequence should be even. As in the aforementioned embodiments, when the sum of the length A of the source information bit sequence and the number of check bits L obtained by the first encoding method is odd, one bit needs to be padded to make the length of the first bit sequence even. Therefore, when the first bit sequence is even, each sub-code rate in the second bit sequence obtained based on the first Polar sequence should not have a sub-code rate that is difficult to decode quickly. Similarly, the first Polar sequence can be quickly decoded when the first bit sequence has all odd values; when the first bit sequence is odd, each sub-code rate in the second bit sequence obtained based on the first Polar sequence should not have a sub-code rate that is difficult to decode quickly. The same applies to other values, and will not be elaborated further here.

[0146] Based on the above, fast decoding can be performed for the first bit sequence with a specific length, thereby improving decoding speed and reducing decoding latency. The specific length mentioned above refers to all selectable even numbers, selectable odd numbers, multiples of 4, multiples of 8, etc.

[0147] In one embodiment, the K most reliable indices in the first Polar sequence carry the first bit sequence, and the remaining NK indices carry frozen bits, resulting in a second bit sequence of length N. In a specific implementation, the first bit sequence is represented as [c0, c1, c2, ..., c...]. K-1 The second bit sequence is represented as [x0, x1, x2, ..., x]. N-1 Q represents the set of bit indices that carry information bits.

[0148] In one example, the process of obtaining the second bit sequence is as follows:

[0149]

[0150] In one embodiment, the length of the first Polar sequence is a power of 2, and the length of the first Polar sequence is at least one of the following: 256, 512, 1024, 2048, 4096, 8192.

[0151] In one embodiment, the second bit sequence is encoded using Polar codes to obtain the third bit sequence. In this embodiment, the second bit sequence x = [x0, x1, x2, ..., x...] is... N-1 The polarization matrix G with N rows and N columns N Multiplying over GF(2) yields the codeword y = x·G N ,in, Taking N=16 as an example, the corresponding polarization transformation factor is as follows: Figure 4 As shown.

[0152] In one embodiment, all or part of the bits of the third bit sequence are sent. The part of the bits to be sent can be selected according to a preset rule, which includes, but is not limited to: selecting E consecutive bits in the third bit sequence for sending, or selecting E non-consecutive bits in the third bit sequence for sending. The number of part of the bits to be sent is E, and the specific selection method is not limited in this embodiment.

[0153] Figure 5 This is a flowchart illustrating a decoding method as provided in one embodiment. This method can be applied to a second processing node, which mainly refers to a decoding end or a receiving end. It should be noted that technical details not described in detail in this embodiment can be found in any of the above embodiments. Figure 5 As shown, the method provided in this embodiment includes:

[0154] Step 210: Receive all or part of the data sequence to be decoded from the third bit sequence;

[0155] Step 220: Perform polar code decoding on the data sequence to be decoded to obtain the decoded second bit sequence;

[0156] Step 230: Obtain the decoded first bit sequence based on the decoded second bit sequence and the first Polar sequence;

[0157] Step 240: Obtain the decoded source information bit sequence based on the decoded first bit sequence;

[0158] The length of the decoded source information bit sequence is A, where A is an integer greater than 0; the length of the first decoded bit sequence is K, where K is an integer greater than or equal to A; the length of the second decoded bit sequence is N, where N is an integer greater than K and N is a power of 2; and the number of bits in the received third bit sequence is E, where E is an integer greater than A.

[0159] In the first Polar sequence, the second Polar sequences corresponding to sub-blocks of the same length are all identical;

[0160] In the first Polar sequence, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2, where Ns is greater than 8 and Ns is equal to a power of 2;

[0161] In the second bit sequence corresponding to the first Polar sequence, the code rate of each subcode does not belong to the code rate set of subcodes, which is used to indicate the code rates of subcodes that cannot be decoded in parallel.

[0162] In this embodiment, upon receiving the data sequence to be decoded, the second processing node can perform data processing to obtain the original source information bit sequence. The length of the decoded source information bit sequence is A, where A is an integer greater than 0; the length of the first decoded bit sequence is K, where K is an integer greater than or equal to A; the length of the second decoded bit sequence is N, where N is an integer greater than K and equal to a power of 2; the length of the third decoded bit sequence is N, and the size of the data in the received third bit sequence is E, where E is an integer greater than A.

[0163] For the received data sequence to be decoded, the decoded second bit sequence can be obtained based on Polar decoding, and the decoded first bit sequence can be obtained from the decoded second bit sequence based on the first Polar sequence. The decoded bit sequence can be obtained based on at least one of the following: de-stuffing, or decoding using a first encoding method. The decoded first bit sequence, the decoded second bit sequence, and the first Polar sequence satisfy the following characteristics:

[0164] If the decoding is correct, the obtained source information bit sequence after decoding should be the same as the data to be encoded at the sending end. The process of processing the data sequence to be encoded has been described in the above embodiments. The decoding process is represented as the inverse process of encoding based on Polar encoding method, first encoding method and first Polar sequence, which will not be elaborated here.

[0165] In one embodiment, obtaining the decoded source information bit sequence based on the decoded first bit sequence includes:

[0166] Based on the decoded first bit sequence, the first bit sequence is obtained according to at least one of the following methods:

[0167] De-stuffing and decoding using the first encoding method.

[0168] In one embodiment, the first Polar sequence satisfies at least one of the following:

[0169] In the first Polar sequence, the second Polar sequences corresponding to sub-blocks of the same length are all the same;

[0170] In the first Polar sequence, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2, where Ns is greater than 8 and Ns is equal to a power of 2.

[0171] The code rate of each subcode in the second bit sequence corresponding to the first Polar sequence does not belong to the code rate set of subcodes. The code rate set of subcodes is used to indicate the code rates of subcodes that cannot be decoded in parallel.

[0172] In one embodiment, in the first Polar sequence, the second Polar sequences corresponding to sub-blocks of the same length are all identical;

[0173] For the i-th sub-block in the first Polar sequence, the second Polar sequence corresponding to the sub-block is obtained by subtracting the bit index corresponding to i*P from the first sequence. The first sequence is formed by the bit indices of the first Polar sequence belonging to the interval [i*P, (i+1)*P-1] according to the sorting in the first Polar sequence, and P is the size of the sub-block.

[0174] For any i, the second Polar sequence is identical.

[0175] In one embodiment, the second Polar sequence corresponding to the sub-block of length Ns in the first Polar sequence is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2;

[0176] For a sub-block of length Ns in the first Polar sequence, the third Polar sequence is obtained by subtracting the bit index corresponding to i*Ns / 2 from the second sequence. The second sequence is formed by the bit indices of the second Polar sequence corresponding to the sub-block of length Ns that belong to the interval [i*Ns / 2, (i+1)*Ns / 2-1], according to the sorting of the second Polar sequence corresponding to the sub-block of length Ns.

[0177] The third Polar sequence corresponding to i=0 is the same as the third Polar sequence corresponding to i=1, and the third Polar sequence is the same as the second Polar sequence corresponding to the sub-block of length Ns / 2.

[0178] In one embodiment, the second Polar sequence corresponding to the sub-block of length Ns in the first Polar sequence is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2;

[0179] Ns satisfies at least one of the following:

[0180] When Ns equals 16, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2;

[0181] When Ns equals 32, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2;

[0182] When Ns equals 64, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2;

[0183] When Ns equals 64 or 32, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2.

[0184] When Ns equals 32 or 16, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2.

[0185] When Ns equals 64, 32, or 16, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2.

[0186] In one embodiment, each subcode rate in the second bit sequence obtained based on the first Polar sequence does not have a code rate belonging to the subcode rate set.

[0187] The encoding method of this application is illustrated by some embodiments below.

[0188] In one embodiment, the encoding process includes:

[0189] Step 1: Obtain the source information bit sequence u = [u0, u1, u2, ..., u A-1 The source information bit sequence may include, but is not limited to: uplink control information bit sequence, downlink control information bit sequence, uplink data information bit sequence, and downlink data information bit sequence. The source information bit sequence may be information carried in one of the following physical channels: physical uplink control channel, physical uplink shared channel, physical downlink control channel, physical downlink shared channel, and physical broadcast channel.

[0190] Step 2: Based on the source information bit sequence, obtain the first bit sequence according to at least one of the following: bit stuffing, encoding using the first encoding method.

[0191] In this embodiment, the source information bit sequence is first padded with bits, and then the padded bit sequence is encoded using a first encoding method to obtain a first bit sequence. The first encoding method is CRC encoding, and the length of the first bit sequence must be even. In this embodiment, if the sum of the length A of the source information bits and the number L of the check bits obtained by the first encoding method is odd, then bits can be padded to make the length of the first bit sequence even.

[0192] In this embodiment, the padding bit u padding Located before the source information bits [u padding ,u0,u1,u2,...,u A-1 The padded bit sequence is then CRC encoded to obtain the first bit sequence [c0, c1, c2, ..., c]. K-1 ] = [u padding ,u0,u1,u2,...,u A-1 ,r0,r1,...,r L-1 ], where L is the length of the CRC.

[0193] In this embodiment, the padding bit u padding The check relationship is formed by modulo-2 addition of all bits in the source information bit sequence: u padding =u0⊕u1⊕u2⊕...⊕u A-1 .

[0194] In another feasible implementation, the filling bit u padding A check relationship is formed by modulo-2 addition of a portion of the bits in the source information bit sequence, for example, u padding The check relationship is formed by modulo-2 addition of the first half of the source information bit sequence, for example, upadding The modulo-2 addition of the first 1 / 4 bits of the source information bit sequence forms a check relationship.

[0195] Building upon the above, the padding bits not only ensure that the length K of the first bit sequence can be decoded quickly (for example, in this embodiment, the first Polar sequence allows for fast decoding when K is even), but also serve as a checksum. If the padding bits form a checksum with the modulo-2 addition of only the first half of the source information bit sequence, then a check can be performed when decoding to the first half of the source information bit sequence. If the checksum is not met, decoding is terminated early, reducing unnecessary decoding overhead. If the padding bits form a checksum with the modulo-2 addition of all bits in the source information bit sequence, a checksum is performed after decoding the information bits, reducing the false alarm rate of CRC check. If CRC cannot correctly determine whether an error has occurred, the checksum relationship of the padding bits can be used for further verification.

[0196] Step 3: Obtain the second bit sequence based on the first Polar sequence and the first bit sequence. The second Polar sequence with a sub-block length of Ns corresponding to the first Polar sequence is nested with the second Polar sequence with a sub-block length of Ns / 2 corresponding to the first Polar sequence.

[0197] In this embodiment, the first Polar sequence satisfies the following characteristics:

[0198] Feature 1: The second Polar sequences corresponding to the same sub-block length of the first Polar sequence are all the same, and the second Polar sequence with a sub-block length of Ns is nested with a second Polar sequence with a sub-block length of Ns / 2.

[0199] The second Polar sequence corresponding to the first Polar sequence under different sub-block lengths P is as follows:

[0200] When P equals 8, the second Polar sequence is: [0 1 2 4 3 5 6 7];

[0201] When P equals 16, the second Polar sequence is: [0 1 2 4 8 3 5 6 9 10 12 7 11 13 14 15];

[0202] When P equals 32, the second Polar sequence is: [0 1 2 4 8 16 3 5 6 9 10 17 12 7 18 20 24 11 13 19 14 21 22 25 26 28 23 15 27 29 30 31];

[0203] Among them, the second Polar sequence with a sub-block length of Ns is nested with the second Polar sequence with a sub-block length of Ns / 2. The characteristic of Ns is that when Ns equals 32 and Ns equals 16, the second Polar sequence with a sub-block length of Ns is nested with the second Polar sequence with a sub-block length of Ns / 2.

[0204] Feature 2: The length of the first bit sequence is even, and in the second bit sequence obtained based on the first Polar sequence, each sub-code rate does not belong to the sub-code rate set. In this embodiment, the rates in the sub-code rate set must at least satisfy the following characteristics:

[0205] When P equals 16, the subcode rate set must contain at least the following rates: {5 / 16, 9 / 16}.

[0206] When P equals 32, the subcode rate set must contain at least the following rates: {6 / 32, 10 / 32, 19 / 32, 24 / 32}.

[0207] In this embodiment, when the length K of the first bit sequence is even, any subcode in the second bit sequence obtained from the first Polar sequence will not have a subcode rate of 5 / 16 or 9 / 16 when the subblock size is 16; and will not have subcode rates of 6 / 32, 10 / 32, 19 / 32, or 24 / 32 when the subblock size is 32. In this embodiment, the subcode rate set is used to represent the subcode rates that cannot be parallelized. Therefore, in this embodiment, fast decoding can be performed using only the first Polar sequence without adjusting it or increasing storage and computation.

[0208] In this embodiment, the K most reliable bit indices in the first Polar sequence carry the first bit sequence, and the remaining NK bit indices carry frozen bits, resulting in a second bit sequence of length N. In a specific implementation, the first bit sequence is represented as [c0, c1, c2, ..., c...]. K-1 The second bit sequence is represented as [x0, x1, x2, ..., x]. N-1 Q represents the set of bit indices carrying the information bits. The process of obtaining the second bit sequence is as follows:

[0209]

[0210]

[0211] In this embodiment, the length N of the first Polar sequence is equal to 1024, and the first Polar sequence is shown in Table 1:

[0212] Table 1. Reliability and Bit Index of the First Polar Sequence

[0213]

[0214]

[0215]

[0216] Step 4: Encode the second bit sequence using Polar codes to obtain the third bit sequence. That is, encode the second bit sequence [x0, x1, x2, ..., x...] using Polar codes. N-1 The third bit sequence [y0, y1, y2, ..., y] is obtained by Polar code encoding. N-1 In this embodiment, the second bit sequence x = [x0, x1, x2, ..., x] is... N-1 The polarization matrix G with N rows and N columns N Multiplying over GF(2) yields the codeword y = x·G N ,in,

[0217] Step 5: Send all or part of the bits of the third bit sequence. The part of the bits to be sent is selected according to a preset rule, which may include, but is not limited to: selecting E consecutive bits in the third bit sequence to send, or selecting E non-consecutive bits in the third bit sequence to send; wherein the number of part of the bits to be sent is E, and the specific selection method is not limited in this embodiment.

[0218] Based on the first Polar sequence in this embodiment, when the mother code length N equals 1024, any sub-code in the second bit sequence obtained from the first Polar sequence will not have a sub-code rate of 5 / 16 or 9 / 16 when the sub-block size is 16; and will not have a sub-code rate of 6 / 32, 10 / 32, 19 / 32, or 24 / 32 when the sub-block size is 32. When the length K of the first bit sequence is even, when the sub-block length Ns equals 32 and Ns equals 16, the second Polar sequence with a sub-block length of Ns is nested with a second Polar sequence with a sub-block length of Ns / 2. Therefore, devices with different computing capabilities can make different choices during decoding: decoding with a parallelism of 8 sub-block size, decoding with a parallelism of 16 sub-block size, and decoding with a parallelism of 32 sub-block size.

[0219] In this embodiment, the first Polar sequence is used for fast decoding. There is no need to adjust the first Polar sequence or increase storage and computation. While saving storage and computation, the first Polar sequence does not show significant degradation compared to the Polar sequence of the Polar code in 5G. Several examples are given below to illustrate this.

[0220] In one example, the lengths of the first bit sequence are 148, 276, 360, 428, 702, 788, 872, where the CRC length L equals 19. Based on the first Polar sequence and the first bit sequence provided in this embodiment, a second bit sequence of length N is obtained. Polar encoding is performed on the second bit sequence to obtain a third bit sequence of length N. All bits of the third bit sequence are then transmitted. Under additive white Gaussian noise channel and QPSK modulation conditions, SC decoding is used to obtain the block error rate (BLER) curves corresponding to different bit lengths to be encoded, as shown below. Figure 6 As shown, the dashed line represents the block error rate curve corresponding to the Polar sequence in 5G, and the solid line represents the block error rate curve corresponding to the first Polar sequence in this embodiment. It can be observed that under the aforementioned code length and code rate, the performance of the two sequences is similar, and the sequences in this embodiment can select different sub-block sizes for fast decoding, for example, sub-block sizes of 8, 16, and 32.

[0221] In one embodiment, the encoding process includes:

[0222] Step 1: Obtain the source information bit sequence u = [u0, u1, u2, ..., u A-1 The source information bit sequence may include, but is not limited to: uplink control information bit sequence, downlink control information bit sequence, uplink data information bit sequence, and downlink data information bit sequence. Specifically, the source information bit sequence may be information carried in one of the following physical channels: physical uplink control channel, physical uplink shared channel, physical downlink control channel, physical downlink shared channel, and physical broadcast channel.

[0223] Step 2: Based on the source information bit sequence, obtain the first bit sequence according to at least one of the following: bit stuffing, encoding using the first encoding method.

[0224] In this embodiment, the source information bit sequence is first padded with bits, and then the padded bit sequence is encoded using a first encoding method to obtain a first bit sequence. The first encoding method is CRC encoding, and the length of the first bit sequence must be an odd number. In this embodiment, if the sum of the length A of the source information bits and the number L of the check bits obtained by the first encoding method is even, then bits need to be padded to make the length of the first bit sequence equal to an odd number.

[0225] In this embodiment, the padding bit u padding Located before the source information bits [u padding ,u0,u1,u2,...,u A-1 The padded bit sequence is then CRC encoded to obtain the first bit sequence [c0, c1, c2, ..., c]. K-1 ] = [u padding ,u0,u1,u2,...,u A-1 ,r0,r1,...,r L-1 ], where L is the length of the CRC.

[0226] In this embodiment, the padding bit u padding The check relationship is formed by modulo-2 addition of all bits in the source information bit sequence: u padding =u0⊕u1⊕u2⊕...⊕u A-1 .

[0227] In another feasible implementation, the filling bit u padding A check relationship is formed by modulo-2 addition of a portion of the bits in the source information bit sequence, for example, u padding The check relationship is formed by modulo-2 addition of the first half of the source information bit sequence, for example, u padding The modulo-2 addition of the first 1 / 4 bits of the source information bit sequence forms a check relationship.

[0228] Step 3: Obtain the second bit sequence based on the first Polar sequence and the first bit sequence. The second Polar sequence with a sub-block length of Ns corresponding to the first Polar sequence is nested with the second Polar sequence with a sub-block length of Ns / 2 corresponding to the first Polar sequence.

[0229] In this embodiment, the first Polar sequence satisfies the following characteristics:

[0230] Feature 1: The second Polar sequences corresponding to the same sub-block length of the first Polar sequence are all the same, and the second Polar sequence with a sub-block length of Ns is nested with a second Polar sequence with a sub-block length of Ns / 2.

[0231] The second Polar sequence corresponding to the first Polar sequence under different sub-block lengths P is as follows:

[0232] When P equals 8, the second Polar sequence is: [0 1 2 4 3 5 6 7];

[0233] When P equals 16, the second Polar sequence is: [0 1 2 4 8 3 5 6 9 10 12 7 11 13 14 15];

[0234] When P equals 32, the second Polar sequence is: [0 1 2 4 8 16 3 5 6 9 10 17 12 7 18 20 24 11 13 19 14 21 22 25 26 28 23 15 27 29 30 31];

[0235] Among them, the second Polar sequence with a sub-block length of Ns is nested with the second Polar sequence with a sub-block length of Ns / 2. The characteristic of Ns is that when Ns equals 32 and Ns equals 16, the second Polar sequence with a sub-block length of Ns is nested with the second Polar sequence with a sub-block length of Ns / 2.

[0236] Feature 2: The length of the first bit sequence is odd, and in the second bit sequence obtained based on the first Polar sequence, each sub-code rate does not belong to the sub-code rate set. In this embodiment, the rates in the sub-code rate set must at least satisfy the following characteristics:

[0237] When P equals 16, the subcode rate set must contain at least the following rates: {5 / 16, 9 / 16}.

[0238] When P equals 32, the subcode rate set must contain at least the following rates: {6 / 32, 10 / 32, 19 / 32, 24 / 32}.

[0239] In this embodiment, when the length K of the first bit sequence is odd, any subcode in the second bit sequence obtained from the first Polar sequence will not have a subcode rate of 5 / 16 or 9 / 16 when the subblock size is 16; and will not have subcode rates of 6 / 32, 10 / 32, 19 / 32, or 24 / 32 when the subblock size is 32. In this embodiment, the subcode rate set is used to represent the subcode rates that cannot be parallelized. Therefore, in this embodiment, fast decoding can be performed using only the first Polar sequence without adjusting it or increasing storage and computation.

[0240] In this embodiment, the K most reliable bit indices in the first Polar sequence carry the first bit sequence, and the remaining NK bit indices carry frozen bits, resulting in a second bit sequence of length N. In one example, the first bit sequence is represented as [c0, c1, c2, ..., c K-1 The second bit sequence is represented as [x0, x1, x2, ..., x]. N-1 Q represents the set of bit indices carrying the information bits. The process of obtaining the second bit sequence is as follows:

[0241]

[0242] In this embodiment, the length N of the first Polar sequence is equal to 1024, and the first Polar sequence is shown in Table 1:

[0243] Table 2 Reliability and Bit Index of the First Polar Sequence

[0244]

[0245]

[0246]

[0247] Step 4: Encode the second bit sequence using Polar codes to obtain the third bit sequence. That is, encode the second bit sequence [x0, x1, x2, ..., x...] using Polar codes. N-1 The third bit sequence [y0, y1, y2, ..., y] is obtained by Polar code encoding. N-1 In this embodiment, the second bit sequence x = [x0, x1, x2, ..., x] is... N-1 The polarization matrix G with N rows and N columns N Multiplying over GF(2) yields the codeword y = x·G N ,in,

[0248] Step 5: Send all or part of the bits of the third bit sequence. The part of the bits to be sent is selected according to a preset rule, which may include, but is not limited to: selecting E consecutive bits in the third bit sequence to send, or selecting E non-consecutive bits in the third bit sequence to send; wherein the number of part of the bits to be sent is E, and the specific selection method is not limited in this embodiment.

[0249] Based on the first Polar sequence in this embodiment, when the mother code length N equals 1024, any sub-code in the second bit sequence obtained from the first Polar sequence will not have a sub-code rate of 5 / 16 or 9 / 16 when the sub-block size is 16; and will not have a sub-code rate of 6 / 32, 10 / 32, 19 / 32, or 24 / 32 when the sub-block size is 32. When the length K of the first bit sequence is odd, when the sub-block length Ns equals 32 and Ns equals 16, the second Polar sequence with a sub-block length of Ns is nested with a second Polar sequence with a sub-block length of Ns / 2. Therefore, devices with different computing capabilities can make different choices during decoding: decoding with a parallelism of 8 sub-block size, decoding with a parallelism of 16 sub-block size, and decoding with a parallelism of 32 sub-block size.

[0250] In this embodiment, the first Polar sequence is used for fast decoding. There is no need to adjust the first Polar sequence or increase storage and computation. While saving storage and computation, the first Polar sequence does not show significant degradation compared to the Polar sequence of the Polar code in 5G. Several examples are given below to illustrate this.

[0251] In one example, the lengths of the first bit sequence are 147, 275, 359, 427, 701, 787, 871, where the CRC length L equals 19. Based on the first Polar sequence and the first bit sequence provided in this embodiment, a second bit sequence of length N is obtained. Polar encoding is performed on the second bit sequence to obtain a third bit sequence of length N. All bits of the third bit sequence are then transmitted. Under additive white Gaussian noise channel and QPSK modulation conditions, SC decoding is used to obtain the block error rate (BLER) curves corresponding to different bit lengths to be encoded, as shown below. Figure 7 As shown, the dashed line represents the block error rate curve corresponding to the Polar sequence in 5G, and the solid line represents the block error rate curve corresponding to the first Polar sequence in this embodiment. It can be observed that under the aforementioned code length and code rate, the performance of the two sequences is similar, and the sequences in this embodiment can select different sub-block sizes for fast decoding, for example, sub-block sizes of 8, 16, and 32.

[0252] In one embodiment, the encoding process includes:

[0253] Step 1: Obtain the source information bit sequence u = [u0, u1, u2, ..., u A-1 The source information bit sequence may include, but is not limited to: uplink control information bit sequence, downlink control information bit sequence, uplink data information bit sequence, and downlink data information bit sequence. Specifically, the source information bit sequence may be information carried in one of the following physical channels: physical uplink control channel, physical uplink shared channel, physical downlink control channel, physical downlink shared channel, and physical broadcast channel.

[0254] Step 2: Based on the source information bit sequence, obtain the first bit sequence according to at least one of the following: bit stuffing, encoding using the first encoding method.

[0255] In this embodiment, the source information bit sequence is first padded with bits, and then the padded bit sequence is encoded using a first encoding method to obtain a first bit sequence. The first encoding method is CRC encoding, and the length of the first bit sequence must be even. In this embodiment, if the sum of the length A of the source information bits and the number L of the check bits obtained by the first encoding method is odd, then bits need to be padded to make the length of the first bit sequence even.

[0256] In this embodiment, the padding bit u padding Located between source information bits [u0, u1, u2, ..., u q-1 ,u padding ,...,u A-1 The padded bit sequence is then CRC encoded to obtain the first bit sequence [c0, c1, c2, ..., c]. K-1 ] = [u0,u1,u2,...,u q-1 ,u padding ,...,u A-1 ,r0,r1,...,r L-1 ], where L is the length of the CRC.

[0257] In this embodiment, the padding bit u padding The check relationship is formed by modulo-2 addition of the first q bits in the source information bit sequence, where q is an integer greater than 0 and less than A: u padding =u0⊕u1⊕u2⊕...⊕u q-1 After decoding u padding Afterwards, a verification can be performed. If the verification is satisfied, decoding continues; if the verification is not satisfied, decoding stops, thus reducing redundant calculations.

[0258] Step 3: Obtain the second bit sequence based on the first Polar sequence and the first bit sequence. The second Polar sequence with a sub-block length of Ns corresponding to the first Polar sequence is nested with the second Polar sequence with a sub-block length of Ns / 2 corresponding to the first Polar sequence.

[0259] In this embodiment, the first Polar sequence satisfies the following characteristics:

[0260] Feature 1: The second Polar sequences corresponding to the same sub-block length of the first Polar sequence are all the same, and the second Polar sequence with a sub-block length of Ns is nested with a second Polar sequence with a sub-block length of Ns / 2.

[0261] The second Polar sequence corresponding to the first Polar sequence under different sub-block lengths P is as follows:

[0262] When P equals 8, the second Polar sequence is: [0 1 2 4 3 5 6 7];

[0263] When P equals 16, the second Polar sequence is: [0 1 2 4 8 3 5 6 9 10 12 7 11 13 14 15];

[0264] When P equals 32, the second Polar sequence is: [0 1 2 4 8 16 3 5 6 9 10 17 12 7 18 20 24 11 13 19 14 21 22 25 26 28 23 15 27 29 30 31];

[0265] Among them, the second Polar sequence with a sub-block length of Ns is nested with the second Polar sequence with a sub-block length of Ns / 2. The characteristic of Ns is that when Ns equals 32 and Ns equals 16, the second Polar sequence with a sub-block length of Ns is nested with the second Polar sequence with a sub-block length of Ns / 2.

[0266] Feature 2: The length of the first bit sequence is even, and in the second bit sequence obtained based on the first Polar sequence, each sub-code rate does not belong to the sub-code rate set. In this embodiment, the rates in the sub-code rate set must at least satisfy the following characteristics:

[0267] When P equals 16, the subcode rate set must contain at least the following rates: {5 / 16, 9 / 16}.

[0268] When P equals 32, the subcode rate set must contain at least the following rates: {6 / 32, 10 / 32, 19 / 32, 24 / 32}.

[0269] In this embodiment, when the length K of the first bit sequence is even, any subcode in the second bit sequence obtained from the first Polar sequence will not have a subcode rate of 5 / 16 or 9 / 16 when the subblock size is 16; and will not have subcode rates of 6 / 32, 10 / 32, 19 / 32, or 24 / 32 when the subblock size is 32. In this embodiment, the subcode rate set is used to represent subcode rates that are difficult to decode quickly. Therefore, in this embodiment, fast decoding can be performed using only the first Polar sequence without adjusting it or increasing storage and computation.

[0270] In this embodiment, the K most reliable bit indices in the first Polar sequence carry the first bit sequence, and the remaining NK bit indices carry frozen bits, resulting in a second bit sequence of length N. In a specific implementation, the first bit sequence is represented as [c0, c1, c2, ..., c...]. K-1 The second bit sequence is represented as [x0, x1, x2, ..., x]. N-1 Q represents the set of bit indices carrying the information bits. The process of obtaining the second bit sequence is as follows:

[0271]

[0272] Step 4: Encode the second bit sequence using Polar codes to obtain the third bit sequence. That is, encode the second bit sequence [x0, x1, x2, ..., x...] using Polar codes. N-1 The third bit sequence [y0, y1, y2, ..., y] is obtained by Polar code encoding. N-1 In this embodiment, the second bit sequence x = [x0, x1, x2, ..., x] is... N-1 The polarization matrix G with N rows and N columns N Multiplying over GF(2) yields the codeword y = x·G N ,in,

[0273] Step 5: Send all or part of the bits of the third bit sequence. The part of the bits to be sent is selected according to a preset rule, which may include, but is not limited to: selecting E consecutive bits in the third bit sequence to send, or selecting E non-consecutive bits in the third bit sequence to send; wherein the number of part of the bits to be sent is E, and the specific selection method is not limited in this embodiment.

[0274] In one embodiment, the encoding process includes:

[0275] Step 1: Obtain the source information bit sequence u = [u0, u1, u2, ..., u A-1 The source information bit sequence may include, but is not limited to: uplink control information bit sequence, downlink control information bit sequence, uplink data information bit sequence, and downlink data information bit sequence. Specifically, the source information bit sequence may be information carried in one of the following physical channels: physical uplink control channel, physical uplink shared channel, physical downlink control channel, physical downlink shared channel, and physical broadcast channel.

[0276] Step 2: Based on the source information bit sequence, obtain the first bit sequence according to at least one of the following: bit stuffing, encoding using the first encoding method.

[0277] In this embodiment, the source information bit sequence is first padded with bits, and then the padded bit sequence is encoded using a first encoding method to obtain a first bit sequence. The first encoding method is CRC encoding, and the length of the first bit sequence must be an odd number. In this embodiment, if the sum of the length A of the source information bits and the number L of the check bits obtained by the first encoding method is even, then bits need to be padded to make the length of the first bit sequence equal to an odd number.

[0278] In this embodiment, the padding bit u padding Located between source information bits [u0, u1, u2, ..., u q-1 ,u padding,...,u A-1 The padded bit sequence is then CRC encoded to obtain the first bit sequence [c0, c1, c2, ..., c]. K-1 ] = [u0,u1,u2,...,u q-1 ,u padding ,...,u A-1 ,r0,r1,...,r L-1 ], where L is the length of the CRC.

[0279] In this embodiment, the padding bit u padding The check relationship is formed by modulo-2 addition of the first q bits in the source information bit sequence, where q is an integer greater than 0 and less than A: u padding =u0⊕u1⊕u2⊕...⊕u q-1 After decoding u padding Afterwards, a verification can be performed. If the verification is satisfied, decoding continues; if the verification is not satisfied, decoding stops, thus reducing redundant calculations.

[0280] Step 3: Obtain the second bit sequence based on the first Polar sequence and the first bit sequence. The second Polar sequence with a sub-block length of Ns corresponding to the first Polar sequence is nested with the second Polar sequence with a sub-block length of Ns / 2 corresponding to the first Polar sequence.

[0281] In this embodiment, the first Polar sequence satisfies the following characteristics:

[0282] Feature 1: The second Polar sequences corresponding to the same sub-block length of the first Polar sequence are all the same, and the second Polar sequence with a sub-block length of Ns is nested with a second Polar sequence with a sub-block length of Ns / 2.

[0283] The second Polar sequence corresponding to the first Polar sequence under different sub-block lengths P is as follows:

[0284] When P equals 8, the second Polar sequence is: [0 1 2 4 3 5 6 7];

[0285] When P equals 16, the second Polar sequence is: [0 1 2 4 8 3 5 6 9 10 12 7 11 13 14 15];

[0286] When P equals 32, the second Polar sequence is: [0 1 2 4 8 16 3 5 6 9 10 17 12 7 18 20 24 11 13 19 14 21 22 25 26 28 23 15 27 29 30 31];

[0287] Among them, the second Polar sequence with a sub-block length of Ns is nested with the second Polar sequence with a sub-block length of Ns / 2. The characteristic of Ns is that when Ns equals 32 and Ns equals 16, the second Polar sequence with a sub-block length of Ns is nested with the second Polar sequence with a sub-block length of Ns / 2.

[0288] Feature 2: The length of the first bit sequence is odd, and in the second bit sequence obtained based on the first Polar sequence, each sub-code rate does not belong to the sub-code rate set. In this embodiment, the rates in the sub-code rate set must at least satisfy the following characteristics:

[0289] When P equals 16, the subcode rate set must contain at least the following rates: {5 / 16, 9 / 16}.

[0290] When P equals 32, the subcode rate set must contain at least the following rates: {6 / 32, 10 / 32, 19 / 32, 24 / 32}.

[0291] In this embodiment, when the length K of the first bit sequence is odd, any subcode in the second bit sequence obtained from the first Polar sequence will not have a subcode rate of 5 / 16 or 9 / 16 when the subblock size is 16; and will not have subcode rates of 6 / 32, 10 / 32, 19 / 32, or 24 / 32 when the subblock size is 32. In this embodiment, the subcode rate set is used to represent the subcode rates that cannot be parallelized. Therefore, in this embodiment, fast decoding can be performed using only the first Polar sequence without adjusting it or increasing storage and computation.

[0292] In this embodiment, the K most reliable bit indices in the first Polar sequence carry the first bit sequence, and the remaining NK bit indices carry frozen bits, resulting in a second bit sequence of length N. In a specific implementation, the first bit sequence is represented as [c0, c1, c2, ..., c...]. K-1 The second bit sequence is represented as [x0, x1, x2, ..., x]. N-1 Q represents the set of bit indices carrying the information bits. The process of obtaining the second bit sequence is as follows:

[0293]

[0294] Step 4: Encode the second bit sequence using Polar codes to obtain the third bit sequence. That is, encode the second bit sequence [x0, x1, x2, ..., x...] using Polar codes. N-1 The third bit sequence [y0, y1, y2, ..., y] is obtained by Polar code encoding. N-1In this embodiment, the second bit sequence x = [x0, x1, x2, ..., x] is... N-1 The polarization matrix G with N rows and N columns N Multiplying over GF(2) yields the codeword y = x·G N ,in,

[0295] Step 5: Send all or part of the bits of the third bit sequence. The part of the bits to be sent is selected according to a preset rule, which may include, but is not limited to: selecting E consecutive bits in the third bit sequence to send, or selecting E non-consecutive bits in the third bit sequence to send; wherein the number of part of the bits to be sent is E, and the specific selection method is not limited in this embodiment.

[0296] In one embodiment, the encoding process includes:

[0297] Step 1: Obtain the source information bit sequence u = [u0, u1, u2, ..., u A-1 The source information bit sequence may include, but is not limited to: uplink control information bit sequence, downlink control information bit sequence, uplink data information bit sequence, and downlink data information bit sequence. Specifically, the source information bit sequence may be information carried in one of the following physical channels: physical uplink control channel, physical uplink shared channel, physical downlink control channel, physical downlink shared channel, and physical broadcast channel.

[0298] Step 2: Based on the source information bit sequence, obtain the first bit sequence according to at least one of the following: bit stuffing, encoding using the first encoding method.

[0299] In this embodiment, the source information bit sequence is first encoded using a first encoding method, and then bits are padded to the bit sequence encoded using the first encoding method to obtain a first bit sequence. The first encoding method is CRC encoding, and the length of the first bit sequence must be even. In this embodiment, if the sum of the length A of the source information bits and the number L of the check bits obtained by the first encoding method is odd, then bits need to be padded to make the length of the first bit sequence even.

[0300] In this embodiment, the padding bit u padding Located between the bit sequences [u0, u1, u2, ..., u] after encoding using the first encoding method q-1 ,u padding ,...,u A-1 ,r0,r1,...,r L-1 ], L is the length of the CRC. Padding bits u paddingThe modulo-2 sum of the first P bits of the bit sequence encoded using the first encoding method forms a check relationship, where q is an integer greater than 0 and less than A+L: u padding =u0⊕u1⊕u2⊕...⊕u q-1 After decoding u padding Afterwards, a verification can be performed. If the verification is satisfied, decoding continues; if the verification is not satisfied, decoding stops, thus reducing redundant calculations.

[0301] Step 3: Obtain the second bit sequence based on the first Polar sequence and the first bit sequence. The second Polar sequence with a sub-block length of Ns corresponding to the first Polar sequence is nested with the second Polar sequence with a sub-block length of Ns / 2 corresponding to the first Polar sequence.

[0302] In this embodiment, the first Polar sequence satisfies the following characteristics:

[0303] Feature 1: The second Polar sequences corresponding to the same sub-block length of the first Polar sequence are all the same, and the second Polar sequence with a sub-block length of Ns is nested with a second Polar sequence with a sub-block length of Ns / 2.

[0304] The second Polar sequence corresponding to the first Polar sequence under different sub-block lengths P is as follows:

[0305] When P equals 8, the second Polar sequence is: [0 1 2 4 3 5 6 7];

[0306] When P equals 16, the second Polar sequence is: [0 1 2 4 8 3 5 6 9 10 12 7 11 13 14 15];

[0307] When P equals 32, the second Polar sequence is: [0 1 2 4 8 16 3 5 6 9 10 17 12 7 18 20 24 11 13 19 14 21 22 25 26 28 23 15 27 29 30 31];

[0308] Among them, the second Polar sequence with a sub-block length of Ns is nested with the second Polar sequence with a sub-block length of Ns / 2. The characteristic of Ns is that when Ns equals 32 and Ns equals 16, the second Polar sequence with a sub-block length of Ns is nested with the second Polar sequence with a sub-block length of Ns / 2.

[0309] Feature 2: The length of the first bit sequence is even, and in the second bit sequence obtained based on the first Polar sequence, each sub-code rate does not belong to the sub-code rate set. The rates in the sub-code rate set must satisfy at least the following characteristics:

[0310] When P equals 16, the subcode rate set must contain at least the following rates: {5 / 16, 9 / 16}.

[0311] When P equals 32, the subcode rate set must contain at least the following rates: {6 / 32, 10 / 32, 19 / 32, 24 / 32}.

[0312] In this embodiment, when the length K of the first bit sequence is even, any subcode in the second bit sequence obtained from the first Polar sequence will not have a subcode rate of 5 / 16 or 9 / 16 when the subblock size is 16; and will not have subcode rates of 6 / 32, 10 / 32, 19 / 32, or 24 / 32 when the subblock size is 32. In this embodiment, the subcode rate set is used to represent subcode rates that are difficult to decode quickly. Therefore, in this embodiment, fast decoding can be performed using only the first Polar sequence without adjusting it or increasing storage and computation.

[0313] In this embodiment, the K most reliable bit indices in the first Polar sequence carry the first bit sequence, and the remaining NK bit indices carry frozen bits, resulting in a second bit sequence of length N. In a specific implementation, the first bit sequence is represented as [c0, c1, c2, ..., c...]. K-1 The second bit sequence is represented as [x0, x1, x2, ..., x]. N-1 Q represents the set of bit indices carrying the information bits. The process of obtaining the second bit sequence is as follows:

[0314]

[0315] Step 4: Encode the second bit sequence using Polar codes to obtain the third bit sequence. That is, encode the second bit sequence [x0, x1, x2, ..., x...] using Polar codes. N-1 The third bit sequence [y0, y1, y2, ..., y] is obtained by Polar code encoding. N-1 In this embodiment, the second bit sequence x = [x0, x1, x2, ..., x] is... N-1 The polarization matrix G with N rows and N columns N Multiplying over GF(2) yields the codeword y = x·G N ,in,

[0316] Step 5: Send all or part of the bits of the third bit sequence. The part of the bits to be sent is selected according to a preset rule, which may include, but is not limited to: selecting E consecutive bits in the third bit sequence to send, or selecting E non-consecutive bits in the third bit sequence to send; wherein the number of part of the bits to be sent is E, and the specific selection method is not limited in this embodiment.

[0317] In one embodiment, the encoding process includes:

[0318] Step 1: Obtain the source information bit sequence u = [u0, u1, u2, ..., u A-1 The source information bit sequence may include, but is not limited to: uplink control information bit sequence, downlink control information bit sequence, uplink data information bit sequence, and downlink data information bit sequence. Specifically, the source information bit sequence may be information carried in one of the following physical channels: physical uplink control channel, physical uplink shared channel, physical downlink control channel, physical downlink shared channel, and physical broadcast channel.

[0319] Step 2: Based on the source information bit sequence, obtain the first bit sequence according to at least one of the following: bit stuffing, encoding using the first encoding method.

[0320] In this embodiment, the source information bit sequence is first encoded using a first encoding method, and then bits are padded to the bit sequence encoded using the first encoding method to obtain a first bit sequence. The first encoding method is CRC encoding, and the length of the first bit sequence must be an odd number. In this embodiment, if the sum of the length A of the source information bits and the number L of the check bits obtained by the first encoding method is even, then bits need to be padded to make the length of the first bit sequence equal to an odd number.

[0321] In this embodiment, the padding bit u padding Located between the bit sequences [u0, u1, u2, ..., u] after encoding using the first encoding method q-1 ,u padding ,...,u A-1 ,r0,r1,...,r L-1 ], L is the length of the CRC. Padding bits u padding The modulo-2 sum of the first P bits of the bit sequence encoded using the first encoding method forms a check relationship, where q is an integer greater than 0 and less than A+L: u padding =u0⊕u1⊕u2⊕...⊕u q-1 After decoding u padding Afterwards, a verification can be performed. If the verification is satisfied, decoding continues; if the verification is not satisfied, decoding stops, thus reducing redundant calculations.

[0322] Step 3: Obtain the second bit sequence based on the first Polar sequence and the first bit sequence. The second Polar sequence with a sub-block length of Ns corresponding to the first Polar sequence is nested with the second Polar sequence with a sub-block length of Ns / 2 corresponding to the first Polar sequence.

[0323] In this embodiment, the first Polar sequence satisfies the following characteristics:

[0324] Feature 1: The second Polar sequences corresponding to the same sub-block length of the first Polar sequence are all the same, and the second Polar sequence with a sub-block length of Ns is nested with a second Polar sequence with a sub-block length of Ns / 2.

[0325] The second Polar sequence corresponding to the first Polar sequence under different sub-block lengths P is as follows:

[0326] When P equals 8, the second Polar sequence is: [0 1 2 4 3 5 6 7];

[0327] When P equals 16, the second Polar sequence is: [0 1 2 4 8 3 5 6 9 10 12 7 11 13 14 15];

[0328] When P equals 32, the second Polar sequence is: [0 1 2 4 8 16 3 5 6 9 10 17 12 7 18 20 24 11 13 19 14 21 22 25 26 28 23 15 27 29 30 31];

[0329] Among them, the second Polar sequence with a sub-block length of Ns is nested with the second Polar sequence with a sub-block length of Ns / 2. The characteristic of Ns is that when Ns equals 32 and Ns equals 16, the second Polar sequence with a sub-block length of Ns is nested with the second Polar sequence with a sub-block length of Ns / 2.

[0330] Feature 2: The length of the first bit sequence is odd, and in the second bit sequence obtained based on the first Polar sequence, each sub-code rate does not belong to the sub-code rate set. In this embodiment, the rates in the sub-code rate set must at least satisfy the following characteristics:

[0331] When P equals 16, the subcode rate set must contain at least the following rates: {5 / 16, 9 / 16}.

[0332] When P equals 32, the subcode rate set must contain at least the following rates: {6 / 32, 10 / 32, 19 / 32, 24 / 32}.

[0333] In this embodiment, when the length K of the first bit sequence is odd, any subcode in the second bit sequence obtained from the first Polar sequence will not have a subcode rate of 5 / 16 or 9 / 16 when the subblock size is 16; and will not have subcode rates of 6 / 32, 10 / 32, 19 / 32, or 24 / 32 when the subblock size is 32. In this embodiment, the subcode rate set is used to represent the subcode rates that cannot be parallelized. Therefore, in this embodiment, fast decoding can be performed using only the first Polar sequence without adjusting it or increasing storage and computation.

[0334] In this embodiment, the K most reliable bit indices in the first Polar sequence carry the first bit sequence, and the remaining NK bit indices carry frozen bits, resulting in a second bit sequence of length N. In a specific implementation, the first bit sequence is represented as [c0, c1, c2, ..., c...]. K-1 The second bit sequence is represented as [x0, x1, x2, ..., x]. N-1 Q represents the set of bit indices formed by the last K elements of the first Polar sequence, representing the set of bit indices carrying the information bits. The process of obtaining the second bit sequence is as follows:

[0335]

[0336] Step 4: Encode the second bit sequence using Polar codes to obtain the third bit sequence. That is, encode the second bit sequence [x0, x1, x2, ..., x...] using Polar codes. N-1 The third bit sequence [y0, y1, y2, ..., y] is obtained by Polar code encoding. N-1 In this embodiment, the second bit sequence x = [x0, x1, x2, ..., x] is... N-1 The polarization matrix G with N rows and N columns N Multiplying over GF(2) yields the codeword y = x·G N ,in,

[0337] Step 5: Send all or part of the bits of the third bit sequence. The part of the bits to be sent is selected according to a preset rule, which may include, but is not limited to: selecting E consecutive bits in the third bit sequence to send, or selecting E non-consecutive bits in the third bit sequence to send; wherein the number of part of the bits to be sent is E, and the specific selection method is not limited in this embodiment.

[0338] In one embodiment, the encoding process includes:

[0339] Step 1: Obtain the source information bit sequence u = [u0, u1, u2, ..., u A-1 The source information bit sequence may include, but is not limited to: uplink control information bit sequence, downlink control information bit sequence, uplink data information bit sequence, and downlink data information bit sequence. Specifically, the source information bit sequence may be information carried in one of the following physical channels: physical uplink control channel, physical uplink shared channel, physical downlink control channel, physical downlink shared channel, and physical broadcast channel.

[0340] Step 2: Based on the source information bit sequence, obtain the first bit sequence according to at least one of the following: bit stuffing, encoding using the first encoding method.

[0341] In this embodiment, the source information bit sequence is first encoded using a first encoding method, and then bits are padded to the bit sequence encoded using the first encoding method to obtain a first bit sequence. The first encoding method is CRC encoding, and the length of the first bit sequence must be even. In this embodiment, if the sum of the length A of the source information bits and the number L of the check bits obtained by the first encoding method is odd, then bits need to be padded to make the length of the first bit sequence even.

[0342] In this embodiment, the padding bit u padding Located between the bit sequences [u0, u1, u2, ..., u] after encoding using the first encoding method q-1 ,u padding ,...,u A-1 ,r0,r1,...,r L-1 ], L is the length of the CRC. Padding bits u padding The modulo-2 sum of the first P bits of the bit sequence encoded using the first encoding method forms a check relationship, where q is an integer greater than 0 and less than A+L: u padding =u0⊕u1⊕u2⊕...⊕u q-1 After decoding u padding Afterwards, a verification can be performed. If the verification is satisfied, decoding continues; if the verification is not satisfied, decoding stops, thus reducing redundant calculations.

[0343] Step 3: Obtain the second bit sequence based on the first Polar sequence and the first bit sequence. The second Polar sequence with a sub-block length of Ns corresponding to the first Polar sequence is nested with the second Polar sequence with a sub-block length of Ns / 2 corresponding to the first Polar sequence.

[0344] In this embodiment, the first Polar sequence satisfies the following characteristics:

[0345] Feature 1: The second Polar sequences corresponding to the same sub-block length of the first Polar sequence are all the same, and the second Polar sequence with a sub-block length of Ns is nested with a second Polar sequence with a sub-block length of Ns / 2.

[0346] The second Polar sequence corresponding to the first Polar sequence under different sub-block lengths P is as follows:

[0347] When P equals 8, the second Polar sequence is: [0 1 2 4 3 5 6 7];

[0348] When P equals 16, the second Polar sequence is: [0 1 2 4 8 3 5 6 9 10 12 7 11 13 14 15];

[0349] Among them, the second Polar sequence with a sub-block length of Ns is nested with the second Polar sequence with a sub-block length of Ns / 2. The characteristic of Ns is that when Ns equals 16, the second Polar sequence with a sub-block length of Ns is nested with the second Polar sequence with a sub-block length of Ns / 2.

[0350] Feature 2: The length of the first bit sequence is even, and in the second bit sequence obtained based on the first Polar sequence, each sub-code rate does not belong to the sub-code rate set. In this embodiment, the rates in the sub-code rate set must at least satisfy the following characteristics:

[0351] When P equals 16, the subcode rate set must contain at least the following rates: {5 / 16, 9 / 16}.

[0352] In this embodiment, when the length K of the first bit sequence is even, any subcode in the second bit sequence obtained from the first Polar sequence will not have a subcode rate of 5 / 16 or 9 / 16 when the subblock size is 16. In this embodiment, the subcode rate set is used to represent the subcode rates that cannot be parallelized. Therefore, in this embodiment, fast decoding can be performed using only the first Polar sequence without adjusting it or increasing storage and computation.

[0353] In this embodiment, the K most reliable bit indices in the first Polar sequence carry the first bit sequence, and the remaining NK bit indices carry frozen bits, resulting in a second bit sequence of length N. In a specific implementation, the first bit sequence is represented as [c0, c1, c2, ..., c...]. K-1 The second bit sequence is represented as [x0, x1, x2, ..., x]. N-1Q represents the set of bit indices formed by the last K elements of the first Polar sequence, representing the set of bit indices carrying the information bits. The process of obtaining the second bit sequence is as follows:

[0354]

[0355] Step 4: Encode the second bit sequence using Polar codes to obtain the third bit sequence. That is, encode the second bit sequence [x0, x1, x2, ..., x...] using Polar codes. N-1 The third bit sequence [y0, y1, y2, ..., y] is obtained by Polar code encoding. N-1 In this embodiment, the second bit sequence x = [x0, x1, x2, ..., x] is... N-1 The polarization matrix G with N rows and N columns N Multiplying over GF(2) yields the codeword y = x·G N ,in,

[0356] Step 5: Send all or part of the bits of the third bit sequence. The part of the bits to be sent is selected according to a preset rule, which may include, but is not limited to: selecting E consecutive bits in the third bit sequence to send, or selecting E non-consecutive bits in the third bit sequence to send; wherein the number of part of the bits to be sent is E, and the specific selection method is not limited in this embodiment.

[0357] In one embodiment, the encoding process includes:

[0358] Step 1: Obtain the source information bit sequence u = [u0, u1, u2, ..., u A-1 The source information bit sequence may include, but is not limited to: uplink control information bit sequence, downlink control information bit sequence, uplink data information bit sequence, and downlink data information bit sequence. Specifically, the source information bit sequence may be information carried in one of the following physical channels: physical uplink control channel, physical uplink shared channel, physical downlink control channel, physical downlink shared channel, and physical broadcast channel.

[0359] Step 2: Based on the source information bit sequence, obtain the first bit sequence according to at least one of the following: bit stuffing, encoding using the first encoding method.

[0360] In this embodiment, the source information bit sequence is first encoded using a first encoding method, and then bits are padded to the bit sequence encoded using the first encoding method to obtain a first bit sequence. The first encoding method is CRC encoding, and the length of the first bit sequence must be an odd number. In this embodiment, if the sum of the length A of the source information bits and the number L of the check bits obtained by the first encoding method is even, then bits need to be padded to make the length of the first bit sequence equal to an odd number.

[0361] In this embodiment, the padding bit u padding Located between the bit sequences [u0, u1, u2, ..., u] after encoding using the first encoding method q-1 ,u padding ,...,u A-1 ,r0,r1,...,r L-1 ], L is the length of the CRC. Padding bits u padding The modulo-2 sum of the first P bits of the bit sequence encoded using the first encoding method forms a check relationship, where q is an integer greater than 0 and less than A+L: u padding =u0⊕u1⊕u2⊕...⊕u q-1 After decoding u padding Afterwards, a verification can be performed. If the verification is satisfied, decoding continues; if the verification is not satisfied, decoding stops, thus reducing redundant calculations.

[0362] Step 3: Obtain the second bit sequence based on the first Polar sequence and the first bit sequence. The second Polar sequence with a sub-block length of Ns corresponding to the first Polar sequence is nested with the second Polar sequence with a sub-block length of Ns / 2 corresponding to the first Polar sequence.

[0363] In this embodiment, the first Polar sequence satisfies the following characteristics:

[0364] Feature 1: The second Polar sequences corresponding to the same sub-block length of the first Polar sequence are all the same, and the second Polar sequence with a sub-block length of Ns is nested with a second Polar sequence with a sub-block length of Ns / 2.

[0365] The second Polar sequence corresponding to the first Polar sequence under different sub-block lengths P is as follows:

[0366] When P equals 8, the second Polar sequence is: [0 1 2 4 3 5 6 7];

[0367] When P equals 16, the second Polar sequence is: [0 1 2 4 8 3 5 6 9 10 12 7 11 13 14 15];

[0368] Among them, the second Polar sequence with a sub-block length of Ns is nested with the second Polar sequence with a sub-block length of Ns / 2. The characteristic of Ns is that when Ns equals 16, the second Polar sequence with a sub-block length of Ns is nested with the second Polar sequence with a sub-block length of Ns / 2.

[0369] Feature 2: The length of the first bit sequence is odd, and in the second bit sequence obtained based on the first Polar sequence, each sub-code rate does not belong to the sub-code rate set. In this embodiment, the rates in the sub-code rate set must at least satisfy the following characteristics:

[0370] When P equals 16, the subcode rate set must contain at least the following rates: {5 / 16, 9 / 16}.

[0371] In this embodiment, when the length K of the first bit sequence is odd, any subcode in the second bit sequence obtained from the first Polar sequence will not have a subcode rate of 5 / 16 or 9 / 16 when the subblock size is 16. In this embodiment, the subcode rate set is used to represent the subcode rates that cannot be parallelized. Therefore, in this embodiment, fast decoding can be performed using only the first Polar sequence without adjusting it or increasing storage and computation.

[0372] In this embodiment, the K most reliable bit indices in the first Polar sequence carry the first bit sequence, and the remaining NK bit indices carry frozen bits, resulting in a second bit sequence of length N. In a specific implementation, the first bit sequence is represented as [c0, c1, c2, ..., c...]. K-1 The second bit sequence is represented as [x0, x1, x2, ..., x]. N-1 Q represents the set of bit indices carrying the information bits. The process of obtaining the second bit sequence is as follows:

[0373]

[0374] Step 4: Encode the second bit sequence using Polar codes to obtain the third bit sequence. That is, encode the second bit sequence [x0, x1, x2, ..., x...] using Polar codes. N-1 The third bit sequence [y0, y1, y2, ..., y] is obtained by Polar code encoding. N-1 In this embodiment, the second bit sequence x = [x0, x1, x2, ..., x] is... N-1 The polarization matrix G with N rows and N columns N Multiplying over GF(2) yields the codeword y = x·G N ,in,

[0375] Step 5: Send all or part of the bits of the third bit sequence. The part of the bits to be sent is selected according to a preset rule, which may include, but is not limited to: selecting E consecutive bits in the third bit sequence to send, or selecting E non-consecutive bits in the third bit sequence to send; wherein the number of part of the bits to be sent is E, and the specific selection method is not limited in this embodiment.

[0376] This application also provides an encoding device. Figure 8 This is a schematic diagram of an encoding device provided in one embodiment. Figure 8 As shown, the encoding device includes:

[0377] The acquisition module 310 is configured to acquire the source information bit sequence;

[0378] The first processing module 320 is configured to obtain a first bit sequence based on the source information bit sequence;

[0379] The second processing module 330 is configured to obtain a second bit sequence based on the first Polar sequence and the first bit sequence;

[0380] Encoding module 340 is configured to perform polar code encoding on the second bit sequence to obtain a third bit sequence;

[0381] The transmitting module 350 is configured to transmit all or part of the bits of the third bit sequence;

[0382] In the first Polar sequence, the second Polar sequences corresponding to sub-blocks of the same length are all identical;

[0383] In the first Polar sequence, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2, where Ns is greater than 8 and Ns is equal to a power of 2;

[0384] In the second bit sequence corresponding to the first Polar sequence, the code rate of each subcode does not belong to the code rate set of subcodes, which is used to indicate the code rates of subcodes that cannot be decoded in parallel.

[0385] In one embodiment, obtaining the first bit sequence based on the source information bit sequence includes:

[0386] Based on the source information bit sequence, the first bit sequence is obtained according to at least one of the following methods:

[0387] Bit stuffing, first encoding method.

[0388] In one embodiment, obtaining the first bit sequence based on the source information bit sequence includes one of the following:

[0389] Bits are padded into the source information bit sequence, and the bit sequence after padding is encoded using the first encoding method to obtain the first bit sequence;

[0390] The source information bit sequence is encoded using a first encoding method, and bits are padded into the bit sequence encoded using the first encoding method;

[0391] The source information bit sequence is encoded using a first encoding method to obtain a first bit sequence;

[0392] Fill bits into the source information bit sequence to obtain the first bit sequence;

[0393] The source information bit sequence is used as the first bit sequence.

[0394] In one embodiment, the padded bits and the modulo-2 addition of some or all of the bits in the source information bit sequence constitute one of the following check relationships: odd check relationship, even check relationship.

[0395] In one embodiment, the first encoding method includes at least one of the following: cyclic redundancy check encoding and parity check encoding.

[0396] In one embodiment, the number of padded bits satisfies at least one of the following:

[0397] The number of padding bits is at most 1, such that the length of the first bit sequence is equal to an even number;

[0398] The number of padding bits is at most 1, such that the length of the first bit sequence is an odd number;

[0399] The number of padding bits is at most 3, such that the length of the first bit sequence is a multiple of 4;

[0400] The number of padding bits is at most 7, such that the length of the first bit sequence is a multiple of 8.

[0401] In one embodiment, the first Polar sequence satisfies at least one of the following:

[0402] In the first Polar sequence, the second Polar sequences corresponding to sub-blocks of the same length are all identical;

[0403] In the first Polar sequence, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2, where Ns is greater than 8 and Ns is equal to a power of 2;

[0404] In the second bit sequence corresponding to the first Polar sequence, the code rate of each subcode does not belong to the code rate set of subcodes, which is used to indicate the code rates of subcodes that cannot be decoded in parallel.

[0405] In one embodiment, in the first Polar sequence, the second Polar sequences corresponding to sub-blocks of the same length are all identical;

[0406] For the i-th sub-block in the first Polar sequence, the second Polar sequence corresponding to the sub-block is obtained by subtracting the bit index corresponding to i*P from the first sequence, wherein the first sequence is formed by the bit indexes belonging to the interval [i*P, (i+1)*P-1] in the first Polar sequence according to the sorting in the first Polar sequence, and P is the size of the sub-block;

[0407] For any i, the second Polar sequence is identical.

[0408] In one embodiment, the second Polar sequence corresponding to the sub-block of length Ns in the first Polar sequence is nested into the second Polar sequence corresponding to the sub-block of length Ns / 2;

[0409] For a sub-block of length Ns in the first Polar sequence, the third Polar sequence is obtained by subtracting the bit index corresponding to i*Ns / 2 from the second sequence. The second sequence is formed by the bit indices of the second Polar sequence corresponding to the sub-block of length Ns that belong to the interval [i*Ns / 2, (i+1)*Ns / 2-1], according to the sorting in the second Polar sequence corresponding to the sub-block of length Ns.

[0410] The third Polar sequence corresponding to i equals 0 is the same as the third Polar sequence corresponding to i equals 1, and the third Polar sequence is the same as the second Polar sequence corresponding to the sub-block of length Ns / 2.

[0411] In one embodiment, the second Polar sequence corresponding to the sub-block of length Ns in the first Polar sequence is nested into the second Polar sequence corresponding to the sub-block of length Ns / 2;

[0412] Ns satisfies at least one of the following:

[0413] When Ns equals 16, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2;

[0414] When Ns equals 32, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2;

[0415] When Ns equals 64, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2;

[0416] When Ns equals 64 or 32, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2.

[0417] When Ns equals 32 or 16, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2.

[0418] When Ns equals 64, 32, or 16, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2.

[0419] In one embodiment, obtaining the second bit sequence based on the first Polar sequence and the first bit sequence includes:

[0420] The first bit sequence is carried by the K most reliable indices in the first Polar sequence, and the remaining NK indices are carried by the frozen bits to obtain a second bit sequence of length N;

[0421] The sub-blocks in the second bit sequence represent the sub-blocks obtained by dividing the second bit sequence from the first bit into blocks at equal intervals P, where P is the size of the sub-block and P is divisible by N. Each sub-block corresponds to a specific sub-code rate.

[0422] In the second bit sequence, the code rate of each subcode does not belong to the subcode code rate set, which is used to indicate the subcode code rates that cannot be decoded in parallel.

[0423] In one embodiment, the code rate of the sub-code rate set is determined according to at least one of the following parameters: the size of the sub-block, and the second Polar sequence corresponding to the size of the sub-block;

[0424] The second Polar sequence corresponding to the size of the sub-block is as follows: For the i-th sub-block, the second Polar sequence corresponding to the sub-block is obtained by subtracting the bit index corresponding to i*P from the first sequence, wherein the first sequence is composed of the bit indices of the first Polar sequence belonging to the interval [i*P, (i+1)*P-1] according to the sorting in the first Polar sequence, and P is the size of the sub-block.

[0425] In one embodiment, the second Polar sequence corresponding to the size of the sub-block includes at least one of the following:

[0426] When the size of the sub-block is equal to 8, the second Polar sequence is: [0 1 2 4 3 5 6 7];

[0427] When the size of the sub-block is equal to 16, the second Polar sequence is: [0 1 2 4 8 3 5 6 9 10 12 7 11 13 14 15];

[0428] When the size of the sub-block is equal to 32, the second Polar sequence is: [0 1 2 4 8 16 3 5 6 9 10 17 12 7 18 20 24 11 13 19 14 21 22 25 26 28 23 15 27 29 30 31];

[0429] When the size of the sub-block is equal to 64, the second Polar sequence is: [0 1 2 4 8 16 3 32 5 69 10 17 12 7 33 18 34 20 24 36 11 40 13 19 21 14 48 35 22 25 37 38 41 26 28 42 23 49 44 39 15 50 27 52 56 29 43 30 45 51 46 53 54 57 58 31 60 55 47 59 61 62 63].

[0430] In one embodiment, the code rates in the subcode code rate set satisfy at least one of the following:

[0431] When the size of the sub-block is equal to 16, the sub-code rate set contains at least the code rates {5 / 16, 9 / 16};

[0432] When the size of the sub-block is equal to 32, the sub-code rate set contains at least the code rates {6 / 32, 10 / 32, 19 / 32, 24 / 32};

[0433] When the size of the sub-block is equal to 64, the set of sub-code rates includes at least the code rates {6 / 64, 11 / 64, 24 / 64, 29 / 64, 31 / 64, 39 / 64, 50 / 64, 55 / 64}.

[0434] In one embodiment, the length of the first Polar sequence is a power of 2, and the length of the first Polar sequence is at least one of the following: 256, 512, 1024, 2048, 4096, 8192.

[0435] The encoding device proposed in this embodiment belongs to the same inventive concept as the encoding method proposed in the above embodiments. Technical details not described in detail in this embodiment can be found in any of the above embodiments. Furthermore, this embodiment has the same beneficial effects as the encoding method.

[0436] This application also provides a decoding device. Figure 9 This is a schematic diagram of an encoding device provided in one embodiment. Figure 9 As shown, the decoding device includes:

[0437] The receiving module 410 is configured to receive all or part of the data sequence to be decoded from the third bit sequence;

[0438] Decoding module 420 is configured to perform polar code decoding on the data sequence to be decoded to obtain the decoded second bit sequence;

[0439] The first processing module 430 is configured to obtain the decoded first bit sequence based on the decoded second bit sequence and the first Polar sequence;

[0440] The second processing module 440 is configured to obtain the decoded source information bit sequence based on the decoded first bit sequence.

[0441] In the first Polar sequence, the second Polar sequences corresponding to sub-blocks of the same length are all identical;

[0442] In the first Polar sequence, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2, where Ns is greater than 8 and Ns is equal to a power of 2;

[0443] In the second bit sequence corresponding to the first Polar sequence, the code rate of each subcode does not belong to the code rate set of subcodes, which is used to indicate the code rates of subcodes that cannot be decoded in parallel.

[0444] In one embodiment, obtaining the decoded source information bit sequence based on the decoded first bit sequence includes:

[0445] Based on the decoded first bit sequence, the first bit sequence is obtained according to at least one of the following methods:

[0446] De-stuffing and decoding using the first encoding method.

[0447] In one embodiment, the first Polar sequence satisfies at least one of the following:

[0448] In the first Polar sequence, the second Polar sequences corresponding to sub-blocks of the same length are all identical;

[0449] In the first Polar sequence, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2, where Ns is greater than 8 and Ns is equal to a power of 2;

[0450] In the second bit sequence corresponding to the first Polar sequence, the code rate of each subcode does not belong to the code rate set of subcodes, which is used to indicate the code rates of subcodes that cannot be decoded in parallel.

[0451] In one embodiment, in the first Polar sequence, the second Polar sequences corresponding to sub-blocks of the same length are all identical;

[0452] For the i-th sub-block in the first Polar sequence, the second Polar sequence corresponding to the sub-block is obtained by subtracting the bit index corresponding to i*P from the first sequence, wherein the first sequence is formed by the bit indexes belonging to the interval [i*P, (i+1)*P-1] in the first Polar sequence according to the sorting in the first Polar sequence, and P is the size of the sub-block;

[0453] For any i, the second Polar sequence is identical.

[0454] In one embodiment, the second Polar sequence corresponding to the sub-block of length Ns in the first Polar sequence is nested into the second Polar sequence corresponding to the sub-block of length Ns / 2;

[0455] For a sub-block of length Ns in the first Polar sequence, the third Polar sequence is obtained by subtracting the bit index corresponding to i*Ns / 2 from the second sequence. The second sequence is formed by the bit indices of the second Polar sequence corresponding to the sub-block of length Ns that belong to the interval [i*Ns / 2, (i+1)*Ns / 2-1], according to the sorting in the second Polar sequence corresponding to the sub-block of length Ns.

[0456] The third Polar sequence corresponding to i equals 0 is the same as the third Polar sequence corresponding to i equals 1, and the third Polar sequence is the same as the second Polar sequence corresponding to the sub-block of length Ns / 2.

[0457] In one embodiment, the second Polar sequence corresponding to the sub-block of length Ns in the first Polar sequence is nested into the second Polar sequence corresponding to the sub-block of length Ns / 2;

[0458] Ns satisfies at least one of the following:

[0459] When Ns equals 16, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2;

[0460] When Ns equals 32, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2;

[0461] When Ns equals 64, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2;

[0462] When Ns equals 64 or 32, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2.

[0463] When Ns equals 32 or 16, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2.

[0464] When Ns equals 64, 32, or 16, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2.

[0465] In one embodiment, each subcode rate in the second bit sequence obtained based on the first Polar sequence does not have a code rate belonging to the subcode rate set.

[0466] This application also provides a processing node, which can be either an encoding end or a decoding end. It can be an electronic device with a certain computing capability, such as a terminal device, server, or other processing device. The terminal device can be a cellular phone, cordless phone, Session Initiation Protocol (SIP) phone, Wireless Local Loop (WLL) station, Personal Digital Assistant (PDA), handheld device with wireless communication capabilities, computing device, or other processing device connected to a wireless modem, in-vehicle device, wearable device, or electronic device in a 5G network, 5G-A network, or a future 6G or higher network.

[0467] Figure 10 This is a schematic diagram of the hardware structure of a processing node provided in one embodiment, such as... Figure 10 As shown, the processing node provided in this application includes a processor 510 and a memory 520; the processor 510 in the processing node can be one or more. Figure 10 Taking a processor 510 as an example; the memory 520 is configured to store one or more programs; the one or more programs are executed by the one or more processors 510, causing the one or more processors 510 to implement the encoding method or decoding method as described in the embodiments of this application.

[0468] The processing node also includes: a communication device 530, an input device 540, and an output device 550.

[0469] The processor 510, memory 520, communication device 530, input device 540, and output device 550 in the processing node can be connected via a bus or other means. Figure 10 Taking the example of a connection between China and Israel via a bus.

[0470] Input device 540 can be used to receive input digital or character information, and to generate key signal inputs related to user settings and function control of the processing node. Output device 550 may include display devices such as a display screen.

[0471] The communication device 530 may include a receiver and a transmitter. The communication device 530 is configured to perform information transmission and reception communication under the control of the processor 510.

[0472] The memory 520, as a computer-readable storage medium, can be configured to store software programs, computer-executable programs, and modules, such as program instructions / modules corresponding to the encoding or decoding methods described in the embodiments of this application. The memory 520 may include a program storage area and a data storage area, wherein the program storage area may store the operating system and at least one application program required for a function; the data storage area may store data created based on the use of the processing node, etc. Furthermore, the memory 520 may include high-speed random access memory and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other non-volatile solid-state storage device. In some instances, the memory 520 may further include memory remotely located relative to the processor 510, and these remote memories can be connected to the processing node via a network. Examples of such networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0473] This application also provides a storage medium storing a computer program, which, when executed by a processor, implements any of the encoding or decoding methods described in this application.

[0474] This application also provides a computer program storage product, including a computer program / instruction, which, when executed by a processor, implements any of the encoding or decoding methods described in this application.

[0475] The computer storage medium in this application embodiment can be any combination of one or more computer-readable media. The computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium. For example, a computer-readable storage medium can be, but is not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of computer-readable storage media (a non-exhaustive list) include: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), flash memory, optical fiber, portable CD-ROM, optical storage device, magnetic storage device, or any suitable combination thereof. The computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device.

[0476] Computer-readable signal media may include data signals propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, which can send, propagate, or transmit programs for use by or in connection with an instruction execution system, apparatus, or device.

[0477] Program code contained on a computer-readable medium may be transmitted using any suitable medium, including but not limited to: wireless, wire, optical fiber, radio frequency (RF), etc., or any suitable combination thereof.

[0478] Computer program code for performing the operations of this application can be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, and C++, as well as conventional procedural programming languages ​​such as "C" or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0479] This application also provides a computer program product, including a computer program / instructions, which, when executed by a processor, implement the encoding or decoding method as described in any of the above embodiments.

[0480] The above description is merely an exemplary embodiment of this application and is not intended to limit the scope of protection of this application.

[0481] Those skilled in the art will understand that the term user terminal encompasses any suitable type of wireless user equipment, such as mobile phones, portable data processing portable web browsers, or vehicle-mounted mobile stations.

[0482] Generally, the various embodiments of this application can be implemented in hardware or dedicated circuitry, software, logic, or any combination thereof. For example, some aspects can be implemented in hardware, while others can be implemented in firmware or software that can be executed by a controller, microprocessor, or other computing device, although this application is not limited thereto.

[0483] Embodiments of this application can be implemented by executing computer program instructions through the data processor of a mobile device, for example, in a processor entity, or through hardware, or through a combination of software and hardware. The computer program instructions can be assembly instructions, Instruction Set Architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, status setting data, or source code or object code written in any combination of one or more programming languages.

[0484] Any block diagram of logical flow in the accompanying drawings of this application may represent program steps, or may represent interconnected logic circuits, modules, and functions, or may represent a combination of program steps and logic circuits, modules, and functions. The computer program may be stored in memory. The memory may be of any type suitable to the local technical environment and may be implemented using any suitable data storage technology, such as, but not limited to, read-only memory (ROM), random access memory (RAM), optical storage devices and systems (Digital Video Disc (DVD) or Compact Disk (CD), etc.). Computer-readable media may include non-transitory storage media. The data processor may be of any type suitable to the local technical environment, such as, but not limited to, general-purpose computers, special-purpose computers, microprocessors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), and processors based on multi-core processor architectures.

[0485] A detailed description of exemplary embodiments of this application has been provided above through exemplary and non-limiting examples. However, various modifications and adjustments to the above embodiments will be apparent to those skilled in the art when considered in conjunction with the accompanying drawings and claims, without departing from the scope of this application. Therefore, the proper scope of this application will be determined by the claims.

Claims

1. An encoding method, characterized in that, include: Obtain the source information bit sequence; A first bit sequence is obtained based on the source information bit sequence; The second bit sequence is obtained based on the first Polar sequence and the first bit sequence; The second bit sequence is polar-coded to obtain the third bit sequence; Send all or part of the bits of the third bit sequence; In the first Polar sequence, the second Polar sequences corresponding to sub-blocks of the same length are all identical; In the first Polar sequence, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2, where Ns is greater than 8 and Ns is equal to a power of 2; In the second bit sequence corresponding to the first Polar sequence, the code rate of each subcode does not belong to the code rate set of subcodes, which is used to indicate the code rates of subcodes that cannot be decoded in parallel.

2. The method according to claim 1, characterized in that, Obtaining the first bit sequence based on the source information bit sequence includes: Based on the source information bit sequence, the first bit sequence is obtained according to at least one of the following methods: Bit stuffing, first encoding method.

3. The method according to claim 1, characterized in that, The process of obtaining the first bit sequence based on the source information bit sequence includes one of the following: Bits are padded into the source information bit sequence, and the bit sequence after padding is encoded using the first encoding method to obtain the first bit sequence; The source information bit sequence is encoded using a first encoding method, and bits are padded into the bit sequence encoded using the first encoding method; The source information bit sequence is encoded using a first encoding method to obtain a first bit sequence; Fill bits into the source information bit sequence to obtain the first bit sequence; The source information bit sequence is used as the first bit sequence.

4. The method according to claim 2 or 3, characterized in that, The padding bits, together with some or all of the bits in the source information bit sequence, form one of the following parity relationships: odd parity or even parity.

5. The method according to claim 2 or 3, characterized in that, The first encoding method includes at least one of the following: cyclic redundancy check encoding and parity check encoding.

6. The method according to claim 2 or 3, characterized in that, The number of padded bits satisfies at least one of the following: The number of padding bits is at most 1, such that the length of the first bit sequence is equal to an even number; The number of padding bits is at most 1, such that the length of the first bit sequence is an odd number; The number of padding bits is at most 3, such that the length of the first bit sequence is a multiple of 4; The number of padding bits is at most 7, such that the length of the first bit sequence is a multiple of 8.

7. The method according to claim 1, characterized in that, In the first Polar sequence, the second Polar sequences corresponding to sub-blocks of the same length are all identical; For the i-th sub-block in the first Polar sequence, the second Polar sequence corresponding to the sub-block is obtained by subtracting the bit index corresponding to i*P from the first sequence, wherein the first sequence is formed by the bit indexes belonging to the interval [i*P, (i+1)*P-1] in the first Polar sequence according to the sorting in the first Polar sequence, and P is the size of the sub-block; For any i, the second Polar sequence is identical.

8. The method according to claim 1, characterized in that, The second Polar sequence corresponding to the sub-block of length Ns in the first Polar sequence is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2; For a sub-block of length Ns in the first Polar sequence, the third Polar sequence is obtained by subtracting the bit index corresponding to i*Ns / 2 from the second sequence. The second sequence is formed by the bit indices of the second Polar sequence corresponding to the sub-block of length Ns that belong to the interval [i*Ns / 2, (i+1)*Ns / 2-1], according to the sorting in the second Polar sequence corresponding to the sub-block of length Ns. The third Polar sequence corresponding to i equals 0 is the same as the third Polar sequence corresponding to i equals 1, and the third Polar sequence is the same as the second Polar sequence corresponding to the sub-block of length Ns / 2.

9. The method according to claim 1, characterized in that, The second Polar sequence corresponding to the sub-block of length Ns in the first Polar sequence is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2; Ns satisfies at least one of the following: When Ns equals 16, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2; When Ns equals 32, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2; When Ns equals 64, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2; When Ns equals 64 or 32, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2. When Ns equals 32 or 16, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2. When Ns equals 64, 32, or 16, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2.

10. The method according to claim 1, characterized in that, The process of obtaining the second bit sequence based on the first Polar sequence and the first bit sequence includes: The first bit sequence is carried by the K most reliable indices in the first Polar sequence, and the remaining NK indices are carried by the frozen bits to obtain a second bit sequence of length N; The sub-blocks in the second bit sequence represent the sub-blocks obtained by dividing the second bit sequence from the first bit into blocks at equal intervals P, where P is the size of the sub-block and P is divisible by N. Each sub-block corresponds to a specific sub-code rate. In the second bit sequence, the code rate of each subcode does not belong to the subcode code rate set, which is used to indicate the subcode code rates that cannot be decoded in parallel.

11. The method according to claim 1 or 10, characterized in that, The code rate of the sub-code code rate set is determined according to at least one of the following parameters: the size of the sub-block, and the second Polar sequence corresponding to the size of the sub-block; The second Polar sequence corresponding to the size of the sub-block is as follows: For the i-th sub-block, the second Polar sequence corresponding to the sub-block is obtained by subtracting the bit index corresponding to i*P from the first sequence, wherein the first sequence is composed of the bit indices of the first Polar sequence belonging to the interval [i*P, (i+1)*P-1] according to the sorting in the first Polar sequence, and P is the size of the sub-block.

12. The method according to claim 11, characterized in that, The second Polar sequence corresponding to the size of the sub-block includes at least one of the following: When the size of the sub-block is equal to 8, the second Polar sequence is: [0 1 2 4 3 5 6 7]; When the size of the sub-block is equal to 16, the second Polar sequence is: [0 1 2 4 8 3 5 6 9 10 12 711 13 1415]; When the size of the sub-block is equal to 32, the second Polar sequence is: [0 1 2 4 8 16 3 5 6 9 10 17 12 7 18 20 24 11 13 19 14 21 22 25 26 28 23 15 27 29 30 31]; When the size of the sub-block is equal to 64, the second Polar sequence is: [0 1 2 4 8 16 3 32 5 6 9 10 17 12 7 33 18 34 20 24 36 11 40 13 19 21 14 48 35 22 25 37 38 41 26 28 42 23 49 44 39 15 50 27 52 56 29 43 30 45 51 46 53 54 57 58 31 60 55 47 59 61 62 63].

13. The method according to claim 1 or 10, characterized in that, The code rates in the subcode code rate set satisfy at least one of the following: When the size of the sub-block is equal to 16, the sub-code rate set contains at least the code rates {5 / 16, 9 / 16}; When the size of the sub-block is equal to 32, the sub-code rate set contains at least the code rates {6 / 32, 10 / 32, 19 / 32, 24 / 32}; When the size of the sub-block is equal to 64, the set of sub-code rates includes at least the code rates {6 / 64, 11 / 64, 24 / 64, 29 / 64, 31 / 64, 39 / 64, 50 / 64, 55 / 64}.

14. The method according to claim 1, characterized in that, The length of the first Polar sequence is a power of 2, and the length of the first Polar sequence is at least one of the following: 256, 512, 1024, 2048, 4096, 8192.

15. A decoding method, characterized in that, include: Receive all or part of the data sequence to be decoded from the third bit sequence; The data sequence to be decoded is polar-coded to obtain the decoded second bit sequence; The first bit sequence is obtained by combining the decoded second bit sequence with the first Polar sequence. The decoded source information bit sequence is obtained based on the decoded first bit sequence; In the first Polar sequence, the second Polar sequences corresponding to sub-blocks of the same length are all identical; In the first Polar sequence, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2, where Ns is greater than 8 and Ns is equal to a power of 2; In the second bit sequence corresponding to the first Polar sequence, the code rate of each subcode does not belong to the code rate set of subcodes, which is used to indicate the code rates of subcodes that cannot be decoded in parallel.

16. The method according to claim 15, characterized in that, The process of obtaining the decoded source information bit sequence based on the decoded first bit sequence includes: Based on the decoded first bit sequence, the first bit sequence is obtained according to at least one of the following methods: De-stuffing and decoding using the first encoding method.

17. The method according to claim 15, characterized in that, In the first Polar sequence, the second Polar sequences corresponding to sub-blocks of the same length are all identical; For the i-th sub-block in the first Polar sequence, the second Polar sequence corresponding to the sub-block is obtained by subtracting the bit index corresponding to i*P from the first sequence, wherein the first sequence is formed by the bit indexes belonging to the interval [i*P, (i+1)*P-1] in the first Polar sequence according to the sorting in the first Polar sequence, and P is the size of the sub-block; For any i, the second Polar sequence is identical.

18. The method according to claim 15, characterized in that, The second Polar sequence corresponding to the sub-block of length Ns in the first Polar sequence is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2; For a sub-block of length Ns in the first Polar sequence, the third Polar sequence is obtained by subtracting the bit index corresponding to i*Ns / 2 from the second sequence. The second sequence is formed by the bit indices of the second Polar sequence corresponding to the sub-block of length Ns that belong to the interval [i*Ns / 2, (i+1)*Ns / 2-1], according to the sorting in the second Polar sequence corresponding to the sub-block of length Ns. The third Polar sequence corresponding to i equals 0 is the same as the third Polar sequence corresponding to i equals 1, and the third Polar sequence is the same as the second Polar sequence corresponding to the sub-block of length Ns / 2.

19. The method according to claim 15, characterized in that, The second Polar sequence corresponding to the sub-block of length Ns in the first Polar sequence is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2; Ns satisfies at least one of the following: When Ns equals 16, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2; When Ns equals 32, the second Polar sequence corresponding to the sub-block of length Ns is nested with the second Polar sequence corresponding to the sub-block of length Ns / 2; When Ns equals 64, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2; When Ns equals 64 or 32, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2. When Ns equals 32 or 16, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2. When Ns equals 64, 32, or 16, the second Polar sequence corresponding to a sub-block of length Ns is nested with the second Polar sequence corresponding to a sub-block of length Ns / 2.

20. The method according to claim 16, characterized in that, In the second bit sequence obtained based on the first Polar sequence, there is no code rate belonging to the set of subcode code rates for each subcode code rate.

21. A processing node, characterized in that, include: Memory, and one or more processors; The memory is configured to store one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the encoding method as described in any one of claims 1-14 or the decoding method as described in any one of claims 15-20.

22. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the program is executed by the processor, it implements the encoding method as described in any one of claims 1-14 or the decoding method as described in any one of claims 15-20.

Images