Abstract:
A polar code processing method and system, and a wireless communications apparatus are provided, where the method includes: acquiring at least two periodic puncturing patterns and combining the at least two periodic puncturing patterns in a predetermined manner to obtain at least two hybrid puncturing patterns; selecting, from the at least two hybrid puncturing patterns, one with a lowest frame error rate as an optimal puncturing pattern; and performing rate matching on polar polar-coded bits according to the optimal puncturing pattern, and using the rate-matched bits as to-be-transmitted bits. A frame error rate may be reduced and HARQ performance of a polar code may be enhanced.
Abstract:
A method for decoding Polar codes includes: receiving a Polar code having a length of N, and dividing the Polar code into m subcodes that are coupled to each other, each subcode has a length of N/m, and each of N and m is an integer powers of 2; calculating squared Euclidean distances of input bits in the m subcodes, to obtain minimum squared Euclidean distances of the input bits that are independent of each other; obtaining, accordingly a minimum squared Euclidean distance of input bits that are coupled to each other in the m subcodes; and obtaining input bits that are in the m subcodes and that meet the independent minimum squared Euclidean distances and the combined minimum squared Euclidean distance, and obtaining a decoding result of the Polar code with reference to relationships between the m subcodes and the Polar code.
Abstract:
A polar code processing method and system, and a wireless communications apparatus are provided, where the method includes: acquiring at least two periodic puncturing patterns and combining the at least two periodic puncturing patterns in a predetermined manner to obtain at least two hybrid puncturing patterns; selecting, from the at least two hybrid puncturing patterns, one with a lowest frame error rate as an optimal puncturing pattern; and performing rate matching on polar polar-coded bits according to the optimal puncturing pattern, and using the rate-matched bits as to-be-transmitted bits. A frame error rate may be reduced and HARQ performance of a polar code may be enhanced.
Abstract:
Embodiments of the present invention provide a method and an apparatus for processing data. The method includes: performing code block segmentation on a data block to obtain multiple first blocks, wherein a difference between numbers of bits of any two first blocks in the multiple first blocks is not more than 1 bit; determining multiple second blocks according to a padding bit and the multiple first blocks, wherein a value of the padding bit is a preset value; adding consecutive N−K fixed bits to each of the multiple second blocks to obtain multiple third blocks, wherein a value of the fixed bit is a preset value, and N−K≧0; and performing polar encoding according to the multiple third blocks.
Abstract:
The embodiments of the present invention provide a decoding method and a decoding device for a polar code cascaded with CRC. The decoding method includes: performing SC-List decoding on a Polar code according to the number of survival paths L to obtain L survival paths, where L is a positive integer; performing cyclic redundancy check on the L survival paths respectively; and increasing the number of survival paths when all the L survival paths fail to pass the cyclic redundancy check, and acquiring a decoding result of the Polar code according to the increased number of survival paths. In the embodiments of the present invention, the path number of survival paths is adjusted according to a result of the cyclic redundancy check, so as to output paths as much as possible, where the output paths can pass the cyclic redundancy check, thereby improving decoding performance.
Abstract:
The present disclosure provides example coding method, apparatus, and computer-readable storage medium. One example method includes sorting a plurality of pieces of run-length encoding (RLE) data based on their distribution probabilities. The plurality of pieces of sorted RLE data are mapped onto a plurality of pieces of reassembled data. The plurality of pieces of reassembled data are expanded into a plurality of pieces of binary data. A first matrix is generated based on the plurality of pieces of binary data. A code sequence is determined by processing a source signal, where the code sequence comprises a first set and a second set. A first vector is decoded to output a third set, where the third set includes one or more bits reserved after processing the source signal and one or more locations at which a decoding error occurs in one or more bits discarded after processing the source signal.
Abstract:
An information adding method and apparatus, to increase a quantity of terminals that can be represented by an identifier sequence. The method includes: performing, by a transmit end, polar code encoding on a first bit sequence to generate an encoded second bit sequence; adding, by the transmit end, a part or all of an identifier sequence to the second bit sequence to generate a third bit sequence, where the identifier sequence is used to identify a terminal; and sending, by the transmit end, the third bit sequence.
Abstract:
The present invention provides channel interleaving method of a polar (Polar) code. The method includes: determining an M_r-row and M_c-column matrix used for interleaving, and permutating, based on permutation patterns of the column sequence numbers and/or permutation patterns of the row sequence numbers, the matrix into which the to-be-interleaved bits are written. The permutation patterns of the column sequence numbers are represented by: [Pc(0), Pc(1), . . . , Pc(ic), . . . , Pc(M_c−1)]. Pc(ic) is obtained by performing pruned bit reverse (PBR, pruned bit reverse)-based mapping on the column sequence number ic. The permutation patterns of the row sequence numbers are represented by: [Pr(0), Pr(1), . . . , Pr(ir), . . . , Pr(M_r−1)]. Pr(ir) is obtained by performing pruned bit reverse (PBR, pruned bit reverse)-based mapping on the row sequence number ir; and reading interleaved bits from the permutated matrix.
Abstract:
Embodiments of the present disclosure provide an encoding/decoding method, apparatus, and system. The method includes: encoding information bits to obtain a first-level encoded code word; obtaining a sorting value of each check bit of the first-level encoded code word, and adjusting each check bit to a corresponding position according to the sorting value of each check bit, where the sorting value refers to a value of S when the check bit is related to first S information bits of the information bits in the first-level encoded code word, and S is a non-zero integer; and performing second-level encoding on the first-level encoded code word after positions of the check bits are adjusted, thereby obtaining a second-level encoded code word. The present disclosure is applicable to various communication systems.
Abstract:
Disclosed in an embodiment of the present invention are a polar code encoding method and device, the method comprising: utilizing a common information bit set to represent each of m polar code blocks, the polar codes in each polar code block having the same code length and different code rates, and m being greater than or equal to 2; according to the common information bit set corresponding to the polar code block, acquiring an information bit set corresponding to each polar code in the polar code block; and according to the information bit set corresponding to each polar code in the polar code block, conducting polar code encoding on information to be encoded, thus reducing polar code representation overhead, and solving the problem in the prior art of excessively high polar code representation overhead.